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 50 | next 50) (20 | 50 | 100 | 250 | 500)- 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]
