Polynomial universal traversing sequences for cycles are constructible
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The expressiveness of a family of finite set languages
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Theoretical Computer Science
The Complexity of Planarity Testing
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Space Efficient Algorithms for Series-Parallel Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On Reachability in Graphs with Bounded Independence Number
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On the Parallel Complexity of Tree Automata
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of XPath query evaluation
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
McNaughton families of languages
Theoretical Computer Science
Reversible Space Equals Deterministic Space
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Completeness results for graph isomorphism
Journal of Computer and System Sciences
The complexity of planarity testing
Information and Computation
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
Space efficient algorithms for directed series-parallel graphs
Journal of Algorithms
On the complexity of nonrecursive XQuery and functional query languages on complex values
ACM Transactions on Database Systems (TODS)
How to meet in anonymous network
Theoretical Computer Science
Pure Pointer Programs with Iteration
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Deterministic Rendezvous in Trees with Little Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Parameterized complexity of finding regular induced subgraphs
Journal of Discrete Algorithms
Efficient algorithms for descendant-only tree pattern queries
Information Systems
Planarity, Determinants, Permanents, and (Unique) Matchings
ACM Transactions on Computation Theory (TOCT)
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Efficient algorithms for the tree homeomorphism problem
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Pure pointer programs with iteration
ACM Transactions on Computational Logic (TOCL)
Type inference for sublinear space functional programming
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Journal of Computer and System Sciences
How to meet in anonymous network
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Asynchronous deterministic rendezvous in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
A propositional proof system for log space
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Planarity, determinants, permanents, and (unique) matchings
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Correctness of multiplicative (and exponential) proof structures is NL-complete
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
On the space complexity of parameterized problems
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Shielding circuits with groups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Iterated group products and leakage resilience against NC1
Proceedings of the 5th conference on Innovations in theoretical computer science
Monomials, multilinearity and identity testing in simple read-restricted circuits
Theoretical Computer Science
| Hi-index | 0.01 |