Theoretical Computer Science
Complexity of generalized graph coloring
Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
Completeness results for conflict-free vector replacement systems
Journal of Computer and System Sciences
Complexity results for POMSET languages
SIAM Journal on Discrete Mathematics
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
Normal and sinkless Petri nets
Journal of Computer and System Sciences
The complexity of word problems—this time with interleaving
Information and Computation
On limited nondeterminism and the complexity of the V-C dimension
Journal of Computer and System Sciences
The VC-dimension of set systems defined by graphs
Discrete Applied Mathematics
Graph Ramsey theory and the polynomial hierarchy
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Deciding the Vapnik-Ccaron;ervonenkis dimension is Sp3 -complete
Journal of Computer and System Sciences
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The minimum equivalent DNF problem and shortest implicants
Journal of Computer and System Sciences
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
The Minimization Problem for Boolean Formulas
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Optimizing TRIEs for ordered pattern matching is /spl Pi//sub 2//sup P/-complete
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
On the Complexity of Approximating the VC Dimension
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
The Boolean isomorphism problem
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximability and completeness in the polynomial hierarchy
Approximability and completeness in the polynomial hierarchy
Links between complexity theory and constrained block coding
IEEE Transactions on Information Theory
| Hi-index | 0.00 |