Reviewed pages
Jump to navigation
Jump to search
This lists contains reviewed pages whose highest attained review level (of a revision) is the specified level. A link is given to the latest revision of that level.
(first | last) View (previous 250 | next 250) (20 | 50 | 100 | 250 | 500)- Description of algorithm properties and structure (23,254 bytes) (reviewed versions) [best revision]
- Algorithm classification (14,160 bytes) (reviewed versions) [best revision]
- Cholesky decomposition (27,885 bytes) (reviewed versions) [best revision]
- About project (7,657 bytes) (reviewed versions) [best revision]
- Cholesky method (36,489 bytes) (reviewed versions) [best revision]
- Horners method (6,835 bytes) (reviewed versions) [best revision]
- Back substitution empty (reviewed versions) [best revision]
- Dot product (8,732 bytes) (reviewed versions) [best revision]
- Forward substitution (10,596 bytes) (reviewed versions) [best revision]
- Dense matrix multiplication (serial version for real matrices) (8,676 bytes) (reviewed versions) [best revision]
- Cooley–Tukey Fast Fourier Transform, radix-2 case (10,606 bytes) (reviewed versions) [best revision]
- Dense matrix-vector multiplication (8,409 bytes) (reviewed versions) [best revision]
- Pairwise summation of numbers (4,707 bytes) (reviewed versions) [best revision]
- Glossary (35,612 bytes) (reviewed versions) [best revision]
- Open Encyclopedia of Parallel Algorithmic Features (110 bytes) (reviewed versions) [best revision]
- LU decomposition via Gaussian elimination (943 bytes) (reviewed versions) [best revision]
- Backward substitution (16,438 bytes) (reviewed versions) [best revision]
- Single Source Shortest Path (SSSP) (7,288 bytes) (reviewed versions) [best revision]
- All Pairs Shortest Path (APSP) (10,383 bytes) (reviewed versions) [best revision]
- Transitive closure of a directed graph (7,508 bytes) (reviewed versions) [best revision]
- Construction of the minimum spanning tree (MST) (9,031 bytes) (reviewed versions) [best revision]
- Search for isomorphic subgraphs (1,659 bytes) (reviewed versions) [best revision]
- Graph connectivity (9,572 bytes) (reviewed versions) [best revision]
- Finding maximal flow in a transportation network (3,721 bytes) (reviewed versions) [best revision]
- Assignment problem (2,797 bytes) (reviewed versions) [best revision]
- Givens method (19,186 bytes) (reviewed versions) [best revision]
- Elimination method, pointwise version empty (reviewed versions) [best revision]
- Repeated Thomas algorithm, pointwise version (161 bytes) (reviewed versions) [best revision]
- Poisson equation, solving with DFT (23,205 bytes) (reviewed versions) [best revision]
- Thomas algorithm, pointwise version (11,793 bytes) (reviewed versions) [best revision]
- Two-sided Thomas algorithm, pointwise version (12,979 bytes) (reviewed versions) [best revision]
- Single-qubit transform of a state vector (11,023 bytes) (reviewed versions) [best revision]
- The serial-parallel summation method (7,465 bytes) (reviewed versions) [best revision]
- Methods for solving tridiagonal SLAEs (10,435 bytes) (reviewed versions) [best revision]
- The dqds algorithm for calculating singular values of bidiagonal matrices (1,840 bytes) (reviewed versions) [best revision]
- One step of the dqds algorithm (12,038 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for reducing a symmetric matrix to tridiagonal form (16,217 bytes) (reviewed versions) [best revision]
- Linpack benchmark (11,057 bytes) (reviewed versions) [best revision]
- Breadth-first search (BFS) (11,853 bytes) (reviewed versions) [best revision]
- Dijkstra's algorithm (6,845 bytes) (reviewed versions) [best revision]
- Bellman-Ford algorithm (8,948 bytes) (reviewed versions) [best revision]
- Purdom's algorithm (14,464 bytes) (reviewed versions) [best revision]
- DCSC algorithm for finding the strongly connected components (16,575 bytes) (reviewed versions) [best revision]
- Tarjan-Vishkin biconnected components algorithm (167 bytes) (reviewed versions) [best revision]
- Boruvka's algorithm (14,885 bytes) (reviewed versions) [best revision]
- LU decomposition using Gaussian elimination without pivoting (625 bytes) (reviewed versions) [best revision]
- LU decomposition using Gaussian elimination with pivoting (1,423 bytes) (reviewed versions) [best revision]
- QR decomposition of dense nonsingular matrices (4,050 bytes) (reviewed versions) [best revision]
- Stone doubling algorithm for the LU decomposition of a tridiagonal matrix (11,754 bytes) (reviewed versions) [best revision]
- Gaussian elimination, compact scheme for tridiagonal matrices and its modifications (10,636 bytes) (reviewed versions) [best revision]
- Gaussian elimination, compact scheme for tridiagonal matrices, serial variant (9,486 bytes) (reviewed versions) [best revision]
- Givens (rotations) method for the QR decomposition of a matrix (1,809 bytes) (reviewed versions) [best revision]
- Givens (rotations) method for the QR decomposition of a (real) Hessenberg matrix (188 bytes) (reviewed versions) [best revision]
- Orthogonalization method (4,430 bytes) (reviewed versions) [best revision]
- Triangular decomposition of a Gram matrix (950 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for the QR decomposition of a matrix (1,401 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for the QR decomposition of a (real) Hessenberg matrix (197 bytes) (reviewed versions) [best revision]
- QR decomposition methods for dense Hessenberg matrices (687 bytes) (reviewed versions) [best revision]
- Unitary-triangular factorizations (527 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for reducing of a matrix to Hessenberg form (2,422 bytes) (reviewed versions) [best revision]
- Pairwise summation (111 bytes) (reviewed versions) [best revision]
- Parallel prefix scan algorithm using pairwise summation (165 bytes) (reviewed versions) [best revision]
- Uniform norm of a vector: Real version, serial-parallel variant (223 bytes) (reviewed versions) [best revision]
- Fast Fourier transform for powers-of-two (142 bytes) (reviewed versions) [best revision]
- Dense matrix multiplication (110 bytes) (reviewed versions) [best revision]
- Matrix decomposition problem (110 bytes) (reviewed versions) [best revision]
- Triangular decompositions (107 bytes) (reviewed versions) [best revision]
- Gaussian elimination (finding the LU decomposition) (134 bytes) (reviewed versions) [best revision]
- Compact scheme for Gaussian elimination and its modifications: Tridiagonal matrix (207 bytes) (reviewed versions) [best revision]
- Gaussian elimination, compact scheme for tridiagonal matrices, serial version (9,330 bytes) (reviewed versions) [best revision]
- Serial-parallel algorithm for the LU decomposition of a tridiagonal matrix (215 bytes) (reviewed versions) [best revision]
- Gaussian elimination with column pivoting (187 bytes) (reviewed versions) [best revision]
- Gaussian elimination with row pivoting (185 bytes) (reviewed versions) [best revision]
- Gaussian elimination with diagonal pivoting (206 bytes) (reviewed versions) [best revision]
- Gaussian elimination with complete pivoting (196 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for the QR decomposition of a square matrix, real point-wise version (236 bytes) (reviewed versions) [best revision]
- Classical orthogonalization method (130 bytes) (reviewed versions) [best revision]
- Orthogonalization method with reorthogonalization (136 bytes) (reviewed versions) [best revision]
- Reducing matrices to compact forms (156 bytes) (reviewed versions) [best revision]
- Unitary reductions to Hessenberg form (200 bytes) (reviewed versions) [best revision]
- Classical point-wise Householder (reflections) method for reducing a matrix to Hessenberg form (275 bytes) (reviewed versions) [best revision]
- Unitary reductions to tridiagonal form (206 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for reducing a complex Hermitian matrix to symmetric tridiagonal form (275 bytes) (reviewed versions) [best revision]
- Eigenvalue decomposition (finding eigenvalues and eigenvectors) (192 bytes) (reviewed versions) [best revision]
- Householder (reflections) reduction of a matrix to bidiagonal form (201 bytes) (reviewed versions) [best revision]
- Singular value decomposition (finding singular values and singular vectors) (190 bytes) (reviewed versions) [best revision]
- Stone doubling algorithm for solving bidiagonal SLAEs (170 bytes) (reviewed versions) [best revision]
- Thomas algorithm (80 bytes) (reviewed versions) [best revision]
- Stone doubling algorithm (108 bytes) (reviewed versions) [best revision]
- Serial-parallel method for solving tridiagonal matrices based on the LU decomposition and backward substitutions (269 bytes) (reviewed versions) [best revision]
- Repeated two-sided Thomas algorithm, pointwise version (151 bytes) (reviewed versions) [best revision]
- Complete cyclic reduction (127 bytes) (reviewed versions) [best revision]
- Block Thomas algorithm (95 bytes) (reviewed versions) [best revision]
- Two-sided Thomas algorithm, block variant (130 bytes) (reviewed versions) [best revision]
- High Performance Conjugate Gradient (HPCG) benchmark (116 bytes) (reviewed versions) [best revision]
- Biconjugate gradient stabilized method (BiCGStab) (168 bytes) (reviewed versions) [best revision]
- Kaczmarz's algorithm (95 bytes) (reviewed versions) [best revision]
- QR algorithm (83 bytes) (reviewed versions) [best revision]
- QR algorithm as implemented in SCALAPACK (122 bytes) (reviewed versions) [best revision]
- Hessenberg QR algorithm as implemented in SCALAPACK (173 bytes) (reviewed versions) [best revision]
- Symmetric QR algorithm as implemented in SCALAPACK (167 bytes) (reviewed versions) [best revision]
- QR algorithm for complex Hermitian matrices as implemented in SCALAPACK (184 bytes) (reviewed versions) [best revision]
- The Jacobi (rotations) method for solving the symmetric eigenvalue problem (205 bytes) (reviewed versions) [best revision]
- The classical Jacobi (rotations) method with pivoting for symmetric matrices (221 bytes) (reviewed versions) [best revision]
- Serial Jacobi (rotations) method for symmetric matrices (198 bytes) (reviewed versions) [best revision]
- Serial Jacobi (rotations) method with thresholds for symmetric matrices (220 bytes) (reviewed versions) [best revision]
- Lanczos algorithm in exact algorithm (without reorthogonalization) (184 bytes) (reviewed versions) [best revision]
- Jacobi (rotations) method for finding singular values (208 bytes) (reviewed versions) [best revision]
- Binary search: Finding the position of a target value within a sorted array (91 bytes) (reviewed versions) [best revision]
- Depth-first search (DFS) (98 bytes) (reviewed versions) [best revision]
- Δ-stepping algorithm (97 bytes) (reviewed versions) [best revision]
- Johnson's algorithm (97 bytes) (reviewed versions) [best revision]
- Floyd-Warshall algorithm (87 bytes) (reviewed versions) [best revision]
- Longest shortest path (114 bytes) (reviewed versions) [best revision]
- Kruskal's algorithm (97 bytes) (reviewed versions) [best revision]
- Prim's algorithm (91 bytes) (reviewed versions) [best revision]
- GHS algorithm (84 bytes) (reviewed versions) [best revision]
- Ullman's algorithm (95 bytes) (reviewed versions) [best revision]
- VF2 algorithm (84 bytes) (reviewed versions) [best revision]
- Shiloach-Vishkin algorithm for finding the connected components (161 bytes) (reviewed versions) [best revision]
- Disjoint set union (128 bytes) (reviewed versions) [best revision]
- Tarjan's strongly connected components algorithm (161 bytes) (reviewed versions) [best revision]
- Tarjan's biconnected components algorithm (152 bytes) (reviewed versions) [best revision]
- Tarjan's algorithm for finding the bridges of a graph (139 bytes) (reviewed versions) [best revision]
- Vertex connectivity of a graph (135 bytes) (reviewed versions) [best revision]
- Gabow's edge connectivity algorithm (163 bytes) (reviewed versions) [best revision]
- Ford–Fulkerson algorithm (112 bytes) (reviewed versions) [best revision]
- Preflow-Push algorithm (128 bytes) (reviewed versions) [best revision]
- Finding minimal-cost flow in a transportation network (166 bytes) (reviewed versions) [best revision]
- Hungarian algorithm (101 bytes) (reviewed versions) [best revision]
- Auction algorithm (97 bytes) (reviewed versions) [best revision]
- Hopcroft–Karp algorithm (110 bytes) (reviewed versions) [best revision]
- Two-qubit transform of a state vector (151 bytes) (reviewed versions) [best revision]
- K-means clustering (107 bytes) (reviewed versions) [best revision]
- Face recognition (97 bytes) (reviewed versions) [best revision]
- Stochastic dual dynamic programming (SDDP) (182 bytes) (reviewed versions) [best revision]
- Newton's method for systems of nonlinear equations (149 bytes) (reviewed versions) [best revision]
- Cubature rules (103 bytes) (reviewed versions) [best revision]
- Numerical quadrature (cubature) rules on an interval (for a multidimensional cube) (230 bytes) (reviewed versions) [best revision]
- Meet-in-the-middle attack (110 bytes) (reviewed versions) [best revision]
- Шаблон:Buttonlinkimp (75 bytes) (reviewed versions) [best revision]
- BFS, RCC for CPU (615 bytes) (reviewed versions) [best revision]
- BFS, RCC for GPU (637 bytes) (reviewed versions) [best revision]
- BFS, C++, Boost Graph Library (820 bytes) (reviewed versions) [best revision]
- BFS, C++, MPI, Boost Graph Library (761 bytes) (reviewed versions) [best revision]
- BFS, GAP (608 bytes) (reviewed versions) [best revision]
- BFS, Java, WebGraph (772 bytes) (reviewed versions) [best revision]
- BFS, Python, NetworkX (773 bytes) (reviewed versions) [best revision]
- BFS, Python/C++, NetworKit (757 bytes) (reviewed versions) [best revision]
- BFS, Ligra (642 bytes) (reviewed versions) [best revision]
- Cooley-Tukey, locality (1,114 bytes) (reviewed versions) [best revision]
- Cooley-Tukey, scalability (701 bytes) (reviewed versions) [best revision]
- Cholesky decomposition, locality (6,337 bytes) (reviewed versions) [best revision]
- Cholesky decomposition, SCALAPACK (5,529 bytes) (reviewed versions) [best revision]
- Cholesky decomposition, scalability (4,546 bytes) (reviewed versions) [best revision]
- Dijkstra, C++, Boost Graph Library (963 bytes) (reviewed versions) [best revision]
- Dijkstra, Python (891 bytes) (reviewed versions) [best revision]
- Dijkstra, Python/C++ (803 bytes) (reviewed versions) [best revision]
- Dijkstra, C++, MPI: Parallel Boost Graph Library, 1 (1,009 bytes) (reviewed versions) [best revision]
- Dijkstra, C++, MPI: Parallel Boost Graph Library, 2 (1,350 bytes) (reviewed versions) [best revision]
- Dijkstra, Google (8,387 bytes) (reviewed versions) [best revision]
- Bellman-Ford, C++, Boost Graph Library (791 bytes) (reviewed versions) [best revision]
- Bellman-Ford, Python, NetworkX (827 bytes) (reviewed versions) [best revision]
- Bellman-Ford, Java, JGraphT (758 bytes) (reviewed versions) [best revision]
- Bellman-Ford, OpenMP, Stinger (712 bytes) (reviewed versions) [best revision]
- Bellman-Ford, Nvidia nvGraph (719 bytes) (reviewed versions) [best revision]
- Bellman-Ford, MPI, Graph500 (705 bytes) (reviewed versions) [best revision]
- Bellman-Ford, Ligra (703 bytes) (reviewed versions) [best revision]
- Bellman-Ford, scalability (5,787 bytes) (reviewed versions) [best revision]
- BFS, MPI, Graph500 (624 bytes) (reviewed versions) [best revision]
- Δ-stepping, C++, MPI, Parallel Boost Graph Library (964 bytes) (reviewed versions) [best revision]
- Δ-stepping, Gap (698 bytes) (reviewed versions) [best revision]
- Johnson's, C++, Boost Graph Library (804 bytes) (reviewed versions) [best revision]
- Floyd-Warshall, C++, Boost Graph Library (797 bytes) (reviewed versions) [best revision]
- Floyd-Warshall, Python, NetworkX (830 bytes) (reviewed versions) [best revision]
- Floyd-Warshall, Java, JGraphT (765 bytes) (reviewed versions) [best revision]
- Floyd-Warshall, scalability (90 bytes) (reviewed versions) [best revision]
- Purdom's, Boost Graph Library (2,304 bytes) (reviewed versions) [best revision]
- Boruvka's, C++, MPI, Parallel Boost Graph Library (1,261 bytes) (reviewed versions) [best revision]
- Boruvka's, RCC for CPU (677 bytes) (reviewed versions) [best revision]
- Boruvka's, RCC for GPU (625 bytes) (reviewed versions) [best revision]
- Boruvka's, scalability (5,868 bytes) (reviewed versions) [best revision]
- Boruvka's, locality (5,049 bytes) (reviewed versions) [best revision]
- Kruskal's, C++, Boost Graph Library (832 bytes) (reviewed versions) [best revision]
- Kruskal's, C++, MPI, Parallel Boost Graph Library (1,457 bytes) (reviewed versions) [best revision]
- Kruskal's, Python, NetworkX (821 bytes) (reviewed versions) [best revision]
- Kruskal's, Java, JGraphT (761 bytes) (reviewed versions) [best revision]
- Prim's, C++, Boost Graph Library (831 bytes) (reviewed versions) [best revision]
- Prim's, Java, JGraphT (752 bytes) (reviewed versions) [best revision]
- Ullman's, C++, Chemical Descriptors Library (767 bytes) (reviewed versions) [best revision]
- Ullman's, C++, VF Library (723 bytes) (reviewed versions) [best revision]
- VF2, C++, VF Library (669 bytes) (reviewed versions) [best revision]
- VF2, C++, Boost Graph Library (773 bytes) (reviewed versions) [best revision]
- VF2, Python, NetworkX (754 bytes) (reviewed versions) [best revision]
- Disjoint set union, Boost Graph Library (794 bytes) (reviewed versions) [best revision]
- Disjoint set union, Java, JGraphT (741 bytes) (reviewed versions) [best revision]
- Tarjan's strongly connected components, C++, Boost Graph Library (809 bytes) (reviewed versions) [best revision]
- Tarjan's strongly connected components, Java, WebGraph (820 bytes) (reviewed versions) [best revision]
- Tarjan's strongly connected components, Java, JGraphT (792 bytes) (reviewed versions) [best revision]
- Tarjan's strongly connected components, Python, NetworkX (893 bytes) (reviewed versions) [best revision]
- Tarjan's strongly connected components, Python/C++, NetworKit (897 bytes) (reviewed versions) [best revision]
- DCSC for finding the strongly connected components, C++, MPI, Parallel Boost Graph Library (2,639 bytes) (reviewed versions) [best revision]
- Tarjan's biconnected components, C++, Boost Graph Library (812 bytes) (reviewed versions) [best revision]
- Tarjan's biconnected components, Python, NetworkX (865 bytes) (reviewed versions) [best revision]
- Tarjan's biconnected components, Java, JGraphT (777 bytes) (reviewed versions) [best revision]
- Tarjan-Vishkin biconnected components, scalability (114 bytes) (reviewed versions) [best revision]
- Ford–Fulkerson, C++, Boost Graph Library (937 bytes) (reviewed versions) [best revision]
- Ford–Fulkerson, Python, NetworkX (871 bytes) (reviewed versions) [best revision]
- Ford–Fulkerson, Java, JGraphT (819 bytes) (reviewed versions) [best revision]
- Preflow-Push, C++, Boost Graph Library (823 bytes) (reviewed versions) [best revision]
- Preflow-Push, Python, NetworkX (886 bytes) (reviewed versions) [best revision]
- Hungarian, Java, JGraphT (837 bytes) (reviewed versions) [best revision]
- Hopcroft–Karp, Java, JGraphT (773 bytes) (reviewed versions) [best revision]
- Longest shortest path, Java, WebGraph (1,256 bytes) (reviewed versions) [best revision]
- Longest shortest path, Python/C++, NetworKit (842 bytes) (reviewed versions) [best revision]
- DFS, C++, Boost Graph Library (957 bytes) (reviewed versions) [best revision]
- DFS, C++, MPI, Parallel Boost Graph Library (845 bytes) (reviewed versions) [best revision]
- DFS, Python, NetworkX (817 bytes) (reviewed versions) [best revision]
- Lanczos, C++, MPI, 2 (84 bytes) (reviewed versions) [best revision]
- Lanczos, C, MPI (79 bytes) (reviewed versions) [best revision]
- Lanczos, C++, MPI, 3 (84 bytes) (reviewed versions) [best revision]
- One step of the dqds, LAPACK (4,696 bytes) (reviewed versions) [best revision]
- Horners, locality (5,792 bytes) (reviewed versions) [best revision]
- Dense matrix-vector multiplication, locality (108 bytes) (reviewed versions) [best revision]
- Dense matrix multiplication, locality (9,363 bytes) (reviewed versions) [best revision]
- Dense matrix multiplication, scalability (3,550 bytes) (reviewed versions) [best revision]
- Pairwise summation of numbers, locality (103 bytes) (reviewed versions) [best revision]
- Pairwise summation of numbers, scalability (106 bytes) (reviewed versions) [best revision]
- Uniform norm of a vector, locality (98 bytes) (reviewed versions) [best revision]
- Dot product, locality (3,730 bytes) (reviewed versions) [best revision]
- Dot product, scalability (3,105 bytes) (reviewed versions) [best revision]
- The serial-parallel summation method, locality (3,524 bytes) (reviewed versions) [best revision]
- The serial-parallel summation method, scalability (3,552 bytes) (reviewed versions) [best revision]
- LU decomposition via Gaussian elimination, locality (7,632 bytes) (reviewed versions) [best revision]
- LU decomposition via Gaussian elimination, scalability (3,407 bytes) (reviewed versions) [best revision]
- Givens method, locality (3,509 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for the QR decomposition, locality (131 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for the QR decomposition, SCALAPACK (132 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for reducing a symmetric matrix to tridiagonal form, locality (5,336 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for reducing a symmetric matrix to tridiagonal form, SCALAPACK (7,498 bytes) (reviewed versions) [best revision]
- Householder (reflections) reduction of a matrix to bidiagonal form, locality (140 bytes) (reviewed versions) [best revision]
- Householder (reflections) reduction of a matrix to bidiagonal form, SCALAPACK (141 bytes) (reviewed versions) [best revision]
- HPCG, locality (78 bytes) (reviewed versions) [best revision]
- HPCG, scalability (81 bytes) (reviewed versions) [best revision]
- BiCGStab, MIT (77 bytes) (reviewed versions) [best revision]
- BiCGStab, HYPRE (79 bytes) (reviewed versions) [best revision]
- BiCGStab, NVIDIA AmgX (85 bytes) (reviewed versions) [best revision]
- Kaczmarz's, MATLAB1 (83 bytes) (reviewed versions) [best revision]
- Kaczmarz's, MATLAB2 (83 bytes) (reviewed versions) [best revision]
- Kaczmarz's, MATLAB3 (83 bytes) (reviewed versions) [best revision]