Using approximation algorithms to design parallel algorithms that may ignore processor allocation
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- On parallel hashing and integer sortingPublished by Springer Nature ,2005
- The parallel simplicity of compaction and chainingPublished by Springer Nature ,2005
- Constant-time parallel integer sortingPublished by Association for Computing Machinery (ACM) ,1991
- A simple randomized parallel algorithm for list-rankingInformation Processing Letters, 1990
- Every robust CRCW PRAM can efficiently simulate a PRIORITY PRAMPublished by Association for Computing Machinery (ACM) ,1990
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- Priority Search TreesSIAM Journal on Computing, 1985
- Parallel tree contraction and its applicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Parallel Prefix ComputationJournal of the ACM, 1980
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979