[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.5555/146062.146077guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Time-lapse snapshots

Published: 01 June 1992 Publication History

Abstract

No abstract available.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
ISTCS'92: Symposium proceedings on Theory of computing and systems
June 1992
220 pages
ISBN:0387555536

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 June 1992

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2005)An optimal multi-writer snapshot algorithmProceedings of the thirty-seventh annual ACM symposium on Theory of computing10.1145/1060590.1060697(723-732)Online publication date: 22-May-2005
  • (2001)Self-stabilizing l-exclusionTheoretical Computer Science10.1016/S0304-3975(00)00325-X266:1-2(653-692)Online publication date: 6-Sep-2001
  • (1997)Lower bounds for distributed coin-flipping and randomized consensusProceedings of the twenty-ninth annual ACM symposium on Theory of computing10.1145/258533.258649(559-568)Online publication date: 4-May-1997
  • (1996)Spreading rumors rapidly despite an adversaryProceedings of the fifteenth annual ACM symposium on Principles of distributed computing10.1145/248052.248077(143-151)Online publication date: 1-May-1996
  • (1996)Modular competitiveness for distributed algorithmsProceedings of the twenty-eighth annual ACM symposium on Theory of Computing10.1145/237814.237869(237-246)Online publication date: 1-Jul-1996
  • (1993)Contention in shared memory algorithmsProceedings of the twenty-fifth annual ACM symposium on Theory of Computing10.1145/167088.167145(174-183)Online publication date: 1-Jun-1993
  • (1993)Bounded round numberProceedings of the twelfth annual ACM symposium on Principles of distributed computing10.1145/164051.164058(53-64)Online publication date: 1-Sep-1993
  • (1993)Atomic snapshots in O(n log n) operationsProceedings of the twelfth annual ACM symposium on Principles of distributed computing10.1145/164051.164055(29-40)Online publication date: 1-Sep-1993
  • (1992)Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing10.1145/129712.129776(655-666)Online publication date: 1-Jul-1992

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media