MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
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
On the separation between k-party and (k - 1)-party nondeterministic message complexities
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Communication complexity and intrinsic universality in cellular automata
Theoretical Computer Science
Hi-index | 0.00 |