The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On feasible numbers (Preliminary Version)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
A unified approach to models of synchronous parallel machines
STOC '78 Proceedings of the tenth 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
General context-free language recognition.
General context-free language recognition.
Formal languages and their relation to automata
Formal languages and their relation to automata
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
The strong exponential hierarchy collapses
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Properties that characterize LOGCFL
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The decision problem for the probabilities of higher-order properties
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Predicting performance of concurrency control designs
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A logic for partially specified data structures
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the power of one-way communication
Journal of the ACM (JACM)
Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
LFP: a logic for linguistic descriptions and an analysis of its complexity
Computational Linguistics
Limits on the provable consequences of one-way permutations
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Tradeoffs between communication and space
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Inductive pebble games and the expressive power of datalog
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of the ACM (JACM)
Limits on the provable consequences of one-way permutations (invited talk)
CRYPTO '88 Proceedings on Advances in cryptology
Processor networks and alternating machines
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Complexity classes defined by counting quantifiers
Journal of the ACM (JACM)
ACM SIGACT News
Space-bounded probabilistic game automata
Journal of the ACM (JACM)
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
On the equivalence of recursive and nonrecursive datalog programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of reusing and modifying rulebases
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of querying indefinite data about linearly ordered domains
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finite state verifiers I: the power of interaction
Journal of the ACM (JACM)
A calculus for access control in distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Stratified functional programs and computational complexity
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
On the power of bounded concurrency I: finite automata
Journal of the ACM (JACM)
On the power of bounded concurrency II: pushdown automata
Journal of the ACM (JACM)
Journal of Computer and System Sciences
Simple strategies for large zero-sum games with applications to complexity theory
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fast algorithms for finding randomized strategies in game trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximate solutions to problems in PSPACE
ACM SIGACT News
The complexity of probabilistic verification
Journal of the ACM (JACM)
Fundamentals of computing (a cheatlist)
ACM SIGACT News
Fixpoint logics, relational machines, and computational complexity
Journal of the ACM (JACM)
Making games short (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Complexity of nonrecursive logic programs with complex values
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Workflow, transactions and datalog
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of ordering subgoals
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of the ACM (JACM)
An Efficient General-Purpose Parallel Computer
Journal of the ACM (JACM)
Cost Trade-offs in Graph Embeddings, with Applications
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On the complexity of flow-sensitive dataflow analyses
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Paths vs. trees in set-based program analysis
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Security verification of programs with stack inspection
SACMAT '01 Proceedings of the sixth ACM symposium on Access control models and technologies
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Policy algebras for access control: the propositional case
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
SIGACT news complexity theory column 35
ACM SIGACT News
Higher-order strictness analysis in untyped lambda calculus
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
High-Level specification and automatic generation of IP interface monitors
Proceedings of the 39th annual Design Automation Conference
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Theoretical Computer Science
On the complexity of verifying concurrent transition systems
Information and Computation
Model Checking of Safety Properties
Formal Methods in System Design
Alternating-time temporal logic
Journal of the ACM (JACM)
Relaxed update and partition network games
Fundamenta Informaticae
Generalized Definite Set Constraints
Constraints
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete
Theoretical Computer Science
A leaf-size hierarchy of alternating rebound Turing machines
Journal of Automata, Languages and Combinatorics
An automata-theoretic approach to the reachability analysis of RPPS systems
Nordic Journal of Computing
Model Checking Games for the Alternation-Free µ-Calculus and Alternating Automata
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
0-1 Laws for Fragments of Existential Second-Order Logic: A Survey
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Alternating and Empty Alternating Auxiliary Stack Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
From Bidirectionality to Alternation
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Two-Way Finite State Transducers with Nested Pebbles
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Infinite Relations in Paraconsistent Databases
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
On Model Checking Synchronised Hardware Circuits
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
Decidable Fragments of Simultaneous Rigid Reachability
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Finite Automata with Generalized Acceptance Criteria
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Alternating the Temporal Picture for Safety
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On Game-Theoretic Models of Networks
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
EXPSPACE-Complete Variant of Guarded Fragment with Transitivity
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
The Control of Synchronous Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Open Systems in Reactive Environments: Control and Synthesis
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Extended Temporal Logic Revisited
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Local Model Checking Games for Fixed Point Logic with Chop
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
On the Power of Input-Synchronized Alternating Finite Automata
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Alternating-Time Temporal Logic
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
The State Explosion Problem from Trace to Bisimulation Equivalence
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Model Checking Fixed Point Logic with Chop
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A Calculus for Access Control in Distributed Systems
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
On Lexicographic Termination Ordering with Space Bound Certifications
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Model Checking CTL Properties of Pushdown Systems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Computational Power of BSP Computers
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Model Checking of Safety Properties
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Model Checking Linear Properties of Prefix-Recognizable Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Modal Satisfiability Is in Deterministic Linear Space
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
The Descriptive Comlexity of the Fixed-Points of Bounded Formulas
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
View-Based Query Answering and Query Containment over Semistructured Data
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Supernondeterministic Finite Automata
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
A propositional policy algebra for access control
ACM Transactions on Information and System Security (TISSEC)
From bidirectionality to alternation
Theoretical Computer Science - Mathematical foundations of computer science
Verifying minimum stable circuit values
Information Processing Letters
Note on winning positions on pushdown games with ω-regular conditions
Information Processing Letters
Alternating and empty alternating auxiliary stack automata
Theoretical Computer Science
Circuit Bottom Fan-in and Computational Power
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Decision procedures for inductive Boolean functions based on alternating automata
Theoretical Computer Science
Two-dimensional alternating Turing machines
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Space-bounded hierarchies and probabilistic computations
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Bandwidth constrained NP-Complete problems
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Speedups of deterministic machines by synchronous parallel machines
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Alternation and the power of nondeterminism
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Languages which capture complexity classes
STOC '83 Proceedings of the fifteenth 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
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
Stream processing of XPath queries with predicates
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
XPath queries on streaming data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Automata logics, and infinite games
On exponential-time completeness of the circularity problem for attribute grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
Mathematical Structures in Computer Science
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Computational structure of generative phonology and its relation to language comprehension
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Generalized acceptance, succinctness and supernondeterministic finite automata
Theoretical Computer Science - Implementation and application automata
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
A note on one-pebble two-dimensional Turing machines
Information Sciences: an International Journal
Coalition games and alternating temporal logics
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Knowledge based programs: on the complexity of perfect recall in finite environments
TARK '96 Proceedings of the 6th conference on Theoretical aspects of rationality and knowledge
Weighted hypertree decompositions and optimal query plans
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
From linear time to branching time
ACM Transactions on Computational Logic (TOCL)
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
Theoretical Computer Science - Expressiveness in concurrency
On the complexity of nonrecursive XQuery and functional query languages on complex values
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS)
Parallelizing time with polynomial circuits
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
On state-alternating context-free grammars
Theoretical Computer Science
Collecting Statistics Over Runtime Executions
Formal Methods in System Design
Theoretical Computer Science - Mathematical foundations of computer science 2004
Efficient LTL compilation for SAT-based model checking
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Artificial Intelligence
Modular strategies for recursive game graphs
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
A note on alternating one-pebble Turing machines with sublogarithmic space
Information Processing Letters
On the complexity of nonrecursive XQuery and functional query languages on complex values
ACM Transactions on Database Systems (TODS)
Some properties of one-pebble turing machines with sublogarithmic space
Theoretical Computer Science
Finite graph automata for linear and boundary graph languages
Theoretical Computer Science
Weighted hypertree decompositions and optimal query plans
Journal of Computer and System Sciences
On the complexity of the two-variable guarded fragment with transitive guards
Information and Computation
Statecharts in the making: a personal account
Proceedings of the third ACM SIGPLAN conference on History of programming languages
State explosion in almost-sure probabilistic reachability
Information Processing Letters
Complexity results on branching-time pushdown model checking
Theoretical Computer Science
The complexity of query containment in expressive fragments of XPath 2.0
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Inductive Time-Space Lower Bounds for Sat and Related Problems
Computational Complexity
The Complexity of Tensor Circuit Evaluation
Computational Complexity
Inverse monoids: Decidability and complexity of algebraic questions
Information and Computation
Analysis of modular arithmetic
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bounds on the automata size for Presburger arithmetic
ACM Transactions on Computational Logic (TOCL)
Information and Computation
Soft Linear Logic and Polynomial Complexity Classes
Electronic Notes in Theoretical Computer Science (ENTCS)
Some succinctness properties of Ω-DTAFA
SEPADS'06 Proceedings of the 5th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
Algebrization: a new barrier in complexity theory
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
ACM Transactions on Computational Logic (TOCL)
Proof Synthesis and Reflection for Linear Arithmetic
Journal of Automated Reasoning
Mathematical Structures in Computer Science
Reachability on prefix-recognizable graphs
Information Processing Letters
On the (High) Undecidability of Distributed Synthesis Problems
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Model Checking Knowledge and Linear Time: PSPACE Cases
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Commitment Monitoring in a Multiagent System
CEEMAS '07 Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V
On the Merits of Temporal Testers
25 Years of Model Checking
Conjunctive Grammars and Alternating Pushdown Automata
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Optimizing Conjunctive Queries over Trees Using Schema Information
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
The Complexity of Conjunctive Query Answering in Expressive Description Logics
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Deterministic Input-Reversal and Input-Revolving Finite Automata
Language and Automata Theory and Applications
Consensual Definition of Languages by Regular Sets
Language and Automata Theory and Applications
On Alternating Phrase-Structure Grammars
Language and Automata Theory and Applications
An Infinite Automaton Characterization of Double Exponential Time
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Infinite Runs in Weighted Timed Automata with Energy Constraints
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
More Concise Representation of Regular Languages by Automata and Regular Expressions
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
A finite set of functions with an EXPTIME-complete composition problem
Theoretical Computer Science
PSPACE bounds for rank-1 modal logics
ACM Transactions on Computational Logic (TOCL)
On recursive and non-recursive trade-offs between finite-turn pushdown automata
Journal of Automata, Languages and Combinatorics
Pebble alternating tree-walking automata and their recognizing power
Acta Cybernetica
Run-Time Monitoring of Electronic Contracts
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Four-dimensional multi-inkdot finite automata
WSEAS Transactions on Computers
Role Conjunctions in Expressive Description Logics
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
Factoring and Testing Primes in Small Space
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Polyadic Dynamic Logics for HPSG Parsing
Journal of Logic, Language and Information
A survey of three-dimensional automata
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Recognizability of multi-inkdot finite automata on four-dimensional input tapes
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Electronic Notes in Theoretical Computer Science (ENTCS)
Two Ways of Introducing Alternation into Context-Free Grammars and Pushdown Automata
IEICE - Transactions on Information and Systems
An Automata-Based Monitoring Technique for Commitment-Based Multi-Agent Systems
Coordination, Organizations, Institutions and Norms in Agent Systems IV
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Journal of Computer Science and Technology
Sup-interpretations, a semantic method for static analysis of program resources
ACM Transactions on Computational Logic (TOCL)
Branching-Time Model-Checking of Probabilistic Pushdown Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
EXPTIME-complete Decision Problems for Modal and Mixed Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity of query containment in expressive fragments of XPath 2.0
Journal of the ACM (JACM)
Keep It Small, Keep It Real: Efficient Run-Time Verification of Web Service Compositions
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Fixpoint Guided Abstraction Refinement for Alternating Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Alternation as a programming paradigm
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
On Models of a Nondeterministic Computation
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Complexity boundaries for horn description logics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
Pac-learning recursive logic programs: negative results
Journal of Artificial Intelligence Research
On input-revolving deterministic and nondeterministic finite automata
Information and Computation
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Artificial Intelligence
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
Undecidability and intractability results concerning datalog programs and their persistency numbers
ACM Transactions on Computational Logic (TOCL)
Query answering in description logics with transitive roles
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Computation of equilibriain noncooperative games
Computers & Mathematics with Applications
Tractable database design and datalog abduction through bounded treewidth
Information Systems
Game Over: The Foci Approach to LTL Satisfiability and Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
The problem of space invariance for sequential machines
Information and Computation
Conformant plans and beyond: Principles and complexity
Artificial Intelligence
A note on the space complexity of some decision problems for finite automata
Information Processing Letters
A note on alternating one-pebble Turing machines with sublogarithmic space
Information Processing Letters
Modal and mixed specifications: Key decision problems and their complexities
Mathematical Structures in Computer Science
More concise representation of regular languages by automata and regular expressions
Information and Computation
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
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
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
Testing extended regular language membership incrementally by rewriting
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
CTL+ is complete for double exponential time
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Symbolic backwards-reachability analysis for higher-order pushdown systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
A lower bound on web services composition
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Complexity results on balanced context-free languages
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Verification of data paths using unbounded integers: automata strike back
HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing
The weakness of self-complementation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Alternating states for dual nondeterminism in imperative programming
Theoretical Computer Science
Formal Methods in System Design
Model checking temporal metric specifications with Trio2Promela
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fixed point guided abstraction refinement for alternating automata
Theoretical Computer Science
Synchronized alternating turing machines on four-dimensional input tapes
WSEAS Transactions on Computers
WSEAS Transactions on Computers
On the computational complexity of dominance links in grammatical formalisms
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Information Tracking in Games on Graphs
Journal of Logic, Language and Information
Logic of infons: The propositional case
ACM Transactions on Computational Logic (TOCL)
An automata-theoretic approach to infinite-state systems
Time for verification
Towards a theory of time-bounded verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
The complexity of model checking for intuitionistic logics and their modal companions
RP'10 Proceedings of the 4th international conference on Reachability problems
Basic notions in computational complexity
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Other complexity classes and measures
Algorithms and theory of computation handbook
Parallel computation: models and complexity issues
Algorithms and theory of computation handbook
ALCALC: a context description logic
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Extended computation tree logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
A logic for reasoning about counterfactual emotions
Artificial Intelligence
P-hardness of the emptiness problem for visibly pushdown languages
Information Processing Letters
Hardness of preorder checking for basic formalisms
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Synthesis of trigger properties
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Alternating interval based temporal logics
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Quasi-interpretations a way to control resources
Theoretical Computer Science
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
Mathematical Structures in Computer Science
Linear conjunctive grammars and one-turn synchronized alternating pushdown automata
FG'09 Proceedings of the 14th international conference on Formal grammar
The blow-up in translating LTL to deterministic automata
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Revisiting Monte-Carlo tree search on a normal form game: NoGo
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
The complexity of request-response games
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Isomorphism of regular trees and words
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Efficient probabilistically checkable debates
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On the complexity of szilard languages of regulated grammars
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
On the computational complexity of behavioral description-based web service composition
Theoretical Computer Science
Hardness of preorder checking for basic formalisms
Theoretical Computer Science
Course of value distinguishes the intentionality of programming languages
Proceedings of the Second Symposium on Information and Communication Technology
Reaching and Distinguishing States of Distributed Systems
SIAM Journal on Computing
A characterization of alternating log time by first order functional programs
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
An O(n2) time algorithm for alternating Büchi games
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reasoning about Co-Büchi tree automata
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model-checking hierarchical structures
Journal of Computer and System Sciences
Algorithms for omega-regular games with imperfect information
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Infinite state model-checking of propositional dynamic logics
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Weak automata for the linear time µ-calculus
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Antichains: a new algorithm for checking universality of finite automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
The complexity of model checking higher order fixpoint logic
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Inverse monoids: decidability and complexity of algebraic questions
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Complexity results on branching-time pushdown model checking
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
On the power of unambiguity in alternating machines
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Translational lemmas for alternating TMs and PRAMs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
The complexity of live sequence charts
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
An Implicit Characterization of PSPACE
ACM Transactions on Computational Logic (TOCL)
HBAC: a model for history-based access control and its model checking
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
PSL model checking and run-time verification via testers
FM'06 Proceedings of the 14th international conference on Formal Methods
Finding shortest witnesses to the nonemptiness of automata on infinite words
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Computation as an unbounded process
Theoretical Computer Science
Playing savitch and cooking games
Concurrency, Compositionality, and Correctness
Deterministic dynamic monitors for linear-time assertions
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
Antichain algorithms for finite automata
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Turing machines for dummies: why representations do matter
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Finding finite herbrand models
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Two-Way automata making choices only at the endmarkers
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
An alternating hierarchy for finite automata
Theoretical Computer Science
The dag-width of directed graphs
Journal of Combinatorial Theory Series B
Extending decidable existential rules by joining acyclicity and guardedness
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
LTL over description logic axioms
ACM Transactions on Computational Logic (TOCL)
The complexity of inhabitation with explicit intersection
Logic and Program Semantics
Logic and Program Semantics
An appreciation of dexter kozen
Logic and Program Semantics
A parameterized halting problem
The Multivariate Algorithmic Revolution and Beyond
A saturation method for collapsible pushdown systems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Removing nondeterminism in constant height pushdown automata
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Unary coded NP-complete languages in ASPACE (log log n)
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Regularity problems for weak pushdown ω-automata and games
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Relaxed Update and Partition Network Games
Fundamenta Informaticae
First steps in checking and comparing Princeton WordNet and Estonian Wordnet
EACL 2012 Proceedings of the EACL 2012 Joint Workshop of LINGVIS & UNCLH
Traces of term-automatic graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On the complexity of reasoning about dynamic policies
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Towards more expressive ontology languages: The query answering problem
Artificial Intelligence
Entanglement and the complexity of directed graphs
Theoretical Computer Science
The covering and boundedness problems for branching vector addition systems
Journal of Computer and System Sciences
Concurrent games on VASS with inhibition
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
The complexity of one-agent refinement modal logic
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Instance compression for the polynomial hierarchy and beyond
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Limits on the computational power of random strings
Information and Computation
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Isomorphism of regular trees and words
Information and Computation
Type-Based complexity analysis for fork processes
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Model checking for modal intuitionistic dependence logic
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
Behavioural description based web service composition using abstraction and refinement
International Journal of Web and Grid Services
Bounded planning for strategic goals with incomplete information and perfect recall
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
ACM Transactions on Computation Theory (TOCT)
Decision problems for additive regular functions
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
One alternation can be more powerful than randomization in small and fast two-way finite automata
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Branching-time model-checking of probabilistic pushdown automata
Journal of Computer and System Sciences
Linear temporal logic and linear dynamic logic on finite traces
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
The complexity of one-agent refinement modal logic (extended abstract)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
The complexity of online manipulation of sequential elections
Journal of Computer and System Sciences
Taming the infinite chase: query answering under expressive relational constraints
Journal of Artificial Intelligence Research
The Complexity of Szilard Languages of Matrix Grammars Revisited
Fundamenta Informaticae
| Hi-index | 0.02 |