Linear-time register allocation for a fixed number of registers
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Listing all potential maximal cliques of a graph
Theoretical Computer Science
The Treewidth of Java Programs
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Iterative-free program analysis
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Tree-decompositions of small pathwidth
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Space-efficient construction variants of dynamic programming
Nordic Journal of Computing
A global progressive register allocator
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Approximation algorithms via contraction decomposition
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Size and treewidth bounds for conjunctive queries
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
Answer-set programming with bounded treewidth
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Tree-decompositions of small pathwidth
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Recognizing digraphs of Kelly-width 2
Discrete Applied Mathematics
Sampling-based program execution monitoring
Proceedings of the ACM SIGPLAN/SIGBED 2010 conference on Languages, compilers, and tools for embedded systems
A note on root choice for parallel processing of tree decompositions
KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
Optimal root choice for parallel processing of tree decompositions
International Journal of Intelligent Information and Database Systems
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
Decomposition, approximation, and coloring of odd-minor-free graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
Lowering overhead in sampling-based execution monitoring and tracing
Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
Contraction decomposition in h-minor-free graphs and algorithmic applications
Proceedings of the forty-third annual ACM symposium on Theory of computing
Register loading via linear programming
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Size and Treewidth Bounds for Conjunctive Queries
Journal of the ACM (JACM)
Time and parallelizability results for parity games with bounded treewidth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Optimal register allocation in polynomial time
CC'13 Proceedings of the 22nd international conference on Compiler Construction
Optimal placement of bank selection instructions in polynomial time
Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems
Does Treewidth Help in Modal Satisfiability?
ACM Transactions on Computational Logic (TOCL)
Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing
Faster algorithms for markov decision processes with low treewidth
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
The complexity of register allocation
Discrete Applied Mathematics
Hi-index | 0.00 |