Short pages

From dankwiki

Showing below up to 50 results in range #1 to #50.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. (hist) ‎Ray Solomonoff ‎[17 bytes]
  2. (hist) ‎OpenCL ‎[19 bytes]
  3. (hist) ‎Mplayer ‎[33 bytes]
  4. (hist) ‎Blum's axioms ‎[37 bytes]
  5. (hist) ‎Rice's Theorem ‎[37 bytes]
  6. (hist) ‎Chaitin's Constant ‎[37 bytes]
  7. (hist) ‎Kolmogorov complexity ‎[37 bytes]
  8. (hist) ‎Jefferson's Time Warp ‎[37 bytes]
  9. (hist) ‎Grover's Algorithm ‎[37 bytes]
  10. (hist) ‎Batcher's Odd-Even Merge ‎[37 bytes]
  11. (hist) ‎Wyllie's List Ranking ‎[37 bytes]
  12. (hist) ‎Duff's Device ‎[37 bytes]
  13. (hist) ‎Jensen's Device ‎[37 bytes]
  14. (hist) ‎Broder's Method ‎[37 bytes]
  15. (hist) ‎Mealy machine ‎[37 bytes]
  16. (hist) ‎Moore machine ‎[37 bytes]
  17. (hist) ‎Ford-Fulkerson Algorithm ‎[37 bytes]
  18. (hist) ‎De Bruijn presentation ‎[37 bytes]
  19. (hist) ‎Barendregt convention ‎[37 bytes]
  20. (hist) ‎Bernstein conditions ‎[37 bytes]
  21. (hist) ‎Carmack's Reverse ‎[37 bytes]
  22. (hist) ‎Bell-La Padula model ‎[37 bytes]
  23. (hist) ‎Biba Integrity Model ‎[37 bytes]
  24. (hist) ‎Graham-Denning Model ‎[37 bytes]
  25. (hist) ‎Kernighan-Lin algorithm ‎[37 bytes]
  26. (hist) ‎Hopfield net ‎[37 bytes]
  27. (hist) ‎Linde-Buzo-Gray algorithm ‎[37 bytes]
  28. (hist) ‎Lloyd's algorithm ‎[37 bytes]
  29. (hist) ‎Karnaugh map ‎[37 bytes]
  30. (hist) ‎Gustafson's Law ‎[37 bytes]
  31. (hist) ‎Quine-McLuskey algorithm ‎[37 bytes]
  32. (hist) ‎Petrick's method ‎[37 bytes]
  33. (hist) ‎Lin-Kernighan Heuristic ‎[37 bytes]
  34. (hist) ‎Nassi-Shneiderman diagram ‎[37 bytes]
  35. (hist) ‎Steinhaus-Johnson-Trotter algorithm ‎[37 bytes]
  36. (hist) ‎Knuth Shuffle ‎[37 bytes]
  37. (hist) ‎Chaitin's algorithm ‎[37 bytes]
  38. (hist) ‎Floyd-Steinberg dithering ‎[37 bytes]
  39. (hist) ‎Huet's Zipper ‎[37 bytes]
  40. (hist) ‎Zimmermann-Sassaman key-signing protocol ‎[37 bytes]
  41. (hist) ‎Bloom filter ‎[37 bytes]
  42. (hist) ‎Mellor-Crummey and Scott lock ‎[37 bytes]
  43. (hist) ‎Craig, Landin and Hagersten lock ‎[37 bytes]
  44. (hist) ‎Popek-Goldberg virtualization requirements ‎[37 bytes]
  45. (hist) ‎Guruswami-Sudan Algorithm ‎[37 bytes]
  46. (hist) ‎Turing Degree ‎[37 bytes]
  47. (hist) ‎Van Wijngaarden Grammars ‎[38 bytes]
  48. (hist) ‎Kruskal's Algorithm ‎[38 bytes]
  49. (hist) ‎Prim's Algorithm ‎[38 bytes]
  50. (hist) ‎Dijkstra's Algorithm ‎[38 bytes]

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)