An Efficient Noisy Binary Search in Graphs via Median Approximation

von Dereniowski, Dariusz
Veröffentlicht in IWOCA (32. : 2021 : Online) Combinatorial Algorithms (2021)

All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier

von Grandoni, Fabrizio
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 1 of 4 (2021)