IR
Anthology
Community
Talya
Eden
2025
doi
dblp
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks.
Sabyasachi Basu
|
Nadia Koshima
|
Talya Eden
|
Omri Ben-Eliezer
|
C. Seshadhri
Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining, WSDM 2025, Hannover, Germany, March 10-14, 2025
2022
doi
dblp
Sampling Multiple Nodes in Large Networks: Beyond Random Walks.
Omri Ben-Eliezer
|
Talya Eden
|
Joel Oren
|
Dimitris Fotakis
WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21 - 25, 2022
2018
doi
dblp
Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples.
Talya Eden
|
Shweta Jain
|
Ali Pinar
|
Dana Ron
|
C. Seshadhri
Proceedings of the 2018 World Wide Web Conference on World Wide Web, WWW 2018, Lyon, France, April 23-27, 2018