A time complexity lower bound for randomized implementations of some shared objects

  • Authors:
  • Prasad Jayanti

  • Affiliations:
  • Department of Computer Science, Dartmouth College, Hanover, NH

  • Venue:
  • PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract