Data Structures and Algorithms
First published: 27 December 1999
Abstract
The sections in this article are
- 1 Data Structures
- 2 Algorithms for Some Basic Problems
- 3 Sorting
- 4 Selection
- 5 Randomized Algorithms
- 6 Parallel Computing
- 7 Bibliographic Notes
- 8 Acknowledgments
Bibliography
- 1 E. Horowitz S. Sahni D. Mehta Fundamentals of Data Structures in C++, San Francisco: Freeman, 1995.
- 2 J. H. Kingston Algorithms and Data Structures, Reading, MA: Addison-Wesley, 1990.
- 3 M. A. Weiss Data Structures and Algorithm Analysis, Menlo Park, CA: Benjamin/Cummings, 1992.
- 4 D. Wood Data Structures, Algorithms, and Performance, Reading, MA: Addison-Wesley, 1993.
- 5 T. H. Cormen C. E. Leiserson R. L. Rivest Introduction to Algorithms, Cambridge, MA: MIT Press, 1990.
- 6 A. V. Aho J. E. Hopcroft J. D. Ullman The Design and Analysis of Computer Algorithms, Reading, MA: Addison-Wesley, 1974.
- 7 E. Horowitz S. Sahni S. Rajasekaran Computer Algorithms, San Francisco: Freeman, 1998.
- 8 E. Horowitz S. Sahni S. Rajasekaran Computer Algorithms/C++, San Francisco: Freeman, 1997.
- 9 R. Sedgewick Algorithms, Reading, MA: Addison-Wesley, 1988.
- 10 U. Manber Introduction to Algorithms: A Creative Approach, Reading, MA: Addison-Wesley, 1989.
- 11 S. Baase Computer Algorithms, Reading, MA: Addison-Wesley, 1988.
- 12 G. Brassard P. Bratley Fundamentals of Algorithms, Upper Saddle River, NJ: Prentice-Hall, 1996.
- 13 B. M. E. Moret H. D. Shapiro Algorithms from P to NP, Menlo Park, CA: Benjamin/Cummings, 1991.
- 14 G. J. E. Rawlins Compared to What? An Introduction to the Analysis of Algorithms, San Francisco: Freeman, 1992.
- 15 J. D. Smith Design and Analysis of Algorithms, PWS-KENT, 1989.
- 16 J. Nievergelt K. H. Hinrichs Algorithms and Data Structures, Englewood Cliffs, NJ: Prentice-Hall, 1993.
- 17 K. A. Berman J. L. Paul Fundamentals of Sequential and Parallel Algorithms, Boston: PWS, 1997.
- 18 M. O. Rabin Probabilistic Algorithms, in J. F. Traub (ed.), Algorithms and Complexity, New York: Academic Press, 1976, pp. 21–36.
- 19
R. Solovay
V. Strassen
A Fast Monte-Carlo Test for Primality,
SIAM J. Comput.,
6:
84–85,
1977.
10.1137/0206006 Google Scholar
- 20 W. D. Frazer A. C. McKellar Samplesort: A Sampling Approach to Minimal Storage Tree Sorting, J. ACM, 17 (3): 496–502, 1977.
- 21 J. Já Já Parallel Algorithms: Design and Analysis, Reading, MA: Addison-Wesley, 1992.
- 22 F. T. Leighton Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes, San Mateo, CA: Morgan-Kaufmann, 1992.
- 23 R. Motwani P. Raghavan Randomized Algorithms, Cambridge, UK: Cambridge Univ. Press, 1995.
- 24 K. Mulmuley Computational Geometry: An Introduction Through Randomized Algorithms, Englewood Cliffs, NJ: Prentice-Hall, 1994.
- 25 J. H. Reif (ed.) Synthesis of Parallel Algorithms, San Mateo, CA: Morgan-Kaufmann, 1992.
- 26
S. Rajasekaran
Sorting and Selection on Interconnection Networks,
DIMACS Series Discrete Math. Theoretical Comput. Sci.,
21:
275–296,
1995.
10.1090/dimacs/021/19 Google Scholar
- 27 D. E. Knuth The Art of Computer Programming, vol. 3, Sorting and Searching, Reading, MA: Addison-Wesley, 1973.
Wiley Encyclopedia of Electrical and Electronics Engineering
Browse other articles of this reference work:
