\(O(\log \log N)\) time algorithms for Hamiltonian suffix and min-max-pair heap operations on the hypercube

DOI10.1006/JPDC.1997.1418zbMATH Open0897.68018OpenAlexW2093067085MaRDI QIDQ1388140

Sajal K. Das, M. Cristina Pinotti

Publication date: 3 August 1998

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1997.1418

zbMATH Keywords

distributed-memory multicomputerHamiltonian suffix

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

This page was built for publication: \(O(\log \log N)\) time algorithms for Hamiltonian suffix and min-max-pair heap operations on the hypercube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388140)