All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)

• 08:51, 28 April 2023 Admin talk contribs uploaded a new version of File:Eigenvalues (Iterative Methods) - Eigenpair closest to mu - Time.png
• 08:50, 28 April 2023 Admin talk contribs uploaded a new version of File:Maximum Cardinality Matching - Bipartite Graph MCM - Time.png
• 08:49, 28 April 2023 Admin talk contribs uploaded a new version of File:Hyperbolic Spline Interpolation - Time.png
• 08:49, 28 April 2023 Admin talk contribs created page File:Secret Sharing - Time.png
• 08:49, 28 April 2023 Admin talk contribs uploaded File:Secret Sharing - Time.png
• 08:49, 28 April 2023 Admin talk contribs uploaded a new version of File:Greatest Common Divisor - Time.png
• 08:49, 28 April 2023 Admin talk contribs uploaded a new version of File:Filtering Problem (Stochastic Processes) - Time.png
• 08:49, 28 April 2023 Admin talk contribs uploaded a new version of File:Minimum Spanning Tree (MST) - Undirected, General MST - Time.png
• 08:49, 28 April 2023 Admin talk contribs uploaded a new version of File:Frequent Words with Mismatches Problem - Time.png
• 08:48, 28 April 2023 Admin talk contribs uploaded a new version of File:Entity Resolution - Time.png
• 08:48, 28 April 2023 Admin talk contribs uploaded a new version of File:Maximum-Weight Matching - Time.png
• 08:48, 28 April 2023 Admin talk contribs uploaded a new version of File:Motif Search - Time.png
• 08:47, 28 April 2023 Admin talk contribs uploaded a new version of File:Linear System - Positive Definite, Hermitian Matrix - Time.png
• 08:47, 28 April 2023 Admin talk contribs uploaded a new version of File:Poisson Problem - 3-Dimensional Poisson Problem - Time.png
• 08:47, 28 April 2023 Admin talk contribs uploaded a new version of File:Linear System - Toeplitz Matrix - Time.png
• 08:47, 28 April 2023 Admin talk contribs created page File:Interval Scheduling - Unweighted Interval Scheduling, Online - Time.png
• 08:47, 28 April 2023 Admin talk contribs uploaded File:Interval Scheduling - Unweighted Interval Scheduling, Online - Time.png
• 08:46, 28 April 2023 Admin talk contribs uploaded a new version of File:LU Decomposition - Square Matrix LU Decomposition - Time.png
• 08:46, 28 April 2023 Admin talk contribs uploaded a new version of File:Eigenvalues (Iterative Methods) - Eigenpair with the Largest Eigenvalue - Time.png
• 08:46, 28 April 2023 Admin talk contribs uploaded a new version of File:Minimum value in each row of an implicitly-defined totally monotone matrix - Time.png
• 09:00, 10 April 2023 Admin talk contribs created page Reduction from Triangle Detection to Disjunctive Reachability Queries in MDPs (Created page with "FROM: Triangle Detection TO: Disjunctive Reachability Queries in MDPs == Description == == Implications == assume: Strong Triangle<br/>then: there is no combinatorial $O(n^{3-\epsilon})$ or $O((k \cdot n^{2})^{1-\epsilon})$ algorithm for any $\epsilon > {0}$ for target. The bounds holf for dense MDPs with $m=\Theta(n^{2})$ == Year == 2016 == Reference == Chatterjee, Krishnendu, et al. "Model and objective separation with conditional lower bounds: Dis...")
• 08:56, 10 April 2023 Admin talk contribs created page Wen (1-dimensional Maximum subarray problem) (Created page with "== Time Complexity == $O(log n)$ == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == EREW PRAM == Year == 1995 == Reference == https://www.sciencedirect.com/science/article/abs/pii/016781919400063G")
• 08:55, 10 April 2023 Admin talk contribs created page Masek, Paterson (Edit sequence Sequence Alignment) (Created page with "== Time Complexity == $O(mn/log(n)$) == Space Complexity == $O(mn/log(n)$) words (https://www.sciencedirect.com/science/article/pii/0022000080900021?via%3Dihub) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1980 == Reference == https://www.sciencedirect.com/science/article/pii/0022000080900021?via%3Dihub")
• 08:55, 10 April 2023 Admin talk contribs created page Wagner-Fischer algorithm (Edit sequence Sequence Alignment) (Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(mn)$ words (https://dl.acm.org/doi/10.1145/360825.360861) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1974 == Reference == https://dl.acm.org/doi/abs/10.1145/321796.321811")
• 08:55, 10 April 2023 Admin talk contribs created page Wagner-Fischer algorithm (Edit distance Sequence Alignment) (Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(m)$ words (Easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1974 == Reference == https://dl.acm.org/doi/abs/10.1145/321796.321811")
• 08:49, 10 April 2023 Admin talk contribs created page 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")
• 08:49, 10 April 2023 Admin talk contribs created page 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")
• 08:49, 10 April 2023 Admin talk contribs created page 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")
• 08:49, 10 April 2023 Admin talk contribs created page 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")
• 08:49, 10 April 2023 Admin talk contribs created page 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")
• 08:49, 10 April 2023 Admin talk contribs created page 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")
• 08:49, 10 April 2023 Admin talk contribs created page 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/")
• 08:49, 10 April 2023 Admin talk contribs created page 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")
• 08:48, 10 April 2023 Admin talk contribs created page 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")
• 08:48, 10 April 2023 Admin talk contribs created page 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")
• 08:48, 10 April 2023 Admin talk contribs created page 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 ==")
• 08:48, 10 April 2023 Admin talk contribs created page 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")
• 08:48, 10 April 2023 Admin talk contribs created page 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")
• 08:48, 10 April 2023 Admin talk contribs created page 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")
• 08:42, 10 April 2023 Admin talk contribs created page 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")
• 08:42, 10 April 2023 Admin talk contribs created page 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 ==")
• 08:42, 10 April 2023 Admin talk contribs created page 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...")
• 08:36, 10 April 2023 Admin talk contribs created page 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")
• 08:33, 10 April 2023 Admin talk contribs created page 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")
• 08:33, 10 April 2023 Admin talk contribs created page 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")
• 08:33, 10 April 2023 Admin talk contribs created page 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")
• 08:33, 10 April 2023 Admin talk contribs created page 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")
• 08:32, 10 April 2023 Admin talk contribs created page 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")
• 08:32, 10 April 2023 Admin talk contribs created page 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")
• 08:29, 10 April 2023 Admin talk contribs created page 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")

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)