<--- Back to Details
First PageDocument Content
Computer science / TeX / The Art of Computer Programming / Algorithm / Next Magazine / Knuth–Bendix completion algorithm / Metafont / Concrete Mathematics / Knuth reward check / Computing / Donald Knuth / Mathematics
Date: 2002-02-22 10:58:44
Computer science
TeX
The Art of Computer Programming
Algorithm
Next Magazine
Knuth–Bendix completion algorithm
Metafont
Concrete Mathematics
Knuth reward check
Computing
Donald Knuth
Mathematics

Add to Reading List

Source URL: www.ams.org

Download Document from Source Website

File Size: 369,48 KB

Share Document on Facebook

Similar Documents

The Arpeggigon: A Functional Reactive Musical Automaton Demo, FARM 2017, 9 Sept., Oxford Henrik Nilsson Joint work with Guerric Chupin and Jin Zhan Functional Programming Laboratory, School of Computer Science

DocID: 1tGaw - View Document

The Art of Computer Programming, Vol. 4 Fascicle 6

DocID: 1t9cN - View Document

Mathematics / Theoretical computer science / Mathematical logic / Predicate logic / Constraint programming / Electronic design automation / Logic in computer science / Satisfiability modulo theories / Z3 / First-order logic / Language Integrated Query / Computer program

Unleashing the Verification Genie in the Cloud Nikolaj Bjørner Microsoft Research, One Microsoft Way, Redmond, WA, 98074, USA Abstract Z3 is a state-of-the-art SMT (Satisfiability Modulo Theories)

DocID: 1pT28 - View Document

Software engineering / Software / Computer programming / Perl / Cross-platform software / High-level programming languages / Scripting languages / CPAN / Adam Kennedy

About Shawn H Corey Working as a contractor has given Shawn years of experience in various types of programming. His experience enables him to develop state-of-the-art programs that are both comprehensive and functional.

DocID: 1pOgx - View Document

Sorting algorithms / Analysis of algorithms / External sorting / Merge sort / Algorithm / Randomized algorithm / Samplesort / Selection algorithm / In-place algorithm / Time complexity / The Art of Computer Programming / Best /  worst and average case

Scalable Distributed-Memory External Sorting Mirko Rahn, Peter Sanders, Johannes Singler4 Karlsruhe Institute of Technology Postfach 6980, 76128 Karlsruhe, Germany arXiv:0910.2582v1 [cs.DS] 14 Oct 2009

DocID: 1pGn4 - View Document