Wanted pages

Jump to: navigation, search

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 50 results in range #1 to #50.

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

  1. Suffix tree‏‎ (7 links)
  2. Binary indexed tree‏‎ (7 links)
  3. Fibonacci heap‏‎ (7 links)
  4. Trie‏‎ (6 links)
  5. Hash table‏‎ (6 links)
  6. Priority queue‏‎ (6 links)
  7. International Olympiad in Informatics‏‎ (5 links)
  8. Heapsort‏‎ (5 links)
  9. Optimization problem‏‎ (4 links)
  10. Balanced binary search tree‏‎ (4 links)
  11. Strongly connected component‏‎ (4 links)
  12. Quicksort‏‎ (4 links)
  13. Tarjan's strongly connected components algorithm‏‎ (4 links)
  14. Suffix array‏‎ (4 links)
  15. Binary search tree‏‎ (4 links)
  16. Transitive closure‏‎ (4 links)
  17. Gabow's algorithm‏‎ (4 links)
  18. Kosaraju's algorithm‏‎ (4 links)
  19. Imperative programming language‏‎ (3 links)
  20. Skip list‏‎ (3 links)
  21. Iterator‏‎ (2 links)
  22. Associative array‏‎ (2 links)
  23. Matrix multiplication‏‎ (2 links)
  24. Lambda calculus‏‎ (2 links)
  25. Connected component‏‎ (2 links)
  26. Minimum diameter spanning tree‏‎ (2 links)
  27. Bubble sort‏‎ (2 links)
  28. Minimum spanning arborescence‏‎ (2 links)
  29. Finding cut vertices and edges‏‎ (2 links)
  30. Dinic's algorithm‏‎ (2 links)
  31. Linear time‏‎ (2 links)
  32. ACSL‏‎ (2 links)
  33. Analysis of algorithms‏‎ (2 links)
  34. Functional programming language‏‎ (2 links)
  35. Longest common prefix array‏‎ (2 links)
  36. Hash function‏‎ (2 links)
  37. Directed graph‏‎ (2 links)
  38. Biconnected component‏‎ (2 links)
  39. Link/cut tree‏‎ (2 links)
  40. Insertion sort‏‎ (2 links)
  41. Transitive reduction‏‎ (2 links)
  42. Self-balancing binary search tree‏‎ (2 links)
  43. Mergesort‏‎ (2 links)
  44. Bridge‏‎ (2 links)
  45. Staircase‏‎ (1 link)
  46. Aho–Corasick algorithm‏‎ (1 link)
  47. Dictionaries‏‎ (1 link)
  48. Subgraphs‏‎ (1 link)
  49. Template:Itching‏‎ (1 link)
  50. Disjoint set data structure‏‎ (1 link)

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