User contributions for Admin
Jump to navigation
Jump to search
10 April 2023
- 08:3408:34, 10 April 2023 diff hist +2 Fleischer forward-backward (FB) algorithm (SCCs Strongly Connected Components) No edit summary current
- 08:3408:34, 10 April 2023 diff hist +95 Miller; Stout (2-dimensional Convex Hull) No edit summary current
- 08:3408:34, 10 April 2023 diff hist +94 Preparata and Hong (2-dimensional; 3-dimensional Convex Hull) No edit summary current
- 08:3408:34, 10 April 2023 diff hist +3 Graham (2-dimensional Convex Hull) No edit summary current
- 08:3408:34, 10 April 2023 diff hist +148 Goodrich (Reporting all intersection points, line segments Line segment intersection) No edit summary current
- 08:3408:34, 10 April 2023 diff hist +1 Boissonnat; Snoeyink (Reporting all intersection points, generalized segments Line segment intersection) No edit summary current
- 08:3408:34, 10 April 2023 diff hist +1 Balaban. (Reporting all intersection points, generalized segments Line segment intersection) No edit summary current
- 08:3408: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
- 08:3408: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
- 08:3308:33, 10 April 2023 diff hist +2 Chazelle & Edelsbrunner (Reporting all intersection points, line segments Line segment intersection) No edit summary current
- 08:3308:33, 10 April 2023 diff hist +19 Lee and Sidford ( Linear Programming) No edit summary current
- 08:3308:33, 10 April 2023 diff hist +209 Cohen; Lee and Song ( Linear Programming) No edit summary current
- 08:3308:33, 10 April 2023 diff hist −25 Terlaky's Criss-cross algorithm ( Linear Programming) No edit summary current
- 08:3308:33, 10 April 2023 diff hist −25 Simplex Algorithm ( Linear Programming) No edit summary current
- 08:3308:33, 10 April 2023 diff hist +3 Harrow (Quantum) (Sparse Linear System Linear System) No edit summary current
- 08:3308: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
- 08:3308:33, 10 April 2023 diff hist −97 Beigel & Eppstein (3-Graph Coloring Graph Coloring) No edit summary current Tag: Manual revert
- 08:3308:33, 10 April 2023 diff hist +97 Beigel & Eppstein (3-Graph Coloring Graph Coloring) No edit summary Tags: Manual revert Reverted
- 08:3308:33, 10 April 2023 diff hist +4 Goldberg & Rao (Integer Maximum Flow Maximum Flow) No edit summary
- 08:3308:33, 10 April 2023 diff hist −1 Goldberg & Rao (Integer Maximum Flow Maximum Flow) No edit summary
- 08:3308:33, 10 April 2023 diff hist +3 Phillips & Westbrook (st-Maximum Flow Maximum Flow) No edit summary current
- 08:3308:33, 10 April 2023 diff hist +1 King et al. (KRT) (st-Maximum Flow Maximum Flow) No edit summary current
- 08:3308:33, 10 April 2023 diff hist +1 Alon (st-Maximum Flow Maximum Flow) No edit summary current
- 08:3308:33, 10 April 2023 diff hist +2 Cheriyan et al. (st-Maximum Flow Maximum Flow) No edit summary current
- 08:3308:33, 10 April 2023 diff hist 0 Cheriyan & Hagerup (st-Maximum Flow Maximum Flow) No edit summary current
- 08:3308:33, 10 April 2023 diff hist +3 Ahuja & Orlin ( Maximum Flow) No edit summary current
- 08:3308:33, 10 April 2023 diff hist +3 Goldberg & Tarjan ( Maximum Flow) No edit summary current
- 08:3308:33, 10 April 2023 diff hist +3 Sleator & Tarjan ( Maximum Flow) No edit summary current
- 08:3308:33, 10 April 2023 diff hist +160 Dinitz (with dynamic trees) ( Maximum Flow) No edit summary current
- 08:3308:33, 10 April 2023 diff hist +75 Dantzig ( Maximum Flow) No edit summary current
- 08:3308:33, 10 April 2023 diff hist −33 T. C. Hu ; M. T. Shing (Matrix Chain Ordering Problem Matrix Chain Multiplication) No edit summary current
- 08:3308:33, 10 April 2023 diff hist +1 Spreadsort (Non-Comparison Sorting Sorting) No edit summary current
- 08:3308:33, 10 April 2023 diff hist +50 Flash Sort (Non-Comparison Sorting Sorting) No edit summary current
- 08:3308:33, 10 April 2023 diff hist −13 Naive sorting (Non-Comparison Sorting Sorting) No edit summary current
- 08:3308:33, 10 April 2023 diff hist +60 Thorup's Sorting Algorithm (Comparison Sorting Sorting) No edit summary current
- 08:3308:33, 10 April 2023 diff hist +2 Bitonic Merge Sort Parallel Implementation (Comparison Sorting Sorting) No edit summary current
- 08:3308: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
- 08:3308: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
- 08:3308: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
- 08:3208: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
- 08:3208:32, 10 April 2023 diff hist +2 Quick Sort (Comparison Sorting Sorting) No edit summary current
- 08:3208:32, 10 April 2023 diff hist +115 Tree sort (Comparison Sorting Sorting) No edit summary current
- 08:3208: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
- 08:3208:32, 10 April 2023 diff hist +3 Petford and Welsh (3-Graph Coloring Graph Coloring) No edit summary current
- 08:3208:32, 10 April 2023 diff hist +9 Rao-Blackwellized Particle Filtering SLAM (SLAM Algorithms SLAM Algorithms) No edit summary current
- 08:3208:32, 10 April 2023 diff hist +9 Compressed Extended KF (SLAM Algorithms SLAM Algorithms) No edit summary current
- 08:3208:32, 10 April 2023 diff hist +9 UKF (SLAM Algorithms SLAM Algorithms) No edit summary current
- 08:3208:32, 10 April 2023 diff hist +9 EKF SLAM (SLAM Algorithms SLAM Algorithms) No edit summary current
- 08:3208:32, 10 April 2023 diff hist +1 Image analogies Hertzmann (Texture Synthesis Texture Synthesis) No edit summary current
- 08:3208:32, 10 April 2023 diff hist +12 Czumaj (Approximate MCOP Matrix Chain Multiplication) No edit summary Tags: Manual revert Reverted