Skip to main content
SpringerLink
Log in

Synchronizers, Spanners

1985; Awerbuch

  • Reference work entry
Book cover Encyclopedia of Algorithms

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Awerbuch, B.: Complexity of network synchronization. J. ACM 4, 804–823 (1985)

    Article  MathSciNet  Google Scholar 

  2. Awerbuch, B., Patt-Shamir, B., Peleg, D., Saks, M.E.: Adapting to asynchronous dynamic networks. In: Proc. of the 24th Annual ACM Symp. on Theory of Computing, Victoria, 4–6 May 1992, pp. 557–570

    Google Scholar 

  3. Awerbuch, B., Peleg, D.: Network synchronization with polylogarithmic overhead. In: Proc. 31st IEEE Symp. on Foundations of Computer Science, Sankt Louis, 22–24 Oct. 1990, pp. 514–522

    Google Scholar 

  4. Awerbuch, B., Peleg, D.: Routing with polynomial communication‐space tradeoff. SIAM J. Discret. Math. 5, 151–162 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  5. Elkin, M.: Computing Almost Shortest Paths. In: Proc. 20th ACM Symp. on Principles of Distributed Computing, Newport, RI, USA, 26–29 Aug. 2001, pp. 53–62

    Google Scholar 

  6. Elkin, M., Peleg, D.: Spanner constructions for general graphs. In: Proc. of the 33th ACM Symp. on Theory of Computing, Heraklion, 6–8 Jul. 2001, pp. 173–182

    Google Scholar 

  7. Lakshmanan, K.B., Thulasiraman, K., Comeau, M.A.: An efficient distributed protocol for finding shortest paths in networks with negative cycles. IEEE Trans. Softw. Eng. 15, 639–644 (1989)

    Article  Google Scholar 

  8. Peleg, D., Schäffer, A.: Graph spanners. J. Graph Theory 13, 99–116 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  9. Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. SIAM J. Comput. 18, 740–747 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  10. Schieber, B., Moran, S.: Slowing sequential algorithms for obtaining fast distributed and parallel algorithms: Maximum matchings. In: Proc. of 5th ACM Symp. on Principles of Distributed Computing, Calgary, 11–13 Aug. 1986, pp. 282–292

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Ben-Gurion University, Beer-Sheva, Israel

    Michael Elkin

Authors
  1. Michael Elkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer ScienceMcCormick School of Engineering and Applied Science, Northwestern University, Evanston, IL, 60208, USA

    Ming-Yang Kao Professor of Computer Science

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Elkin, M. (2008). Synchronizers, Spanners. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_417

Download citation

Publish with us

Policies and ethics

Search

Navigation