D. E. Knuth. The Art of Computer Programming 3: Sorting and Searching. Addison-Wesley, 1973. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Unknown - (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming 3: Sorting and Searching. Addison-Wesley, 1973.
Comparing WCET and Resource Demands of Trigonometric - Functions Implemented As (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming - Sorting and Searching, volume 3. Addison Wesly, New York, USA, 2nd edition, 1998. ISBN 0-201-89685-0.
The VLDB Journal manuscript No. - Will Be Inserted (Correct)
No context found.
D.E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3, chapter 6.3. Addison Wesley, second edition, 1998.
Efficient URL Caching for World Wide Web Crawling - Broder, Najork, Wiener (2003) (1 citation) (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming: Sorting and Searching. Addison-Wesley, 1973.
Copyright C - Society Of Photo-Optical (2001) (Correct)
No context found.
D. E. Knuth, The Art of Computer Programming: Sorting and Searching, vol. 3, Addison-Wesley, Reading, MA, 1973.
R-Trees Have Grown Everywhere - Manolopoulos, Nanopoulos.. (Correct)
No context found.
D. Knuth: "The Art of Computer Programming: Sorting and Searching", Vol.3, AddisonWesley, 1967.
A Game Tree Strategy for Automated Negotiation - Karp, Chen, Wu, Zhang (2003) (Correct)
No context found.
D. Knuth, "The Art of Computer Programming: Sorting and Searching", pg. 519, Addison-Wesley, 1998
Super Scalar Sample Sort - Sanders, Winkel (2004) (1 citation) (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming --- Sorting and Searching, volume
Engineering a Sorted List Data Structure for 32 Bit Keys - Dementiev, Kettner.. (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming | Sorting and Searching, volume 3. Addison Wesley, 2nd edition, 1998.
HyLog: A High Performance Approach to Managing Disk Layout - Wang, Zhao, Bunt (2004) (1 citation) (Correct)
No context found.
D. Knuth. The Art of Computer Programming -- Sorting and Searching, volume 3. AddisonWesley, second edition, 1998.
Efficient Filtering of XML Documents with XPath.. - Chan, Felber.. (2001) (19 citations) (Correct)
No context found.
D.E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3, chapter 6.3. Addison Wesley, second edition, 1998.
The Path-Indexing Method for Indexing Terms - Mark Stickel Artificial (1989) (12 citations) (Correct)
No context found.
Knuth, D.E. The Art of Computer Programming: Sorting and Searching. AddisonWesley, Reading, Massachusetts, 1973.
Unsupervised Learning of Word Segmentation Rules with.. - Kazakov, Manandhar (2000) (4 citations) (Correct)
No context found.
D. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, 1973.
Unknown - (2003) (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming: Sorting and Searching, Vol.3. Addison Wesley, Reading, Massachusetts, 1973.
Compact Grid Layouts of Multi-Level Networks - Muthukrishnan, Paterson.. (Correct)
No context found.
D. Knuth. The Art of Computer Programming 3: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
Algorithm Selection for Sorting and Probabilistic Inference: A.. - Guo (2003) (Correct)
No context found.
D. E. Knuth. The art of computer programming: Sorting and Searching, volume 3. Addison-Wesley, 1981. 226
Copyright C - Society Of Photo-Optical (2001) (Correct)
No context found.
D. E. Knuth, The Art of Computer Programming: Sorting and Searching, vol. 3, Addison-Wesley, Reading, MA, 1973.
Modeling Multimedia Data Objects Allocation Problem for.. - Allahverdi, Al-Anzi (2000) (Correct)
No context found.
D.E. Knuth, The Art of Computer Programming: Sorting and searching, AddisonWesley, Reading, MA, 1973. 4
JuruXML -- an XML retrieval system at INEX'02 - Yosi Mass Matan (1 citation) (Correct)
No context found.
Donald E Knuth, The art of computer programming: sorting and searching (vol 3), Addison Wesley, 1973.
SNMP GetPrev: An Efficient Way to Browse Large MIB Tables - Breitgand, Raz, Shavitt (2002) (Correct)
No context found.
D. E. Knuth, The Art of Computer Programming: Sorting and Searching, 2nd ed. Reading, MA: Addison-Wesley, 1998, vol. 3.
Engineering a Sorted List Data Structure for 32 Bit Keys - Dementiev, Kettner.. (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming | Sorting and Searching, volume 3. Addison Wesley, 2nd edition, 1998.
Engineering a Sorted List Data Structure for 32 Bit Keys - Dementiev, Kettner.. (Correct)
No context found.
D. E. Knuth. The Art of Computer Programming --- Sorting and Searching, volume 3. Addison Wesley, 2nd edition, 1998.
A Bayesian Approach for Automatic Algorithm Selection - Guo (Correct)
No context found.
D. E. Knuth. The art of computer programming: Sorting and Searching, volume 3. Addison-Wesley, 1981.
Cost-Effective Flow Table Designs for High-Speed Routers.. - Xu, Singhal (2002) (Correct)
No context found.
D. Knuth, The Art of Computer Programming: Sorting and Searching, Addison-Wesley, Reading, Massachusetts, 1975.
Efficient filtering of XML documents with XPath.. - Chan, Felber.. (2002) (19 citations) (Correct)
No context found.
D.E. Knuth (1998) The art of computer programming: sorting and searching, vol. 3, 2nd edn. Addison-Wesley, Reading, Mass., USA
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