The characterization of data-accumulating algorithms

Theory of Computing Systems

Volumn 33, Issue 1, 2000, Pages 85-96

  Bruda, S D ^a   Akl, S G ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES;

D-ALGORITHM; ON-LINE ALGORITHMS; PARALLEL IMPLEMENTATIONS;

COMPUTER SCIENCE;

EID: 0034418085     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002249910005     Document Type: Article

References (15)

1. A. V. Aho, J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. S. G. Akl, Parallel Computation: Models and Methods, Prentice-Hall, Englewood Cliffs, NJ, 1997.
3. S. G. Akl, L. F. Lindon, Paradigms Admitting Superunitary Behavior in Parallel Computation, Parallel Algorithms and Applications, 11 (1997), 129-153.
4. R. P. Brent, The Parallel Evaluation of General Arithmetic Expressions, Journal of the ACM 21 (1974) 201-206.
5. S. D. Bruda, S. G. Akl, On the Data-Accumulating Paradigm, in Proceedings of the Fourth International Conference on Computer Science and Informatics, Research Triangle Park, NC, 1998, pp. 150-153.
6. J. Hartmanis, P. M. Lewis, II, R. E. Stearns, Classifications of Computations by Time and Memory Requirements, Proceedings of the IFIP Congress 65, 1965, pp. 31-35.
7. S. Irani, A. R. Karlin, Online Computation, in D. S. Hochbaum (ed.), Approximation Algorithms for NP-Hard Problems, International Thomson, 1997, pp. 521-564.
8. D. Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, MA, 1969.
9. T-H. Lai, S. Sahni, Anomalies in Parallel Branch-and-Bound Algorithms, Communications of the ACM, 27 (1984), 594-602.
10. H. R. Lewis, C. H. Papadimitriou, Elements of the Theory of Computation, Prentice-Hall, Englewood Cliffs, NJ, 1981.
11. F. Luccio, L. Pagli, The p-Shovelers Problem (Computing with Time-Varying Data), in Proceedings of the IEEE Symposium on Parallel and Distributed Processing, 1992, pp. 188-193.
12. F. Luccio, L. Pagli, Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-up, Theory of Computing Systems, 31 (1998), 5-26.
13. W. Paul, On-Line Simulation of k + 1 Tapes by k Tapes Requires Nonlinear Time, Information and Control, 53 (1982), 1-8.
14. A. L. Rosenberg, Real-Time Definable Languages, Journal of the ACM, 14 (1967), 645-662
15. J. R. Smith, The Design and Analysis of Parallel Algorithms, Oxford University Press, Oxford, 1993.