Ittai Abraham
Ittai Abraham
Unknown affiliation
Verified email at cs.huji.ac.il
TitleCited byYear
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
3592006
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
2242010
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
2082011
Link recommendation and densification
PA Dow, S Kalyanaraman, I Abraham, S Indarapu
US Patent App. 13/205,274, 2013
1742013
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
1562004
Hierarchical hub labelings for shortest paths
I Abraham, D Delling, AV Goldberg, RF Werneck
European Symposium on Algorithms, 24-35, 2012
1532012
Byzantine disk paxos: optimal resilience with byzantine shared memory
I Abraham, G Chockler, I Keidar, D Malkhi
Distributed Computing 18 (5), 387-408, 2006
1142006
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
1132006
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
1122008
LAND: stretch (1+ epsilon) locality-aware networks for DHTs.
I Abraham, D Malkhi, O Dobzinski
SODA, 550-559, 2004
1002004
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
992003
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
972004
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
902012
Object location using path separators
I Abraham, C Gavoille
Proceedings of the twenty-fifth annual ACM symposium on Principles of …, 2006
802006
Advances in metric embedding theory
I Abraham, Y Bartal, O Neimany
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
752006
Metric embeddings with relaxed guarantees
I Abraham, Y Bartal, J Kleinberg, THH Chan, O Neiman, K Dhamdhere, ...
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 83-100, 2005
732005
Peaches, lemons, and cookies: Designing auction markets with dispersed information
I Abraham, S Athey, M Babaioff, M Grubb
722013
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
722011
Alternative routes in road networks
I Abraham, D Delling, AV Goldberg, RF Werneck
Journal of Experimental Algorithmics (JEA) 18, 1.3, 2013
632013
Lower bounds on implementing robust and resilient mediators
I Abraham, D Dolev, JY Halpern
Theory of Cryptography Conference, 302-319, 2008
632008
The system can't perform the operation now. Try again later.
Articles 1–20