On the power of nonconservative PRAM

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1113, Issue , 1996, Pages 303-311

  Dessmark, Anders ^a   Lingas, Andrzej ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EREW PRAM; NONCONSERVATIVE; PRAM MODELS; SIMPLE METHOD;

ARTIFICIAL INTELLIGENCE;

EID: 0039549338     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61550-4_157     Document Type: Conference Paper

References (14)

1. A. Aho, J.E. Hopcroft and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
2. A. Andersson, T. Hagerup, S. Nilsson and R. Raman. Sorting in Linear Time? Proc. 27-th Annual ACM Symposium on Theory of Computing, 1995, pp. 427-436.
3. M. Ajtai, J. Komlos and E. Szemeredi. An O(n log n) sorting network. Proc. 15-th Annual ACM Symposium on Theory of Computing, 1983, pp. 1-9.
4. S. Albers and T. Hagerup. Improved Parallel Integer Sorting without Concurrent Writing. Proceedings of Symposium on Discrete Algorithms, 1992, pp. 463-472.
5. R. Cole and U. Vishkin. Approximate Parallel Scheduling. Part 1: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time. SIAM J. Comput. 17(1), 1988, pp. 128-142.
6. T. Hagerup and H. Shen. Improved nonconservative sequential and parallel integer sorting. Information Processing Letters 36, 1990, pp. 57-63.
7. J. Hopcroft, W. Paul and L. Valiant. On time versus space and related problems. In Proc. 16-th Annual IEEE Symposium on the Foundations of Computer Science, 1975, pp. 57-64.
8. R. M. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. In: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. A (Elsevier Science Publishers, 1990), pp. 869-941.
9. D.G. Kirkpatrick and S. Reisch. Upper bounds for sorting integers on random access machines. Theoretical Computer Science 28, 1984, pp. 263-276.
10. R. Ostrovsky. Efficient Computation on Oblivious RAMs. In Proc. 22-nd Annual ACM Symposium on Theory of Computing, 1990, pp. 514-523.
11. W.J. Paul and J. Simon. Decision trees and random access machines. Proc. International Symposium on Logic and Algorithmic, Zürich, 1980, pp. 331-340.
12. N. Pippenger and M. Fischer. Relations among complexity measures. JACM 26, pp. 361-381.
13. C. Schnorr. The network complexity and the Turing machine complexity of finite functions. Acta Inform. 7, 1976, pp. 95-107.
14. A. Schönhage and V. Strassen. Schnelle Multiplikation grosser Zahlen. Computing 7, 1971, pp. 281-322.