Efficient simulation of synthesis-oriented system level designs
Proceedings of the 15th international symposium on System Synthesis
SIGACT news complexity theory comun 37
ACM SIGACT News
Valid identity problem for shuffle regular expressions
Journal of Automata, Languages and Combinatorics
Alphabet-Based Synchronisation is Exponentially Cheaper
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
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
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Finite Automata, Digraph Connectivity, and Regular Expression Size
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Inclusion Test Algorithms for One-Unambiguous Regular Expressions
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Succinctness of Regular Expressions with Interleaving, Intersection and Counting
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Linear time membership in a class of regular expressions with interleaving and counting
Proceedings of the 17th ACM conference on Information and knowledge management
On the relationship between workflow models and document types
Information Systems
Efficient asymmetric inclusion between regular expression types
Proceedings of the 12th International Conference on Database Theory
Efficient inclusion for a class of XML types with interleaving and counting
Information Systems
Detection of corrupted schema mappings in XML data integration systems
ACM Transactions on Internet Technology (TOIT)
Linear inclusion for XML regular expression types
Proceedings of the 18th ACM conference on Information and knowledge management
XML schema containment checking based on semi-implicit techniques
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Efficient inclusion for a class of XML types with interleaving and counting
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Succinctness of regular expressions with interleaving, intersection and counting
Theoretical Computer Science
Learning deterministic finite automata from interleaved strings
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Reasoning about finite-state switched systems
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Recognizing shuffled languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Optimizing schema languages for XML: numerical constraints and interleaving
ICDT'07 Proceedings of the 11th international conference on Database Theory
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Almost-linear inclusion for XML regular expression types
ACM Transactions on Database Systems (TODS)
Unshuffling a square is NP-hard
Journal of Computer and System Sciences
| Hi-index | 0.00 |