David Peleg
Affiliations: | APM Applied Mathematics | Weizmann Institute of Science, Rehovot, Israel |
Area:
Computer Science, Applied MathematicsGoogle:
"David Peleg"Children
Sign in to add trainee| Nissan Lev-Tov | grad student | 2005 | Weizmann Institute |
| Yuval Emek | grad student | 2008 | Weizmann Institute |
| Erez Kantor | grad student | 2010 | Weizmann Institute |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Navon T, Peleg D. (2020) Mixed fault tolerance in server assignment: Combining reinforcement and backup Theoretical Computer Science. 836: 76-93 |
| Bar-Noy A, Peleg D, Rawitz D. (2020) Vertex-weighted realizations of graphs Theoretical Computer Science. 807: 56-72 |
| Pandurangan G, Peleg D, Scquizzato M. (2020) Message lower bounds via efficient network synchronization Theoretical Computer Science. 810: 82-95 |
| Avin C, Daltrophe H, Keller B, et al. (2020) Mixed preferential attachment model: Homophily and minorities in social networks Physica a: Statistical Mechanics and Its Applications. 555: 124723 |
| Parter M, Peleg D. (2020) Fault Tolerant Approximate BFS Structures with Additive Stretch Algorithmica. 1-34 |
| Avin C, Lotker Z, Peleg D, et al. (2018) Elites in social networks: An axiomatic approach to power balance and Price's square root law. Plos One. 13: e0205820 |
| Kantor E, Lotker Z, Parter M, et al. (2018) The topology of wireless communication on a line Theoretical Computer Science. 711: 105-108 |
| Lenzen C, Patt-Shamir B, Peleg D. (2018) Distributed distance computation and routing with small messages Distributed Computing. 32: 133-157 |
| Parter M, Peleg D. (2016) Sparse Fault-Tolerant BFS Structures Acm Transactions On Algorithms. 13: 1-24 |
| Abraham I, Chechik S, Gavoille C, et al. (2016) Forbidden-set distance labels for graphs of bounded doubling dimension Acm Transactions On Algorithms. 12 |