STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Improved labeling scheme for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Maintaining Center and Median in Dynamic Trees
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Maintaining information in fully dynamic trees with top trees
ACM Transactions on Algorithms (TALG)
Theoretical Computer Science
Journal of Experimental Algorithmics (JEA)
An experimental analysis of self-adjusting computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Self-adjusting computation with Delta ML
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
The tree inclusion problem: in optimal space and faster
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Tree compression with top trees
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |