Back to Search
Start Over
O(log log n) time algorithms for Hamiltonian-suffix and min-max-pair heap operations on hypercube multicomputers.
- Source :
- Proceedings 11th International Parallel Processing Symposium; 1997, p507-511, 5p
- Publication Year :
- 1997
Details
- Language :
- English
- ISBNs :
- 9780818677939
- Database :
- Complementary Index
- Journal :
- Proceedings 11th International Parallel Processing Symposium
- Publication Type :
- Conference
- Accession number :
- 92212268
- Full Text :
- https://doi.org/10.1109/IPPS.1997.580947