Computability of Recursive Functions
Journal of the ACM (JACM)
Two-Tape Simulation of Multitape Turing Machines
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Programming Language for Automata
Journal of the ACM (JACM)
An efficient context-free parsing algorithm
Communications of the ACM
Variations on pushdown machines (Detailed Abstract)
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Properties that characterize LOGCFL
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On the power of one-way communication
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Depth reduction for noncommutative arithmetic circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The Complexity of Finite Memory Programs with Recursion
Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
Parallel RAMs with owned global memory and deterministic context-free language recognition
Journal of the ACM (JACM)
The intrinsically exponential complexity of the circularity problem for attribute grammars
Communications of the ACM
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Computing a context-free grammar-generating series
Information and Computation
A syntactical analysis of non-size-increasing polynomial time computation
ACM Transactions on Computational Logic (TOCL)
SIGACT news complexity theory column 35
ACM SIGACT News
Even simple programs are hard to analyze
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the complexity of the circularity test for attribute grammars
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Theoretical Computer Science
Turing universality of the game of life
Collision-based computing
Alternating and Empty Alternating Auxiliary Stack Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
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
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Alternating and empty alternating auxiliary stack automata
Theoretical Computer Science
Analysing the implicit complexity of programs
Information and Computation - Special issue: ICC '99
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Measures of parallelism in alternating computation trees (Extended Abstract)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Low level complexity for combinatorial games
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Separating tape bounded auxiliary pushdown automata classes
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On the complexity of grammar and related problems
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
On the time and tape complexity of languages I
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
An observation on time-storage trade off
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Tree-size bounded alternation(Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Comparative schematology and pebbling with auxiliary pushdowns (Preliminary Version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Turing machines and the spectra of first-order formulas with equality
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Iterated pushdown automata and complexity classes
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
SIGACT news complexity theory column 42
ACM SIGACT News
The expressive power of higher-order types or, life without CONS
Journal of Functional Programming
Computational aspects of M-grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
A PTIME-complete matching problem for SLP-compressed words
Information Processing Letters
The intractability of computing the Hamming distance
Theoretical Computer Science
Theoretical Computer Science - Mathematical foundations of computer science 2004
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Program Schemes with Deep Pushdown Storage
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Two-way finite automata with a write-once track
Journal of Automata, Languages and Combinatorics
The complexity of propositional implication
Information Processing Letters
On Models of a Nondeterministic Computation
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Journal of Computer and System Sciences
Journal of Computer and System Sciences
An observation on time-storage trade off
Journal of Computer and System Sciences
Pushdown automata with counters
Journal of Computer and System Sciences
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Flip-pushdown automata: k + 1 pushdown reversals are better than k
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Max-plus quasi-interpretations
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The descriptive complexity approach to LOGCFL
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Efficient first order functional program interpreter with time bound certifications
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Complexity and algorithms for well-structured k-SAT instances
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
P-hardness of the emptiness problem for visibly pushdown languages
Information Processing Letters
Quasi-interpretations a way to control resources
Theoretical Computer Science
Nodes connected by path languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Course of value distinguishes the intentionality of programming languages
Proceedings of the Second Symposium on Information and Communication Technology
Incremental branching programs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Some programming languages for LOGSPACE and PTIME
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Tackling the partner units configuration problem
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
Fundamenta Informaticae
Generalized satisfiability for the description logic ALC
Theoretical Computer Science
Tradeoff lower lounds for stack machines
Computational Complexity
| Hi-index | 0.03 |