The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Elkin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Elkin, Guy Kortsarz
    Polylogarithmic Inapproximability of the Radio Broadcast Problem. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:105-116 [Conf]
  2. Michael Elkin, Guy Kortsarz
    Approximation Algorithm for Directed Telephone Multicast Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:212-223 [Conf]
  3. Michael Elkin, David Peleg
    Strong Inapproximability of the Basic k-Spanner Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:636-647 [Conf]
  4. Michael Elkin, David Peleg
    Approximating k-Spanner Problems for k>2. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:90-104 [Conf]
  5. Michael Elkin
    Computing almost shortest paths. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:53-62 [Conf]
  6. Michael Elkin, Jian Zhang
    Efficient algorithms for constructing (1+, varepsilon;, beta)-spanners in the distributed and streaming models. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:160-168 [Conf]
  7. Michael Elkin, David Peleg
    The Client-Server 2-Spanner Problem with Applications to Network Design. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:117-132 [Conf]
  8. Béla Bollobás, Don Coppersmith, Michael Elkin
    Sparse distance preservers and additive spanners. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:414-423 [Conf]
  9. Don Coppersmith, Michael Elkin
    Sparse source-wise and pair-wise distance preservers. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:660-669 [Conf]
  10. Michael Elkin
    A faster distributed protocol for constructing a minimum spanning tree. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:359-368 [Conf]
  11. Michael Elkin, Guy Kortsarz
    Sublogarithmic approximation for telephone multicast: path out of jungle. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:76-85 [Conf]
  12. Michael Elkin, Guy Kortsarz
    Improved schedule for radio broadcast. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:222-231 [Conf]
  13. Michael Elkin, David Peleg
    The Hardness of Approximating Spanner Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:370-381 [Conf]
  14. Michael Elkin
    Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:331-340 [Conf]
  15. Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng
    Lower-stretch spanning trees. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:494-503 [Conf]
  16. Michael Elkin, Guy Kortsarz
    Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:438-447 [Conf]
  17. Michael Elkin, David Peleg
    (1+epsilon, beta)-spanner constructions for general graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:173-182 [Conf]
  18. Michael Elkin, Guy Kortsarz
    An Approximation Algorithm for the Directed Telephone Multicast Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:4, pp:569-583 [Journal]
  19. Michael Elkin, Daniel A. Spielman, Shang-Hua Teng
    Lower-Stretch Spanning Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  20. Michael Elkin, Jian Zhang
    Efficient algorithms for constructing (1+epsilon, beta)-spanners in the distributed and streaming models. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:5, pp:375-385 [Journal]
  21. Michael Elkin, Guy Kortsarz
    Logarithmic inapproximability of the radio broadcast problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:52, n:1, pp:8-25 [Journal]
  22. Michael Elkin, Guy Kortsarz
    Sublogarithmic approximation for telephone multicast. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:4, pp:648-659 [Journal]
  23. Michael Elkin
    A faster distributed protocol for constructing a minimum spanning tree. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:8, pp:1282-1308 [Journal]
  24. Michael Elkin, Guy Kortsarz
    A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:3, pp:672-689 [Journal]
  25. Michael Elkin, David Peleg
    (1+epsilon, beta)-Spanner Constructions for General Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:3, pp:608-631 [Journal]
  26. Michael Elkin
    An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:433-456 [Journal]
  27. Béla Bollobás, Don Coppersmith, Michael Elkin
    Sparse Distance Preservers and Additive Spanners. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:1029-1055 [Journal]
  28. Michael Elkin, Guy Kortsarz
    Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:881-899 [Journal]
  29. Michael Elkin
    Computing almost shortest paths. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:2, pp:283-323 [Journal]
  30. Michael Elkin, Guy Kortsarz
    An improved algorithm for radio broadcast. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  31. Michael Elkin, David Peleg
    Approximating k-spanner problems for kge2. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:249-277 [Journal]
  32. Michael Elkin
    Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:716-727 [Conf]
  33. Michael Elkin
    A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:185-194 [Conf]
  34. Michael Elkin
    A near-optimal fully dynamic distributed algorithm for maintaining sparse spanners [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  35. Michael Elkin, Christian Liebchen, Romeo Rizzi
    New length bounds for cycle bases. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:5, pp:186-193 [Journal]

  36. Novel Algorithms for the Network Lifetime Problem in Wireless Settings. [Citation Graph (, )][DBLP]


  37. Narrow-Shallow-Low-Light Trees with and without Steiner Points. [Citation Graph (, )][DBLP]


  38. Balancing Degree, Diameter and Weight in Euclidean Spanners. [Citation Graph (, )][DBLP]


  39. Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. [Citation Graph (, )][DBLP]


  40. Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition. [Citation Graph (, )][DBLP]


  41. Deterministic distributed vertex coloring in polylogarithmic time. [Citation Graph (, )][DBLP]


  42. An Improved Construction of Progression-Free Sets. [Citation Graph (, )][DBLP]


  43. Distributed (delta+1)-coloring in linear (in delta) time. [Citation Graph (, )][DBLP]


  44. Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners [Citation Graph (, )][DBLP]


  45. Distributed (Delta + 1)-coloring in linear (in Delta) time [Citation Graph (, )][DBLP]


  46. Deterministic Distributed Vertex Coloring in Polylogarithmic Time [Citation Graph (, )][DBLP]


  47. Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. [Citation Graph (, )][DBLP]


Search in 0.018secs, Finished in 0.020secs
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