Computational complexity theory
ACM Computing Surveys (CSUR)
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Sparse sets and collapse of complexity classes
Information and Computation
Some facets of complexity theory and cryptography: A five-lecture tutorial
ACM Computing Surveys (CSUR)
An Extended Algebra for Constraint Databases
IEEE Transactions on Knowledge and Data Engineering
Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Global Power of Additional Queries to p-Random Oracles
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Bi-Immunity Separates Strong NP-Completeness Notions
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
EXPSPACE-Complete Variant of Guarded Fragment with Transitivity
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On Higher Arthur-Merlin Classes
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT)
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
A Cost Model for Asynchronous and Structured Message Passing
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
The complexity of achievement and maintenance problems in agent-based systems
Artificial Intelligence
Information and Computation
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Acceptance by Transformation Monoids (with an Application to Local Self Reductions)
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
LR(k) Testing is Average Case Complete
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Optimal proof systems imply complete sets for promise classes
Information and Computation
Bi-immunity separates strong NP-completeness notions
Information and Computation
Hierarchies for semantic classes
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A reducibility for the dot-depth hierarchy
Theoretical Computer Science - Mathematical foundations of computer science 2004
Languages to diagonalize against advice classes
Computational Complexity
Information and Computation
On the complexity of the two-variable guarded fragment with transitive guards
Information and Computation
A broader view on the limitations of information processing and communication by nature
Natural Computing: an international journal
Baire categories on small complexity classes and meager--comeager laws
Information and Computation
Theoretical Computer Science
Computational Complexity
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
Natural Computing: an international journal
Solving SUBSET SUM by Spiking Neural P Systems with Pre-computed Resources
Fundamenta Informaticae
On Toda's Theorem in Structural Communication Complexity
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Structural properties of oracle classes
Information Processing Letters
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
The two-variable guarded fragment with transitive guards is 2EXPTIME-hard
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Super-polynomial versus half-exponential circuit size in the exponential hierarchy
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Weak completeness notions for exponential time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Limits to measurement in experiments governed by algorithms†
Mathematical Structures in Computer Science
On the complexity of szilard languages of regulated grammars
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Immunity and pseudorandomness of context-free languages
Theoretical Computer Science
Complexity issues for preorders on finite labeled forests
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
On the computational complexity of behavioral description-based web service composition
Theoretical Computer Science
On the µ-calculus augmented with sabotage
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Cluster computing and the power of edge recognition
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
The complexity of black-box ring problems
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
P systems with active membranes characterize PSPACE
DNA'06 Proceedings of the 12th international conference on DNA Computing
Pure nash equilibria in games with a large number of actions
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Counting in the two variable guarded logic with transitivity
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Nontriviality for exponential time w.r.t weak reducibilities
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Generic density and small span theorem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Characterizations and Existence of Easy Sets without Hard Subsets
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes
Fundamenta Informaticae
| Hi-index | 0.00 |