Bounded-depth circuits: separating wires from gates
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The average time complexity to compute preffix functions in processor networks
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
r-semi-groups: a generic approach for designing stabilizing silent tasks
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Restricted two-variable FO + MOD sentences, circuits and communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Regular languages, unambiguous concatenation and computational complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |