Counting networks are practically linearizable

  • Authors:
  • Nancy Lynch;Nir Shavit;Alex Shvartsman;Dan Touitou

  • Affiliations:
  • Massachusetts Institute of Technology, Laboratory for Computer Science;Massachusetts Institute of Technology and Tel-Aviv University and MIT Laboratory for Computer Science, 545, Technology Square, NE43-340, Cambridge, MA;Massachusetts Institute of Technology, Laboratory for Computer Science;Tel-Aviv University, Department of Computer Science

  • Venue:
  • PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract