Spremljaj
Daniel H. Larkin
Daniel H. Larkin
Preverjeni e-poštni naslov na cs.princeton.edu - Domača stran
Naslov
Navedeno
Navedeno
Leto
Better approximation algorithms for the graph diameter
S Chechik, DH Larkin, L Roditty, G Schoenebeck, RE Tarjan, VV Williams
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
1322014
A back-to-basics empirical study of priority queues
DH Larkin, S Sen, RE Tarjan
2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and …, 2014
642014
Disjoint set union with randomized linking
A Goel, S Khanna, DH Larkin, RE Tarjan
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
152014
Nested set union
DH Larkin, RE Tarjan
Algorithms-ESA 2014: 22th Annual European Symposium, Wroclaw, Poland …, 2014
32014
Compressing trees with a sledgehammer
DH Larkin
Princeton University, 2016
12016
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–5