A data structure for dynamically maintaining rooted trees

Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry

Output-sensitive generation of random events

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

I/O-Efficient Shortest Path Queries in Geometric Spanners

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures

Dynamizing static algorithms, with applications to dynamic trees and history independence

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Self-adjusting top trees

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)

Searching dynamic point sets in spaces with bounded doubling dimension

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

Dynamic trees in practice

Journal of Experimental Algorithmics (JEA)

An experimental analysis of self-adjusting computation

ACM Transactions on Programming Languages and Systems (TOPLAS)

Space-time tradeoffs for approximate nearest neighbor searching

Journal of the ACM (JACM)

Algorithms for memory hierarchies: advanced lectures

Algorithms for memory hierarchies: advanced lectures

Dynamic trees in practice

WEA'07 Proceedings of the 6th international conference on Experimental algorithms

Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies

Journal of Discrete Algorithms

Self-adjusting computation with Delta ML

AFP'08 Proceedings of the 6th international conference on Advanced functional programming

Data structures for mergeable trees

ACM Transactions on Algorithms (TALG)

Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I

Balanced trees inhabiting functional parallel programming

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming

LS(Graph): a constraint-based local search for constraint optimization on trees and paths

Constraints

Output-sensitive well-separated pair decompositions for dynamic point sets

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems