Using tadpoles to reduce memory and communication requirements for exhaustive, breadth-first search using distributed computers

  • Authors:
  • Gene Cooperman;Michael Tselman

  • Affiliations:
  • College of Computer Science, Northeastern University, Boston, MA;College of Computer Science, Northeastern University, Boston, MA

  • Venue:
  • Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract