Donald E. Knuth. The Art of Computer Programming, Volume 3 Sorting and Searching. Addison-Wesley, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Algorithms for Programmers - ideas and source code - Arndt (2004) (Correct)
....are given. These include plain sorting, sorting index arrays, pointer sorting; all optionally with a supplied comparison function. Massive literature exist about the topic so we will not go into the algorithmic details. A very readable introduction is [I2A] in depth information can be found in [DEK3]. Some algorithms on sorted arrays like binary searching and determination of unique elements are included. 9.1 Sorting There are a few straightforward algorithms for sorting that scale with (where n is the size of the array to be sorted) Here we use selection sort whose idea is to find the ....
D.E.Knuth: The Art of Computer Programming, 2.edition, Volume 3: Sorting and Searching, Addison-Wesley 1997
Biased Skip Lists - Bagchi, Buchsbaum, Goodrich (2004) (Correct)
....1.1 Related Prior Work The study of biased data structures for weighted data is a classic topic in algorithmics. Early work includes a dynamic programming method by Knuth [14] for constructing a static biased binary search tree for items weighted by their search frequencies (see also Knuth [15]) Subsequent work focuses primarily on methods for achieving search times within a constant factor of optimal while also being able to perform updates e#ciently. Most of the known methods for constructing dynamic biased data structures do so using search trees, and they di#er from one another ....
D. E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. AddisonWesley, Reading, MA, 1973.
On the Fast Construction of Spatial Hierarchies - For Ray Tracing (Correct)
No context found.
Donald E. Knuth. The Art of Computer Programming, Volume 3 Sorting and Searching. Addison-Wesley, 1998.
A Survey of Sequential and Systolic Algorithms for the Algebraic.. - Fink (1992) (4 citations) (Correct)
No context found.
D. E. Knuth. The art of computer programming. Volume 3: Sorting and Searching. Addison-Wesley, Reading, Mass., 1973, pages 258-- 265.
Compression of a Dictionary - Lansky, Zemlicka (2006) (Correct)
No context found.
Knuth, D.: The Art of Computer Programming, Volume 3: Sorting and Searching. Third edn. Addison-Wesley (1997)
Unknown - Symbolic Parallel Programming (Correct)
No context found.
Donald E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
Accountable Certificate Management using Undeniable - Attestations Ahto Buldas (2000) (16 citations) (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming. Volume 3: Sorting and Searching. Addison-Wesley, 2 edition, 1998.
Speeding up Pollard's Rho Method for Computing Discrete Logarithms - Teske (1998) (20 citations) (Correct)
No context found.
D. E. Knuth. The art of computer programming. Volume 3: Sorting and searching. Addison-Wesley, Reading, Massachusetts, 1973.
Biased Skip Lists - Bagchi, Buchsbaum, Goodrich (2004) (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. AddisonWesley, Reading, MA, 1973.
Integer Sorting in O(n √(log log n)) Expected Time and.. - Han, Thorup (2005) (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading, Massachusetts, second edition, 1998.
The Completeness Threshold for Bounded Model Checking - Clarke, Kroening.. (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison Wesley, 1973.
Sorting Methods for Small Arrays - Werneck, Ribeiro (2000) (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming, Volume 3 / Sorting and Searching. AddisonWesley, second edition, 1997.
Fun-Sort --- Or the Chaos of Unordered - Binary Search Therese (Correct)
No context found.
Knuth, D. E. The Art of Computer Programming, Volume 3: Sorting and Searching, 2 ed. Addison-Wesley, Reading, MA, 1998.
Unknown - Martin Klazar To (Correct)
No context found.
D. E. Knuth, The art of computer programming, Volume 3 Sorting and Searching , Addison-Wesley, Reading, 1973.
Fast and Accurate Bitstate Verification for SPIN - Dillinger, Manolios (2004) (1 citation) (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison Wesley Longman Publishing Co., Inc., 2nd edition, 1997.
An Implementation of a General-Purpose Parallel Sorting.. - Tridgell, Brent (1993) (14 citations) (Correct)
No context found.
D. E. Knuth, The Art of Computer Programming, Volume 3: Sorting and Searching (second edition), Addison-Wesley, Menlo Park, 1981, 112-113.
The Guessing Secrets problem: a probabilistic approach - Alberto Del Lungo (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. AddisonWesley, 1973.
Random Mapping Statistics - Philippe Flajolet Inria (1990) (37 citations) (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison-Wesley, 1973.
Page Replacement Algorithm for Buffer Management - In The Omega (Correct)
No context found.
Knuth D.E. Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition). Addison -Wesley, 1998. 780 p.
Indexing Text with Approximate q-grams - Navarro, Sutinen, Tarhio (2000) (8 citations) (Correct)
No context found.
D. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison-Wesley, 1973.
A Fast, Storage-Efficient Parallel Sorting Algorithm - Brent, Tridgell (1993) (Correct)
No context found.
D. E. Knuth, The Art of Computer Programming, Volume 3: Sorting and Searching (second edition), Addison-Wesley, Menlo Park, 1981.
Bounds Consistency Techniques for Long Linear Constraints - Harvey, Schimpf (Correct)
No context found.
Donald E. Knuth. The Art of Computer Programming. Volume 3: Sorting and Searching. Addison-Wesley, second edition, 1998.
On the Decomposition of Lattices - Hemkemeier, Vallentin (1998) (Correct)
No context found.
D. E. Knuth. The art of computer programming., volume 3: Sorting and searching. of Addison-Wesley Series in Computer Science and Information Processing. Addison-Wesley Publishing Company, 1974.
Enumeration of Resolvable 2-(10, 5, 16) and 3-(10, 5, 6) Designs - Morales, Velarde (Correct)
No context found.
D. Knuth, The Art of Computer Programming, Volume 3: Sorting and Searching, Addison-Wesley 1973, pp. 247, 251.
Ascending Runs of Sequences of Geometrically Distributed.. - Guy Louchard And (2003) (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. AddisonWesley, 1973.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC