User contributions for Admin
Jump to navigation
Jump to search
10 April 2023
- 09:5109:51, 10 April 2023 diff hist −4 Rabin Karp (The Frequent Words Problem The Frequent Words Problem) No edit summary current
- 09:5109:51, 10 April 2023 diff hist −4 Naive solution (The Frequent Words Problem The Frequent Words Problem) No edit summary current
- 09:5109:51, 10 April 2023 diff hist −10 Gray-code based (Tower of Hanoi Tower of Hanoi) No edit summary current
- 09:5109:51, 10 April 2023 diff hist −10 Non-recursion based (Tower of Hanoi Tower of Hanoi) No edit summary current
- 09:5109:51, 10 April 2023 diff hist −9 Recursion based (Tower of Hanoi Tower of Hanoi) No edit summary current
- 09:5109:51, 10 April 2023 diff hist −10 Iteration based (Tower of Hanoi Tower of Hanoi) No edit summary current
- 09:5109:51, 10 April 2023 diff hist −10 Naive Solution (Median String Problem with Unbounded Alphabets Median String Problem) No edit summary current
- 09:5109:51, 10 April 2023 diff hist 0 Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) No edit summary Tags: Manual revert Reverted
- 09:5109:51, 10 April 2023 diff hist 0 Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) No edit summary Tags: Manual revert Reverted
- 09:5109:51, 10 April 2023 diff hist +1 Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) No edit summary Tag: Reverted
- 09:5109:51, 10 April 2023 diff hist −1 Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) No edit summary Tags: Manual revert Reverted
- 09:5109:51, 10 April 2023 diff hist 0 Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) No edit summary Tags: Manual revert Reverted
- 09:5109:51, 10 April 2023 diff hist +1 Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) No edit summary Tags: Manual revert Reverted
- 09:5109:51, 10 April 2023 diff hist 0 Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) No edit summary Tags: Manual revert Reverted
- 09:5109:51, 10 April 2023 diff hist +1 Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) No edit summary Tags: Manual revert Reverted
- 09:5109:51, 10 April 2023 diff hist −2 Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) No edit summary Tags: Manual revert Reverted
- 09:5109:51, 10 April 2023 diff hist −59 Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) No edit summary Tag: Reverted
- 09:5109:51, 10 April 2023 diff hist +59 Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem) No edit summary Tags: Manual revert Reverted
- 09:5109:51, 10 April 2023 diff hist +2 Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Search) No edit summary current
- 09:5109:51, 10 April 2023 diff hist +2 Hopcroft 2-3 Tree ( Self-Balancing Trees Search) No edit summary current
- 09:5109:51, 10 April 2023 diff hist +2 Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Deletion) No edit summary current
- 09:5109:51, 10 April 2023 diff hist +2 Hopcroft 2-3 Tree ( Self-Balancing Trees Deletion) No edit summary current
- 09:5109:51, 10 April 2023 diff hist +2 Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Insertion) No edit summary current
- 09:5109:51, 10 April 2023 diff hist +2 Hopcroft 2-3 Tree ( Self-Balancing Trees Insertion) No edit summary current
- 09:5109:51, 10 April 2023 diff hist +2 Bayer, McCreight B-Tree ( Self-Balancing Trees Creation) No edit summary current
- 09:5009:50, 10 April 2023 diff hist +3 Tarjan Splay Tree ( Self-Balancing Trees Creation) No edit summary current
- 09:5009:50, 10 April 2023 diff hist +3 Hopcroft 2-3 Tree ( Self-Balancing Trees Creation) No edit summary current
- 09:5009:50, 10 April 2023 diff hist +3 Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Creation) No edit summary current
- 09:5009:50, 10 April 2023 diff hist +3 AVL Tree ( Self-Balancing Trees Creation) No edit summary current
- 09:5009:50, 10 April 2023 diff hist −9 Function Field Sieve (FFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations) No edit summary current
- 09:5009:50, 10 April 2023 diff hist −5 Rautiainen, Marschall (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) No edit summary current
- 09:5009:50, 10 April 2023 diff hist −6 Jain, Chang (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) No edit summary current
- 09:5009:50, 10 April 2023 diff hist +30 Rautiainen and Marschall (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) No edit summary current
- 09:5009:50, 10 April 2023 diff hist −4 V-ALIGN (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) No edit summary current
- 09:5009:50, 10 April 2023 diff hist −7 HybridSpades (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) No edit summary current
- 09:5009:50, 10 April 2023 diff hist +52 Navarro (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) No edit summary current
- 09:5009:50, 10 April 2023 diff hist −102 Amir et al. (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) No edit summary current
- 09:5009:50, 10 April 2023 diff hist +6 Bareiss algorithm with fast multiplication (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries) No edit summary current
- 09:5009:50, 10 April 2023 diff hist +2 Bareiss algorithm (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries) No edit summary current
- 09:5009:50, 10 April 2023 diff hist 0 Dunning; Gupta & Silberholz (Maximum Cut, Approximate Maximum Cut) No edit summary current
- 09:5009:50, 10 April 2023 diff hist +2 Ausiello et al. (Maximum Cut, Approximate Maximum Cut) No edit summary current
- 09:5009:50, 10 April 2023 diff hist −10 Khuller; Raghavachari & Young, "Greedy Methods" (Maximum Cut, Approximate Maximum Cut) No edit summary current
- 09:5009:50, 10 April 2023 diff hist −10 Mitzenmacher & Upfal (Maximum Cut, Approximate Maximum Cut) No edit summary current
- 09:5009:50, 10 April 2023 diff hist −10 Motwani & Raghavan (Maximum Cut, Approximate Maximum Cut) No edit summary current
- 09:5009:50, 10 April 2023 diff hist 0 Hadlock (Maximum Cut Maximum Cut) No edit summary current
- 09:5009:50, 10 April 2023 diff hist −10 Iterative naive (d-Neighborhood of a String d-Neighborhood of a String) No edit summary current
- 09:5009:50, 10 April 2023 diff hist +2 Salomon (Swath Method) (Point-in-Polygon Point-in-Polygon) No edit summary current
- 09:5009:50, 10 April 2023 diff hist −54 Nordbeck and Rystedt (Grid Method) (Point-in-Polygon Point-in-Polygon) No edit summary current
- 09:5009:50, 10 April 2023 diff hist −1 Branch and bound (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem) No edit summary current
- 09:4909:49, 10 April 2023 diff hist −1 Brute force (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem) No edit summary current
- 09:4909:49, 10 April 2023 diff hist +2 Randomized HITS (Link Analysis Link Analysis) No edit summary current
- 09:4909:49, 10 April 2023 diff hist −6 The INDEGREE Algorithm (InDegree Analysis Link Analysis) No edit summary current
- 09:4909:49, 10 April 2023 diff hist −10 Naive (All Maximal Non-Branching Paths in a Graph All Maximal Non-Branching Paths in a Graph) No edit summary current
- 09:4909:49, 10 April 2023 diff hist +418 N Kingsford (Motif Search Motif Search) Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(m^{2}n^{2})$ words (Creates an ILP with $O(m^2n^2)$ variables and $O(n^2m)$ constraints, each involving $O(m)$ variables) == Description == ILP formulation == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2006 == Reference == https://link.springer.com/chapter/10.1007/11780441_22" current
- 09:4909:49, 10 April 2023 diff hist +364 N Liang Cwinnower (Motif Search Motif Search) Created page with "== Time Complexity == $O(nm^{0.5})$ == Space Complexity == $O(m^{2})$ words (Considers a graph on $O(m)$ nodes and $O(m^2)$ edges) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2003 == Reference == https://www.worldscientific.com/doi/10.1142/S0219720004000466" current
- 09:4909:49, 10 April 2023 diff hist +370 N Sagot M (Motif Search Motif Search) Created page with "== Time Complexity == $O(n \log(n)$ m^{1.{4}5}) == Space Complexity == $O(mn^{2}/w)$ words (https://link.springer.com/chapter/10.1007/BFb0054337) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1988 == Reference == https://link.springer.com/chapter/10.1007/BFb0054337" current
- 09:4909:49, 10 April 2023 diff hist +407 N Bailey TL; Elkan C MEME (Motif Search Motif Search) Created page with "== Time Complexity == $O(n^{2}m^{2})$ == Space Complexity == $O(mn)$ words (Uses iterations of the EM algorithm as in (Lawrence, Reilly 1990), and thus uses similar amounts of space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1995 == Reference == https://link.springer.com/article/10.1007/BF00993379" current
- 09:4909:49, 10 April 2023 diff hist +367 N Sinha S; Tompa M YMF (Yeast Motif Finder) (Motif Search Motif Search) Created page with "== Time Complexity == $O(n^{0.{6}6} m)$ == Space Complexity == $O(m)$ words (Derived: store number of occurances for each motif of a specified length) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2000 == Reference == https://www.ncbi.nlm.nih.gov/pubmed/10977095" current
- 09:4909:49, 10 April 2023 diff hist +410 N Tompa M (Motif Search Motif Search) Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(m^{2})$ words (Requires considering an $O(m^2)*O(m^2)$ matrix with $O(m^2)$ nonzero entries, based on a DFA with $O(m^2)$ states) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1999 == Reference == https://www.aaai.org/Papers/ISMB/1999/ISMB99-030.pdf" current
- 09:4909:49, 10 April 2023 diff hist +378 N Van Helden J; Rios AF; Collado-Vides J (Motif Search Motif Search) Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(m)$ words (Derived: store number of occurances for each motif of a specified length) == Description == Dyad analysis == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2000 == Reference == https://www.ncbi.nlm.nih.gov/pmc/articles/PMC102821/" current
- 09:4909:49, 10 April 2023 diff hist +431 N Helden Oligo-Analysis (Motif Search Motif Search) Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(m)$ words (Derived: store number of occurances for each motif of a specified length) == Description == Uses oligonucleotides? Also only detects "short" motifs, and used for yeast == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1998 == Reference == https://www.ncbi.nlm.nih.gov/pubmed/9719638" current
- 09:4909:49, 10 April 2023 diff hist +1 Dinur & Steurer ( The Set-Covering Problem) No edit summary current
- 09:4909:49, 10 April 2023 diff hist +1 Raz & Safra ( The Set-Covering Problem) No edit summary current
- 09:4909:49, 10 April 2023 diff hist +1 Greedy Algorithm ( The Set-Covering Problem) No edit summary current
- 09:4909:49, 10 April 2023 diff hist +4 Damiano Brigo; Bernard Hanzon and François LeGland (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) No edit summary current
- 09:4909:49, 10 April 2023 diff hist +1 Maybeck; Peter S Extended Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) No edit summary current
- 09:4909:49, 10 April 2023 diff hist 0 Stratonovich (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) No edit summary current Tag: Manual revert
- 09:4909:49, 10 April 2023 diff hist 0 Stratonovich (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) No edit summary Tags: Manual revert Reverted
- 09:4809:48, 10 April 2023 diff hist +1 Alpha-HMM (Matsuyama, Yasuo) (Maximum Likelihood Methods in Unknown Latent Variables, Hidden Markov Models Maximum Likelihood Methods in Unknown Latent Variables) No edit summary current
- 09:4809:48, 10 April 2023 diff hist +1 Shaban; Amirreza; Mehrdad; Farajtabar (Maximum Likelihood Methods in Unknown Latent Variables; multi-view model, discrete observations Maximum Likelihood Methods in Unknown Latent Variables) No edit summary current
- 09:4809:48, 10 April 2023 diff hist +1 EM with Quasi-Newton Methods (Jamshidian; Mortaza; Jennrich; Robert I.) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) No edit summary current
- 09:4809:48, 10 April 2023 diff hist +1 SPRINGBORN B.; SCHROEDER P.; PINKALL U. 2008 (Mesh Parameterization Mesh Parameterization) No edit summary current
- 09:4809:48, 10 April 2023 diff hist +1 BEN-CHEN M.; GOTSMAN C.; BUNIN G. 2008 (Mesh Parameterization Mesh Parameterization) No edit summary current
- 09:4809:48, 10 April 2023 diff hist +4 YANG Y.; KIM J.; LUO F.; HU S.; GU X. 2008 (Mesh Parameterization Mesh Parameterization) No edit summary current
- 09:4809:48, 10 April 2023 diff hist +3 ZAYER R.; ROESSL C.; SEIDEL H.-P 2005 (Mesh Parameterization Mesh Parameterization) No edit summary current
- 09:4809:48, 10 April 2023 diff hist +1 LÉVY B.; PETITJEAN S.; RAY N.; MAILLOT J 2002 (Mesh Parameterization Mesh Parameterization) No edit summary current
- 09:4809:48, 10 April 2023 diff hist +1 LEE Y.; KIM H. S.; LEE S 2002 (Mesh Parameterization Mesh Parameterization) No edit summary current
- 09:4809:48, 10 April 2023 diff hist +441 N B. I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) Created page with "== Time Complexity == $O(n^{4})$ == Space Complexity == $O(n)$?? words (Requires computing the coefficients b_i and functions Phi(x) and Psi(x) as in equations 17 and 18) == Description == Discrete Generalized Splines == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2000 == Reference == http://sutir.sut.ac.th:8080/sutir/bitstream/123456789/431/1/bib115.pdf" current
- 09:4809:48, 10 April 2023 diff hist +411 N P. Costantini, B. I. Kvasov, and C. Manni (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) Created page with "== Time Complexity == $O(n^{5} \log K)$ == Space Complexity == $O(n)$? words (Derived: Pentadiagonal matrix in the linear system only requires O(n) space) == Description == Pentadiagonal linear system == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1999 == Reference == https://link.springer.com/article/10.1023/A:1018988312596" current
- 09:4809:48, 10 April 2023 diff hist +229 N V. I. Paasonen (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) Created page with "== Time Complexity == $O(n^{5} \log K)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1968 == Reference ==" current
- 09:4809:48, 10 April 2023 diff hist +316 N V. A. Lyul’ka and I. E. Mikhailov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) Created page with "== Time Complexity == $O(n^{4})$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2003 == Reference == http://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=zvmmf&paperid=943&option_lang=eng" current
- 09:4809:48, 10 April 2023 diff hist +261 N V. A. Lyul’ka and A. V. Romanenko (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) Created page with "== Time Complexity == $O(n^{5})$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1994 == Reference == https://www.mathnet.ru/eng/zvmmf2544" current
- 09:4809:48, 10 April 2023 diff hist +413 N B.I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) Created page with "== Time Complexity == $O(n^{3} \log^{2}K)$ == Space Complexity == $O(n)$? words (Derived: Tridiagonal matrices in the linear system only require O(n) space) == Description == Tridiagonal linear system == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2008 == Reference == https://link.springer.com/article/10.1134/S0965542508040039" current
- 09:4609:46, 10 April 2023 diff hist +138 Martinian and M. J. Wainwright (Lossy Compression Data Compression) No edit summary current
- 09:4609:46, 10 April 2023 diff hist +127 Miyake 2006 (Lossy Compression Data Compression) No edit summary current
- 09:4609:46, 10 April 2023 diff hist +142 Sun; M. Shao; J. Chen; K. Wong; and X. Wu (Lossy Compression Data Compression) No edit summary current
- 09:4609:46, 10 April 2023 diff hist +64 Brute force (Lossy Compression Data Compression) No edit summary current
- 09:4609:46, 10 April 2023 diff hist +135 Ciliberti; Mézard (Lossy Compression Data Compression) No edit summary current
- 09:4609:46, 10 April 2023 diff hist +8 Maneva and M. J. Wainwright (Lossy Compression Data Compression) No edit summary current
- 09:4609:46, 10 April 2023 diff hist −3 GLR parser (CFG Parsing CFG Problems) No edit summary current
- 09:4609:46, 10 April 2023 diff hist −365 Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem) No edit summary Tags: Manual revert Reverted
- 09:4609:46, 10 April 2023 diff hist +365 Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem) No edit summary Tags: Manual revert Reverted
- 09:4609:46, 10 April 2023 diff hist −10 Sam Buss (The Vertex Cover Problem The Vertex Cover Problem) No edit summary current
- 09:4609:46, 10 April 2023 diff hist −10 Brute force (backtracking search) (The Vertex Cover Problem The Vertex Cover Problem) No edit summary current
- 09:4609:46, 10 April 2023 diff hist −9 C-LOOK (Disk Scheduling Disk Scheduling) No edit summary current
- 09:4409:44, 10 April 2023 diff hist −9 C-SCAN (Disk Scheduling Disk Scheduling) No edit summary current
- 09:4409:44, 10 April 2023 diff hist −9 LOOK (Disk Scheduling Disk Scheduling) No edit summary current
- 09:4409:44, 10 April 2023 diff hist −9 SCAN (Disk Scheduling Disk Scheduling) No edit summary current
- 09:4409:44, 10 April 2023 diff hist −9 SSTF (Disk Scheduling Disk Scheduling) No edit summary current
- 09:4409:44, 10 April 2023 diff hist −10 FCFS (Disk Scheduling Disk Scheduling) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +1 Brute force algorithm (Functional Dependency Inference Problem Dependency Inference Problem) No edit summary current
- 09:4409:44, 10 April 2023 diff hist −10 Naive algorithm (Subset Sum The Subset-Sum Problem) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +3 String Graph (Myers) (De Novo Genome Assembly De Novo Genome Assembly) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +2 Dwyer (higher dimensions) (General Delaunay Triangulation (d-dimensions) Delaunay Triangulation) No edit summary current
- 09:4409:44, 10 April 2023 diff hist −51 Katajainen and M. Koppinen ( Delaunay Triangulation) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +3 Dwyer (2-Dimensional Delaunay Triangulation Delaunay Triangulation) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +3 S-hull (Sinclair) (2-Dimensional Delaunay Triangulation Delaunay Triangulation) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +3 Guibas; Stofli (2-Dimensional Delaunay Triangulation Delaunay Triangulation) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +3 Belloch (2-Dimensional Delaunay Triangulation Delaunay Triangulation) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +3 Bowyer–Watson algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +3 De Berg; Cheong (2-Dimensional Delaunay Triangulation Delaunay Triangulation) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +2 9-point FFT (3-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +2 5-point cyclic reduction (3-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +2 9-point ADI iteration + smooth guess (3-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +2 5-point FFT (3-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +2 9-point ADI iteration (3-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +2 5-point ADI iteration (3-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4409:44, 10 April 2023 diff hist +2 5-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4309:43, 10 April 2023 diff hist +2 5-point Gauss Seidel iteration (3-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4309:43, 10 April 2023 diff hist +2 9-point FFT (2-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4309:43, 10 April 2023 diff hist +2 5-point cyclic reduction (2-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4309:43, 10 April 2023 diff hist +2 9-point ADI iteration + smooth guess (2-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4309:43, 10 April 2023 diff hist +2 5-point FFT (2-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4309:43, 10 April 2023 diff hist +2 9-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4309:43, 10 April 2023 diff hist +2 5-point ADI iteration (2-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4309:43, 10 April 2023 diff hist +2 5-point SOR iteration (2-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4309:43, 10 April 2023 diff hist +2 5-point Gauss Seidel iteration (2-Dimensional Poisson Problem Poisson Problem) No edit summary current
- 09:4309:43, 10 April 2023 diff hist +2 TSPLIB (Minimum TSP The Traveling-Salesman Problem) No edit summary current
- 09:4309:43, 10 April 2023 diff hist −10 Kazuhisa Makino, Takeaki Uno; Section 5 (Enumerating Maximal Cliques, arbitrary graph Clique Problems) No edit summary current
- 09:4309:43, 10 April 2023 diff hist −10 Shuji Tsukiyama, Mikio Ide, Hiromu Ariyoshi, and Isao Shirakawa (Enumerating Maximal Cliques, arbitrary graph Clique Problems) No edit summary current
- 09:4309:43, 10 April 2023 diff hist −10 M. Chrobak and D. Eppstein (Enumerating Maximal Cliques, arbitrary graph Clique Problems) No edit summary current
- 09:4309:43, 10 April 2023 diff hist −10 Chiba and Nishizeki (Enumerating Maximal Cliques, arbitrary graph Clique Problems) No edit summary current
- 09:4309:43, 10 April 2023 diff hist −10 David Eppstein, Maarten Löffler, Darren Strash (Enumerating Maximal Cliques, arbitrary graph Clique Problems) No edit summary current
- 09:4309:43, 10 April 2023 diff hist −10 Tomita; Tanaka & Takahashi (Enumerating Maximal Cliques, arbitrary graph Clique Problems) No edit summary current
- 09:4309:43, 10 April 2023 diff hist −11 Akkoyunlu; E. A. (Enumerating Maximal Cliques, arbitrary graph Clique Problems) No edit summary current
- 09:4309:43, 10 April 2023 diff hist −10 Bron–Kerbosch algorithm (Enumerating Maximal Cliques, arbitrary graph Clique Problems) No edit summary current
- 09:4309:43, 10 April 2023 diff hist +4 Wang Y-K; Fan K-C; Horng J-T ( Graph Edit Distance Computation) No edit summary current
- 09:4309:43, 10 April 2023 diff hist −16 Schieber; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) No edit summary current
- 09:4309:43, 10 April 2023 diff hist +86 Tarjan's off-line lowest common ancestors algorithm (Off-Line Lowest Common Ancestor Lowest Common Ancestor) No edit summary current
- 09:4209:42, 10 April 2023 diff hist +2 Dekel; Nassimi & Sahni Parallel Implementation (Topological Sorting Topological Sorting) No edit summary current
- 09:4209:42, 10 April 2023 diff hist −10 Tarjan's DFS based algorithm (Topological Sorting Topological Sorting) No edit summary current
- 09:4209:42, 10 April 2023 diff hist −10 Kahn's algorithm (Topological Sorting Topological Sorting) No edit summary current
- 09:4209:42, 10 April 2023 diff hist +1 Chan's algorithm Parallel Implementation ( Variance Calculations) No edit summary current
- 09:4209:42, 10 April 2023 diff hist −10 Weighted incremental algorithm ( Variance Calculations) No edit summary current
- 09:4209:42, 10 April 2023 diff hist −10 Welford's Online algorithm ( Variance Calculations) No edit summary current
- 09:4209:42, 10 April 2023 diff hist −10 Two-pass algorithm ( Variance Calculations) No edit summary current
- 09:4209:42, 10 April 2023 diff hist −10 Naïve algorithm ( Variance Calculations) No edit summary current
- 09:4209:42, 10 April 2023 diff hist −7 Bowyer–Watson algorithm (Voronoi Diagrams Voronoi Diagrams) No edit summary current
- 09:4209:42, 10 April 2023 diff hist +3 Linde–Buzo–Gray algorithm ( Voronoi Diagrams) No edit summary current
- 09:4209:42, 10 April 2023 diff hist −7 Fortune's algorithm (Voronoi Diagrams Voronoi Diagrams) No edit summary current
- 09:4209:42, 10 April 2023 diff hist −20 Optimal Register Allocation (ORA), Goodwin & Wilken Algorithm (Global Register Allocation Register Allocation) No edit summary current
- 09:4209:42, 10 April 2023 diff hist +3 Generalized expectation maximization (GEM) algorithm ( Maximum Likelihood Parameters) No edit summary current
- 09:4209:42, 10 April 2023 diff hist +2 Expectation conditional maximization (ECM) ( Maximum Likelihood Parameters) No edit summary current
- 09:4209:42, 10 April 2023 diff hist +462 N Knuth–Bendix algorithm (Coset Enumeration Coset Enumeration) Created page with "== Time Complexity == $O({1.5}^n n^{2} logn)$ == Space Complexity == $O(ng)$??? words (Can store a table whose number of required registers is the product of the number of generators (n) and the number of cosets (O(g))) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1970 == Reference == https://www.cs.tufts.edu/~nr/cs257/archive/don-knuth/knuth-bendix.pdf" current
- 09:4209:42, 10 April 2023 diff hist +387 N Haselgrove-Leech-Trotter (HLT) algorithm (Coset Enumeration Coset Enumeration) Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O(ng)$? words (Implementation stores a table whose number of required registers is the product of the number of generators (n) and the number of cosets (O(g))) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1940 == Reference ==" current
- 09:4209:42, 10 April 2023 diff hist +501 N Todd–Coxeter algorithm (Coset Enumeration Coset Enumeration) Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O(gkc)$ words (Defines O(k) tables, each with O(g) columns and O(c) rows) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1936 == Reference == https://www.cambridge.org/core/journals/proceedings-of-the-edinburgh-mathematical-society/article/practical-method-for-enumerating-cosets-of-a-finite-abstract-group/030657..." current
- 09:4209:42, 10 April 2023 diff hist +3 Divide-and-conquer (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods)) No edit summary current
- 09:4109:41, 10 April 2023 diff hist −10 Weiler–Atherton clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping) No edit summary current
- 09:4109:41, 10 April 2023 diff hist −10 Vatti clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping) No edit summary current
- 09:4109:41, 10 April 2023 diff hist −10 Sutherland–Hodgman algorithm (Polygon Clipping with Convex Clipping Polygon Polygon Clipping) No edit summary current
- 09:4109:41, 10 April 2023 diff hist −10 Greiner–Hormann clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping) No edit summary current
- 09:4109:41, 10 April 2023 diff hist −10 Gupta-Sproull algorithm (Line Drawing Line Drawing) No edit summary current
- 09:4109:41, 10 April 2023 diff hist −10 Xiaolin Wu's line algorithm (Line Drawing Line Drawing) No edit summary current
- 09:4109:41, 10 April 2023 diff hist −10 Bresenham's line algorithm (Line Drawing Line Drawing) No edit summary current
- 09:4109:41, 10 April 2023 diff hist −10 Digital Differential Analyzer (Line Drawing Line Drawing) No edit summary current
- 09:4109:41, 10 April 2023 diff hist −10 Naive algorithm (Line Drawing Line Drawing) No edit summary current
- 09:4109:41, 10 April 2023 diff hist +2 Wang-Zhu-Cantor additive FFT (Discrete Fourier Transform Discrete Fourier Transform) No edit summary current
- 09:4109:41, 10 April 2023 diff hist +2 Von zur Gathen-Gerhard additive FFT (Discrete Fourier Transform Discrete Fourier Transform) No edit summary current
- 09:4109:41, 10 April 2023 diff hist +3 Extended Split Radix FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform) No edit summary current
- 09:4109:41, 10 April 2023 diff hist +3 Bergland; Glenn radix-8 algorithm (Discrete Fourier Transform Discrete Fourier Transform) No edit summary current
- 09:4109:41, 10 April 2023 diff hist +3 Gentleman; Morven and Gordon Sande radix-4 algorithm (Discrete Fourier Transform Discrete Fourier Transform) No edit summary current
- 09:4109:41, 10 April 2023 diff hist +3 Yavne Split Radix FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform) No edit summary current
- 09:4109:41, 10 April 2023 diff hist +3 Bruun's FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform) No edit summary current
- 09:4109:41, 10 April 2023 diff hist −10 Heap's algorithm (All Permutations All Permutations) No edit summary current
- 09:4109:41, 10 April 2023 diff hist −10 Tompkins–Paige algorithm (All Permutations All Permutations) No edit summary current
- 09:4009:40, 10 April 2023 diff hist −10 Steinhaus–Johnson–Trotter algorithm (All Permutations All Permutations) No edit summary current
- 09:4009:40, 10 April 2023 diff hist −9 SMAWK algorithm ( Minimum value in each row of an implicitly-defined totally monotone matrix) No edit summary current
- 09:4009:40, 10 April 2023 diff hist −10 Naive algorithm ( Minimum value in each row of an implicitly-defined totally monotone matrix) No edit summary current
- 09:4009:40, 10 April 2023 diff hist +4 Faugère F5 algorithm (Gröbner Bases Gröbner Bases) No edit summary current
- 09:4009:40, 10 April 2023 diff hist +4 Faugère F4 algorithm (Gröbner Bases Gröbner Bases) No edit summary current
- 09:4009:40, 10 April 2023 diff hist +2 Ellipsoid method (General, Constrained optimization Convex Optimization (Non-linear)) No edit summary current
- 09:3909:39, 10 April 2023 diff hist +1 Bader & Cong Parallel Implementation (Undirected, General MST Minimum Spanning Tree (MST)) No edit summary current
- 09:3909:39, 10 April 2023 diff hist +1 Incremental convex hull algorithm; Michael Kallay ( Convex Hull) No edit summary current
- 09:3909:39, 10 April 2023 diff hist +1 Probabilistic Convolution Tree (Change-Making Problem Change-Making Problem) No edit summary current
- 09:3909:39, 10 April 2023 diff hist +9 Srba (SLAM Algorithms SLAM Algorithms) No edit summary current
- 09:3909:39, 10 April 2023 diff hist +10 FastSlam (SLAM Algorithms SLAM Algorithms) No edit summary current
- 09:3809:38, 10 April 2023 diff hist +3 Quasi-linear Topological watershed ( Image Segmentation) No edit summary current
- 09:3709:37, 10 April 2023 diff hist +3 Chen's lambda-connected segmentation ( Image Segmentation) No edit summary current
- 09:3709:37, 10 April 2023 diff hist +3 Dual clustering - Guberman ( Image Segmentation) No edit summary current
- 09:3709:37, 10 April 2023 diff hist +3 Barghout; Lauren Visual Taxometric approach ( Image Segmentation) No edit summary current
- 09:3709:37, 10 April 2023 diff hist +2 Hanrahan–Krueger (Specular Reflection Texture Mapping) No edit summary current
- 09:3709:37, 10 April 2023 diff hist +3 Ward anisotropic (Specular Reflection Texture Mapping) No edit summary current
- 09:3709:37, 10 April 2023 diff hist +3 Y. Dufournaud; C. Schmid; and R. Horaud 2000 (Blob Detection Feature Detection) No edit summary current
- 09:3709:37, 10 April 2023 diff hist +3 T. Lindeberg DoG 2015 (Blob Detection Feature Detection) No edit summary current
- 09:3609:36, 10 April 2023 diff hist +1 Förstner algorithm 1987 (Corner Detection Feature Detection) No edit summary current
- 09:3609:36, 10 April 2023 diff hist +460 N Fortune ( Delaunay Triangulation) Created page with "== Time Complexity == $O(n \log n)$ == Space Complexity == $O(n)$ words (See Fortune's Algorithm (Voronoi diagrams); Voronoi diagram gives us O(n) circumcenters which can be used to find the O(n) triangles) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM? == Year == 1987 == Reference == http://www.wias-berlin.de/people/si/course/files/Fortune87-SweepLine-Voronoi.pdf" current
- 09:3609:36, 10 April 2023 diff hist +1 Harvey; Hoeven; Lecerf ( Multiplication) No edit summary Tag: Manual revert
- 09:3609:36, 10 April 2023 diff hist −9 Covanov and Thomé ( Multiplication) No edit summary Tags: Manual revert Reverted
- 09:3509:35, 10 April 2023 diff hist +9 Covanov and Thomé ( Multiplication) No edit summary Tags: Manual revert Reverted
- 09:3509:35, 10 April 2023 diff hist −1 Harvey; Hoeven; Lecerf ( Multiplication) No edit summary Tags: Manual revert Reverted
- 09:3409:34, 10 April 2023 diff hist +3 Munro’s algorithm (SCCs Strongly Connected Components) No edit summary current
- 09:3409:34, 10 April 2023 diff hist +2 Fleischer forward-backward (FB) algorithm (SCCs Strongly Connected Components) No edit summary current
- 09:3409:34, 10 April 2023 diff hist +95 Miller; Stout (2-dimensional Convex Hull) No edit summary current
- 09:3409:34, 10 April 2023 diff hist +94 Preparata and Hong (2-dimensional; 3-dimensional Convex Hull) No edit summary current
- 09:3409:34, 10 April 2023 diff hist +3 Graham (2-dimensional Convex Hull) No edit summary current
- 09:3409:34, 10 April 2023 diff hist +148 Goodrich (Reporting all intersection points, line segments Line segment intersection) No edit summary current
- 09:3409:34, 10 April 2023 diff hist +1 Boissonnat; Snoeyink (Reporting all intersection points, generalized segments Line segment intersection) No edit summary current
- 09:3409:34, 10 April 2023 diff hist +1 Balaban. (Reporting all intersection points, generalized segments Line segment intersection) No edit summary current
- 09:3409:34, 10 April 2023 diff hist +1 Jean-Daniel Boissonnat and Franco P. Preparata. (Reporting all intersection points, generalized segments Line segment intersection) No edit summary current
- 09:3409:34, 10 April 2023 diff hist +2 NIEVERGELT. J.. AND PREPARATA (Section 3) (Reporting all intersection points, convex polygons Line segment intersection) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +2 Chazelle & Edelsbrunner (Reporting all intersection points, line segments Line segment intersection) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +19 Lee and Sidford ( Linear Programming) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +209 Cohen; Lee and Song ( Linear Programming) No edit summary current
- 09:3309:33, 10 April 2023 diff hist −25 Terlaky's Criss-cross algorithm ( Linear Programming) No edit summary current
- 09:3309:33, 10 April 2023 diff hist −25 Simplex Algorithm ( Linear Programming) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +3 Harrow (Quantum) (Sparse Linear System Linear System) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +409 N Conjugate Gradient (Positive Definite Matrix Linear System) Created page with "== Time Complexity == $O(m k^{0.5})$ == Space Complexity == $O(m)$ words (http://www.cs.cmu.edu/~quake-papers/painless-conjugate-gradient.pdf) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1952 == Reference == https://nvlpubs.nist.gov/nistpubs/jres/049/jresv49n6p409_A1b.pdf" current
- 09:3309:33, 10 April 2023 diff hist −97 Beigel & Eppstein (3-Graph Coloring Graph Coloring) No edit summary current Tag: Manual revert
- 09:3309:33, 10 April 2023 diff hist +97 Beigel & Eppstein (3-Graph Coloring Graph Coloring) No edit summary Tags: Manual revert Reverted
- 09:3309:33, 10 April 2023 diff hist +4 Goldberg & Rao (Integer Maximum Flow Maximum Flow) No edit summary
- 09:3309:33, 10 April 2023 diff hist −1 Goldberg & Rao (Integer Maximum Flow Maximum Flow) No edit summary
- 09:3309:33, 10 April 2023 diff hist +3 Phillips & Westbrook (st-Maximum Flow Maximum Flow) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +1 King et al. (KRT) (st-Maximum Flow Maximum Flow) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +1 Alon (st-Maximum Flow Maximum Flow) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +2 Cheriyan et al. (st-Maximum Flow Maximum Flow) No edit summary current
- 09:3309:33, 10 April 2023 diff hist 0 Cheriyan & Hagerup (st-Maximum Flow Maximum Flow) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +3 Ahuja & Orlin ( Maximum Flow) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +3 Goldberg & Tarjan ( Maximum Flow) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +3 Sleator & Tarjan ( Maximum Flow) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +160 Dinitz (with dynamic trees) ( Maximum Flow) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +75 Dantzig ( Maximum Flow) No edit summary current
- 09:3309:33, 10 April 2023 diff hist −33 T. C. Hu ; M. T. Shing (Matrix Chain Ordering Problem Matrix Chain Multiplication) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +1 Spreadsort (Non-Comparison Sorting Sorting) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +50 Flash Sort (Non-Comparison Sorting Sorting) No edit summary current
- 09:3309:33, 10 April 2023 diff hist −13 Naive sorting (Non-Comparison Sorting Sorting) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +60 Thorup's Sorting Algorithm (Comparison Sorting Sorting) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +2 Bitonic Merge Sort Parallel Implementation (Comparison Sorting Sorting) No edit summary current
- 09:3309:33, 10 April 2023 diff hist +343 N Shell Sort (Sedgewick) (Comparison Sorting Sorting) Created page with "== Time Complexity == $O(n^{1.{3}3})$ == Space Complexity == $O({1})$ words (in-situ sorting) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1986 == Reference == https://www.sciencedirect.com/science/article/pii/0196677486900015?via%3Dihub" current
- 09:3309:33, 10 April 2023 diff hist +312 N Shell Sort (Pratt) (Comparison Sorting Sorting) Created page with "== Time Complexity == $O(n \log^{2} n)$ == Space Complexity == $O({1})$ words (in-situ sorting) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1971 == Reference == https://apps.dtic.mil/sti/pdfs/AD0740110.pdf" current
- 09:3309:33, 10 April 2023 diff hist +313 N Shell Sort (Frank & Lazarus) (Comparison Sorting Sorting) Created page with "== Time Complexity == $O(n^{1.5})$ == Space Complexity == $O({1})$ words (in-situ sorting) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1960 == Reference == https://dl.acm.org/citation.cfm?doid=366947.366957" current
- 09:3209:32, 10 April 2023 diff hist +311 N Shell Sort (Shell) (Comparison Sorting Sorting) Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O({1})$ words (in-situ sorting) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1959 == Reference == https://dl.acm.org/citation.cfm?doid=368370.368387" current
- 09:3209:32, 10 April 2023 diff hist +2 Quick Sort (Comparison Sorting Sorting) No edit summary current
- 09:3209:32, 10 April 2023 diff hist +115 Tree sort (Comparison Sorting Sorting) No edit summary current
- 09:3209:32, 10 April 2023 diff hist +444 N Khuller; Matias ( Closest Pair Problem) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$, not sure if this is auxiliary not mentioned (https://www.sciencedirect.com/science/article/pii/S0890540185710498, Theorem 2.3) == Description == Randomized Sieve == Approximate? == Exact == Randomized? == Yes, Las Vegas == Model of Computation == not mentioned == Year == 1995 == Reference == https://www.sciencedirect.com/science/article/pii/S0890540185710498" current
- 09:3209:32, 10 April 2023 diff hist +3 Petford and Welsh (3-Graph Coloring Graph Coloring) No edit summary current
- 09:3209:32, 10 April 2023 diff hist +9 Rao-Blackwellized Particle Filtering SLAM (SLAM Algorithms SLAM Algorithms) No edit summary current
- 09:3209:32, 10 April 2023 diff hist +9 Compressed Extended KF (SLAM Algorithms SLAM Algorithms) No edit summary current
- 09:3209:32, 10 April 2023 diff hist +9 UKF (SLAM Algorithms SLAM Algorithms) No edit summary current
- 09:3209:32, 10 April 2023 diff hist +9 EKF SLAM (SLAM Algorithms SLAM Algorithms) No edit summary current
- 09:3209:32, 10 April 2023 diff hist +1 Image analogies Hertzmann (Texture Synthesis Texture Synthesis) No edit summary current
- 09:3209:32, 10 April 2023 diff hist +12 Czumaj (Approximate MCOP Matrix Chain Multiplication) No edit summary Tags: Manual revert Reverted
- 09:3209:32, 10 April 2023 diff hist −12 Czumaj (Approximate MCOP Matrix Chain Multiplication) No edit summary Tags: Manual revert Reverted
- 09:3009:30, 10 April 2023 diff hist +2 Fourier–Motzkin elimination ( Linear Programming) No edit summary current
- 09:3009:30, 10 April 2023 diff hist 0 Brute-force search (3-Graph Coloring Graph Coloring) No edit summary current
- 09:3009:30, 10 April 2023 diff hist +11 Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product) No edit summary Tag: Manual revert
- 09:3009:30, 10 April 2023 diff hist −38 Strassen's algorithm (Matrix Multiplication Matrix Product) No edit summary Tags: Manual revert Reverted
- 09:3009:30, 10 April 2023 diff hist −11 Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product) No edit summary Tags: Manual revert Reverted
- 09:3009:30, 10 April 2023 diff hist +38 Strassen's algorithm (Matrix Multiplication Matrix Product) No edit summary Tags: Manual revert Reverted
- 09:3009:30, 10 April 2023 diff hist +3 Galil & Naamad ( Maximum Flow) No edit summary current
- 09:3009:30, 10 April 2023 diff hist +3 Edmonds & Karp ( Maximum Flow) No edit summary current
- 09:3009:30, 10 April 2023 diff hist −34 Wagner and Fischer (LCS Longest Common Subsequence) No edit summary current
- 09:3009:30, 10 April 2023 diff hist +66 Dynamic Programming Algorithm (S. S. Godbole) (Matrix Chain Ordering Problem Matrix Chain Multiplication) No edit summary current
- 09:3009:30, 10 April 2023 diff hist +1 Brute Force (Matrix Chain Ordering Problem Matrix Chain Multiplication) No edit summary current
- 09:3009:30, 10 April 2023 diff hist +4 Hoare's Selection Algorithm (QuickSelect) (kth Order Statistic kth Order Statistic) No edit summary current
- 09:3009:30, 10 April 2023 diff hist −13 Naive Selection (kth Order Statistic kth Order Statistic) No edit summary current
- 09:2909:29, 10 April 2023 diff hist +2 Heap Sort (Comparison Sorting Sorting) No edit summary current
- 09:2909:29, 10 April 2023 diff hist +2 Intro Sort (Comparison Sorting Sorting) No edit summary current
- 09:2909:29, 10 April 2023 diff hist 0 Bubble Sort (Comparison Sorting Sorting) No edit summary current
- 09:2909:29, 10 April 2023 diff hist +2 Merge Sort (Comparison Sorting Sorting) No edit summary current
- 09:2909:29, 10 April 2023 diff hist 0 Selection Sort (Comparison Sorting Sorting) No edit summary current
- 09:2909:29, 10 April 2023 diff hist 0 Naive sorting (Comparison Sorting Sorting) No edit summary current
- 09:2909:29, 10 April 2023 diff hist +388 N Nivasch (Cycle Detection Cycle Detection) Created page with "== Time Complexity == $O(\mu + \lambda)$ == Space Complexity == $O(\log\mu)$ Stack size (https://www.gabrielnivasch.org/fun/cycle-detection) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == not mentioned == Year == 2004 == Reference == https://drive.google.com/file/d/16H_lrjeaBJqWvcn07C_w-6VNHldJ-ZZl/view" current
- 09:2909:29, 10 April 2023 diff hist +400 N Sedgewick; Szymanski; and Yao (Cycle Detection Cycle Detection) Created page with "== Time Complexity == $(\mu + \lambda)({1}+\Theta({1}/sqrt(M)))$ == Space Complexity == M Memory cells (https://epubs.siam.org/doi/abs/10.1137/0211030?journalCode=smjcat) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1982 == Reference == https://epubs.siam.org/doi/abs/10.1137/0211030?journalCode=smjcat" current
- 09:2909:29, 10 April 2023 diff hist +380 N Eppstein (Subset Sum The Subset-Sum Problem) Created page with "== Time Complexity == $\tilde{O}(n max(S))$ == Space Complexity == $O(t logt)$ (https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference == https://www.sciencedirect.com/science/article/abs/pii/S019667749690841X?via%3Dihub" current
- 09:2909:29, 10 April 2023 diff hist +305 N Compression/Clustering (Vector Quantization) (k-ANNS Nearest Neighbor Search) Created page with "== Time Complexity == Varies by codebook structure == Space Complexity == Varies by codebook structure (Table 2) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1992 == Reference ==" current
- 09:2909:29, 10 April 2023 diff hist +418 N Projected radial search (k-ANNS for a dense 3D map of geometric points Nearest Neighbor Search) Created page with "== Time Complexity == $O(k)$ == Space Complexity == $O({1})$ words (Derived: There are 5 local variables and no tables or lists aside from input/output) == Description == == Approximate? == Approximate Approximation Factor: ? == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2013 == Reference == http://www.araa.asn.au/acra/acra2013/papers/pap148s1-file1.pdf" current
- 09:2909:29, 10 April 2023 diff hist +474 N Locality-sensitive hashing (k-ANNS Nearest Neighbor Search) Created page with "== Time Complexity == $O(nLkt)$ (pre-processing) $O(L(kt+dnP_2^k))$ (query-time) == Space Complexity == $O(nL)$ hash table cells (https://en.wikipedia.org/wiki/Locality-sensitive_hashing#LSH_algorithm_for_nearest_neighbor_search) == Description == == Approximate? == Approximate Approximation Factor: c == Randomized? == No, deterministic == Model of Computation == == Year == 2010 == Reference == http://infolab.stanford.edu/~ullman/mmds/ch3n.pdf" current
- 09:2909:29, 10 April 2023 diff hist +419 N Hierarchical Navigable Small World (HNSW) (k-ANNS Nearest Neighbor Search) Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(M)$ bytes of memory (https://arxiv.org/abs/1603.09320, "Memory usage is proportional to choice of M") == Description == == Approximate? == Approximate Approximation Factor: ? experimental results == Randomized? == No, deterministic == Model of Computation == == Year == 2018 == Reference == https://doi.org/10.1109/TPAMI.2018.2889473" current
- 09:2809:28, 10 April 2023 diff hist +2 All-Integers 3SUM No edit summary current
- 09:2809:28, 10 April 2023 diff hist +2 3SUM' No edit summary current
- 09:2809:28, 10 April 2023 diff hist +4 Real 3SUM No edit summary current
- 09:2809:28, 10 April 2023 diff hist +4 3SUM No edit summary current
- 09:2809:28, 10 April 2023 diff hist +6 Bichromatic Hamming Close Pair No edit summary current
- 09:2809:28, 10 April 2023 diff hist +2 Dynamic Dihedral Rotation Queries No edit summary current
- 09:2809:28, 10 April 2023 diff hist +2 Static Dihedral Rotation Queries No edit summary current
- 09:2809:28, 10 April 2023 diff hist +55 Generalized Büchi Games No edit summary current
- 09:2809:28, 10 April 2023 diff hist +55 Disjunctive coBüchi Objectives No edit summary current
- 09:2809:28, 10 April 2023 diff hist −19 Disjunctive Queries of Safety in Graphs No edit summary current
- 09:2809:28, 10 April 2023 diff hist +6 Safety in Graphs No edit summary current
- 09:2809:28, 10 April 2023 diff hist −19 Conjunctive Safety Queries in MDPs No edit summary current
- 09:2809:28, 10 April 2023 diff hist −19 Disjunctive Safety Queries in MDPs No edit summary current
- 09:2809:28, 10 April 2023 diff hist +6 Safety in MDPs No edit summary current
- 09:2809:28, 10 April 2023 diff hist −19 Conjunctive Reachability Queries in MDPs No edit summary current
- 09:2809:28, 10 April 2023 diff hist −19 Disjunctive Reachability Queries in MDPs No edit summary current
- 09:2809:28, 10 April 2023 diff hist +6 Reachability in MDPs No edit summary current
- 09:2809:28, 10 April 2023 diff hist +2 RNA Folding No edit summary current
- 09:2809:28, 10 April 2023 diff hist +4 Ap-reach No edit summary current
- 09:2809:28, 10 April 2023 diff hist +4 2-sensitive incremental st-reach No edit summary current
- 09:2809:28, 10 April 2023 diff hist +4 1-sensitive incremental ss-reach No edit summary current
- 09:2809:28, 10 April 2023 diff hist +4 Constant sensitivity incremental ST-Reach No edit summary current
- 09:2809:28, 10 April 2023 diff hist +4 St-Reach No edit summary current
- 09:2809:28, 10 April 2023 diff hist +4 ST-Reach No edit summary current
- 09:2809:28, 10 April 2023 diff hist +6 Sensitive incremental No edit summary current
- 09:2809:28, 10 April 2023 diff hist +2 Online Vector-Matrix-Vector Multiplication No edit summary current
- 09:2809:28, 10 April 2023 diff hist +2 Online Matrix-Vector Multiplication No edit summary current
- 09:2809:28, 10 April 2023 diff hist +6 Shortest k-Cycle No edit summary current
- 09:2809:28, 10 April 2023 diff hist +4 Shortest Cycle No edit summary current
- 09:2709:27, 10 April 2023 diff hist +4 Price Query No edit summary current
- 09:2709:27, 10 April 2023 diff hist +4 Independent Set Queries No edit summary current
- 09:2709:27, 10 April 2023 diff hist +4 All Pairs Minimum Witness No edit summary current
- 09:2709:27, 10 April 2023 diff hist +4 Minimum Witness Finding No edit summary current
- 09:2709:27, 10 April 2023 diff hist +3 Multiple Local Alignment No edit summary current
- 09:2709:27, 10 April 2023 diff hist +1 Local Alignment No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 Geometric Base No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 3D Motion Planning No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 Planar Motion Planning No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 Visible Triangle No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 Visibility From Infinity No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 Visibility Between Segments No edit summary current
- 09:2709:27, 10 April 2023 diff hist +4 Weighted Depth No edit summary current
- 09:2709:27, 10 April 2023 diff hist +4 Max-Weight Rectangle No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 Point Covering No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 Triangle Measure No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 Hole in Union No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 Triangles Cover Triangle No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 Strips Cover Box No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 Separator2 No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 Separator1 No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 Point on 3 Lines No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 3 Points on Line No edit summary current
- 09:2709:27, 10 April 2023 diff hist +4 Partial Match No edit summary current
- 09:2709:27, 10 April 2023 diff hist +4 Dynamic Time Warping No edit summary current
- 09:2709:27, 10 April 2023 diff hist +4 Frechet Distance No edit summary current
- 09:2709:27, 10 April 2023 diff hist +2 Metricity No edit summary current
- 09:2709:27, 10 April 2023 diff hist +1 Triangle Collection* No edit summary current
- 09:2709:27, 10 April 2023 diff hist +1 Triangle Detection No edit summary current
- 09:2709:27, 10 April 2023 diff hist +1 Triangle in Unweighted Graph No edit summary current
- 09:2709:27, 10 April 2023 diff hist +1 Minimum Triangle No edit summary current
- 09:2709:27, 10 April 2023 diff hist +1 Nondecreasing Triangle No edit summary current
- 09:2709:27, 10 April 2023 diff hist +1 Negative Triangle Listing No edit summary current
- 09:2509:25, 10 April 2023 diff hist −35 Tower of Hanoi No edit summary
- 09:2509:25, 10 April 2023 diff hist +9 Frequent Words with Mismatches Problem No edit summary
- 09:2509:25, 10 April 2023 diff hist +2 Median String Problem with Binary Alphabets No edit summary current
- 09:2509:25, 10 April 2023 diff hist +2 Median String Problem with Bounded Alphabets No edit summary current
- 09:2509:25, 10 April 2023 diff hist −8 Median String Problem with Unbounded Alphabets No edit summary
- 09:2509:25, 10 April 2023 diff hist +4 N-Queens Completion No edit summary current
- 09:2509:25, 10 April 2023 diff hist +2 Constructing Solutions No edit summary current
- 09:2409:24, 10 April 2023 diff hist +2 Counting Solutions No edit summary
- 09:2409:24, 10 April 2023 diff hist +2 Turnpike Problem No edit summary
- 09:2409:24, 10 April 2023 diff hist +5 Change-Making Problem No edit summary
- 09:2409:24, 10 April 2023 diff hist +4 Transitive Reduction Problem of Directed Graphs No edit summary
- 09:2409:24, 10 April 2023 diff hist +6 Self-Balancing Trees Search No edit summary
- 09:2409:24, 10 April 2023 diff hist +6 Self-Balancing Trees Deletion No edit summary
- 09:2409:24, 10 April 2023 diff hist +6 Self-Balancing Trees Insertion No edit summary
- 09:2409:24, 10 April 2023 diff hist +16 Self-Balancing Trees Creation No edit summary
- 09:2409:24, 10 April 2023 diff hist +2 Rod-Cutting Problem No edit summary
- 09:2409:24, 10 April 2023 diff hist +2 Discrete Logarithm Over Finite Fields No edit summary
- 09:2409:24, 10 April 2023 diff hist +10 Sequence-To-Graph Alignment No edit summary current
- 09:2409:24, 10 April 2023 diff hist +2 Integer Relation Among Integers No edit summary current
- 09:2409:24, 10 April 2023 diff hist +2 Integer Relation Among Reals No edit summary current
- 09:2409:24, 10 April 2023 diff hist +10 Determinant of Matrices with Integer Entries No edit summary
- 09:2409:24, 10 April 2023 diff hist +2 Undirected Wiener Index No edit summary current
- 09:2409:24, 10 April 2023 diff hist +6 Minimum Wiener Connector Problem No edit summary current
- 09:2409:24, 10 April 2023 diff hist −24 Maximum Cut No edit summary current
- 09:2409:24, 10 April 2023 diff hist −3 D-Neighborhood of a String No edit summary
- 09:2409:24, 10 April 2023 diff hist +1 SLAM Algorithms No edit summary current
- 09:2409:24, 10 April 2023 diff hist +11 Clock Synchronization in Distributed Systems No edit summary
- 09:2409:24, 10 April 2023 diff hist +12 Image Segmentation No edit summary current
- 09:2409:24, 10 April 2023 diff hist +86 Point-in-Polygon No edit summary
- 09:2409:24, 10 April 2023 diff hist +5 Specular Reflection No edit summary current
- 09:2409:24, 10 April 2023 diff hist +60 Cyclic Peptide Sequencing Problem No edit summary
- 09:2409:24, 10 April 2023 diff hist +24 Distributed Locking Algorithms No edit summary
- 09:2409:24, 10 April 2023 diff hist +3 Texture Synthesis No edit summary current
- 09:2409:24, 10 April 2023 diff hist +50 InDegree Analysis No edit summary
- 09:2409:24, 10 April 2023 diff hist −6 All Maximal Non-Branching Paths in a Graph No edit summary
- 09:2409:24, 10 April 2023 diff hist +99 Motif Search No edit summary
- 09:2409:24, 10 April 2023 diff hist +46 Weighted Set-Covering No edit summary current
- 09:2309:23, 10 April 2023 diff hist +18 Unweighted Set-Covering No edit summary current
- 09:2309:23, 10 April 2023 diff hist +1 Optimal Policies for MDPs No edit summary
- 09:2309:23, 10 April 2023 diff hist +25 Filtering Problem (Stochastic Processes) No edit summary
- 09:2309:23, 10 April 2023 diff hist +6 Blob Detection No edit summary current
- 09:2309:23, 10 April 2023 diff hist +589 Corner Detection No edit summary current
- 09:2309:23, 10 April 2023 diff hist +4 Matrix Factorization No edit summary
- 09:2309:23, 10 April 2023 diff hist +66 Maximum Likelihood Methods in Unknown Latent Variables No edit summary
- 09:2309:23, 10 April 2023 diff hist +11 Mesh Parameterization No edit summary current
- 09:2309:23, 10 April 2023 diff hist +72 Hyperbolic Spline Interpolation No edit summary
- 09:2309:23, 10 April 2023 diff hist +14 Duplicate Elimination No edit summary
- 09:2309:23, 10 April 2023 diff hist +3 Subtree Isomorphism No edit summary current
- 09:2309:23, 10 April 2023 diff hist +2 Largest Common Subtree No edit summary current
- 09:2309:23, 10 April 2023 diff hist +18 Graph Isomorphism, Bounded Number of Vertices of Each Color No edit summary current
- 09:2309:23, 10 April 2023 diff hist −38 Longest Palindromic Substring No edit summary
- 09:2309:23, 10 April 2023 diff hist +144 Entity Resolution No edit summary
- 09:2309:23, 10 April 2023 diff hist +4 Constructing Suffix Trees No edit summary
- 09:2309:23, 10 April 2023 diff hist +2 Maximum Square Subarray No edit summary current
- 09:2309:23, 10 April 2023 diff hist +2 2D Maximum Subarray No edit summary current
- 09:2309:23, 10 April 2023 diff hist −22 1D Maximum Subarray No edit summary
- 09:2309:23, 10 April 2023 diff hist −20 Maximum Subarray No edit summary current
- 09:2309:23, 10 April 2023 diff hist −59 Longest Path on Interval Graphs No edit summary
- 09:2309:23, 10 April 2023 diff hist +13 Stable Pair Checking No edit summary current
- 09:2309:23, 10 April 2023 diff hist +18 Stable Matching Verification No edit summary current
- 09:2309:23, 10 April 2023 diff hist +45 Boolean d-Attribute Stable Matching No edit summary current
- 09:2309:23, 10 April 2023 diff hist +2 Stable Roommates Problem No edit summary
- 09:2309:23, 10 April 2023 diff hist +2 Almost Stable Marriage Problem No edit summary current
- 09:2209:22, 10 April 2023 diff hist +2 Stable Marriage Problem No edit summary
- 09:2209:22, 10 April 2023 diff hist +5 Cryptanalysis of Linear Feedback Shift Registers No edit summary
- 09:2209:22, 10 April 2023 diff hist +42 Factorization of Polynomials Over Finite Fields No edit summary
- 09:2209:22, 10 April 2023 diff hist +24 Lossless Compression No edit summary current
- 09:2209:22, 10 April 2023 diff hist +82 Lossy Compression No edit summary
- 09:2209:22, 10 April 2023 diff hist +32 Finding Frequent Itemsets No edit summary
- 09:2209:22, 10 April 2023 diff hist +30 CFG Recognition No edit summary
- 09:2209:22, 10 April 2023 diff hist −40 CFG Parsing No edit summary
- 09:2209:22, 10 April 2023 diff hist +52 The Vertex Cover Problem, Degrees Bounded By 3 No edit summary
- 09:2209:22, 10 April 2023 diff hist +32 The Vertex Cover Problem No edit summary
- 09:2209:22, 10 April 2023 diff hist −53 Disk Scheduling No edit summary
- 09:2209:22, 10 April 2023 diff hist +42 4NF Decomposition for Conflict-Free Dependency Sets No edit summary current
- 09:2209:22, 10 April 2023 diff hist +42 4NF Decomposition for Functional and Multivalued Dependency Sets No edit summary current
- 09:2209:22, 10 April 2023 diff hist +42 4NF Decomposition No edit summary current
- 09:2209:22, 10 April 2023 diff hist +42 Decisional BCNF No edit summary
- 09:2209:22, 10 April 2023 diff hist +42 BCNF Decomposition No edit summary
- 09:2209:22, 10 April 2023 diff hist +45 Multivalued Dependency Inference Problem No edit summary
- 09:2209:22, 10 April 2023 diff hist +46 Functional Dependency Inference Problem No edit summary
- 09:2209:22, 10 April 2023 diff hist +6 Subset Sum No edit summary
- 09:2209:22, 10 April 2023 diff hist +43 De Novo Genome Assembly No edit summary
- 09:2209:22, 10 April 2023 diff hist +137 Delaunay Triangulation No edit summary
- 09:2209:22, 10 April 2023 diff hist +46 3-Dimensional Poisson Problem No edit summary
- 09:2209:22, 10 April 2023 diff hist +46 2-Dimensional Poisson Problem No edit summary
- 09:2209:22, 10 April 2023 diff hist +4 Approximate TSP No edit summary current
- 09:2209:22, 10 April 2023 diff hist +7 Maximum TSP No edit summary current
- 09:2209:22, 10 April 2023 diff hist +6 Minimum TSP No edit summary
- 09:2209:22, 10 April 2023 diff hist +26 Max-Weight k-Clique No edit summary current
- 09:2209:22, 10 April 2023 diff hist +26 Min-Weight k-Clique No edit summary current
- 09:2209:22, 10 April 2023 diff hist +26 Exact k-Clique No edit summary current
- 09:2209:22, 10 April 2023 diff hist +26 K-Clique No edit summary current
- 09:2209:22, 10 April 2023 diff hist −77 Enumerating Maximal Cliques, arbitrary graph No edit summary
- 09:2209:22, 10 April 2023 diff hist +6 Inexact GED No edit summary
- 09:2109:21, 10 April 2023 diff hist +6 Exact GED No edit summary
- 09:2109:21, 10 April 2023 diff hist +4 Lowest Common Ancestors with Linking and Cutting No edit summary current
- 09:2109:21, 10 April 2023 diff hist +4 Lowest Common Ancestor with Linking No edit summary current
- 09:1909:19, 10 April 2023 diff hist −4 K-dimensional space, $l m$ (or $l \infty$) norm No edit summary current
- 09:1909:19, 10 April 2023 diff hist +6 Directed (Optimum Branchings), Super Dense MST No edit summary current
- 09:1909:19, 10 April 2023 diff hist +6 Directed (Optimum Branchings), General MST No edit summary current
- 09:1909:19, 10 April 2023 diff hist +6 Undirected, Integer Weights MST No edit summary current
- 09:1909:19, 10 April 2023 diff hist +6 Undirected, Planar MST No edit summary current
- 09:1909:19, 10 April 2023 diff hist +6 Undirected, Dense MST No edit summary current
- 09:1909:19, 10 April 2023 diff hist +5 Undirected, General MST No edit summary
- 09:1909:19, 10 April 2023 diff hist +25 Connected Subgraph No edit summary current
- 09:1909:19, 10 April 2023 diff hist +25 2 Strong Components (dynamic) No edit summary current
- 09:1909:19, 10 April 2023 diff hist +25 Strong Connectivity (dynamic) No edit summary current
- 09:1909:19, 10 April 2023 diff hist +25 Maximum Strongly Connected Component No edit summary current
- 09:1909:19, 10 April 2023 diff hist +4 Transitive Closure No edit summary
- 09:1909:19, 10 April 2023 diff hist +4 Strongly Connected Components No edit summary
- 09:1909:19, 10 April 2023 diff hist +5 2-dimensional Convex Hull, Dynamic No edit summary current
- 09:1909:19, 10 April 2023 diff hist +5 2-dimensional Convex Hull, Online No edit summary current
- 09:1909:19, 10 April 2023 diff hist +9 D-dimensional Convex Hull No edit summary current
- 09:1909:19, 10 April 2023 diff hist +5 3-dimensional Convex Hull No edit summary current
- 09:1909:19, 10 April 2023 diff hist +5 2-dimensional Convex Hull No edit summary current
- 09:1909:19, 10 April 2023 diff hist +4 Counting number of intersection points, line segments No edit summary current
- 09:1909:19, 10 April 2023 diff hist +4 Reporting all intersection points, general polygons No edit summary current
- 09:1909:19, 10 April 2023 diff hist +6 Reporting all intersection points, convex polygons No edit summary
- 09:1909:19, 10 April 2023 diff hist +7 Reporting all intersection points, generalized segments No edit summary
- 09:1909:19, 10 April 2023 diff hist −58 Reporting all intersection points, line segments No edit summary
- 09:1909:19, 10 April 2023 diff hist −37 0-1 Linear Programming No edit summary current
- 09:1909:19, 10 April 2023 diff hist −37 Integer Linear Programming No edit summary current
- 09:1909:19, 10 April 2023 diff hist −37 Linear Programming with Reals No edit summary current
- 09:1809:18, 10 April 2023 diff hist −37 General Linear Programming No edit summary current
- 09:1809:18, 10 April 2023 diff hist +6 Vandermonde Matrix No edit summary
- 09:1809:18, 10 April 2023 diff hist +6 Toeplitz Matrix No edit summary
- 09:1809:18, 10 April 2023 diff hist +6 Non-Definite, Symmetric Matrix No edit summary
- 09:1809:18, 10 April 2023 diff hist +6 Positive Definite, Hermitian Matrix No edit summary current
- 09:1809:18, 10 April 2023 diff hist +9 Sparse Linear System No edit summary current
- 09:1809:18, 10 April 2023 diff hist +6 General Linear System No edit summary current
- 09:1809:18, 10 April 2023 diff hist +2 $(\min, \leq)$ Product No edit summary current
- 09:1809:18, 10 April 2023 diff hist +2 Distance Product No edit summary current
- 09:1809:18, 10 April 2023 diff hist +2 Matrix Product Verification No edit summary current
- 09:1809:18, 10 April 2023 diff hist +2 Boolean Matrix Multiplication (Combinatorial) No edit summary current
- 09:1809:18, 10 April 2023 diff hist +2 Boolean Matrix Multiplication No edit summary current
- 09:1809:18, 10 April 2023 diff hist +11 Matrix Multiplication No edit summary
- 09:1809:18, 10 April 2023 diff hist +22 Maximum Local Edge Connectivity No edit summary current
- 09:1809:18, 10 April 2023 diff hist +22 All-Pairs Maximum Flow No edit summary current
- 09:1809:18, 10 April 2023 diff hist +17 Minimum-Cost Flow No edit summary current
- 09:1809:18, 10 April 2023 diff hist +24 Non-integer Maximum Flow No edit summary current
- 09:1809:18, 10 April 2023 diff hist +22 Unweighted Maximum Flow No edit summary current
- 09:1809:18, 10 April 2023 diff hist +30 Integer Maximum Flow No edit summary
- 09:1809:18, 10 April 2023 diff hist +31 St-Maximum Flow No edit summary
- 09:1809:18, 10 April 2023 diff hist −17 Matrix Chain Scheduling Problem No edit summary current
- 09:1809:18, 10 April 2023 diff hist −71 Matrix Chain Ordering Problem No edit summary
- 09:1809:18, 10 April 2023 diff hist −20 Kth Order Statistic No edit summary
- 09:1809:18, 10 April 2023 diff hist +41 Non-Comparison Sorting No edit summary
- 09:1709:17, 10 April 2023 diff hist +2 Family:Recovery No edit summary current
- 09:1709:17, 10 April 2023 diff hist +45 Family:Interval Scheduling No edit summary current
- 09:1509:15, 10 April 2023 diff hist +52 Family:Nearest Neighbor Search No edit summary current
- 09:1509:15, 10 April 2023 diff hist +199 Family:Root Computation Removed redirect to Root Computation current Tag: Removed redirect
- 08:5708:57, 10 April 2023 diff hist +231 N Work-conserving schedulers (Unweighted Interval Scheduling, Online Interval Scheduling) Created page with "== Time Complexity == $O(n)$ == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference ==" current
- 08:5708:57, 10 April 2023 diff hist +288 N Multilevel queue scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n+k)$? words (^see above; also level information for each task) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference ==" current
- 08:5708:57, 10 April 2023 diff hist +250 N Round-robin scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n+k)$? words (^see above) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference ==" current
- 08:5708:57, 10 April 2023 diff hist +250 N First come, first served (Unweighted Interval Scheduling, Online Interval Scheduling) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n+k)$? words (^see above) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference ==" current
- 08:5708:57, 10 April 2023 diff hist +250 N Shortest remaining time first (Unweighted Interval Scheduling, Online Interval Scheduling) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n+k)$? words (^see above) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference ==" current
- 08:5708:57, 10 April 2023 diff hist +367 N Priority scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n+k)$? words (Keep track of (sorted, based on criteria) list of (unscheduled, running, etc.; just un-done) tasks, along with machine statuses) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference ==" current
- 08:5708:57, 10 April 2023 diff hist +394 N Fixed priority shortest job first (Unweighted Interval Scheduling, Online Interval Scheduling) Created page with "== Time Complexity == $O(n \log n)$ == Space Complexity == $O(n+k)$? words (Keep track of (sorted, based on criteria) list of (unscheduled, running, etc.; just un-done) tasks, along with machine statuses and task priorities) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference ==" current
- 08:5708:57, 10 April 2023 diff hist +3 $O(n\log n)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling) No edit summary current