The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ittai Abraham: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  34. Volume in General Metric Spaces. [Citation Graph (, )][DBLP]


  35. Nearly Tight Low Stretch Spanning Trees. [Citation Graph (, )][DBLP]


  36. An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience. [Citation Graph (, )][DBLP]


  37. Forbidden-set distance labels for graphs of bounded doubling dimension. [Citation Graph (, )][DBLP]


  38. Embedding metric spaces in their intrinsic dimension. [Citation Graph (, )][DBLP]


  39. On low dimensional local embeddings. [Citation Graph (, )][DBLP]


  40. Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. [Citation Graph (, )][DBLP]


  41. Lower Bounds on Implementing Robust and Resilient Mediators. [Citation Graph (, )][DBLP]


  42. Compact Multicast Routing. [Citation Graph (, )][DBLP]


  43. Fast Asynchronous Consensus with Optimal Resilience. [Citation Graph (, )][DBLP]


  44. Alternative Routes in Road Networks. [Citation Graph (, )][DBLP]


  45. Papillon: Greedy Routing in Rings [Citation Graph (, )][DBLP]


  46. An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience [Citation Graph (, )][DBLP]


  47. Nearly Tight Low Stretch Spanning Trees [Citation Graph (, )][DBLP]


Search in 0.020secs, Finished in 0.022secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002