Find link

The Art of Computer Programming not in Three-valued logic

language:

Find link is a tool written by Edward Betts.

searching for The Art of Computer Programming 108 found (368 total)

alternate case: the Art of Computer Programming

George Springer (mathematician) (569 words) [view diff] exact match in snippet view article

Daniel P. Friedman of the widely used textbook Scheme and the Art of Computer Programming. Scheme is one of the two main dialects of LISP. Three of the

Cascade merge sort (88 words) [view diff] exact match in snippet view article find links to article

than six. Bradley 1982, pp. 189–190 Knuth, Donald (1998). The Art of Computer Programming (2nd ed.). Reading, Mass.: Addison Wesley. p. 288. ISBN 0201896850

Threaded binary tree (1,201 words) [view diff] exact match in snippet view article find links to article

ISBN 978-0-201-16116-8. Knuth, D.E. (1968). Fundamental Algorithms. The Art of Computer Programming. Vol. 1 (1st ed.). Reading/MA: Addison Wesley. Morris, Joseph

Radix sort (2,604 words) [view diff] exact match in snippet view article find links to article

Kirkpatrick-Reisch sorting Prefix sum US 395781 and UK 327 Donald Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching, Third Edition. Addison-Wesley

Hash function (7,467 words) [view diff] exact match in snippet view article find links to article

Resource Center - Glossary. NIST. Knuth, Donald E. (1973). The Art of Computer Programming, Vol. 3, Sorting and Searching. Reading, MA., United States:

Divide-and-conquer algorithm (2,900 words) [view diff] exact match in snippet view article find links to article

Analysis of Algorithms (Addison Wesley, 2002). Donald E. Knuth, The Art of Computer Programming: Volume 3, Sorting and Searching, second edition (Addison-Wesley

2–3 tree (1,223 words) [view diff] exact match in snippet view article find links to article

B-tree (a,b)-tree Finger tree Knuth, Donald M (1998). "6.2.4". The Art of Computer Programming. Vol. 3 (2 ed.). Addison Wesley. ISBN 978-0-201-89685-5. The

Hash table (5,944 words) [view diff] exact match in snippet view article find links to article

from the original on August 7, 2009. Knuth, Donald (1998). The Art of Computer Programming. Vol. 3: Sorting and Searching (2nd ed.). Addison-Wesley. pp

Dragon curve (1,577 words) [view diff] case mismatch in snippet view article find links to article

194–195. Knuth, Donald (1998). "Positional Number Systems". The art of computer programming. Vol. 2 (3rd ed.). Boston: Addison-Wesley. p. 206. ISBN 0-201-89684-2

Breadth-first search (1,858 words) [view diff] exact match in snippet view article find links to article

ISBN 9781450357999. S2CID 44126609. Knuth, Donald E. (1997), The Art of Computer Programming Vol 1. 3rd ed., Boston: Addison-Wesley, ISBN 978-0-201-89683-1

Random access (540 words) [view diff] exact match in snippet view article find links to article

"Random and Sequential Data Access". D. E. KNUTH (1969). The Art of Computer Programming. Vol. 3. Sorting and Searching. Addison-Wesley. ISBN 978-0-201-03803-3

Fibonacci (2,263 words) [view diff] exact match in snippet view article find links to article

ISBN 978-0-253-33388-9. Virahanka Fibonacci. Knuth, Donald (2006). The Art of Computer Programming: Generating All Trees – History of Combinatorial Generation;

Carl Hindenburg (604 words) [view diff] exact match in snippet view article find links to article

Number Theory Before Computers". CMI Introductory Workshop. The Art of Computer Programming, Volume 4, Fascicle 4, p. 69, at Google Books "History of the

Tree (graph theory) (3,383 words) [view diff] exact match in snippet view article

EMS Press, 2001 [1994] Knuth, Donald E. (November 14, 1997), The Art of Computer Programming Volume 1: Fundamental Algorithms (3rd ed.), Addison-Wesley

Coroutine (5,477 words) [view diff] exact match in snippet view article find links to article

Knuth, Donald Ervin (1997). Fundamental Algorithms (PDF). The Art of Computer Programming. Vol. 1 (3rd ed.). Addison-Wesley. Section 1.4.5: History and

Connection game (1,587 words) [view diff] exact match in snippet view article find links to article

pp. 82–93. ISBN 978-0-521-75615-0. Knuth, Donald (2011). The Art of Computer Programming. Vol. 4A: Combinatorial Algorithms, Part 1. Addison-Wesley

Cyclic permutation (2,039 words) [view diff] exact match in snippet view article find links to article

Hall/CRC. p. 29. ISBN 978-1-58488-743-0. Knuth, Donald E. (2002). The Art of Computer Programming. Addison-Wesley. p. 35. Bogart, Kenneth P. (2000). Introductory

Universal Turing machine (2,957 words) [view diff] exact match in snippet view article find links to article

1145/321356.321362. S2CID 2347143. Knuth, Donald E. (1973). The Art of Computer Programming. Vol. 1: Fundamental Algorithms (second ed.). Addison-Wesley

Kruskal–Katona theorem (973 words) [view diff] exact match in snippet view article find links to article

Rota (1987, pp. 381–401). Knuth, Donald (2011), "7.2.1.3", The Art of Computer Programming, volume 4A: Combinatorial algorithms, part 1, p. 373. Kruskal

Middle-square method (845 words) [view diff] case mismatch in snippet view article find links to article

Government Printing Office, 1951): pp. 36–38. Donald E. Knuth, The art of computer programming, Vol. 2, Seminumerical algorithms, 2nd edn. (Reading, Mass

Associative array (2,775 words) [view diff] exact match in snippet view article find links to article

search tree called a red–black tree." Knuth, Donald (1998). The Art of Computer Programming. Vol. 3: Sorting and Searching (2nd ed.). Addison-Wesley. pp

John W. Nystrom (733 words) [view diff] exact match in snippet view article find links to article

Tonal System, with Sixteen to the Base. Lippincott. p. 105. The Art of Computer Programming section 4.1, Donald Knuth. A New Treatise on Elements of Mechanics

Variable (computer science) (2,812 words) [view diff] exact match in snippet view article

26–28, Bibcode:1986cptt.book.....A Knuth, Donald (1997). The Art of Computer Programming. Vol. 1 (3rd ed.). Reading, Massachusetts: Addison-Wesley.

Big O notation (8,726 words) [view diff] case mismatch in snippet view article find links to article

Archived 2008-05-13 at the Wayback Machine) Donald E. Knuth, The art of computer programming. Vol. 1. Fundamental algorithms, third edition, Addison Wesley

List of computing people (477 words) [view diff] exact match in snippet view article find links to article

Kernighan, Dennis Ritchie, C programming language Donald Knuth, The Art of Computer Programming, TeX Rasmus Lerdorf, creator of the PHP Scripting Language

Component (graph theory) (3,441 words) [view diff] exact match in snippet view article

97–98 Knuth, Donald E. (January 15, 2022), "Weak components", The Art of Computer Programming, Volume 4, Pre-Fascicle 12A: Components and Traversal (PDF)

Complex-base system (1,965 words) [view diff] case mismatch in snippet view article find links to article

S2CID 16513137. Knuth, Donald (1998). "Positional Number Systems". The art of computer programming. Vol. 2 (3rd ed.). Boston: Addison-Wesley. p. 205. ISBN 0-201-89684-2

Harmonic number (5,560 words) [view diff] exact match in snippet view article find links to article

procedure Block-stacking problem Knuth, Donald (1997). The Art of Computer Programming (3rd ed.). Addison-Wesley. pp. 75–79. ISBN 0-201-89683-4. John

Eduard Wirsing (804 words) [view diff] case mismatch in snippet view article find links to article

507–562. His results are presented, for example, in Donald Knuth The art of computer programming , Volume 2 (Seminumerical Algorithms), Addison-Wesley, 3rd

Y (game) (1,048 words) [view diff] exact match in snippet view article

Cambridge University Press. Page 87. Donald Knuth. 2011. The Art of Computer Programming, Volume 4A. Addison-Wesley. Page 547. Craige Schensted. "A

Modulo (3,351 words) [view diff] exact match in snippet view article find links to article

Glossary. Retrieved August 27, 2020. Knuth, Donald. E. (1972). The Art of Computer Programming. Addison-Wesley. Boute, Raymond T. (April 1992). "The Euclidean

Algorithm (6,769 words) [view diff] exact match in snippet view article find links to article

Knuth, Donald (1969). Volume 2/Seminumerical Algorithms, The Art of Computer Programming First Edition. Reading, Massachusetts: Addison–Wesley. Kosovsky

2Sum (785 words) [view diff] exact match in snippet view article find links to article

305–363. doi:10.1007/PL00009321. Knuth, Donald E. (1998). The Art of Computer Programming, Volume II: Seminumerical Algorithms (3rd ed.). Addison–Wesley

Key clustering (102 words) [view diff] exact match in snippet view article find links to article

particularly poor clustering behaviour. Knuth, Donald (1998). The Art of Computer Programming. Vol. 3: Sorting and Searching (2nd ed.). Addison-Wesley. pp

Linear separability (1,625 words) [view diff] case mismatch in snippet view article find links to article

Wiley-Interscience. ISBN 978-0-471-62530-8. Knuth, Donald Ervin (2011). The art of computer programming. Upper Saddle River: Addison-Wesley. pp. 75–79. ISBN 978-0-201-03804-0

Rader's FFT algorithm (1,095 words) [view diff] exact match in snippet view article find links to article

Convolution, Springer-Verlag, 2nd ed., 1997. Donald E. Knuth, The Art of Computer Programming, vol. 2: Seminumerical Algorithms, 3rd edition, section 4.5

Berlekamp–Rabin algorithm (2,006 words) [view diff] case mismatch in snippet view article find links to article

doi:10.1137/0209024. ISSN 0097-5397. Donald E Knuth (1998). The art of computer programming. Vol. 2 Vol. 2. Addison-Wesley. ISBN 978-0201896848. OCLC 900627019

Numerical digit (3,566 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-1-4020-4559-2. Knuth, Donald Ervin (1998). The art of computer programming. Reading, Mass.: Addison-Wesley Pub. Co. ISBN 0-201-03809-9

Bijective numeration (2,021 words) [view diff] exact match in snippet view article find links to article

doi:10.2307/3029479, JSTOR 3029479. Knuth, D. E. (1969), The Art of Computer Programming, Vol. 2: Seminumerical Algorithms (1st ed.), Addison-Wesley

Kolmogorov–Smirnov test (3,912 words) [view diff] exact match in snippet view article find links to article

S2CID 122547015. Eq. (15) in Section 3.3.1 of Knuth, D.E., The Art of Computer Programming, Volume 2 (Seminumerical Algorithms), 3rd Edition, Addison

CYK algorithm (2,189 words) [view diff] exact match in snippet view article find links to article

report). AFCRL. 65-758. Knuth, Donald E. (November 14, 1997). The Art of Computer Programming Volume 2: Seminumerical Algorithms (3rd ed.). Addison-Wesley

Randomness (4,316 words) [view diff] exact match in snippet view article find links to article

New York, London; Akademie-Verlag, Berlin, 1986. MR0854102. The Art of Computer Programming. Vol. 2: Seminumerical Algorithms, 3rd ed. by Donald E. Knuth

Petersen graph (2,993 words) [view diff] exact match in snippet view article find links to article

doi:10.1098/rstl.1886.0002, S2CID 108716533 Knuth, Donald E., The Art of Computer Programming; volume 4, pre-fascicle 0A. A draft of section 7: Introduction

Randomized algorithm (4,218 words) [view diff] case mismatch in snippet view article find links to article

ISBN 9781450377867. S2CID 6464612. Knuth, Donald E. (1998). The art of computer programming, volume 3: (2nd ed.) sorting and searching. USA: Addison Wesley

Addition-chain exponentiation (748 words) [view diff] exact match in snippet view article find links to article

théoretique et application 24, pp. 531-543 (1990). Donald E. Knuth, The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd edition, §4.6.3 (Addison-Wesley:

Petersen graph (2,993 words) [view diff] exact match in snippet view article find links to article

doi:10.1098/rstl.1886.0002, S2CID 108716533 Knuth, Donald E., The Art of Computer Programming; volume 4, pre-fascicle 0A. A draft of section 7: Introduction

Three-valued logic (3,292 words) [view diff] exact match in snippet view article find links to article

'unknown whether true or false'. Knuth, Donald E. (1981). The Art of Computer Programming Vol. 2. Reading, Mass.: Addison-Wesley Publishing Company.

Grid file (747 words) [view diff] exact match in snippet view article find links to article

ETH and K. C. Sevcik, 1984. Abstract, p. 1. Donald Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching, Second Edition. Addison-Wesley

Primitive root modulo n (2,508 words) [view diff] exact match in snippet view article find links to article

the OEIS) Knuth, Donald E. (1998). Seminumerical Algorithms. The Art of Computer Programming. Vol. 2 (3rd ed.). Addison–Wesley. section 4.5.4, page 391

Huffman coding (4,550 words) [view diff] exact match in snippet view article find links to article

"Algorithm G (Garsia–Wachs algorithm for optimum binary trees)", The Art of Computer Programming, Vol. 3: Sorting and Searching (2nd ed.), Addison–Wesley, pp

Geometric distribution (5,151 words) [view diff] exact match in snippet view article find links to article

1007/978-1-4613-8643-8. ISBN 978-1-4613-8645-2. Knuth, Donald Ervin (1997). The Art of Computer Programming. Vol. 2 (3rd ed.). Reading, Mass: Addison-Wesley. p. 136.

Edsger W. Dijkstra (5,171 words) [view diff] exact match in snippet view article find links to article

University of Texas at Austin. — (1971). A Short Introduction to the Art of Computer Programming. Eindhoven: Technische Hogeschool. OCLC 3474242. EWD316. —

Kyoto Prize in Advanced Technology (557 words) [view diff] exact match in snippet view article find links to article

Contribution to Various Fields of the Computer Science Ranging from the Art of Computer Programming to the Development of Epoch-Making Electronic Publishing Tools

Factorial (8,419 words) [view diff] exact match in snippet view article find links to article

Algorithm Design. Addison-Wesley. p. 55. Knuth, Donald E. (1998). The Art of Computer Programming, Volume 3: Sorting and Searching (2nd ed.). Addison-Wesley

Polynomial greatest common divisor (7,886 words) [view diff] exact match in snippet view article find links to article

The Art of Computer Programming II. Addison-Wesley. pp. 370–371. Knuth, Donald E. (1997). Seminumerical Algorithms. The Art of Computer Programming.

Function (computer programming) (6,531 words) [view diff] exact match in snippet view article

unit that appears within a module. Donald E. Knuth (1997). The Art of Computer Programming, Volume I: Fundamental Algorithms. Addison-Wesley. ISBN 0-201-89683-4

Assembly language (9,872 words) [view diff] exact match in snippet view article find links to article

Randall. "Chapter 8. MASM: Directives & Pseudo-Opcodes" (PDF). The Art of Computer Programming. Archived (PDF) from the original on 2020-03-24. Retrieved

Random-access stored-program machine (2,620 words) [view diff] exact match in snippet view article find links to article

Amsterdam, Netherlands. ISBN 0-7204-2103-9. Donald Knuth (1968), The Art of Computer Programming, Second Edition 1973, Addison-Wesley, Reading, Massachusetts

Lehmer code (2,097 words) [view diff] exact match in snippet view article find links to article

(4): 101–108, archived from the original on 2004-11-16 Knuth, Donald (1981), The Art of Computer Programming, vol. 3, Reading: Addison-Wesley, pp. 12–13

Melvin Conway (969 words) [view diff] exact match in snippet view article find links to article

Knuth, Donald Ervin (1997). Fundamental Algorithms (PDF). The Art of Computer Programming. Vol. 1 (3rd ed.). Addison-Wesley. Section 1.4.5: History and

Turing machine (9,420 words) [view diff] case mismatch in snippet view article find links to article

Knuth, Donald E. (1973). Volume 1/Fundamental Algorithms: The Art of computer Programming (2nd ed.). Reading, Mass.: Addison–Wesley Publishing Company

Boolos, John P. Burgess (1970) Cook (1970) Donald Knuth (1968), The Art of Computer Programming, Second Edition 1973, Addison-Wesley, Reading, Massachusetts

Double factorial (4,286 words) [view diff] case mismatch in snippet view article find links to article

1093/biomet/86.2.279. MR 1705359. Knuth, Donald Ervin (2023). The art of computer programming. volume 4B part 2: Combinatorial algorithms. Boston Munich:

Horner's method (5,170 words) [view diff] exact match in snippet view article find links to article

1929; Dover reprint, 2 vols, 1959. Knuth, Donald (1997). The Art of Computer Programming. Vol. 2: Seminumerical Algorithms (3rd ed.). Addison-Wesley

Residue number system (1,596 words) [view diff] exact match in snippet view article find links to article

on 2005-02-17. Retrieved 2023-08-24. Knuth, Donald Ervin. The Art of Computer Programming. Addison Wesley. Harvey, David (2010). "A multimodular algorithm

Linked list (7,792 words) [view diff] exact match in snippet view article find links to article

typically on the order of 10 bytes. Knuth, Donald (1998). The Art of Computer Programming. Vol. 3: Sorting and Searching (2nd ed.). Addison-Wesley. p

Quadruple-precision floating-point format (3,080 words) [view diff] exact match in snippet view article find links to article

Discrete & Computational Geometry 18: 305–363, 1997. Knuth, D. E. The Art of Computer Programming (2nd ed.). chapter 4.2.3. problem 9. Robert Munafo. F107 and

Balanced ternary (4,106 words) [view diff] case mismatch in snippet view article find links to article

Archived from the original on 2009-09-19. Knuth, Donald (1997). The art of Computer Programming. Vol. 2. Addison-Wesley. pp. 195–213. ISBN 0-201-89684-2. Douglas

Al-Khwarizmi (7,520 words) [view diff] exact match in snippet view article find links to article

(1958), Chapter VI:19. Knuth, Donald (1997). "Basic Concepts". The Art of Computer Programming. Vol. 1 (3rd ed.). Addison-Wesley. p. 1. ISBN 978-0-201-89683-1

Byte Sieve (1,554 words) [view diff] exact match in snippet view article find links to article

through the Sieve". Byte. pp. 283–325. Knuth, Donald (1969). The Art of Computer Programming Volume 2: Seminumerical Algorithms. Addison-Wesley. ISBN 978-0-201-89684-8

Topswops (1,483 words) [view diff] case mismatch in snippet view article find links to article

pp. 76–82. ISBN 978-0716719250. Knuth, Donald E. (2002). The Art of computer programming: Volume 4, Fascicle 2A: Generating all n-tuples. Addison-Wesley

Quicksort (9,949 words) [view diff] exact match in snippet view article find links to article

1002/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-#. Donald Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching, Third Edition. Addison-Wesley

Aztec diamond (1,766 words) [view diff] exact match in snippet view article find links to article

(2019), "Pre-Fascicle 5c (section 7.2.2.1, Dancing Links)", The Art of Computer Programming, vol. 4, p. 93 Majumdar, Diptapriyo. "Advance Graph Algorithms:

Gamma function (13,511 words) [view diff] exact match in snippet view article find links to article

ISBN 978-3-030-12558-5. Extract of page 205 Knuth, D. E. (1997). The Art of Computer Programming. Vol. 1 (Fundamental Algorithms). Addison-Wesley. ISBN 0-201-89683-4

Positional notation (7,490 words) [view diff] case mismatch in snippet view article find links to article

1007/s10781-007-9025-5. S2CID 52885600. Knuth, Donald (1997). The art of Computer Programming. Vol. 2. Addison-Wesley. pp. 195–213. ISBN 0-201-89684-2. Ifrah

Juan Caramuel y Lobkowitz (3,027 words) [view diff] exact match in snippet view article find links to article

1515/dmvm-2008-0009. S2CID 179000299. Knuth, Donald E. (2014). The Art of Computer Programming II: Seminumerical Algorithms. Pearson Education. p. 183. ISBN 9780321635761

Strassen algorithm (3,526 words) [view diff] exact match in snippet view article find links to article

matrix multiplication, pp. 735–741. Knuth, Donald (1997). The Art of Computer Programming, Seminumerical Algorithms. Vol. II (3rd ed.). Addison-Wesley

Juan Caramuel y Lobkowitz (3,027 words) [view diff] exact match in snippet view article find links to article

1515/dmvm-2008-0009. S2CID 179000299. Knuth, Donald E. (2014). The Art of Computer Programming II: Seminumerical Algorithms. Pearson Education. p. 183. ISBN 9780321635761

Binomial coefficient (10,733 words) [view diff] exact match in snippet view article find links to article

SIAM. p. 25. ISBN 0-89871-420-6. Knuth, Donald E. (1997). The Art of Computer Programming, Volume 1: Fundamental Algorithms (Third ed.). Addison-Wesley

Graph coloring (8,128 words) [view diff] exact match in snippet view article find links to article

ISSN 0304-3975 Knuth, Donald Ervin (1997), Seminumerical Algorithms, The Art of Computer Programming, vol. 2 (3rd ed.), Reading/MA: Addison-Wesley, ISBN 0-201-89684-2

Church–Turing thesis (6,786 words) [view diff] exact match in snippet view article find links to article

Metamathematics. North-Holland. OCLC 523942. Knuth, Donald (1973). The Art of Computer Programming. Vol. 1/Fundamental Algorithms (2nd ed.). Addison–Wesley. Kugel

Cycle detection (4,566 words) [view diff] exact match in snippet view article find links to article

ISBN 978-1-420-07003-3. Joux (2009, p. 224). Knuth, Donald E. (1969), The Art of Computer Programming, vol. II: Seminumerical Algorithms, Addison-Wesley, p. 7, exercises

Weak component (1,608 words) [view diff] exact match in snippet view article find links to article

MR 0323577 Knuth, Donald E. (15 January 2022), "Weak components", The Art of Computer Programming, Volume 4, Pre-Fascicle 12A: Components and Traversal (PDF)

Spanish philosophy (8,359 words) [view diff] exact match in snippet view article find links to article

379. ISBN 9781136353611. Cf. Knuth, Donald Ervin (2006). The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees: History of Combinatorial

Ring (mathematics) (13,715 words) [view diff] exact match in snippet view article

2307/1969205, ISSN 0003-486X, JSTOR 1969205 Knuth, D. E. (1998). The Art of Computer Programming. Vol. 2: Seminumerical Algorithms (3rd ed.). Addison–Wesley

John von Neumann (23,686 words) [view diff] exact match in snippet view article find links to article

p. 73. Dyson 2012, pp. 267–268, 287. Knuth, Donald (1998). The Art of Computer Programming: Volume 3 Sorting and Searching. Boston: Addison-Wesley. p

Quotient filter (2,664 words) [view diff] exact match in snippet view article find links to article

(SIGMOD '17). doi:10.1145/3035918.3035963. Knuth, Donald (1973). The Art of Computer Programming:Searching and Sorting, volume 3. Section 6.4, exercise 13:

Random-access machine (7,515 words) [view diff] exact match in snippet view article find links to article

Amsterdam, Netherlands. ISBN 0-7204-2103-9. Donald Knuth (1968), The Art of Computer Programming, Second Edition 1973, Addison-Wesley, Reading, Massachusetts

Binary prefix (8,597 words) [view diff] exact match in snippet view article find links to article

Library for the HP48S/SX. 1.20 (1 ed.). Retrieved 2015-08-15. The Art of Computer Programming Archived 2016-03-05 at the Wayback Machine Volume 1, Donald

Universal hashing (4,885 words) [view diff] exact match in snippet view article find links to article

oracle.com. Retrieved 2015-06-10. Knuth, Donald Ervin (1998). The Art of Computer Programming, Vol. III: Sorting and Searching (3rd ed.). Reading, Mass;

Primary clustering (1,272 words) [view diff] case mismatch in snippet view article find links to article

effects of primary clustering. Knuth, Donald Ervin (1997). The art of computer programming, volume 3, sorting and searching. Reading, Mass.: Addison-Wesley

Mutually orthogonal Latin squares (4,831 words) [view diff] exact match in snippet view article find links to article

p. 155 Dénes & Keedwell 1974, p. 156 Knuth, Donald (2011), The Art of Computer Programming, vol. 4A: Combinatorial Algorithms Part 1, Addison-Wesley,

Stochastic simulation (3,715 words) [view diff] exact match in snippet view article find links to article

http://bactra.org/notebooks/monte-carlo.html Donald E. Knuth, The Art of Computer Programming, Volume 2: Seminumerical Algorithms - chapitre 3 : Random Numbers

Chebyshev's inequality (7,525 words) [view diff] exact match in snippet view article find links to article

Stack Exchange. Retrieved 2023-12-11. Knuth, Donald (1997). The Art of Computer Programming: Fundamental Algorithms, Volume 1 (3rd ed.). Reading, Massachusetts:

Zero-suppressed decision diagram (3,658 words) [view diff] exact match in snippet view article find links to article

Decision Diagrams". CiteSeerX 10.1.1.67.8986. Knuth, Donald E. The Art of Computer Programming, Vol 4. 22 Dec. 2008. Lynn, Ben. "ZDDs." ZDDs - Introduction

De Bruijn sequence (3,550 words) [view diff] exact match in snippet view article find links to article

p. 59. ISBN 978-1-44715079-4. Knuth, Donald Ervin (2006). The Art of Computer Programming, Fascicle 4: Generating All Trees – History of Combinatorial

Timeline of scientific discoveries (10,600 words) [view diff] exact match in snippet view article find links to article

229–44, doi:10.1016/0315-0860(85)90021-7 Knuth, Donald (1968), The Art of Computer Programming, vol. 1, Addison Wesley, p. 100, ISBN 978-81-7758-754-8, Before

No-three-in-line problem (3,842 words) [view diff] exact match in snippet view article find links to article

MR 0645860. Knuth, Donald E. (2008). "Answer to exercise 242". The Art of Computer Programming, Fascicle 1b: A Draft of Section 7.1.4: Binary Decision Diagrams

Yates analysis (2,486 words) [view diff] exact match in snippet view article find links to article

ISBN 0-471-09315-7. Knuth, Donald Ervin (1997), Seminumerical Algorithms, The Art of Computer Programming, vol. 2 (3rd ed.), Addison-Wesley. Here: sect. 4.3.4. Koivisto

Counter-machine model (3,298 words) [view diff] exact match in snippet view article find links to article

the hierarchies for Turing machines. Donald Knuth (1968), The Art of Computer Programming, Second Edition 1973, Addison-Wesley, Reading, Massachusetts

Named set theory (1,919 words) [view diff] exact match in snippet view article find links to article

edition: http://www.base.com/gordoni/web/naming.html) Knuth, D. The Art of Computer Programming, v.2: Seminumerical Algorithms, Addison-Wesley, Reading, Mass

Sebastián Izquierdo (1,131 words) [view diff] exact match in snippet view article find links to article

ISBN 9781847144614. Rossi 1960, p. 196. Cf. Knuth, Donald Ervin (2006). The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees: History of Combinatorial

Control table (6,465 words) [view diff] exact match in snippet view article find links to article

branching to the appropriate routine is negligible — Donald Knuth, The Art of Computer Programming Volume 1, 1997, page 202 The space required to represent a

Timeline of binary prefixes (12,765 words) [view diff] case mismatch in snippet view article find links to article

Amendment 2, which has a publication date of 1999-01, ... "The Art Of Computer Programming, Fascicle 1 - MMIX". Archived from the original on March 5

Perceptrons (book) (5,190 words) [view diff] case mismatch in snippet view article

Wiley-Interscience. ISBN 978-0-471-62530-8. Knuth, Donald Ervin (2011). The art of computer programming, Volume 4A. Upper Saddle River: Addison-Wesley. pp. 75–79.

Incompressibility method (3,534 words) [view diff] exact match in snippet view article find links to article

1016/0890-5401(88)90003-X D. E. Knuth, Sorting and Searching (Vol. 3 The Art of Computer Programming), 2nd Ed. Addison-Wesley, 1998, pp 83–95. ISBN 0201896850 S

Algorithm characterizations (8,991 words) [view diff] exact match in snippet view article find links to article

mathematical "foundations". Knuth, Donald E.. (1973) [1968]. The Art of Computer Programming Second Edition, Volume 1/Fundamental Algorithms (2nd ed.).

Strict Fibonacci heap (6,087 words) [view diff] exact match in snippet view article find links to article

1017/S095679680000201X. ISSN 0956-7968. Knuth, Donald E. (1998-04-24). The Art of Computer Programming: Sorting and Searching, Volume 3. Addison-Wesley Professional