| Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation I Abraham, D Dolev, R Gonen, J Halpern Proceedings of the twenty-fifth annual ACM symposium on Principles of …, 2006 | 393 | 2006 |
| Highway dimension, shortest paths, and provably efficient algorithms I Abraham, A Fiat, AV Goldberg, RF Werneck Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 263 | 2010 |
| A hub-based labeling algorithm for shortest paths in road networks I Abraham, D Delling, AV Goldberg, RF Werneck International Symposium on Experimental Algorithms, 230-241, 2011 | 257 | 2011 |
| Hierarchical hub labelings for shortest paths I Abraham, D Delling, AV Goldberg, RF Werneck European Symposium on Algorithms, 24-35, 2012 | 188 | 2012 |
| Link recommendation and densification PA Dow, S Kalyanaraman, I Abraham, S Indarapu US Patent App. 13/205,274, 2013 | 168 | 2013 |
| LLS: a locality aware location service for mobile ad hoc networks I Abraham, D Dolev, D Malkhi Proceedings of the 2004 joint workshop on Foundations of mobile computing, 75-84, 2004 | 166 | 2004 |
| Hotstuff: Bft consensus with linearity and responsiveness M Yin, D Malkhi, MK Reiter, GG Gueta, I Abraham Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 145 | 2019 |
| Nearly tight low stretch spanning trees I Abraham, Y Bartal, O Neiman 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 781-790, 2008 | 127 | 2008 |
| Byzantine disk paxos: optimal resilience with byzantine shared memory I Abraham, G Chockler, I Keidar, D Malkhi Distributed Computing 18 (5), 387-408, 2006 | 126 | 2006 |
| SBFT: a scalable and decentralized trust infrastructure GG Gueta, I Abraham, S Grossman, D Malkhi, B Pinkas, M Reiter, ... 2019 49th Annual IEEE/IFIP international conference on dependable systems …, 2019 | 124 | 2019 |
| Routing in networks with low doubling dimension I Abraham, C Gavoille, AV Goldberg, D Malkhi 26th IEEE International Conference on Distributed Computing Systems (ICDCS …, 2006 | 124 | 2006 |
| Pebblesdb: Building key-value stores using fragmented log-structured merge trees P Raju, R Kadekodi, V Chidambaram, I Abraham Proceedings of the 26th Symposium on Operating Systems Principles, 497-514, 2017 | 112 | 2017 |
| Using petal-decompositions to build a low stretch spanning tree I Abraham, O Neiman Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 107 | 2012 |
| Online detection of effectively callback free objects with applications to smart contracts S Grossman, I Abraham, G Golan-Gueta, Y Michalevsky, N Rinetzky, ... Proceedings of the ACM on Programming Languages 2 (POPL), 1-28, 2017 | 103 | 2017 |
| A generic scheme for building overlay networks in adversarial scenarios I Abraham, B Awerbuch, Y Azar, Y Bartal, D Malkhi, E Pavlov Proceedings International Parallel and Distributed Processing Symposium, 9 pp., 2003 | 101 | 2003 |
| Compact name-independent routing with minimum stretch I Abraham, C Gavoille, D Malkhi, N Nisan, M Thorup Proceedings of the sixteenth annual ACM symposium on Parallelism in …, 2004 | 100 | 2004 |
| LAND: stretch (1+ epsilon) locality-aware networks for DHTs. I Abraham, D Malkhi, O Dobzinski SODA, 550-559, 2004 | 99 | 2004 |
| Object location using path separators I Abraham, C Gavoille Proceedings of the twenty-fifth annual ACM symposium on Principles of …, 2006 | 85 | 2006 |
| Alternative routes in road networks I Abraham, D Delling, AV Goldberg, RF Werneck Journal of Experimental Algorithmics (JEA) 18, 1.1-1.17, 2013 | 82 | 2013 |
| VC-dimension and shortest path algorithms I Abraham, D Delling, A Fiat, AV Goldberg, RF Werneck International Colloquium on Automata, Languages, and Programming, 690-699, 2011 | 82 | 2011 |
Dahlia malkhiNoviVerified email at fb.com
