Computer science eponyms: Difference between revisions
No edit summary |
DiVincenzo criteria, Loss-DiVincenzo machine, Ousterhout dichotomy |
||
| Line 109: | Line 109: | ||
* Dijkstra's Algorithm | * Dijkstra's Algorithm | ||
* Dinic's Algorithm | * Dinic's Algorithm | ||
* '''DiVincenzo's criteria''' specify conditions necessary for a quantum computer | |||
* Dolev's Algorithm | * Dolev's Algorithm | ||
* Doo-Sabin subdivision surface | * Doo-Sabin subdivision surface | ||
| Line 238: | Line 239: | ||
* Liskov's Substitution Principle | * Liskov's Substitution Principle | ||
* Lloyd's algorithm | * Lloyd's algorithm | ||
* '''Loss-DiVincenzo machines''' are quantum computers based off electron spin as confined to quantum dots | |||
* Luby's algorithm | * Luby's algorithm | ||
* Luhn Algorithm | * Luhn Algorithm | ||
| Line 269: | Line 271: | ||
* Nisan's Generator | * Nisan's Generator | ||
* '''Ousterhout's dichotomy/fallacy''' a taxonomy of ''systems'' vs ''scripting'' languages | |||
* Otway-Rees Protocol | * Otway-Rees Protocol | ||