Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1998: Foundations of Software Technology and Theoretical Computer Science pp 174–185Cite as

Martingales and Locality in Distributed Computing

  • Conference paper

  • 343 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1530))

Abstract

We use Martingale inequalities to give a simple and uniform analysis of two families of distributed randomised algorithms for edge colouring graphs.

This is a preview of subscription content, 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   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bollabas, B.: Graph Theory: An Introductory Course. Springer, Heidelberg (1980)

    Google Scholar 

  2. Dubhashi, D., Grable, D.A., Panconesi, A.: Near optimal distributed edge colouring via the nibble method. Theoretical Computer Science 203, 225–251 (1998); A special issue for ESA 1995, the 3rd European Symposium on Algorithms

    Google Scholar 

  3. Dubhashi, D., Panconesi, A.: Concentration of measure for computer scientists. Draft of a monograph in preparation

    Google Scholar 

  4. Grable, D., Panconesi, A.: Near optimal distributed edge colouring in O(log log n) rounds. Random Structures and Algorithms 10(3), 385–405 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Grable, D., Panconesi, P.: Brooks and Vizing Colurings, SODA 98

    Google Scholar 

  6. Luby, M.: Removing randomness in parallel without a processor penalty. J. Computer and Systems Sciences 47(2), 250–286 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  7. Marton, K.: Bounding \({\bar d}\) distance by informational divergence: A method to prove measure concentration. Annals of Probability 24, 857–866 (1996)

    Google Scholar 

  8. Marton, K.: On the measure concentration inequality of Talagrand for dependent random variables. Submitted for publication (1998)

    Google Scholar 

  9. McDiarmid, C.J.H.: On the method of bounded differences. In: Siemons, J. (ed.) Surveys in Combinatorics. London Mathematical Society Lecture Notes Series 141. Cambridge University Press, Cambridge (1989)

    Google Scholar 

  10. Molloy, M., Reed, B.: A bound on the strong chromatic index of a graph. J. Comb. Theory (B) 69, 103–109 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  11. Panconesi, A., Srinivasan, A.: Randomized distributed edge coloring via an extension of the Chernoff–Hoeffding bounds. SIAM J. Computing 26(2), 350–368 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  12. Spencer, J.: Probabilistic methods in combinatorics. In: Proceedings of the International Congress of Mathematicians, Zurich, Birkhauser (1995)

    Google Scholar 

  13. Talagrand, M.: Concentration of measure and isoperimetric inequalities in product spaces. Publ. math. IHES 81(2), 73–205 (1995)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engg, Indian Institute of Technology, Delhi, Hauz Khas, New Delhi, 110016, India

    Devdatt P. Dubhashi

Authors
  1. Devdatt P. Dubhashi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Institute of Mathematical Sciences, 600 113, Chennai, India

    Vikraman Arvind

  2. National Institute of Advanced Studies, Indian Institute of Science Campus, 560012, Bangalore, India

    Sundar Ramanujam

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dubhashi, D.P. (1998). Martingales and Locality in Distributed Computing. In: Arvind, V., Ramanujam, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1998. Lecture Notes in Computer Science, vol 1530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49382-2_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-49382-2_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65384-4

  • Online ISBN: 978-3-540-49382-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation