Adding disjunction to datalog (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS)
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of finite-horizon Markov decision process problems
Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
On the complexity of data disjunctions
Theoretical Computer Science - Complexity and logic
Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
The Complexity of Some Basic Problems for Dynamic Process Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On Reachability in Graphs with Bounded Independence Number
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
The Expressive Power and Complexity of Dynamic Process Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Theoretical Computer Science
Trading uninitialized space for time
Information Processing Letters
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
On the Complexity of Obtaining Optimal Watermarking Schemes
IWDW '07 Proceedings of the 6th International Workshop on Digital Watermarking
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Linear connectivity problems in directed hypergraphs
Theoretical Computer Science
Complexity of probabilistic planning under average rewards
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Symbolic OBDD-Based Reachability Analysis Needs Exponential Space
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Exponential space complexity for symbolic maximum flow algorithms in 0-1 networks
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On symbolic OBDD-based algorithms for the minimum spanning tree problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Holographic computation of balanced succinct permanent instances
OSC'10 Proceedings of the Third international conference on Optical supercomputing
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
Model-checking hierarchical structures
Journal of Computer and System Sciences
The complexity of problems on implicitly represented inputs
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
On regular realizability problems
Problems of Information Transmission
Complexity bounds for the verification of real-time software
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Complexity of linear connectivity problems in directed hypergraphs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
On symbolic OBDD-based algorithms for the minimum spanning tree problem
Theoretical Computer Science
Efficiency-revenue trade-offs in auctions
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
On the complexity of the multivariate resultant
Journal of Complexity
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
Hi-index | 0.00 |