2009 | ||
---|---|---|
42 | EE | Ittai Abraham, Yair Bartal, Ofer Neiman: On low dimensional local embeddings. SODA 2009: 875-884 |
2008 | ||
41 | EE | Ittai Abraham, Yair Bartal, Ofer Neiman: Nearly Tight Low Stretch Spanning Trees. FOCS 2008: 781-790 |
40 | EE | Ittai Abraham, Danny Dolev, Joseph Y. Halpern: An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience. PODC 2008: 405-414 |
39 | EE | Ittai Abraham, Yair Bartal, Ofer Neiman: Embedding metric spaces in their intrinsic dimension. SODA 2008: 363-372 |
38 | EE | Ittai Abraham, Danny Dolev, Joseph Y. Halpern: Lower Bounds on Implementing Robust and Resilient Mediators. TCC 2008: 302-319 |
37 | EE | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup: Compact name-independent routing with minimum stretch. ACM Transactions on Algorithms 4(3): (2008) |
36 | EE | Ittai Abraham, Danny Dolev, Joseph Y. Halpern: An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience CoRR abs/0808.1505: (2008) |
35 | EE | Ittai Abraham, Yair Bartal, Ofer Neiman: Nearly Tight Low Stretch Spanning Trees CoRR abs/0808.2017: (2008) |
2007 | ||
34 | EE | Ittai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Venugopalan Ramasubramanian, Kunal Talwar: Reconstructing approximate tree metrics. PODC 2007: 43-52 |
33 | EE | Ittai Abraham, Yair Bartal, Ofer Neiman: Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. SODA 2007: 502-511 |
32 | EE | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder: Strong-diameter decompositions of minor free graphs. SPAA 2007: 16-24 |
31 | EE | Ittai Abraham, Yair Bartal, Ofer Neiman: Local embeddings of metric spaces. STOC 2007: 631-640 |
30 | EE | Ittai Abraham, Danny Dolev, Joseph Y. Halpern: Lower Bounds on Implementing Robust and Resilient Mediators CoRR abs/0704.3646: (2007) |
29 | EE | Ittai Abraham, Gregory Chockler, Idit Keidar, Dahlia Malkhi: Wait-free regular storage from Byzantine components. Inf. Process. Lett. 101(2): 60-65 (2007) |
2006 | ||
28 | EE | Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi: Routing in Networks with Low Doubling Dimension. ICDCS 2006: 75 |
27 | EE | Ittai Abraham, Cyril Gavoille: Object location using path separators. PODC 2006: 188-197 |
26 | EE | Ittai Abraham, Danny Dolev, Rica Gonen, Joseph Y. Halpern: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. PODC 2006: 53-62 |
25 | EE | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi: On space-stretch trade-offs: lower bounds. SPAA 2006: 207-216 |
24 | EE | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi: On space-stretch trade-offs: upper bounds. SPAA 2006: 217-224 |
23 | EE | Ittai Abraham, Yair Bartal, Ofer Neiman: Advances in metric embedding theory. STOC 2006: 271-286 |
22 | EE | Ittai Abraham, Yair Bartal, Ofer Neiman: Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion CoRR abs/cs/0610003: (2006) |
21 | EE | Ittai Abraham, Danny Dolev: Asynchronous resource discovery. Computer Networks 50(10): 1616-1629 (2006) |
20 | EE | Ittai Abraham, Gregory Chockler, Idit Keidar, Dahlia Malkhi: Byzantine disk paxos: optimal resilience with byzantine shared memory. Distributed Computing 18(5): 387-408 (2006) |
2005 | ||
19 | EE | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi: Compact Routing for Graphs Excluding a Fixed Minor. DISC 2005: 442-456 |
18 | EE | Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku: Papillon: Greedy Routing in Rings. DISC 2005: 514-515 |
17 | EE | Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins: Metric Embeddings with Relaxed Guarantees. FOCS 2005: 83-100 |
16 | EE | Ittai Abraham, Ankur Badola, Danny Bickson, Dahlia Malkhi, Sharad Maloo, Saar Ron: Practical Locality-Awareness for Large Scale Information Sharing. IPTPS 2005: 173-181 |
15 | EE | Ittai Abraham, James Aspnes, Jian Yuan: Skip B-Trees. OPODIS 2005: 366-380 |
14 | EE | Ittai Abraham, Dahlia Malkhi: Name independent routing for growth bounded networks. SPAA 2005: 49-55 |
13 | EE | Ittai Abraham, Dahlia Malkhi: Robust Locality-Aware Lookup Networks. Self-star Properties in Complex Information Systems 2005: 392-402 |
12 | EE | Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku: Papillon: Greedy Routing in Rings CoRR abs/cs/0507034: (2005) |
11 | EE | Ittai Abraham, Dahlia Malkhi: Probabilistic quorums for dynamic systems. Distributed Computing 18(2): 113-124 (2005) |
2004 | ||
10 | EE | Ittai Abraham, Danny Dolev, Dahlia Malkhi: LLS: a locality aware location service for mobile ad hoc networks. DIALM-POMC 2004: 75-84 |
9 | EE | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi: Routing with Improved Communication-Space Trade-Off. DISC 2004: 305-319 |
8 | EE | Ittai Abraham, Yonatan Amit, Danny Dolev: Optimal Resilience Asynchronous Approximate Agreement. OPODIS 2004: 229-239 |
7 | EE | Ittai Abraham, Dahlia Malkhi: Compact routing on euclidian metrics. PODC 2004: 141-149 |
6 | EE | Ittai Abraham, Gregory Chockler, Idit Keidar, Dahlia Malkhi: Byzantine disk paxos: optimal resilience with byzantine shared memory. PODC 2004: 226-235 |
5 | EE | Ittai Abraham, Dahlia Malkhi, Oren Dobzinski: LAND: stretch (1 + epsilon) locality-aware networks for DHTs. SODA 2004: 550-559 |
4 | EE | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup: Compact name-independent routing with minimum stretch. SPAA 2004: 20-24 |
2003 | ||
3 | EE | Ittai Abraham, Dahlia Malkhi: Probabilistic Quorums for Dynamic Systems. DISC 2003: 60-74 |
2 | EE | Ittai Abraham, Baruch Awerbuch, Yossi Azar, Yair Bartal, Dahlia Malkhi, Elan Pavlov: A Generic Scheme for Building Overlay Networks in Adversarial Scenarios. IPDPS 2003: 40 |
1 | EE | Ittai Abraham, Danny Dolev: Asynchronous resource discovery. PODC 2003: 143-150 |