| Environmental variability and modularity of bacterial metabolic networks M Parter, N Kashtan, U Alon BMC evolutionary biology 7, 1-8, 2007 | 254 | 2007 |
| 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 | 218 | 2008 |
| MST in log-star rounds of congested clique M Ghaffari, M Parter Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 91 | 2016 |
| Derandomizing local distributed algorithms under bandwidth restrictions K Censor-Hillel, M Parter, G Schwartzman Distributed Computing 33 (3), 349-366, 2020 | 82 | 2020 |
| A polylogarithmic gossip algorithm for plurality consensus M Ghaffari, M Parter Proceedings of the 2016 ACM symposium on principles of distributed computing …, 2016 | 68 | 2016 |
| 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 | 59 | 2009 |
| 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 | 58 | 2020 |
| Dual failure resilient BFS structure M Parter Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 58 | 2015 |
| Sparse fault-tolerant BFS trees M Parter, D Peleg European Symposium on Algorithms, 779-790, 2013 | 57 | 2013 |
| Fault-tolerant approximate BFS structures M Parter, D Peleg ACM Transactions on Algorithms (TALG) 14 (1), 1-15, 2018 | 48 | 2018 |
| Randomized distributed decision P Fraigniaud, M Göös, A Korman, M Parter, D Peleg Distributed Computing 27 (6), 419-434, 2014 | 47 | 2014 |
| 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 | 42 | 2018 |
| Simple, deterministic, constant-round coloring in the congested clique A Czumaj, P Davies, M Parter Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | 39 | 2020 |
| Computational tradeoffs in biological neural networks: Self-stabilizing winner-take-all networks N Lynch, C Musco, M Parter arXiv preprint arXiv:1610.02084, 2016 | 38 | 2016 |
| Secluded connectivity problems S Chechik, MP Johnson, M Parter, D Peleg Algorithmica 79, 708-741, 2017 | 36 | 2017 |
| Graph sparsification for derandomizing massively parallel computation with low space A Czumaj, P Davies, M Parter ACM Transactions on Algorithms (TALG) 17 (2), 1-27, 2021 | 34 | 2021 |
| Planar diameter via metric compression J Li, M Parter Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 34 | 2019 |
| Congested clique algorithms for graph spanners M Parter, E Yogev arXiv preprint arXiv:1805.05404, 2018 | 32 | 2018 |
| Preserving distances in very faulty graphs G Bodwin, F Grandoni, M Parter, VV Williams arXiv preprint arXiv:1703.10293, 2017 | 32 | 2017 |
| Randomized (Delta+ 1)-Coloring in O (log* Delta) Congested Clique Rounds M Parter, HH Su 32nd International Symposium on Distributed Computing (DISC 2018), 2018 | 31 | 2018 |
David PelegProfessor of Computer Science, Weizmann Instituteweizmann.ac.il의 이메일 확인됨
