Daniel H. Larkin

According to our database, Daniel H. Larkin authored at least 5 papers between 2014 and 2016.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2016

Compressing Trees with a Sledgehammer

Daniel H. Larkin

PhD thesis, 2016

2014

Disjoint Set Union with Randomized Linking.

Ashish Goel, Sanjeev Khanna, Daniel H. Larkin, Robert Endre Tarjan

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Better Approximation Algorithms for the Graph Diameter.

Shiri Chechik, Daniel H. Larkin, Liam Roditty, Grant Schoenebeck, Robert Endre Tarjan, Virginia Vassilevska Williams

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Nested Set Union.

Daniel H. Larkin, Robert Endre Tarjan

Proceedings of the Algorithms - ESA 2014, 2014

A Back-to-Basics Empirical Study of Priority Queues.

Daniel H. Larkin, Siddhartha Sen, Robert Endre Tarjan

Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014