Search for persons
X
?
Lecture Notes in Computer Science; Advances in Information Retrieval ,
1
The Power of Anchor Text in the Neural Retrieval Era:
, In:
?
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) ,
2
Derandomizing Directed Random Walks in Almost-Linear Time:
, In:
?
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing ,
3
Decremental strongly-connected components and single-source..:
, In:
?
4
Die Verblendung der Kunst
Passagen Forum
Copies:
:TB Technik K I Vir; Zentrale:E04 a kun 041.8 vir/783
?
Proceedings of the 56th Annual ACM Symposium on Theory of Computing ,
5
Almost-Linear Time Algorithms for Incremental Graphs: Cycle..:
, In:
?
Proceedings of the 56th Annual ACM Symposium on Theory of Computing ,
6
A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Spa..:
, In:
?
Proceedings of the 55th Annual ACM Symposium on Theory of Computing ,
7
Deterministic Incremental APSP with Polylogarithmic Update ..:
, In:
?
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ,
8
New algorithms and hardness for incremental single-source s..:
, In:
?
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) ,
9
A Deterministic Almost-Linear Time Algorithm for Minimum-Co..:
, In:
?
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) ,
11
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time:
, In:
?
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) ,
12
Deterministic Decremental SSSP and Approximate Min-Cost Flo..:
, In:
?
Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms ,
13
New techniques and fine-grained hardness for dynamic near-a..:
, In:
?
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ,
14