Jakab Tardos
Jakab Tardos
Vahvistettu sähköpostiosoite verkkotunnuksessa epfl.ch
Nimike
Viittaukset
Viittaukset
Vuosi
Space efficient approximation to maximum matching size from uniform edge samples
M Kapralov, S Mitrović, A Norouzi-Fard, J Tardos
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
162020
Fast and space efficient spectral sparsification in dynamic streams
M Kapralov, A Mousavifar, C Musco, C Musco, N Nouri, A Sidford, ...
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
112020
Dynamic streaming spectral sparsification in nearly linear time and space
M Kapralov, N Nouri, A Sidford, J Tardos
arXiv preprint arXiv:1903.12150, 2019
112019
Towards tight bounds for spectral sparsification of hypergraphs
M Kapralov, R Krauthgamer, J Tardos, Y Yoshida
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
32021
Communication Efficient Coresets for Maximum Matching
M Kapralov, G Maystre, J Tardos
Symposium on Simplicity in Algorithms (SOSA), 156-164, 2021
12021
Fairness in Streaming Submodular Maximization: Algorithms and Hardness
ME Halabi, S Mitrović, A Norouzi-Fard, J Tardos, J Tarnawski
arXiv preprint arXiv:2010.07431, 2020
12020
Noisy Boolean Hidden Matching with Applications
M Kapralov, A Musipatla, J Tardos, DP Woodruff, S Zhou
arXiv preprint arXiv:2107.02578, 2021
2021
Streaming Belief Propagation for Community Detection
Y Wu, MH Bateni, A Linhares, FMG de Almeida, A Montanari, ...
arXiv preprint arXiv:2106.04805, 2021
2021
Spectral Hypergraph Sparsifiers of Nearly Linear Size
M Kapralov, R Krauthgamer, J Tardos, Y Yoshida
arXiv preprint arXiv:2106.02353, 2021
2021
Coresets for Graph Matching
G Maystre, M Kapralov, J Tardos
2020
THL4
M Elias, GA Gluch, M Kapralov, A Kumar, M Makarov, A Mousavifar, ...
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–11