共 50 条
- [32] Shortest Paths in Planar Graphs with Real Lengths in O(n log2 n/log log n) Time ALGORITHMS-ESA 2010, PT II, 2010, 6347 : 206 - +
- [34] Collaborative Broadcast in O(log log n) Rounds ALGORITHMS FOR SENSOR SYSTEMS, ALGOSENSORS 2019, 2019, 11931 : 119 - 136
- [35] Implicit dictionaries supporting searches and amortized updates in O (log n log log n) time PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 670 - 678
- [36] Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 510 - 520
- [37] Minimum Cut of Directed Planar Graphs in O(n log log n) Time SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 477 - 494
- [39] Sorting stably, in-place, with O(n log n) comparisons and O(n) moves STACS 2005, PROCEEDINGS, 2005, 3404 : 629 - 640