I agree that this site is using cookies. You can find further informations here.
X
Eden, Talya
51  results:
Search for persons X
?
1

Sampling Multiple Nodes in Large Networks : Beyond Rando..:

, In: Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining,
Ben-Eliezer, Omri ; Eden, Talya ; Oren, Joel. - p. 37-47 , 2022
Link: https://dl.acm.org/doi/1..
 
?
2

Sublinear-time distributed algorithms for detecting small c..:

Eden, Talya ; Fiat, Nimrod ; Fischer, Orr..
Distributed Computing.  35 (2021)  3 - p. 207-234 , 2021
Link: https://doi.org/10.1007/..
 
?
3

On Approximating the Number of $k$-Cliques in Sublinear Tim:

Eden, Talya ; Ron, Dana ; Seshadhri, C.
SIAM Journal on Computing.  49 (2020)  4 - p. 747-771 , 2020
Link: https://doi.org/10.1137/..
 
?
4

Testing Bounded Arboricity:

Eden, Talya ; Levi, Reut ; Ron, Dana
ACM Transactions on Algorithms (TALG).  16 (2020)  2 - p. 1-22 , 2020
Link: https://dl.acm.org/doi/1..
 
?
5

Testing Bounded Arboricity:

Eden, Talya ; Levi, Reut ; Ron, Dana
ACM Transactions on Algorithms.  16 (2020)  2 - p. 1-22 , 2020
Link: https://doi.org/10.1145/..
 
?
6

Faster sublinear approximation of the number of k-cliques i..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Eden, Talya ; Ron, Dana ; Seshadhri, C. - p. 1467-1478 , 2020
Link: https://dl.acm.org/doi/1..
 
?
7

Tolerant Junta Testing and the Connection to Submodular Opt..:

Blais, Eric ; Canonne, Clément L. ; Eden, Talya..
ACM Transactions on Computation Theory (TOCT).  11 (2019)  4 - p. 1-33 , 2019
Link: https://dl.acm.org/doi/1..
 
?
8

Tolerant Junta Testing and the Connection to Submodular Opt..:

Blais, Eric ; Canonne, Clément L. ; Eden, Talya..
ACM Transactions on Computation Theory.  11 (2019)  4 - p. 1-33 , 2019
Link: https://doi.org/10.1145/..
 
?
9

Sublinear Time Estimation of Degree Distribution Moments: T..:

Eden, Talya ; Ron, Dana ; Seshadhri, C.
SIAM Journal on Discrete Mathematics.  33 (2019)  4 - p. 2267-2285 , 2019
Link: https://doi.org/10.1137/..
 
?
10

Testing bounded arboricity:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Eden, Talya ; Levi, Reut ; Ron, Dana - p. 2081-2092 , 2018
Link: https://doi.org/10.1137/..
 
?
11

On approximating the number of k-cliques in sublinear time:

, In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing,
Eden, Talya ; Ron, Dana ; Seshadhri, C. - p. 722-734 , 2018
Link: https://dl.acm.org/doi/1..
 
?
12

Tolerant junta testing and the connection to submodular opt..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Blais, Eric ; Canonne, Clément L. ; Eden, Talya.. - p. 2113-2132 , 2018
Link: https://dl.acm.org/doi/1..
 
?
13

Tolerant Junta Testing and the Connection to Submodular Opt..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Blais, Eric ; Canonne, Clément L. ; Eden, Talya.. - p. 2113-2132 , 2018
Link: https://doi.org/10.1137/..
 
?
14

Provable and Practical Approximations for the Degree Distri..:

, In: Proceedings of the 2018 World Wide Web Conference,
Eden, Talya ; Jain, Shweta ; Pinar, Ali.. - p. 449-458 , 2018
Link: https://dl.acm.org/doi/1..
 
?
15

Testing bounded arboricity:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Eden, Talya ; Levi, Reut ; Ron, Dana - p. 2081-2092 , 2018
Link: https://dl.acm.org/doi/1..
 
1-15