"O(log log N) Time Algorithms for Hamiltonian Suffix and Min-Max-Pair Heap ..."

Sajal K. Das, Maria Cristina Pinotti (1998)

> Home

Details and statistics

DOI: 10.1006/JPDC.1997.1418

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jpdc/DasP98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/DasP98
Sajal K. Das, Maria Cristina Pinotti:
O(log log N) Time Algorithms for Hamiltonian Suffix and Min-Max-Pair Heap Operations on the Hypercube. J. Parallel Distributed Comput. 48(2): 200-211 (1998)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.