Oldest pages

Jump to navigation Jump to search

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

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

  1. Decision Tree‏‎ (17:39, 10 September 2014)
  2. Red-Black Tree‏‎ (12:31, 11 September 2014)
  3. Heaps‏‎ (22:29, 19 September 2014)
  4. Union Find‏‎ (20:10, 30 September 2014)
  5. String matching‏‎ (19:30, 1 October 2014)
  6. Problems on Sequences‏‎ (19:43, 1 October 2014)
  7. Find an element in a sequence‏‎ (19:53, 1 October 2014)
  8. Median‏‎ (12:16, 2 October 2014)
  9. Priority queue‏‎ (15:33, 4 October 2014)
  10. B-tree: split‏‎ (08:42, 5 October 2014)
  11. Shortest paths by repeated squaring‏‎ (19:50, 6 October 2014)
  12. Undirected tree‏‎ (21:56, 6 October 2014)
  13. Subgraph‏‎ (21:57, 6 October 2014)
  14. NP-complete problems‏‎ (21:59, 6 October 2014)
  15. Lower asymptotic bounds for algorithmic problems‏‎ (22:00, 6 October 2014)
  16. Hash functions‏‎ (22:01, 6 October 2014)
  17. Fundamental types of algorithmic problems‏‎ (22:01, 6 October 2014)
  18. Encoded algorithmic problems‏‎ (22:02, 6 October 2014)
  19. Algorithmic problems‏‎ (22:04, 6 October 2014)
  20. Union-find with disjoint trees‏‎ (22:04, 6 October 2014)
  21. Search tree‏‎ (22:13, 6 October 2014)
  22. Multi-way search tree‏‎ (22:14, 6 October 2014)
  23. Hashtable‏‎ (22:15, 6 October 2014)
  24. Bubble‏‎ (15:01, 11 October 2014)
  25. B-tree: maximum‏‎ (11:21, 13 October 2014)
  26. B-tree: minimum‏‎ (11:22, 13 October 2014)
  27. Bipartite graph‏‎ (11:33, 13 October 2014)
  28. Bounded monotonous priority queue‏‎ (14:33, 17 October 2014)
  29. Big O notation‏‎ (16:04, 18 October 2014)
  30. Binary search tree: minimum‏‎ (16:13, 18 October 2014)
  31. Binary search tree: maximum‏‎ (16:14, 18 October 2014)
  32. Master theorem‏‎ (23:26, 18 October 2014)
  33. Single source shortest paths‏‎ (10:32, 20 October 2014)
  34. Single source single target shortest paths‏‎ (10:39, 20 October 2014)
  35. All pairs shortest paths‏‎ (12:56, 22 October 2014)
  36. L' Hospital‏‎ (22:43, 29 October 2014)
  37. Exhaustive graph traversal‏‎ (07:21, 3 November 2014)
  38. Repeated depth-first search‏‎ (07:28, 3 November 2014)
  39. Index handler‏‎ (11:02, 7 November 2014)
  40. Index handler with list of unused‏‎ (11:03, 7 November 2014)
  41. Blocking flow‏‎ (19:06, 9 November 2014)
  42. Graph traversal‏‎ (19:06, 9 November 2014)
  43. Strongly connected components‏‎ (19:07, 9 November 2014)
  44. Biconnected components‏‎ (19:07, 9 November 2014)
  45. Sorting Algorithms‏‎ (14:21, 12 November 2014)
  46. Eulerian cycle‏‎ (20:57, 12 November 2014)
  47. K-partite graph‏‎ (19:53, 17 November 2014)
  48. Directed graph‏‎ (20:12, 17 November 2014)
  49. Min-cost flow problem‏‎ (14:31, 1 December 2014)
  50. Basics of shortest paths‏‎ (14:34, 5 December 2014)
  51. Cardinality-maximal matching‏‎ (09:51, 6 December 2014)
  52. Hopcroft-Karp‏‎ (15:00, 6 December 2014)
  53. Maximum-weight matching‏‎ (17:37, 6 December 2014)
  54. Max-flow min-cut‏‎ (09:29, 3 January 2015)
  55. Dinic‏‎ (10:43, 8 January 2015)
  56. Model computer‏‎ (14:28, 13 January 2015)
  57. Alternating paths algorithm‏‎ (13:38, 27 January 2015)
  58. Negative cycle-canceling‏‎ (15:18, 5 February 2015)
  59. Successive shortest paths with reduced costs‏‎ (14:39, 20 February 2015)
  60. Classical bipartite cardinality matching‏‎ (08:49, 22 February 2015)
  61. Maximum matching by Edmonds‏‎ (09:25, 22 February 2015)
  62. Matchings in graphs‏‎ (09:53, 22 February 2015)
  63. Dial implementation‏‎ (09:57, 26 February 2015)
  64. Hungarian method‏‎ (17:26, 27 February 2015)
  65. One-dimensional string matching‏‎ (09:22, 29 April 2015)
  66. Pivot partioning‏‎ (13:34, 5 May 2015)
  67. Successive shortest paths‏‎ (10:08, 6 May 2015)
  68. Basic graph definitions‏‎ (14:47, 16 May 2015)
  69. Sorting Sequences of Strings‏‎ (11:38, 17 May 2015)
  70. Strings‏‎ (11:39, 17 May 2015)
  71. Sorting based on pairwise comparison‏‎ (12:30, 17 May 2015)
  72. Merging two sorted sequences‏‎ (09:22, 20 May 2015)
  73. Sets and sequences‏‎ (12:24, 21 May 2015)
  74. Genericity‏‎ (12:45, 21 May 2015)
  75. Ordered sequence‏‎ (12:52, 21 May 2015)
  76. Sorted sequence‏‎ (13:06, 21 May 2015)
  77. Directed Tree‏‎ (11:29, 26 May 2015)
  78. B-tree‏‎ (13:49, 26 May 2015)
  79. Pivot partitioning by scanning‏‎ (08:30, 30 May 2015)
  80. Numbers‏‎ (18:09, 9 June 2015)
  81. Minimum spanning tree‏‎ (12:33, 16 June 2015)
  82. Path‏‎ (00:26, 17 June 2015)
  83. Linked list‏‎ (22:49, 19 June 2015)
  84. Bubble sort‏‎ (22:50, 19 June 2015)
  85. Bellman-Ford‏‎ (22:51, 19 June 2015)
  86. Bucketsort‏‎ (22:51, 19 June 2015)
  87. Doubly-linked list‏‎ (23:08, 19 June 2015)
  88. Array list: find‏‎ (23:10, 19 June 2015)
  89. Array list: number‏‎ (23:10, 19 June 2015)
  90. Array list: remove‏‎ (23:11, 19 June 2015)
  91. Heap as array‏‎ (23:12, 19 June 2015)
  92. Heap as array: ascendItem‏‎ (23:12, 19 June 2015)
  93. Heap as array: decrease key‏‎ (23:12, 19 June 2015)
  94. Heap as array: descendItem‏‎ (23:12, 19 June 2015)
  95. Heap as array: extract minimum‏‎ (23:13, 19 June 2015)
  96. Heap as array: insert‏‎ (23:13, 19 June 2015)
  97. Quicksort in Place‏‎ (23:16, 19 June 2015)
  98. B-tree: shift key to sibling‏‎ (23:17, 19 June 2015)
  99. B-tree: merge two siblings‏‎ (23:19, 19 June 2015)
  100. B-tree: insert and rearrange‏‎ (23:19, 19 June 2015)
  101. Union-find‏‎ (13:58, 20 June 2015)
  102. Union-find with lists‏‎ (14:27, 20 June 2015)
  103. Prim‏‎ (09:28, 21 June 2015)
  104. Ford-Fulkerson‏‎ (11:49, 23 June 2015)
  105. Selection sort‏‎ (11:05, 30 June 2015)
  106. Binary search tree‏‎ (06:14, 6 July 2015)
  107. String matching based on finite automaton‏‎ (14:36, 16 September 2015)
  108. Merge‏‎ (12:14, 18 September 2015)
  109. Bubblesort‏‎ (12:17, 18 September 2015)
  110. Array list: insert at position‏‎ (12:57, 18 September 2015)
  111. Maximum spanning forest‏‎ (18:03, 18 September 2015)
  112. Kruskal for maximum spanning forest‏‎ (18:31, 20 September 2015)
  113. Array list‏‎ (09:59, 21 September 2015)
  114. Simple string matching algorithm‏‎ (10:13, 21 September 2015)
  115. Bounded priority queue‏‎ (06:43, 19 October 2015)
  116. Depth-first search‏‎ (06:52, 26 October 2015)
  117. Breadth-first search‏‎ (07:50, 26 October 2015)
  118. Kosaraju‏‎ (07:37, 2 November 2015)
  119. Classical eulerian cycle algorithm‏‎ (08:15, 2 November 2015)
  120. Hopcroft-Tarjan‏‎ (13:31, 3 November 2015)
  121. Maximum branching‏‎ (07:53, 8 November 2015)
  122. Branching by Edmonds‏‎ (07:59, 8 November 2015)
  123. Basic flow definitions‏‎ (13:42, 17 November 2015)
  124. Ahuja-Orlin‏‎ (07:59, 30 November 2015)
  125. Edmonds-Karp‏‎ (12:34, 1 December 2015)
  126. Blocking flow by Dinic‏‎ (08:37, 7 December 2015)
  127. FIFO preflow-push‏‎ (09:20, 14 December 2015)
  128. Lecture: Efficient Graph Algorithms‏‎ (09:07, 13 February 2016)
  129. Asymptotic complexity of algorithms‏‎ (05:54, 25 April 2016)
  130. Finding an element in a sorted array‏‎ (05:52, 27 April 2016)
  131. Binary search‏‎ (06:29, 27 April 2016)
  132. Algorithms and correctness‏‎ (12:49, 28 April 2016)
  133. Asymptotic comparison of functions‏‎ (15:38, 10 May 2016)
  134. Quicksort‏‎ (13:36, 3 March 2017)
  135. Mergesort‏‎ (13:36, 3 March 2017)
  136. Binary search tree: find‏‎ (13:38, 3 March 2017)
  137. Binary search tree: insert‏‎ (13:39, 3 March 2017)
  138. Binary search tree: remove‏‎ (13:39, 3 March 2017)
  139. Binary search tree: remove node‏‎ (13:39, 3 March 2017)
  140. Binary search tree: traverse‏‎ (13:41, 3 March 2017)
  141. B-tree: find‏‎ (13:46, 3 March 2017)
  142. B-tree: insert‏‎ (13:47, 3 March 2017)
  143. B-tree: remove‏‎ (13:58, 3 March 2017)
  144. Three indians' algorithm‏‎ (11:27, 16 March 2017)
  145. Preflow-push‏‎ (03:53, 20 June 2017)
  146. Preflow-push with excess scaling‏‎ (17:29, 18 December 2017)
  147. Max-Flow Problems‏‎ (08:58, 31 March 2018)
  148. Main Page‏‎ (15:13, 30 November 2020)
  149. Dijkstra‏‎ (08:35, 14 January 2021)
  150. Floyd-Warshall‏‎ (09:28, 24 May 2022)
  151. Insertion sort‏‎ (09:11, 20 February 2023)

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

Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/Special:AncientPages"