Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
Measures of Nondeterminism in Finite Automata
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
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
Theoretical Computer Science
Partition Arguments in Multiparty Communication Complexity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Partition arguments in multiparty communication complexity
Theoretical Computer Science
Note: Some improved bounds on communication complexity via new decomposition of cliques
Discrete Applied Mathematics
Hi-index | 0.00 |