Long pages

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

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

1. (hist) ‎List:Algorithms ‎[281,464 bytes]
2. (hist) ‎List:Problem Families ‎[10,798 bytes]
3. (hist) ‎Conjunctive Normal Form SAT ‎[9,078 bytes]
4. (hist) ‎Negative Triangle Detection ‎[8,122 bytes]
5. (hist) ‎Boolean Matrix Multiplication ‎[7,916 bytes]
6. (hist) ‎St-Maximum Flow ‎[7,829 bytes]
7. (hist) ‎Integer Maximum Flow ‎[6,683 bytes]
8. (hist) ‎Lowest Common Ancestor ‎[6,468 bytes]
9. (hist) ‎All-Pairs Maximum Flow ‎[6,440 bytes]
10. (hist) ‎Maximum Local Edge Connectivity ‎[6,062 bytes]
11. (hist) ‎Comparison Sorting ‎[5,958 bytes]
12. (hist) ‎Sorting ‎[5,924 bytes]
13. (hist) ‎OV ‎[5,802 bytes]
14. (hist) ‎Minimum-Cost Flow ‎[5,740 bytes]
15. (hist) ‎Mesh Parameterization ‎[5,660 bytes]
16. (hist) ‎Matrix Multiplication ‎[5,652 bytes]
17. (hist) ‎Unweighted Maximum Flow ‎[5,622 bytes]
18. (hist) ‎Non-integer Maximum Flow ‎[5,591 bytes]
19. (hist) ‎Undirected, General MST ‎[5,489 bytes]
20. (hist) ‎Domain:Combinatorics ‎[5,333 bytes]
21. (hist) ‎Dijkstra's Algorithm ‎[5,309 bytes]
22. (hist) ‎The Vertex Cover Problem ‎[5,138 bytes]
23. (hist) ‎Integer Factoring ‎[5,101 bytes]
24. (hist) ‎Mesh Simplification ‎[4,955 bytes]
25. (hist) ‎Subset Sum ‎[4,859 bytes]
26. (hist) ‎Main Page ‎[4,849 bytes]
27. (hist) ‎Informed Search ‎[4,843 bytes]
28. (hist) ‎3SUM ‎[4,609 bytes]
29. (hist) ‎Single String Search ‎[4,574 bytes]
30. (hist) ‎Motif Search ‎[4,438 bytes]
31. (hist) ‎Triangle Detection ‎[4,387 bytes]
32. (hist) ‎APSP ‎[4,258 bytes]
33. (hist) ‎Corner Detection ‎[4,189 bytes]
34. (hist) ‎Transitive Reduction Problem of Directed Graphs ‎[4,028 bytes]
35. (hist) ‎Lowest Common Ancestor with Static Trees ‎[3,979 bytes]
36. (hist) ‎Image Segmentation ‎[3,924 bytes]
37. (hist) ‎Delaunay Triangulation ‎[3,906 bytes]
38. (hist) ‎Inexact Laplacian Solver ‎[3,888 bytes]
39. (hist) ‎Maximum Subarray ‎[3,820 bytes]
40. (hist) ‎Diameter ‎[3,741 bytes]
41. (hist) ‎Enumerating Maximal Cliques, arbitrary graph ‎[3,728 bytes]
42. (hist) ‎Maximum Likelihood Methods in Unknown Latent Variables ‎[3,607 bytes]
43. (hist) ‎Lossy Compression ‎[3,479 bytes]
44. (hist) ‎Discrete Fourier Transform ‎[3,418 bytes]
45. (hist) ‎General Linear Programming ‎[3,395 bytes]
46. (hist) ‎Algorithm Families ‎[3,391 bytes]
47. (hist) ‎Mutual Exclusion ‎[3,333 bytes]
48. (hist) ‎3-Graph Coloring ‎[3,281 bytes]
49. (hist) ‎Link Analysis ‎[3,244 bytes]
50. (hist) ‎4NF Decomposition ‎[3,239 bytes]
51. (hist) ‎Filtering Problem (Stochastic Processes) ‎[3,213 bytes]
52. (hist) ‎Linear Programming with Reals ‎[3,212 bytes]
53. (hist) ‎Historical Origins ‎[3,186 bytes]
54. (hist) ‎Constructing Suffix Trees ‎[3,185 bytes]
55. (hist) ‎Integer Linear Programming ‎[3,145 bytes]
56. (hist) ‎0-1 Linear Programming ‎[3,138 bytes]
57. (hist) ‎Domain:Cryptography ‎[3,125 bytes]
58. (hist) ‎Domain:Numerical Analysis ‎[3,113 bytes]
59. (hist) ‎Root Computation ‎[3,105 bytes]
60. (hist) ‎Unweighted Interval Scheduling, Online ‎[3,094 bytes]
61. (hist) ‎4NF Decomposition for Functional and Multivalued Dependency Sets ‎[3,069 bytes]
62. (hist) ‎Stable Marriage Problem ‎[3,036 bytes]
63. (hist) ‎Geometric Base ‎[3,034 bytes]
64. (hist) ‎SAT ‎[3,026 bytes]
65. (hist) ‎MaxSAT ‎[2,980 bytes]
66. (hist) ‎Triangles Cover Triangle ‎[2,953 bytes]
67. (hist) ‎Multiplication ‎[2,934 bytes]
68. (hist) ‎Unweighted Interval Scheduling ‎[2,931 bytes]
69. (hist) ‎Bipartite Graph MCM ‎[2,906 bytes]
70. (hist) ‎Discrete Logarithm Over Finite Fields ‎[2,884 bytes]
71. (hist) ‎Cryptography ‎[2,875 bytes]
72. (hist) ‎3-Dimensional Poisson Problem ‎[2,865 bytes]
73. (hist) ‎Blob Detection ‎[2,861 bytes]
74. (hist) ‎2-Dimensional Poisson Problem ‎[2,854 bytes]
75. (hist) ‎Lowest Common Ancestor with Linking ‎[2,841 bytes]
76. (hist) ‎4NF Decomposition for Conflict-Free Dependency Sets ‎[2,820 bytes]
77. (hist) ‎Maximum Inner Product Search ‎[2,800 bytes]
78. (hist) ‎Nonnegative Weights ‎[2,754 bytes]
79. (hist) ‎Positive Betweenness Centrality ‎[2,749 bytes]
80. (hist) ‎General Root Computation ‎[2,713 bytes]
81. (hist) ‎Min. Spanning Tree ‎[2,703 bytes]
82. (hist) ‎Global Register Allocation ‎[2,685 bytes]
83. (hist) ‎Minimum TSP ‎[2,636 bytes]
84. (hist) ‎Domain:Operating Systems ‎[2,630 bytes]
85. (hist) ‎Reach Centrality ‎[2,611 bytes]
86. (hist) ‎Unweighted Set-Covering ‎[2,605 bytes]
87. (hist) ‎Weighted Set-Covering ‎[2,602 bytes]
88. (hist) ‎POMDPs ‎[2,598 bytes]
89. (hist) ‎Inexact GED ‎[2,584 bytes]
90. (hist) ‎Hyperbolic Spline Interpolation ‎[2,566 bytes]
91. (hist) ‎Domain:Robotics ‎[2,546 bytes]
92. (hist) ‎Maximum Flow ‎[2,538 bytes]
93. (hist) ‎Boolean Matrix Multiplication (Combinatorial) ‎[2,533 bytes]
94. (hist) ‎Non-Comparison Sorting ‎[2,528 bytes]
95. (hist) ‎Point-in-Polygon ‎[2,488 bytes]
96. (hist) ‎Maximum cardinality matching ‎[2,467 bytes]
97. (hist) ‎Reporting all intersection points, line segments ‎[2,457 bytes]
98. (hist) ‎1D Maximum Subarray ‎[2,453 bytes]
99. (hist) ‎Entity Resolution ‎[2,418 bytes]
100. (hist) ‎Approximate TSP ‎[2,382 bytes]
101. (hist) ‎Disjunctive Queries of Safety in Graphs ‎[2,360 bytes]
102. (hist) ‎Robotics ‎[2,297 bytes]
103. (hist) ‎Disjunctive Reachability Queries in MDPs ‎[2,262 bytes]
104. (hist) ‎Domain:Image Processing ‎[2,251 bytes]
105. (hist) ‎Triangle Collection* ‎[2,241 bytes]
106. (hist) ‎K-Clique ‎[2,236 bytes]
107. (hist) ‎DFA Minimization ‎[2,233 bytes]
108. (hist) ‎Duplicate Elimination ‎[2,230 bytes]
109. (hist) ‎Multivalued Dependency Inference Problem ‎[2,220 bytes]
110. (hist) ‎Decade Analysis ‎[2,198 bytes]
111. (hist) ‎Texture Synthesis ‎[2,195 bytes]
112. (hist) ‎Diffuse Reflection ‎[2,186 bytes]
113. (hist) ‎Nonnegative Integer Weights ‎[2,175 bytes]
114. (hist) ‎CFG Parsing ‎[2,174 bytes]
115. (hist) ‎Constants ‎[2,155 bytes]
116. (hist) ‎3SUM' ‎[2,140 bytes]
117. (hist) ‎Square Matrix LU Decomposition ‎[2,138 bytes]
118. (hist) ‎Directed (Optimum Branchings), General MST ‎[2,137 bytes]
119. (hist) ‎Second Shortest Simple Path ‎[2,123 bytes]
120. (hist) ‎(3-Dimensional, i.e. project onto a 2D plane) ‎[2,113 bytes]
121. (hist) ‎Logarithm calculations ‎[2,111 bytes]
122. (hist) ‎Online ‎[2,107 bytes]
123. (hist) ‎APSP on Dense Directed Graphs with Arbitrary Weights ‎[2,104 bytes]
124. (hist) ‎K-OV ‎[2,102 bytes]
125. (hist) ‎Approximate OBST ‎[2,086 bytes]
126. (hist) ‎Shortest Path(Directed graphs) ‎[2,079 bytes]
127. (hist) ‎Operating Systems ‎[2,075 bytes]
128. (hist) ‎3 - Graph Coloring ‎[2,061 bytes]
129. (hist) ‎Matrix chain multiplication ‎[2,060 bytes]
130. (hist) ‎Stable Pair Checking ‎[2,059 bytes]
131. (hist) ‎Functional Dependency Inference Problem ‎[2,051 bytes]
132. (hist) ‎Line Intersections ‎[2,048 bytes]
133. (hist) ‎Cycle Detection ‎[2,039 bytes]
134. (hist) ‎De Novo Genome Assembly ‎[2,036 bytes]
135. (hist) ‎Sorting - Comparison ‎[2,033 bytes]
136. (hist) ‎Approximate MCOP ‎[2,012 bytes]
137. (hist) ‎2-dimensional Convex Hull ‎[1,996 bytes]
138. (hist) ‎Maximum Cut ‎[1,989 bytes]
139. (hist) ‎Maximum Likelihood Parameters ‎[1,986 bytes]
140. (hist) ‎Disjunctive coBüchi Objectives ‎[1,984 bytes]
141. (hist) ‎Sorting - Non-Comparison ‎[1,962 bytes]
142. (hist) ‎Reporting all intersection points, generalized segments ‎[1,961 bytes]
143. (hist) ‎Generalized Büchi Games ‎[1,947 bytes]
144. (hist) ‎CFG Recognition ‎[1,934 bytes]
145. (hist) ‎Counting Solutions ‎[1,926 bytes]
146. (hist) ‎APSP on Dense Undirected Graphs with Arbitrary Weights ‎[1,917 bytes]
147. (hist) ‎Environment Mapping ‎[1,914 bytes]
148. (hist) ‎Polygon Clipping with Arbitrary Clipping Polygon ‎[1,909 bytes]
149. (hist) ‎Unkeyed Hash Functions ‎[1,908 bytes]
150. (hist) ‎Bichromatic Hamming Close Pair ‎[1,893 bytes]
151. (hist) ‎A* Informed Search ‎[1,878 bytes]
152. (hist) ‎All-Nodes Median Parity ‎[1,876 bytes]
153. (hist) ‎The vertex-cover problem ‎[1,873 bytes]
154. (hist) ‎The set-covering problem ‎[1,873 bytes]
155. (hist) ‎LU decomposition ‎[1,860 bytes]
156. (hist) ‎Representative Algorithms ‎[1,854 bytes]
157. (hist) ‎The traveling-salesman problem ‎[1,847 bytes]
158. (hist) ‎Approximate Betweenness Centrality ‎[1,845 bytes]
159. (hist) ‎Largest Common Subtree ‎[1,845 bytes]
160. (hist) ‎Self-Balancing Trees Creation ‎[1,834 bytes]
161. (hist) ‎Eigenpair closest to mu ‎[1,834 bytes]
162. (hist) ‎Linear Equations ‎[1,828 bytes]
163. (hist) ‎Lowest Common Ancestor with Linking Roots ‎[1,815 bytes]
164. (hist) ‎All-pairs shortest paths (Undirected) ‎[1,815 bytes]
165. (hist) ‎Self-Balancing Trees Search ‎[1,814 bytes]
166. (hist) ‎SLAM Algorithms ‎[1,790 bytes]
167. (hist) ‎Subtree Isomorphism ‎[1,788 bytes]
168. (hist) ‎Off-Line Lowest Common Ancestor ‎[1,783 bytes]
169. (hist) ‎Wheel Factorization ‎[1,754 bytes]
170. (hist) ‎Wagner-Fischer Algorithm ‎[1,754 bytes]
171. (hist) ‎Vatti Clipping Algorithm ‎[1,754 bytes]
172. (hist) ‎Vaidya's Algorithm ‎[1,754 bytes]
173. (hist) ‎Two-pass Algorithm ‎[1,754 bytes]
174. (hist) ‎Todd–Coxeter algorithm ‎[1,754 bytes]
175. (hist) ‎Tarjan's SSC Algorithm ‎[1,754 bytes]
176. (hist) ‎Tarjan's LCA Algorithm ‎[1,754 bytes]
177. (hist) ‎Strassen's Algorithm ‎[1,754 bytes]
178. (hist) ‎SMAWK Algorithm ‎[1,754 bytes]
179. (hist) ‎Ramer–Douglas–Peucker Algorithm ‎[1,754 bytes]
180. (hist) ‎Radix Sort ‎[1,754 bytes]
181. (hist) ‎Rabin–Scott Powerset Construction ‎[1,754 bytes]
182. (hist) ‎Quadratic Sieve ‎[1,754 bytes]
183. (hist) ‎Nested Loop Join ‎[1,754 bytes]
184. (hist) ‎Needleman–Wunsch algorithm ‎[1,754 bytes]
185. (hist) ‎LogLog Algorithm ‎[1,754 bytes]
186. (hist) ‎Linde–Buzo–Gray Algorithm ‎[1,754 bytes]
187. (hist) ‎Lemke–Howson Algorithm ‎[1,754 bytes]
188. (hist) ‎Lawler's Graph Coloring Algorithm ‎[1,754 bytes]
189. (hist) ‎Kruskal's Algorithm ‎[1,754 bytes]
190. (hist) ‎Knuth-Morris-Pratt Algorithm ‎[1,754 bytes]
191. (hist) ‎Knuth's DP Algorithm ‎[1,754 bytes]
192. (hist) ‎Khachiyan Ellipsoid Algorithm ‎[1,754 bytes]
193. (hist) ‎Karatsuba Algorithm ‎[1,754 bytes]
194. (hist) ‎Kahn's Algorithm ‎[1,754 bytes]
195. (hist) ‎K-d Tree ‎[1,754 bytes]
196. (hist) ‎Jarvis Scan ‎[1,754 bytes]
197. (hist) ‎Hungarian Algorithm ‎[1,754 bytes]
198. (hist) ‎Hopcroft–Karp algorithm ‎[1,754 bytes]
199. (hist) ‎Hopcroft's DFA Algorithm ‎[1,754 bytes]
200. (hist) ‎Hoare's Selection Algorithm ‎[1,754 bytes]
201. (hist) ‎Hierholzer's Algorithm ‎[1,754 bytes]
202. (hist) ‎Held–Karp Algorithm ‎[1,754 bytes]
203. (hist) ‎Godbole's DP Algorithm ‎[1,754 bytes]
204. (hist) ‎Gaussian Elimination ‎[1,754 bytes]
205. (hist) ‎Fortune-Hopcroft Algorithm ‎[1,754 bytes]
206. (hist) ‎Floyd-Warshall Algorithm ‎[1,754 bytes]
207. (hist) ‎Floyd's Cycle-Finding Algorithm ‎[1,754 bytes]
208. (hist) ‎Fisher–Yates Shuffle ‎[1,754 bytes]
209. (hist) ‎Faugère F4 Algorithm ‎[1,754 bytes]
210. (hist) ‎Elliptic-curve Diffie-Hellman (ECDH) ‎[1,754 bytes]
211. (hist) ‎Edmonds-Karp Algorithm ‎[1,754 bytes]
212. (hist) ‎Doolittle Algorithm ‎[1,754 bytes]
213. (hist) ‎Dekker's Algorithm ‎[1,754 bytes]
214. (hist) ‎De Bruijn Graph ‎[1,754 bytes]
215. (hist) ‎Cohen–Sutherland Algorithm ‎[1,754 bytes]
216. (hist) ‎Chatlin's Algorithm ‎[1,754 bytes]
217. (hist) ‎Bruun's FFT Algorithm ‎[1,754 bytes]
218. (hist) ‎Bron–Kerbosch Algorithm ‎[1,754 bytes]
219. (hist) ‎Bresenham's Line Algorithm ‎[1,754 bytes]
220. (hist) ‎Bowyer–Watson Algorithm ‎[1,754 bytes]
221. (hist) ‎Bentley-Ottmann Algorithm ‎[1,754 bytes]
222. (hist) ‎Bellman-Ford Algorithm ‎[1,754 bytes]
223. (hist) ‎ADI Iteration ‎[1,754 bytes]
224. (hist) ‎A* Algorithm ‎[1,754 bytes]
225. (hist) ‎Sensitive incremental ‎[1,752 bytes]
226. (hist) ‎Cardinality Estimation ‎[1,750 bytes]
227. (hist) ‎Closest Pair Problem ‎[1,750 bytes]
228. (hist) ‎1-sensitive decremental st-shortest paths ‎[1,748 bytes]
229. (hist) ‎General Graph MCM ‎[1,737 bytes]
230. (hist) ‎APSP on Sparse Undirected Graphs with Positive Integer Weights ‎[1,731 bytes]
231. (hist) ‎APSP on Dense Undirected Graphs with Positive Integer Weights ‎[1,731 bytes]
232. (hist) ‎Graph Isomorphism, General Graphs ‎[1,715 bytes]
233. (hist) ‎Strips Cover Box ‎[1,712 bytes]
234. (hist) ‎Graph Isomorphism, Bounded Number of Vertices of Each Color ‎[1,706 bytes]
235. (hist) ‎List:Hypotheses ‎[1,697 bytes]
236. (hist) ‎K-SAT ‎[1,694 bytes]
237. (hist) ‎Approximate Reach Centrality ‎[1,693 bytes]
238. (hist) ‎D-dimensional Convex Hull ‎[1,690 bytes]
239. (hist) ‎Second category integer factoring ‎[1,663 bytes]
240. (hist) ‎4-Graph Coloring ‎[1,659 bytes]
241. (hist) ‎Gröbner Bases ‎[1,658 bytes]
242. (hist) ‎Distributed Locking Algorithms ‎[1,654 bytes]
243. (hist) ‎Specular Reflection ‎[1,646 bytes]
244. (hist) ‎Self-Balancing Trees Insertion ‎[1,643 bytes]
245. (hist) ‎Rectangular Window ‎[1,635 bytes]
246. (hist) ‎Numerical Analysis ‎[1,635 bytes]
247. (hist) ‎APSP on Sparse Undirected Unweighted Graphs ‎[1,634 bytes]
248. (hist) ‎APSP on Dense Undirected Unweighted Graphs ‎[1,634 bytes]
249. (hist) ‎Self-Balancing Trees Deletion ‎[1,633 bytes]
250. (hist) ‎Finding Frequent Itemsets ‎[1,631 bytes]
251. (hist) ‎Page replacements ‎[1,627 bytes]
252. (hist) ‎Convex Hull ‎[1,626 bytes]
253. (hist) ‎Longest Palindromic Substring ‎[1,621 bytes]
254. (hist) ‎Improvement Rankings ‎[1,613 bytes]
255. (hist) ‎Line Drawing ‎[1,609 bytes]
256. (hist) ‎APSP on Sparse Undirected Graphs with Arbitrary Weights ‎[1,608 bytes]
257. (hist) ‎APSP on Geometrically Weighted Graphs ‎[1,608 bytes]
258. (hist) ‎Weighted Activity selection problem ‎[1,608 bytes]
259. (hist) ‎Exact GED ‎[1,601 bytes]
260. (hist) ‎Tower of Hanoi ‎[1,595 bytes]
261. (hist) ‎General Linear System ‎[1,592 bytes]
262. (hist) ‎Maximum-Weight Matching ‎[1,590 bytes]
263. (hist) ‎Line Simplification ‎[1,586 bytes]
264. (hist) ‎Partial Match ‎[1,585 bytes]
265. (hist) ‎Minimum value in each row of an implicitly-defined totally monotone matrix ‎[1,585 bytes]
266. (hist) ‎Boolean d-Attribute Stable Matching ‎[1,582 bytes]
267. (hist) ‎3 Points on Line ‎[1,580 bytes]
268. (hist) ‎Graph Isomorphism, Bounded Vertex Valences ‎[1,580 bytes]
269. (hist) ‎Topological Sorting ‎[1,578 bytes]
270. (hist) ‎Polynomial interpolation ‎[1,570 bytes]
271. (hist) ‎Toeplitz Matrix ‎[1,569 bytes]
272. (hist) ‎Maximum TSP ‎[1,562 bytes]
273. (hist) ‎Clock Synchronization in Distributed Systems ‎[1,552 bytes]
274. (hist) ‎Domain:Statistics ‎[1,551 bytes]
275. (hist) ‎Constructing Eulerian Trails in a Graph ‎[1,550 bytes]
276. (hist) ‎Polynomial Interpolation ‎[1,549 bytes]
277. (hist) ‎Matrix Chain Ordering Problem ‎[1,541 bytes]
278. (hist) ‎Coset Enumeration ‎[1,536 bytes]
279. (hist) ‎Metricity ‎[1,534 bytes]
280. (hist) ‎Digraph Realization Problem ‎[1,531 bytes]
281. (hist) ‎Domain:Bioinformatics ‎[1,524 bytes]
282. (hist) ‎Multiple String Search ‎[1,523 bytes]
283. (hist) ‎Point in Polygon ‎[1,519 bytes]
284. (hist) ‎Variance Calculations ‎[1,510 bytes]
285. (hist) ‎Non-priority optimal interval Scheduling ‎[1,508 bytes]
286. (hist) ‎Stable Roommates Problem ‎[1,504 bytes]
287. (hist) ‎Distance Product ‎[1,495 bytes]
288. (hist) ‎Positive Definite, Hermitian Matrix ‎[1,494 bytes]
289. (hist) ‎(5/3)-approximate ap-shortest paths ‎[1,489 bytes]
290. (hist) ‎3SAT ‎[1,486 bytes]
291. (hist) ‎Dining Philosophers Problem ‎[1,486 bytes]
292. (hist) ‎Matrix Factorization for Collaborative Filtering ‎[1,474 bytes]
293. (hist) ‎Undirected All-Nodes Reach Centrality ‎[1,469 bytes]
294. (hist) ‎Disk Scheduling ‎[1,465 bytes]
295. (hist) ‎Directed All-Nodes Reach Centrality ‎[1,458 bytes]
296. (hist) ‎Visible Triangle ‎[1,457 bytes]
297. (hist) ‎2D Maximum Subarray ‎[1,454 bytes]
298. (hist) ‎Alphabetic Tree Problem ‎[1,454 bytes]
299. (hist) ‎Ford Fulkerson Algorithm ‎[1,446 bytes]
300. (hist) ‎Minimum Witness Finding ‎[1,429 bytes]
301. (hist) ‎Reporting all intersection points, convex polygons ‎[1,428 bytes]
302. (hist) ‎4 - Graph Coloring ‎[1,427 bytes]
303. (hist) ‎Hole in Union ‎[1,425 bytes]
304. (hist) ‎Domain:Databases ‎[1,423 bytes]
305. (hist) ‎2-dimensional Convex Hull, Dynamic ‎[1,411 bytes]
306. (hist) ‎Constant sensitivity (4/3)-approximate incremental diameter ‎[1,407 bytes]
307. (hist) ‎Greatest Common Divisor ‎[1,404 bytes]
308. (hist) ‎Block Ciphers ‎[1,395 bytes]
309. (hist) ‎Secret-sharing algorithms ‎[1,384 bytes]
310. (hist) ‎Bipartite Maximum-Weight Matching ‎[1,383 bytes]
311. (hist) ‎Directed (Optimum Branchings), Super Dense MST ‎[1,378 bytes]
312. (hist) ‎Longest Common Subsequence ‎[1,377 bytes]
313. (hist) ‎Approximate MCSP ‎[1,377 bytes]
314. (hist) ‎Max-Weight k-Clique ‎[1,360 bytes]
315. (hist) ‎First category integer factoring ‎[1,360 bytes]
316. (hist) ‎Independent Set Queries ‎[1,358 bytes]
317. (hist) ‎Computer Networking ‎[1,357 bytes]
318. (hist) ‎Longest Common Substring with don't cares ‎[1,356 bytes]
319. (hist) ‎Optimal Policies for MDPs ‎[1,352 bytes]
320. (hist) ‎2-sensitive decremental st-shortest paths ‎[1,349 bytes]
321. (hist) ‎Local Alignment ‎[1,348 bytes]
322. (hist) ‎Real 3SUM ‎[1,344 bytes]
323. (hist) ‎Negative Triangle Listing ‎[1,343 bytes]
324. (hist) ‎2-dimensional Convex Hull, Online ‎[1,340 bytes]
325. (hist) ‎Conjunctive Reachability Queries in MDPs ‎[1,338 bytes]
326. (hist) ‎Planar Bipartite Graph Perfect Matching ‎[1,333 bytes]
327. (hist) ‎2-sensitive (7/5)-approximate st-shortest paths ‎[1,332 bytes]
328. (hist) ‎RNA Folding ‎[1,330 bytes]
329. (hist) ‎Line Clipping ‎[1,328 bytes]
330. (hist) ‎1-sensitive (3/2)-approximate ss-shortest paths ‎[1,326 bytes]
331. (hist) ‎1-sensitive incremental ss-reach ‎[1,325 bytes]
332. (hist) ‎Graph Isomorphism, Trivalent Graphs ‎[1,323 bytes]
333. (hist) ‎Lemke–Howson algorithm ‎[1,321 bytes]
334. (hist) ‎Matrix Factorization ‎[1,316 bytes]
335. (hist) ‎Triangle in Unweighted Graph ‎[1,312 bytes]
336. (hist) ‎Conjunctive Safety Queries in MDPs ‎[1,311 bytes]
337. (hist) ‎Disjunctive Safety Queries in MDPs ‎[1,309 bytes]
338. (hist) ‎Solutions to Nonlinear Equations ‎[1,307 bytes]
339. (hist) ‎2-dimensional space, Euclidean metric ‎[1,306 bytes]
340. (hist) ‎1-sensitive (4/3)-approximate decremental diameter ‎[1,303 bytes]
341. (hist) ‎1-sensitive decremental diameter ‎[1,300 bytes]
342. (hist) ‎Point on 3 Lines ‎[1,298 bytes]
343. (hist) ‎1-sensitive (4/3)-approximate decremental eccentricity ‎[1,297 bytes]
344. (hist) ‎Nearest Neighbour ‎[1,297 bytes]
345. (hist) ‎General Permutations ‎[1,294 bytes]
346. (hist) ‎Exact Laplacian Solver ‎[1,294 bytes]
347. (hist) ‎Online Vector-Matrix-Vector Multiplication ‎[1,288 bytes]
348. (hist) ‎Edit Sequence, constant-size alphabet ‎[1,287 bytes]
349. (hist) ‎Non-Definite, Symmetric Matrix ‎[1,286 bytes]
350. (hist) ‎Undirected, Integer Weights MST ‎[1,285 bytes]
351. (hist) ‎Radius ‎[1,280 bytes]
352. (hist) ‎Link analysis (PAGERANK and variants) ‎[1,277 bytes]
353. (hist) ‎INDEGREE analysis ‎[1,277 bytes]
354. (hist) ‎Diameter 2 vs 3 ‎[1,264 bytes]
355. (hist) ‎Strong Connectivity (dynamic) ‎[1,263 bytes]
356. (hist) ‎Statistics ‎[1,259 bytes]
357. (hist) ‎Lowest Common Ancestors with Linking and Cutting ‎[1,258 bytes]
358. (hist) ‎Unbalanced OV ‎[1,257 bytes]
359. (hist) ‎Ray Tracing ‎[1,257 bytes]
360. (hist) ‎The Vertex Cover Problem, Degrees Bounded By 3 ‎[1,254 bytes]
361. (hist) ‎Undirected All-Nodes Positive Betweenness Centrality ‎[1,252 bytes]
362. (hist) ‎Vandermonde Matrix ‎[1,246 bytes]
363. (hist) ‎Directed All-Nodes Positive Betweenness Centrality ‎[1,243 bytes]
364. (hist) ‎Weighted Depth ‎[1,239 bytes]
365. (hist) ‎Determinant of Matrices with Integer Entries ‎[1,238 bytes]
366. (hist) ‎Voronoi Diagrams ‎[1,237 bytes]
367. (hist) ‎Median ‎[1,236 bytes]
368. (hist) ‎Price Query ‎[1,235 bytes]
369. (hist) ‎Decisional BCNF ‎[1,227 bytes]
370. (hist) ‎All-Integers 3SUM ‎[1,226 bytes]
371. (hist) ‎Undirected, Dense MST ‎[1,226 bytes]
372. (hist) ‎Approximate Diameter ‎[1,219 bytes]
373. (hist) ‎Approximate Hard-Margin SVM ‎[1,216 bytes]
374. (hist) ‎Max-Weight Rectangle ‎[1,216 bytes]
375. (hist) ‎Diameter 3 vs 7 ‎[1,212 bytes]
376. (hist) ‎Change-Making Problem ‎[1,207 bytes]
377. (hist) ‎All Permutations ‎[1,207 bytes]
378. (hist) ‎2-dimensional array representation ‎[1,207 bytes]
379. (hist) ‎Undirected, Planar MST ‎[1,206 bytes]
380. (hist) ‎Money Change ‎[1,204 bytes]
381. (hist) ‎3-OV ‎[1,200 bytes]
382. (hist) ‎Matrix Chain Scheduling Problem ‎[1,194 bytes]
383. (hist) ‎2 Strong Components (dynamic) ‎[1,193 bytes]
384. (hist) ‎Dynamic Time Warping ‎[1,191 bytes]
385. (hist) ‎BioInformatics ‎[1,183 bytes]
386. (hist) ‎Convex Polygonal Window ‎[1,178 bytes]
387. (hist) ‎Longest Path on Interval Graphs ‎[1,175 bytes]
388. (hist) ‎Key Exchange ‎[1,168 bytes]
389. (hist) ‎Bubble Sort ‎[1,168 bytes]
390. (hist) ‎Negative Triangle Search ‎[1,166 bytes]
391. (hist) ‎InDegree Analysis ‎[1,166 bytes]
392. (hist) ‎Kth Order Statistic ‎[1,166 bytes]
393. (hist) ‎Sequence-To-Graph Alignment ‎[1,162 bytes]
394. (hist) ‎DAG Realization Problem ‎[1,159 bytes]
395. (hist) ‎Planar Motion Planning ‎[1,158 bytes]
396. (hist) ‎2-sensitive incremental st-reach ‎[1,152 bytes]
397. (hist) ‎N-Queens Problem ‎[1,145 bytes]
398. (hist) ‎Databases ‎[1,143 bytes]
399. (hist) ‎Nondecreasing Triangle ‎[1,133 bytes]
400. (hist) ‎Secret Sharing ‎[1,127 bytes]
401. (hist) ‎Min-Weight k-Clique ‎[1,119 bytes]
402. (hist) ‎Eigenpair with the Largest Eigenvalue ‎[1,114 bytes]
403. (hist) ‎Renamable Horn ‎[1,109 bytes]
404. (hist) ‎Self-balancing trees creation ‎[1,104 bytes]
405. (hist) ‎Betweenness Centrality ‎[1,101 bytes]
406. (hist) ‎All Maximal Non-Branching Paths in a Graph ‎[1,101 bytes]
407. (hist) ‎Stable Matching Verification ‎[1,096 bytes]
408. (hist) ‎Minimum Triangle ‎[1,092 bytes]
409. (hist) ‎Visibility From Infinity ‎[1,088 bytes]
410. (hist) ‎Visibility Between Segments ‎[1,088 bytes]
411. (hist) ‎Gröbner bases ‎[1,086 bytes]
412. (hist) ‎Safety in MDPs ‎[1,084 bytes]
413. (hist) ‎Reachability in MDPs ‎[1,082 bytes]
414. (hist) ‎3D Motion Planning ‎[1,079 bytes]
415. (hist) ‎APSP on Dense Directed Unweighted Graphs ‎[1,079 bytes]
416. (hist) ‎APSP on Sparse Directed Unweighted Graphs ‎[1,078 bytes]
417. (hist) ‎Median String Problem with Unbounded Alphabets ‎[1,075 bytes]
418. (hist) ‎Ap-reach ‎[1,069 bytes]
419. (hist) ‎Separator1 ‎[1,068 bytes]
420. (hist) ‎Rectangular Matrix LU Decomposition ‎[1,067 bytes]
421. (hist) ‎Keyed Hash Functions ‎[1,062 bytes]
422. (hist) ‎Occupancy Grid Mapping ‎[1,060 bytes]
423. (hist) ‎Transitive Closure ‎[1,060 bytes]
424. (hist) ‎The Frequent Words Problem ‎[1,059 bytes]
425. (hist) ‎Safety in Graphs ‎[1,054 bytes]
426. (hist) ‎APSP on Sparse Directed Graphs with Arbitrary Weights ‎[1,046 bytes]
427. (hist) ‎Acyclic DFA Minimization ‎[1,043 bytes]
428. (hist) ‎Shortest k-Cycle ‎[1,042 bytes]
429. (hist) ‎Sparse Linear System ‎[1,042 bytes]
430. (hist) ‎Generating random permutations ‎[1,036 bytes]
431. (hist) ‎4SAT ‎[1,033 bytes]
432. (hist) ‎Multiple Local Alignment ‎[1,031 bytes]
433. (hist) ‎Cyclic Nontrivial SCCs DFA Minimization ‎[1,030 bytes]
434. (hist) ‎K-dimensional space, $l m$ (or $l \infty$) norm ‎[1,019 bytes]
435. (hist) ‎Local Register Allocation ‎[1,011 bytes]
436. (hist) ‎2-dimensional space, $l m$ (or $l \infty$) norm ‎[1,002 bytes]
437. (hist) ‎Cyclic Peptide Sequencing Problem ‎[1,000 bytes]
438. (hist) ‎Sequence to Graph Alignment ‎[1,000 bytes]
439. (hist) ‎Graph edit distance computation ‎[1,000 bytes]
440. (hist) ‎Point Covering ‎[997 bytes]
441. (hist) ‎Frequent Words with Mismatches Problem ‎[995 bytes]
442. (hist) ‎Matrix Product Verification ‎[990 bytes]
443. (hist) ‎Frechet Distance ‎[981 bytes]
444. (hist) ‎D-Neighborhood of a String ‎[978 bytes]
445. (hist) ‎Undirected Wiener Index ‎[977 bytes]
446. (hist) ‎Almost Stable Marriage Problem ‎[971 bytes]
447. (hist) ‎Key exchange ‎[963 bytes]
448. (hist) ‎All Pairs Minimum Witness ‎[962 bytes]
449. (hist) ‎K-Graph Coloring ‎[962 bytes]
450. (hist) ‎St-Shortest Path ‎[957 bytes]
451. (hist) ‎$(\min, \leq)$ Product ‎[954 bytes]
452. (hist) ‎Triangle Measure ‎[951 bytes]
453. (hist) ‎Static Dihedral Rotation Queries ‎[948 bytes]
454. (hist) ‎Deadlock avoidance ‎[946 bytes]
455. (hist) ‎Culling ‎[943 bytes]
456. (hist) ‎Self-balancing trees search ‎[940 bytes]
457. (hist) ‎3-dimensional Convex Hull ‎[932 bytes]
458. (hist) ‎Maximum Square Subarray ‎[931 bytes]
459. (hist) ‎Image Processing ‎[920 bytes]
460. (hist) ‎Steal, No-Force ‎[914 bytes]
461. (hist) ‎Nash Equilibria ‎[913 bytes]
462. (hist) ‎Rod-Cutting Problem ‎[909 bytes]
463. (hist) ‎Rasterization ‎[908 bytes]
464. (hist) ‎Shortest Cycle ‎[901 bytes]
465. (hist) ‎Constructing Eulerian trails in a Graph ‎[899 bytes]
466. (hist) ‎Turnpike problem ‎[897 bytes]
467. (hist) ‎1-in-3SAT ‎[896 bytes]
468. (hist) ‎General Weights ‎[892 bytes]
469. (hist) ‎K-ANNS for a dense 3D map of geometric points ‎[887 bytes]
470. (hist) ‎Not-All-Equal 3-SAT (NAE 3SAT) ‎[876 bytes]
471. (hist) ‎Eccentricity ‎[871 bytes]
472. (hist) ‎Replacement Paths Problem ‎[869 bytes]
473. (hist) ‎Offline ‎[866 bytes]
474. (hist) ‎Arithmetic Expression Binary Tree ‎[866 bytes]
475. (hist) ‎Factorization of Polynomials Over Finite Fields ‎[864 bytes]
476. (hist) ‎Recovery ‎[859 bytes]
477. (hist) ‎Cryptanalysis of Linear Feedback Shift Registers ‎[859 bytes]
478. (hist) ‎Polygon Clipping with Convex Clipping Polygon ‎[855 bytes]
479. (hist) ‎Cyclic Permutations ‎[849 bytes]
480. (hist) ‎Monotone Not-Exactly-1-in-3SAT ‎[847 bytes]
481. (hist) ‎BCNF Decomposition ‎[845 bytes]
482. (hist) ‎SDD Systems Solvers ‎[843 bytes]
483. (hist) ‎Fulkerson–Chen–Anstee (Digraph Realization Problem Graph Realization Problems) ‎[841 bytes]
484. (hist) ‎All-Equal-SAT ‎[839 bytes]
485. (hist) ‎Joins ‎[836 bytes]
486. (hist) ‎Separator2 ‎[831 bytes]
487. (hist) ‎Family:All-Pairs Shortest Paths (APSP) ‎[827 bytes]
488. (hist) ‎Kth order statistic ‎[826 bytes]
489. (hist) ‎Monotone 1-in-3SAT ‎[824 bytes]
490. (hist) ‎Self-balancing trees insertion ‎[817 bytes]
491. (hist) ‎Self-balancing trees deletion ‎[815 bytes]
492. (hist) ‎Sequence Alignment ‎[814 bytes]
493. (hist) ‎Reporting all intersection points, general polygons ‎[811 bytes]
494. (hist) ‎Horn SAT ‎[808 bytes]
495. (hist) ‎Counting number of intersection points, line segments ‎[792 bytes]
496. (hist) ‎Reduction from Triangle Detection to Dynamic st-Reach ‎[791 bytes]
497. (hist) ‎Integer Relation Among Integers ‎[790 bytes]
498. (hist) ‎Decremental Diameter ‎[788 bytes]
499. (hist) ‎Integer Relation Among Reals ‎[785 bytes]
500. (hist) ‎Dual-Horn SAT ‎[784 bytes]

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