\(O(\log \log N)\) time algorithms for Hamiltonian suffix and min-max-pair heap operations on the hypercube (Q1388140)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \(O(\log \log N)\) time algorithms for Hamiltonian suffix and min-max-pair heap operations on the hypercube |
scientific article; zbMATH DE number 1161429
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(O(\log \log N)\) time algorithms for Hamiltonian suffix and min-max-pair heap operations on the hypercube |
scientific article; zbMATH DE number 1161429 |
Statements
\(O(\log \log N)\) time algorithms for Hamiltonian suffix and min-max-pair heap operations on the hypercube (English)
0 references
3 August 1998
0 references
distributed-memory multicomputer
0 references
Hamiltonian suffix
0 references
0.8134872913360596
0 references
0.8117066621780396
0 references
0.7937926650047302
0 references
0.7869971394538879
0 references
