Feasible arithmetic computations: Valiant's hypothesis
Journal of Symbolic Computation
The Complexity of Computing the Size of an Interval
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Alphabet-Based Synchronisation is Exponentially Cheaper
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Model Checking of Safety Properties
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Query-monotonic Turing reductions
Theoretical Computer Science
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
Computational Complexity of Constraint Satisfaction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Succinctness of Regular Expressions with Interleaving, Intersection and Counting
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Complexity of Topological Properties of Regular ω-Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Reformulating Global Grammar Constraints
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Implementation of State Elimination Using Heuristics
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
A Backward and a Forward Simulation for Weighted Tree Automata
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Backward and forward bisimulation minimization of tree automata
Theoretical Computer Science
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Improvements to the evaluation of quantified boolean formulae
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
On NFAs where all states are final, initial, or both
Theoretical Computer Science
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
Theoretical Computer Science
The parallel complexity of finite-state automata problems
Information and Computation
Conformant plans and beyond: Principles and complexity
Artificial Intelligence
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Nearly bounded error probabilistic sets
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Complexity results on balanced context-free languages
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
On the complexity of unary tiling-recognizable picture languages
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Extending downward collapse from 1-versus-2 queries to j-versus-j + 1 queries
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Bounded universal expansion for preprocessing QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Bisimulation minimisation for weighted tree automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Slicing of component behavior specification with respect to their composition
CBSE'07 Proceedings of the 10th international conference on Component-based software engineering
Backward and forward bisimulation minimisation of tree automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
ACM Transactions on Computational Logic (TOCL)
Succinctness of regular expressions with interleaving, intersection and counting
Theoretical Computer Science
Composition of Services with Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
The complexity of Boolean formula minimization
Journal of Computer and System Sciences
Minimizing weighted tree grammars using simulation
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Approximate Satisfiability and Equivalence
SIAM Journal on Computing
Survey of polynomial transformations between NP-complete problems
Journal of Computational and Applied Mathematics
On language decompositions and primality
Rainbow of computer science
cmMUS: a tool for circumscription-based MUS membership testing
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Abstraction-based algorithm for 2QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
On deciding MUS membership with QBF
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Bribery in path-disruption games
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
What's decidable about weighted automata?
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Experimental evaluation of classical automata constructions
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Query-monotonic turing reductions
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Bisimulation minimization of tree automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Antichains: a new algorithm for checking universality of finite automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Representing paraconsistent reasoning via quantified propositional logic
Inconsistency Tolerance
Minimizing NFA's and regular expressions
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Collapsing recursive oracles for relativized polynomial hierarchies
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Simplifying regular expressions: a quantitative perspective
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
The inclusion problem for regular expressions
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Antichain algorithms for finite automata
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Foundations of regular expressions in XML schema languages and SPARQL
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Minimization for generalized Boolean formulas
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Survey: The consequences of eliminating NP solutions
Computer Science Review
Regular Expressions with Counting: Weak versus Strong Determinism
SIAM Journal on Computing
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
From equivalence to almost-equivalence, and beyond--minimizing automata with errors
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Complexity of Topological Properties of Regular ω-Languages
Fundamenta Informaticae
The inclusion problem for regular expressions
Journal of Computer and System Sciences
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Inverting onto functions and polynomial hierarchy
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Equivalence problems for circuits over sets of natural numbers
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Making weighted containment feasible: a heuristic based on simulation and abstraction
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Parameterized regular expressions and their languages
Theoretical Computer Science
Complexity of judgment aggregation
Journal of Artificial Intelligence Research
Control in the presence of manipulators: cooperative and competitive cases
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
Decidability of Weak Simulation on One-Counter Nets
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
State Elimination Heuristics for Short Regular Expressions
Fundamenta Informaticae
| Hi-index | 0.01 |