The Complexity of Constructing Evolutionary Trees Using Experiments
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Adaptive Sorting and the Information Theoretic Lower Bound
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Rebalancing a Binary Serach Tree
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Information Processing Letters
Information Processing Letters
Brief announcement: new bounds for the controller problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
New bounds for the controller problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |