H-PBS: a hash-based scalable technique for parallel bidirectional search

David Nassimi, Milind Joshi, Andrew Sohn. H-PBS: a hash-based scalable technique for parallel bidirectional search. In Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, SPDP 1995, San Antonio, Texas , USA, October 25-28, 1995. pages 414-421, IEEE, 1995. [doi]

@inproceedings{NassimiJS95,
  title = {H-PBS: a hash-based scalable technique for parallel bidirectional search},
  author = {David Nassimi and Milind Joshi and Andrew Sohn},
  year = {1995},
  doi = {10.1109/SPDP.1995.530713},
  url = {http://doi.ieeecomputersociety.org/10.1109/SPDP.1995.530713},
  researchr = {https://researchr.org/publication/NassimiJS95},
  cites = {0},
  citedby = {0},
  pages = {414-421},
  booktitle = {Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, SPDP 1995, San Antonio, Texas , USA, October 25-28, 1995},
  publisher = {IEEE},
  isbn = {0-8186-7195-5},
}