Wanted pages
List of non-existing pages with the most links to them, excluding pages which only have redirects linking to them. For a list of non-existent pages that have redirects linking to them, see Special:BrokenRedirects.
Showing below up to 100 results in range #1 to #100.
View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)
- Binary indexed tree (7 links)
- Suffix tree (7 links)
- Fibonacci heap (7 links)
- Priority queue (6 links)
- Trie (6 links)
- Hash table (6 links)
- Heapsort (5 links)
- Balanced binary search tree (5 links)
- Binary search tree (4 links)
- Strongly connected component (4 links)
- Transitive closure (4 links)
- Quicksort (4 links)
- Optimization problem (4 links)
- Gabow's algorithm (4 links)
- Suffix array (4 links)
- Kosaraju's algorithm (4 links)
- Imperative programming language (3 links)
- Skip list (3 links)
- Bridge (2 links)
- Dinic's algorithm (2 links)
- Minimum spanning arborescence (2 links)
- Connected component (2 links)
- Functional programming language (2 links)
- Minimum diameter spanning tree (2 links)
- Link/cut tree (2 links)
- Insertion sort (2 links)
- Matrix multiplication (2 links)
- Analysis of algorithms (2 links)
- Linear time (2 links)
- ACSL (2 links)
- Finding cut vertices and edges (2 links)
- Longest common prefix array (2 links)
- Hash function (2 links)
- Mergesort (2 links)
- Transitive reduction (2 links)
- Directed graph (2 links)
- Lambda calculus (2 links)
- Iterator (2 links)
- Associative array (2 links)
- Biconnected component (2 links)
- Bubble sort (2 links)
- Self-balancing binary search tree (2 links)
- Treap (1 link)
- Farthest pair of points (1 link)
- Introsort (1 link)
- Dynamic set (1 link)
- Output-only problem (1 link)
- Generalized suffix array (1 link)
- Symbol table (1 link)
- Welzl's algorithm (1 link)
- Boyer–Moore algorithm (1 link)
- Kd-tree (1 link)
- Undirected graph (1 link)
- Template:Purchasing (1 link)
- Ordered set (1 link)
- Haskell (1 link)
- Data structures (1 link)
- Staircase (1 link)
- 2-3-4 tree (1 link)
- Lengauer–Tarjan algorithm (1 link)
- Template:Appetite (1 link)
- C preprocessor (1 link)
- Empty sum (1 link)
- Link-cut tree (1 link)
- Counting distinct substrings (1 link)
- Articulation point (1 link)
- Line segment intersection problem (1 link)
- Karatsuba multiplication (1 link)
- Regex (1 link)
- Huffman coding (1 link)
- Generalized suffix tree (1 link)
- Talk:Partial order (1 link)
- Dynamic trees (1 link)
- Finite automaton (1 link)
- Vertex (1 link)
- PEGWiki talk:Notational conventions (1 link)
- Randomization (1 link)
- High-level programming language (1 link)
- Van Emde Boas tree (1 link)
- Infix (1 link)
- 2-3 tree (1 link)
- Minimum cost maximum flow (1 link)
- Template:Heal (1 link)
- Network flow (1 link)
- Ackermann function (1 link)
- Dinić's algorithm (1 link)
- Sweep line algorithm (1 link)
- Merge sort (1 link)
- Knapsack problem (1 link)
- Eulerian circuit (1 link)
- Pattern matching (1 link)
- Parse tree (1 link)
- Topological order (1 link)
- Programming (1 link)
- Criticism of competitive programming (1 link)
- Selection sort (1 link)
- Imperative programming languages (1 link)
- Megiddo's algorithm (1 link)
- A* (1 link)
- Postfix (1 link)
