2010

• Ittai Abraham, Amos Fiat, Andrew V. Goldberg, and Renato F. Werneck, Highway Dimension, Shortest Paths, and Provably Efficient Algorithms, in Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA10), Society for Industrial and Applied Mathematics, 2010

2009

• ittai abraham, dahlia Malkhi, and David Ratajczak, Compact Multicast Routing, in 23rd International Symposium on Distributed Computing (DISC 2009), Springer Verlag, September 2009
• Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, and Udi Wieder, Strong-Diameter Decompositions of Minor Free Graphs, in Theory of Computing Systems, 2009

2008

• Venugopalan Ramasubramanian, Dahlia Malkhi, Fabian Kuhn, Ittai Abraham, Mahesh Balakrishnan, Archit Gupta, and Aditya Akella, A Unified Network Coordinate System for Bandwidth and Latency, no. MSR-TR-2008-124, September 2008
• Ittai Abraham, Danny Dolev, and Joseph Y. Halpern, Lower Bounds on Implementing Robust and Resilient Mediators, in TCC, Springer, 2008
• Ittai Abraham, Yair Bartal, and Ofer Neiman, Nearly Tight Low Stretch Spanning Trees, in CoRR, vol. abs/0808.2017, 2008
• Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, and Mikkel Thorup, Compact Name-Independent Routing with Minimum Stretch, in ACM Transactions on Algorithms, vol. 4, no. 3, pp. 1–12, ACM, New York, NY, USA, 2008
• Ittai Abraham, Danny Dolev, and Joseph Y. Halpern, An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience, in CoRR, vol. abs/0808.1505, 2008
• Ittai Abraham, Yair Bartal, and Ofer Neiman, Embedding metric spaces in their intrinsic dimension, in SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2008
• Ittai Abraham, Danny Dolev, and Joseph Y. Halpern, An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience, in PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, ACM, New York, NY, USA, 2008

2007

• Ittai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Kunal Talwar, and Venugopalan (Rama) Ramasubramanian, Reconstructing Approximate Tree Metrics, in 26th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2007), Association for Computing Machinery, Inc., Portland, OR, August 2007
• Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, and Udi Wieder, Strong-diameter decompositions of minor free graphs, in ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM, San Diego, California, June 2007
• Ittai Abraham, Gregory Chockler, Idit Keidar, and Dahlia Malkhi, Wait-Free Regular Storage from Byzantine Components, in Information Processsing Letters, vol. 101, no. 2, pp. 60-65, January 2007
• Ittai Abraham, Danny Dolev, and Joseph Y. Halpern, Lower Bounds on Implementing Robust and Resilient Mediators, in CoRR, vol. abs/0704.3646, 2007
• Ittai Abraham, Yair Bartal, and Ofer Neiman, Local embeddings of metric spaces, in STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, ACM, New York, NY, USA, 2007
• Ittai Abraham, Yair Bartal, and Ofer Neiman, Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion, in SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2007

2006

• Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, and Udi Wieder, Strongly-Bounded Sparse Decompositions of Minor Free Graphs, no. MSR-TR-2006-192, December 2006
• Ittai Abraham, Cyril Gavoille, and Dahlia Malkhi, On Space-Stretch Trade-Offs: Upper bounds, in ACM Symposium on Parallel Algorithms and Architectures (SPAA), Cambridge, MA, July 2006
• Ittai Abraham, Cyril Gavoille, and Dahlia Malkhi, On Space-Stretch Trade-Offs: Lower bounds, in ACM Symposium on Parallel Algorithms and Architectures (SPAA), Cambridge, MA, July 2006
• Ittai Abraham, Yair Bartal, and Ofer Neiman, Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion, in CoRR, vol. abs/cs/0610003, 2006
• Ittai Abraham and Cyril Gavoille, Object location using path separators, in PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, ACM Press, New York, NY, USA, 2006
• Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, and Dahlia Malkhi, Routing in Networks with Low Doubling Dimension, IEEE Computer Society, Los Alamitos, CA, USA, 2006
• Ittai Abraham, Yair Bartal, and Ofer Neiman, Advances in metric embedding theory, in STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, ACM Press, New York, NY, USA, 2006
• Ittai Abraham, Danny Dolev, Rica Gonen, and Joe Halpern, Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation, in PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, ACM Press, New York, NY, USA, 2006

2005

• Ittai Abraham, Yair Bartal, Hubert T.-C. Chan, Kedar Dhamdhere, Anupam Gupta, Jon Kleinberg, Ofer Neiman, and Aleksandrs Slivkins, Metric Embeddings with Relaxed Guarantees, in 45th IEEE Symp. on Foundations of Computer Science (FOCS), Institute of Electrical and Electronics Engineers, Inc., October 2005
• Ittai Abraham, Cyril Gavoille, and Dahlia Malkhi, Compact Routing for Graphs Excluding a Fixed Minor, in 19th Intl. Symposium on Distributed Computing (DISC 05), Cracow, Poland, September 2005
• Ittai Abraham, Dahlia Malkhi, and Gurmeet Manku, Papillon: Greedy Routing in Rings, in Brief Announcement in the 19th Intl. Symposium on Distributed Computing (DISC 05), Cracow, Poland, September 2005
• Ittai Abraham and Dahlia Malkhi, Name Independent Routing for Growth Bounded Networks, in 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '05), July 2005
• Ittai Abraham and Dahlia Malkhi, Robust Locality-Aware Lookup Networks, in Self-star Properties in Complex Information Systems, Conceptual and Practical Foundations, Springer, Bertinoro, Italy, May 2005
• Ittai Abraham, Ankur Badola, Danny Bickson, Dahlia Malkhi, Sharad Maloo, and Saar Ron, Practical Locality-Awareness for Large Scale Information Sharing, in 4th Annual International Workshop on Peer-To-Peer Systems (IPTPS '05), February 2005
• Ittai Abraham, Dahlia Malkhi, and Gurmeet Singh Manku, Papillon: Greedy Routing in Rings., in DISC '05: in Prodeeding of the 19th International Conference on Distributed Computing, Springer, 2005
• Ittai Abraham and Dahlia Malkhi, Probabilistic quorums for dynamic systems., in Distributed Computing, vol. 18, no. 2, pp. 113-124, 2005
• Ittai Abraham, Cyril Gavoille, and Dahlia Malkhi, Compact Routing for Graphs Excluding a Fixed Minor., in DISC '05: in Prodeeding of the 19th International Conference on Distributed Computing, Springer, 2005
• Ittai Abraham, Ankur Badola, Danny Bickson, Dahlia Malkhi, Sharad Maloo, and Saar Ron, Practical Locality-Awareness for Large Scale Information Sharing., in IPTPS '05: In Proceeding of the 4th International Workshop on Peer-to-Peer Systems, Springer, 2005
• Ittai Abraham, Yair Bartal, T-H. Hubert Chan, Kedar Dhamdhere Dhamdhere, Anupam Gupta, Jon Kleinberg, Ofer Neiman, and Aleksandrs Slivkins, Metric Embeddings with Relaxed Guarantees, in FOCS '05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, USA, 2005
• Ittai Abraham, Yonatan Amit, and Danny Dolev, Optimal Resilience Asynchronous Approximate Agreement., in OPODIS '04: Proceedings of the 8th International Conference on Principles of Distributed Systems, Springer, 2005
• Ittai Abraham, James Aspnes, and Jian Yuan, Skip B-trees., in OPODIS '05: Proceedings of the 9th International Conference on Principles of Distributed Systems, 2005

2004

• Jon Kleinberg, Aleksandrs Slivkins, and Tom Wexler, Triangulation and Embedding Using Small Sets of Beacons, in 45th IEEE Symp. on Foundations of Computer Science (FOCS), Institute of Electrical and Electronics Engineers, Inc., October 2004
• Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, and Mikkel Thorup, Compact name-independent routing with minimum stretch, in SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, ACM Press, New York, NY, USA, 2004
• Ittai Abraham, Cyril Gavoille, and Dahlia Malkhi, Routing with Improved Communication-Space Trade-Off., in DISC '04: Proceddings of the 18th International Symposium on Distributed Computing, Springer, 2004
• Ittai Abraham, Danny Dolev, and Dahlia Malkhi, LLS: a locality aware location service for mobile ad hoc networks, in DIALM-POMC '04: Proceedings of the 2004 joint workshop on Foundations of mobile computing, ACM Press, New York, NY, USA, 2004
• Ittai Abraham, Dahlia Malkhi, and Oren Dobzinski, LAND: stretch (1 + epsilon) locality-aware networks for DHTs, in SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2004
• Ittai Abraham and Dahlia Malkhi, Principles of Locality-Aware Networks for Locating Nearest Copies of Data, in International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR), 2004
• Jon Kleinberg, Mark Sandler, and Aleksandrs Slivkins, Network failure detection and graph connectivity, in 15th ACM-SIAM Symp. on Discrete Algorithms (SODA), Association for Computing Machinery, Inc., January 2004

2003

• Ittai Abraham, Baruch Awerbuch, Yossi Azar, Yair Bartal, Dahlia Malkhi, and Elan Pavlov, A Generic Scheme for Building Overlay Networks in Adversarial Scenarios, in IPDPS '03: Proceedings of the 17th International Symposium on Parallel and Distributed Processing, IEEE Computer Society, Washington, DC, USA, 2003
• Ittai Abraham and Danny Dolev, Asynchronous resource discovery, in PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing, ACM Press, New York, NY, USA, 2003
• I. Abraham, B. Awerbuch, Y. Azar, Y. Bartal, D. Malkhi, and E. Pavlov, A Generic Scheme for Building Overlay Networks in Adversarial Scenarios, in International Parallel and Distributed Processing Symposium (IDPDS 2003), April 2003, Nice, France, 2003
• I. Abraham and D. Malkhi, Probabilistic Quorums for Dynamic Systems, in 17th International Symposium on DIStributed Computing (DISC 2003), Sorento, Italy, October 2003, 2003
• Aleksandrs Slivkins, Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs, in 11th Annual European Symp. on Algorithms (ESA), 2003
• Ittai Abraham and Dahlia Malkhi, Probabilistic Quorums for Dynamic Systems., in DISC '03: Proceddings of the 17th International Symposium on Distributed Computing, Springer, 2003

2002

• Aleksandrs Slivkins and Jehoshua Bruck, Interleaving Schemes on Circulant Graphs, in Discrete Mathematics, 2002