Complete problems for deterministic polynomial time
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
The circuit value problem is log space complete for P
ACM SIGACT News
Planar 3-colorability is polynomial complete
ACM SIGACT News
ACM Computing Surveys (CSUR)
Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
IEEE Transactions on Computers
Properties that characterize LOGCFL
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Experience in massively parallel discrete event simulation
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
An efficient parallel algorithm for the general planar monotone circuit value problem4
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Improved parallel algorithms for the depth-first search and monotone circuit value problems
CSC '87 Proceedings of the 15th annual conference on Computer Science
The Complexity of Membership Problems for Circuits over Sets of Natural Numbers
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Parallel algorithms for unification and other complete problems in p
ACM '84 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge
A recognition and parsing algorithm for arbitrary conjunctive grammars
Theoretical Computer Science
Tree-width and the monadic quantifier hierarchy
Theoretical Computer Science - Logic and complexity in computer science
SIGACT news complexity theory column 42
ACM SIGACT News
Tantrix TM rotation puzzles are intractable
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Logic circuits in the plane: minimal crossovers
ACM SIGACT News
The complexity of agent design problems: Determinism and history dependence
Annals of Mathematics and Artificial Intelligence
The complexity of membership problems for circuits over sets of integers
Theoretical Computer Science
IEEE Transactions on Computers
Language and Automata Theory and Applications
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Complexity results for checking equivalence of stratified logic programs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Information and Computation
Two dynamic programming algorithms for which interpreted pebbling helps
Information and Computation
A simple P-complete problem and its representations by language equations
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
A simple P-complete problem and its language-theoretic representations
Theoretical Computer Science
Isomorphism of regular trees and words
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
One-input-face MPCVP is hard for l, but in LogDCFL
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Extending Dijkstra's algorithm to maximize the shortest path by node-wise limited arc interdiction
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Evaluating monotone circuits on cylinders, planes and tori
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Balancing bounded treewidth circuits
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
A generalization of spira's theorem and circuits with small segregators or separators
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Computational Complexity of Avalanches in the Kadanoff Sandpile Model
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Isomorphism of regular trees and words
Information and Computation
Verifying proofs in constant depth
ACM Transactions on Computation Theory (TOCT)
Balancing Bounded Treewidth Circuits
Theory of Computing Systems
| Hi-index | 0.01 |