Obserwuj
Merav Parter
Merav Parter
Associate Professor, Weizmann Institute
Zweryfikowany adres z weizmann.ac.il - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Environmental variability and modularity of bacterial metabolic networks
M Parter, N Kashtan, U Alon
BMC evolutionary biology 7, 1-8, 2007
2362007
Facilitated variation: how evolution learns from past environments to generalize to new environments
M Parter, N Kashtan, U Alon
PLoS computational biology 4 (11), e1000206, 2008
1982008
MST in log-star rounds of congested clique
M Ghaffari, M Parter
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
842016
Derandomizing local distributed algorithms under bandwidth restrictions
K Censor-Hillel, M Parter, G Schwartzman
Distributed Computing 33 (3-4), 349-366, 2020
732020
A polylogarithmic gossip algorithm for plurality consensus
M Ghaffari, M Parter
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
592016
Extinctions in heterogeneous environments and the evolution of modularity
N Kashtan, M Parter, E Dekel, AE Mayo, U Alon
Evolution 63 (8), 1964-1975, 2009
552009
Dual failure resilient BFS structure
M Parter
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015
542015
Sparse fault-tolerant BFS trees
M Parter, D Peleg
Algorithms–ESA 2013: 21st Annual European Symposium, Sophia Antipolis …, 2013
512013
Randomized distributed decision
P Fraigniaud, M Göös, A Korman, M Parter, D Peleg
Distributed Computing 27 (6), 419-434, 2014
452014
Fault-tolerant approximate BFS structures
M Parter, D Peleg
ACM Transactions on Algorithms (TALG) 14 (1), 1-15, 2018
442018
The power of distributed verifiers in interactive proofs
M Naor, M Parter, E Yogev
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
382020
Preserving distances in very faulty graphs
G Bodwin, F Grandoni, M Parter, VV Williams
arXiv preprint arXiv:1703.10293, 2017
302017
Computational tradeoffs in biological neural networks: Self-stabilizing winner-take-all networks
N Lynch, C Musco, M Parter
arXiv preprint arXiv:1610.02084, 2016
302016
Optimal vertex fault tolerant spanners (for fixed stretch)
G Bodwin, M Dinitz, M Parter, VV Williams
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
292018
The topology of wireless communication
E Kantor, Z Lotker, M Parter, D Peleg
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
282011
Randomized (Delta+ 1)-Coloring in O (log* Delta) Congested Clique Rounds
M Parter, HH Su
32nd International Symposium on Distributed Computing (DISC 2018), 2018
272018
Congested clique algorithms for graph spanners
M Parter, E Yogev
arXiv preprint arXiv:1805.05404, 2018
262018
Secluded connectivity problems
S Chechik, MP Johnson, M Parter, D Peleg
Algorithmica 79, 708-741, 2017
262017
Local-on-average distributed tasks
M Parter, D Peleg, S Solomon
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
252016
Vertex fault tolerant additive spanners
M Parter
Distributed Computing: 28th International Symposium, DISC 2014, Austin, TX …, 2014
252014
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20