Short pages
From dankwiki
Showing below up to 100 results in range #1 to #100.
- (hist) Kolmogorov complexity [11 bytes]
- (hist) Ray Solomonoff [17 bytes]
- (hist) Spectrummaster [17 bytes]
- (hist) OpenCL [19 bytes]
- (hist) Mplayer [33 bytes]
- (hist) ATX [34 bytes]
- (hist) Blum's axioms [37 bytes]
- (hist) Rice's Theorem [37 bytes]
- (hist) Chaitin's Constant [37 bytes]
- (hist) Grover's Algorithm [37 bytes]
- (hist) Batcher's Odd-Even Merge [37 bytes]
- (hist) Wyllie's List Ranking [37 bytes]
- (hist) Duff's Device [37 bytes]
- (hist) Jensen's Device [37 bytes]
- (hist) Broder's Method [37 bytes]
- (hist) Mealy machine [37 bytes]
- (hist) Moore machine [37 bytes]
- (hist) Ford-Fulkerson Algorithm [37 bytes]
- (hist) Barendregt convention [37 bytes]
- (hist) Bernstein conditions [37 bytes]
- (hist) Carmack's Reverse [37 bytes]
- (hist) Bell-La Padula model [37 bytes]
- (hist) Biba Integrity Model [37 bytes]
- (hist) Kernighan-Lin algorithm [37 bytes]
- (hist) Hopfield net [37 bytes]
- (hist) Linde-Buzo-Gray algorithm [37 bytes]
- (hist) Lloyd's algorithm [37 bytes]
- (hist) Karnaugh map [37 bytes]
- (hist) Gustafson's Law [37 bytes]
- (hist) Quine-McLuskey algorithm [37 bytes]
- (hist) Petrick's method [37 bytes]
- (hist) Lin-Kernighan Heuristic [37 bytes]
- (hist) Nassi-Shneiderman diagram [37 bytes]
- (hist) Knuth Shuffle [37 bytes]
- (hist) Chaitin's algorithm [37 bytes]
- (hist) Floyd-Steinberg dithering [37 bytes]
- (hist) Huet's Zipper [37 bytes]
- (hist) Zimmermann-Sassaman key-signing protocol [37 bytes]
- (hist) Bloom filter [37 bytes]
- (hist) Mellor-Crummey and Scott lock [37 bytes]
- (hist) Craig, Landin and Hagersten lock [37 bytes]
- (hist) Guruswami-Sudan Algorithm [37 bytes]
- (hist) Turing Degree [37 bytes]
- (hist) Van Wijngaarden Grammars [38 bytes]
- (hist) Kruskal's Algorithm [38 bytes]
- (hist) Prim's Algorithm [38 bytes]
- (hist) Dijkstra's Algorithm [38 bytes]
- (hist) Flynn Taxonomy [38 bytes]
- (hist) Bresenham's Algorithm [38 bytes]
- (hist) Tomasulo's Algorithm [38 bytes]
- (hist) Gomory-Hu Tree [38 bytes]
- (hist) Dinic's Algorithm [38 bytes]
- (hist) Sethi-Ullman Algorithm [38 bytes]
- (hist) Bellman-Ford Algorithm [38 bytes]
- (hist) Wu-Manber Algorithm [38 bytes]
- (hist) Rabin-Karp Algorithm [38 bytes]
- (hist) Karp-Lipton Theorem [38 bytes]
- (hist) Cook-Levin Theorem [38 bytes]
- (hist) Yao's Principle [38 bytes]
- (hist) Blum's Speedup Theorem [38 bytes]
- (hist) Valiant-Vazirani Theorem [38 bytes]
- (hist) Barendregt-Geuvers-Klop Conjecture [38 bytes]
- (hist) Kleene–Rosser Paradox [38 bytes]
- (hist) Girard's Paradox [38 bytes]
- (hist) Liskov's Substitution Principle [38 bytes]
- (hist) Davis-Putnam Algorithm [38 bytes]
- (hist) Hennessy-Milner Logic [38 bytes]
- (hist) Coppersmith-Winograd Algorithm [38 bytes]
- (hist) Kosaraju's Algorithm [38 bytes]
- (hist) Tarjan's Algorithm [38 bytes]
- (hist) Greibach Normal Form [38 bytes]
- (hist) Backus-Naur Form [38 bytes]
- (hist) Chomsky Normal Form [38 bytes]
- (hist) Earley Parser [38 bytes]
- (hist) Boyer-Moore Algorithm [38 bytes]
- (hist) Knuth-Morris-Pratt Algorithm [38 bytes]
- (hist) Kuroda Normal Form [38 bytes]
- (hist) Dyck Language [38 bytes]
- (hist) Levin reduction [38 bytes]
- (hist) Karp reduction [38 bytes]
- (hist) Gosper's Hack [38 bytes]
- (hist) Von Neumann architecture [38 bytes]
- (hist) Glushkov Automata [38 bytes]
- (hist) Thompson Automata [38 bytes]
- (hist) Shor's Algorithm [38 bytes]
- (hist) Chomsky Hierarchy [38 bytes]
- (hist) Turing Machines [38 bytes]
- (hist) Borůvka's Algorithm [38 bytes]
- (hist) Fredkin gate [38 bytes]
- (hist) Gray codes [38 bytes]
- (hist) Hamming distance [38 bytes]
- (hist) Lempel-Ziv-Welch compression [38 bytes]
- (hist) Dekker's Algorithm [38 bytes]
- (hist) Peterson's Algorithm [38 bytes]
- (hist) Lamport's Bakery Algorithm [38 bytes]
- (hist) Commentz-Walter Algorithm [38 bytes]
- (hist) Ukkonen's Algorithm [38 bytes]
- (hist) Burrows-Wheeler Transform [38 bytes]
- (hist) Zhu-Takaoka Algorithm [38 bytes]
- (hist) Hirschberg's Algorithm [38 bytes]