| Publication | Date of Publication | Type |
|---|
Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Finding cores of limited length
Lecture Notes in Computer Science | 2022-08-19 | Paper |
| Constructing Light Spanners Deterministically in Near-Linear Time | 2022-05-11 | Paper |
Constructing light spanners deterministically in near-linear time
Theoretical Computer Science | 2022-02-21 | Paper |
Constructing light spanners deterministically in near-linear time
Theoretical Computer Science | 2022-02-21 | Paper |
Generalized dominators for structured programs
Static Analysis | 2022-02-16 | Paper |
Near-optimal induced universal graphs for cycles and paths
Discrete Applied Mathematics | 2020-06-05 | Paper |
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs
(available as arXiv preprint) | 2020-05-27 | Paper |
Near-optimal labeling schemes for nearest common ancestors
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Adjacency labeling schemes and induced-universal graphs
SIAM Journal on Discrete Mathematics | 2019-01-16 | Paper |
Union-find with constant time deletions
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Simpler, faster and shorter labels for distances in graphs
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Minimizing diameters of dynamic trees
Automata, Languages and Programming | 2018-07-04 | Paper |
Optimal induced universal graphs and adjacency labeling for trees
Journal of the ACM | 2018-05-17 | Paper |
Optimal induced universal graphs and adjacency labeling for trees
Journal of the ACM | 2018-05-17 | Paper |
| A Hamiltonian cycle in the square of a 2-connected graph in linear time | 2018-03-15 | Paper |
Sublinear Distance Labeling
(available as arXiv preprint) | 2018-03-02 | Paper |
Distance labeling schemes for trees
(available as arXiv preprint) | 2017-12-19 | Paper |
Worst-case and amortised optimality in union-find (extended abstract)
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Optimal on-line decremental connectivity in trees
Information Processing Letters | 2016-06-01 | Paper |
Maintaining information in fully dynamic trees with top trees
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Black box for constant-time insertion in priority queues (note)
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Adjacency labeling schemes and induced-universal graphs
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Optimal static range reporting in one dimension
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Compact Labeling Scheme for Ancestor Queries
SIAM Journal on Computing | 2006-06-01 | Paper |
Labeling Schemes for Small Distances in Trees
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Nearest common ancestors: a survey and a new algorithm for a distributed environment
Theory of Computing Systems | 2005-02-08 | Paper |
| scientific article; zbMATH DE number 2119759 (Why is no real title available?) | 2004-11-29 | Paper |
Dynamic nested brackets
Information and Computation | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2089205 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2079400 (Why is no real title available?) | 2004-07-28 | Paper |
An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators
Information Processing Letters | 2003-06-24 | Paper |
| A cell probe lower bound for dynamic nearest-neighbour searching | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1670815 (Why is no real title available?) | 2001-12-09 | Paper |
| scientific article; zbMATH DE number 1617247 (Why is no real title available?) | 2001-07-11 | Paper |
Generalized dominators for structured programs
Algorithmica | 2000-08-27 | Paper |
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
Journal of Algorithms | 2000-06-05 | Paper |
| scientific article; zbMATH DE number 1445383 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1445341 (Why is no real title available?) | 2000-05-10 | Paper |
Dominators in Linear Time
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1303574 (Why is no real title available?) | 1999-06-17 | Paper |
