Variations

CS
Comparison Sorting
184 Algorithms
NS
Non-Comparison Sorting
62 Algorithms
UGM
Undirected, General MST
55 Algorithms
MM
Matrix Multiplication
53 Algorithms
UDM
Undirected, Dense MST
47 Algorithms
IS
Integer Sorting
38 Algorithms
LCS
Longest Common Subsequence
36 Algorithms
CCI
Connected Components in an undirected graph
35 Algorithms
M
Multiplication
29 Algorithms
SS
Subset Sum
26 Algorithms
SSS
Single String Search
23 Algorithms
IF
Integer Factoring
22 Algorithms
MS
Mesh Simplification
22 Algorithms
SCC
Strongly Connected Components
22 Algorithms
2DT
2-Dimensional Delaunay Triangulation
20 Algorithms
MP
Mesh Parameterization
20 Algorithms
IS
Image Segmentation
19 Algorithms
IS
Informed Search
19 Algorithms
LC
Lossless Compression
19 Algorithms
2PP
2-Dimensional Poisson Problem
18 Algorithms
CD
Corner Detection
18 Algorithms
DFT
Discrete Fourier Transform
18 Algorithms
2CH
2-dimensional Convex Hull
17 Algorithms
A
APSP
17 Algorithms
CST
Constructing Suffix Trees
17 Algorithms
TVC
The Vertex Cover Problem
17 Algorithms
3PP
3-Dimensional Poisson Problem
15 Algorithms
FFI
Finding Frequent Itemsets
15 Algorithms
GP
General Permutations
15 Algorithms
GRC
General Root Computation
15 Algorithms
BD
Blob Detection
14 Algorithms
3CH
3-dimensional Convex Hull
13 Algorithms
EMC
Enumerating Maximal Cliques, arbitrary graph
13 Algorithms
LCA
Lowest Common Ancestor with Static Trees
13 Algorithms
MS
Motif Search
13 Algorithms
P
POMDPs
13 Algorithms
CVD
Constuct Voronoi Diagram
12 Algorithms
LC
Lossy Compression
12 Algorithms
MCO
Matrix Chain Ordering Problem
12 Algorithms
SF
st-Maximum Flow
12 Algorithms
AE
Any Eigenvalue
11 Algorithms
GCD
Greatest Common Divisor
11 Algorithms
ILS
Inexact Laplacian Solver
11 Algorithms
OBS
Optimal Binary Search Tree Problem
11 Algorithms
P
Point-in-Polygon
11 Algorithms
1MS
1D Maximum Subarray
10 Algorithms
3C
3-Graph Coloring
10 Algorithms
FP(
Filtering Problem (Stochastic Processes)
10 Algorithms
LA
Link Analysis
10 Algorithms
OPF
Optimal Policies for MDPs
10 Algorithms
SF
Smallest Factor
10 Algorithms
SML
Square Matrix LU Decomposition
10 Algorithms
TS
Topological Sorting
10 Algorithms
AP
All Permutations
9 Algorithms
ER
Entity Resolution
9 Algorithms
GGM
General Graph MCM
9 Algorithms
ME
Mutual Exclusion
9 Algorithms
O
Online
9 Algorithms
2PI
2-D Polynomial Interpolation
8 Algorithms
2MS
2D Maximum Subarray
8 Algorithms
4D
4NF Decomposition
8 Algorithms
CET
Constructing Eulerian Trails in a Graph
8 Algorithms
DM
DFA Minimization
8 Algorithms
IMF
Integer Maximum Flow
8 Algorithms
LD
Line Drawing
8 Algorithms
PCW
Polygon Clipping with Arbitrary Clipping Polygon
8 Algorithms
RAI
Reporting all intersection points, line segments
8 Algorithms
S
Sorting
8 Algorithms
SMP
Stable Marriage Problem
8 Algorithms
TS
Texture Synthesis
8 Algorithms
VC
Variance Calculations
8 Algorithms
BMM
Boolean Matrix Multiplication (Combinatorial)
7 Algorithms
DNG
De Novo Genome Assembly
7 Algorithms
DR
Diffuse Reflection
7 Algorithms
DLO
Discrete Logarithm Over Finite Fields
7 Algorithms
DE
Duplicate Elimination
7 Algorithms
EM
Environment Mapping
7 Algorithms
GLS
General Linear System
7 Algorithms
MLM
Maximum Likelihood Methods in Unknown Latent Variables
7 Algorithms
NW
Nonnegative Weights
7 Algorithms
SA
Sequence-To-Graph Alignment
7 Algorithms
TC
Transitive Closure
7 Algorithms
AE
Any Eigenpair
6 Algorithms
BGM
Bipartite Graph MCM
6 Algorithms
CS
Counting Solutions
6 Algorithms
DT
Delaunay Triangulation
6 Algorithms
DS
Disk Scheduling
6 Algorithms
GWU
General Weights, Undirected
6 Algorithms
GRA
Global Register Allocation
6 Algorithms
HSI
Hyperbolic Spline Interpolation
6 Algorithms
LS
Line Simplification
6 Algorithms
MLP
Maximum Likelihood Parameters
6 Algorithms
SA
SLAM Algorithms
6 Algorithms
STS
Self-Balancing Trees Search
6 Algorithms
UHF
Unkeyed Hash Functions
6 Algorithms
UIS
Unweighted Interval Scheduling, Online
6 Algorithms
VD
Voronoi Diagrams
6 Algorithms
KNN
k Nearest Neighbors Search
6 Algorithms
KOS
kth Order Statistic
6 Algorithms
AM
Approximate MCOP
5 Algorithms
AO
Approximate OBST
5 Algorithms
BC
Block Ciphers
5 Algorithms
CE
Cardinality Estimation
5 Algorithms
CNF
Conjunctive Normal Form SAT
5 Algorithms
CS
Constructing Solutions
5 Algorithms
CD
Cycle Detection
5 Algorithms
GLP
General Linear Programming
5 Algorithms
GW
General Weights
5 Algorithms
IG
Inexact GED
5 Algorithms
LPS
Longest Palindromic Substring
5 Algorithms
RT
Ray Tracing
5 Algorithms
STD
Self-Balancing Trees Deletion
5 Algorithms
STI
Self-Balancing Trees Insertion
5 Algorithms
SR
Specular Reflection
5 Algorithms
SE
Symmetric Eigenvalue
5 Algorithms
TOH
Tower of Hanoi
5 Algorithms
TRP
Transitive Reduction Problem of Directed Graphs
5 Algorithms
KS$
k-dimensional space, $l_m$ (or $l_\infty$) norm
5 Algorithms
2
2-Player
4 Algorithms
2SE
2-dimensional space, Euclidean metric
4 Algorithms
4C
4-Graph Coloring
4 Algorithms
AOD
APSP on Dense Directed Graphs with Arbitrary Weights
4 Algorithms
AE
All Eigenvalues
4 Algorithms
ANN
All Nearest Neighbors Search
4 Algorithms
CP
CFG Parsing
4 Algorithms
C
Culling
4 Algorithms
D(B
Directed (Optimum Branchings), General MST
4 Algorithms
ECT
Eigenpair closest to mu
4 Algorithms
ID(
Intersection detection (whether there exists an intersection)
4 Algorithms
MT
Minimum TSP
4 Algorithms
NIW
Nonnegative Integer Weights
4 Algorithms
R3
Real 3SUM
4 Algorithms
RW
Rectangular Window
4 Algorithms
STN
Solutions to Nonlinear Equations
4 Algorithms
WIS
Weighted Interval Schedule Maximization Problem (ISMP)
4 Algorithms
AKN
All k Nearest Neighbors Search
3 Algorithms
ATP
Alphabetic Tree Problem
3 Algorithms
AT
Approximate TSP
3 Algorithms
CP
Change-Making Problem
3 Algorithms
CSI
Clock Synchronization in Distributed Systems
3 Algorithms
CE
Coset Enumeration
3 Algorithms
EDC
Edit Distance, constant-size alphabet
3 Algorithms
GRC
General Root Computation, All Roots
3 Algorithms
GB
Gröbner Bases
3 Algorithms
J
Joins
3 Algorithms
LCA
Lowest Common Ancestors for vertex pairs of a directed tree
3 Algorithms
MF
Matrix Factorization
3 Algorithms
MVI
Minimum value in each row of an implicitly-defined totally monotone matrix
3 Algorithms
MSS
Multiple String Search
3 Algorithms
RAI
Reporting all intersection points, generalized segments
3 Algorithms
STC
Self-Balancing Trees Creation
3 Algorithms
TM
Toeplitz Matrix
3 Algorithms
UCO
Unconstrained Convex Optimization (Non-linear)
3 Algorithms
DCH
d-dimensional Convex Hull
3 Algorithms
KAN
k Approximate Nearest Neighbors Search
3 Algorithms
K
k-OV
3 Algorithms
2CH
2-dimensional Convex Hull, Dynamic
2 Algorithms
2AR
2-dimensional array representation
2 Algorithms
3DT
3-Dimensional Delaunay Triangulation
2 Algorithms
4DF
4NF Decomposition for Conflict-Free Dependency Sets
2 Algorithms
4DF
4NF Decomposition for Functional and Multivalued Dependency Sets
2 Algorithms
AOD
APSP on Dense Undirected Graphs with Arbitrary Weights
2 Algorithms
AL
All-substrings LCS
2 Algorithms
BMM
Bipartite Maximum-Weight Matching
2 Algorithms
BMM
Boolean Matrix Multiplication
2 Algorithms
CR
CFG Recognition
2 Algorithms
CPW
Convex Polygonal Window
2 Algorithms
CPS
Cyclic Peptide Sequencing Problem
2 Algorithms
DOM
Determinant of Matrices with Integer Entries
2 Algorithms
DRP
Digraph Realization Problem
2 Algorithms
DPP
Dining Philosophers Problem
2 Algorithms
DLA
Distributed Locking Algorithms
2 Algorithms
ESC
Edit Sequence, constant-size alphabet
2 Algorithms
EMS
Edit-distance-based Motif Search
2 Algorithms
ELS
Exact Laplacian Solver
2 Algorithms
FOP
Factorization of Polynomials Over Finite Fields
2 Algorithms
FDI
Functional Dependency Inference Problem
2 Algorithms
GIG
Graph Isomorphism, General Graphs
2 Algorithms
KE
Key Exchange
2 Algorithms
LCA
Lowest Common Ancestor with Linking
2 Algorithms
LCA
Lowest Common Ancestor with Linking Roots
2 Algorithms
MCS
Matrix Chain Scheduling Problem
2 Algorithms
MC
Max-Weight Clique
2 Algorithms
MC
Maximum Cut
2 Algorithms
MM
Maximum-Weight Matching
2 Algorithms
MWC
Minimum Wiener Connector Problem
2 Algorithms
MDI
Multivalued Dependency Inference Problem
2 Algorithms
NSM
Non-Definite, Symmetric Matrix
2 Algorithms
NWD
Nonnegative Weighted Digraph
2 Algorithms
NWU
Nonnegative Weights, Undirected
2 Algorithms
O
OV
2 Algorithms
OLC
Off-Line Lowest Common Ancestor
2 Algorithms
PDH
Positive Definite, Hermitian Matrix
2 Algorithms
R
Rasterization
2 Algorithms
RP
Rod-Cutting Problem
2 Algorithms
SS
Secret Sharing
2 Algorithms
SRP
Stable Roommates Problem
2 Algorithms
TFW
The Frequent Words Problem
2 Algorithms
US
Unweighted Set-Covering
2 Algorithms
VM
Vandermonde Matrix
2 Algorithms
WS
Weighted Set-Covering
2 Algorithms
2CH
2-dimensional Convex Hull, Online
1 Algorithms
2S$
2-dimensional space, $l_m$ (or $l_\infty$) norm
1 Algorithms
3AR
3-Coloring a Random 3-Colorable Graph
1 Algorithms
3
3SAT
1 Algorithms
4
4SAT
1 Algorithms
AOD
APSP on Dense Undirected Graphs with Positive Integer Weights
1 Algorithms
AOD
APSP on Dense Undirected Unweighted Graphs
1 Algorithms
AOG
APSP on Geometrically Weighted Graphs
1 Algorithms
AOS
APSP on Sparse Undirected Graphs with Arbitrary Weights
1 Algorithms
AOS
APSP on Sparse Undirected Graphs with Positive Integer Weights
1 Algorithms
AOS
APSP on Sparse Undirected Unweighted Graphs
1 Algorithms
ADM
Acyclic DFA Minimization
1 Algorithms
AE
All Eigenpairs
1 Algorithms
AMN
All Maximal Non-Branching Paths in a Graph
1 Algorithms
ASM
Almost Stable Marriage Problem
1 Algorithms
AM
Approximate MCSP
1 Algorithms
AEB
Arithmetic Expression Binary Tree
1 Algorithms
BC
Biconnected Components
1 Algorithms
C
Consensus
1 Algorithms
CO(
Convex Optimization (Non-linear)
1 Algorithms
CPW
Convex Polyhedral Window
1 Algorithms
CNO
Counting number of intersection points, line segments
1 Algorithms
COL
Cryptanalysis of Linear Feedback Shift Registers
1 Algorithms
CNS
Cyclic Nontrivial SCCs DFA Minimization
1 Algorithms
CP
Cyclic Permutations
1 Algorithms
DRP
DAG Realization Problem
1 Algorithms
DA
Deadlock Avoidance
1 Algorithms
DPB
Decisional Perfect BCNF
1 Algorithms
DML
Dense Matrix LU Decomposition
1 Algorithms
DMM
Dense Matrix Multiplication
1 Algorithms
D(B
Directed (Optimum Branchings), Super Dense MST
1 Algorithms
DSF
Directed Spanning Forest
1 Algorithms
DSS
Dynamic Subset Sum
1 Algorithms
EWT
Eigenpair with the Largest Eigenvalue
1 Algorithms
EK
Enumerating k-Cliques
1 Algorithms
ESI
Euclidean space in k dimensions
1 Algorithms
EG
Exact GED
1 Algorithms
FWW
Frequent Words with Mismatches Problem
1 Algorithms
GIB
Graph Isomorphism, Bounded Number of Vertices of Each Color
1 Algorithms
GIB
Graph Isomorphism, Bounded Vertex Valences
1 Algorithms
IC
Image Compositing
1 Algorithms
IA
InDegree Analysis
1 Algorithms
IRA
Integer Relation Among Reals
1 Algorithms
LOL
Length of Longest Common Subsequence
1 Algorithms
LPO
Longest Path on Interval Graphs
1 Algorithms
LCA
Lowest Common Ancestor
1 Algorithms
LCA
Lowest Common Ancestors with insertion and deletion of leaves
1 Algorithms
MCF
Maximum Cut for Planar Graphs
1 Algorithms
MSP
Median String Problem with Unbounded Alphabets
1 Algorithms
MLC
Multiple Longest Common Subsequence
1 Algorithms
NTD
NFA to DFA conversion
1 Algorithms
NIW
Nonnegative Integer Weighted Digraph
1 Algorithms
NE
Nonsymmetric Eigenvalue
1 Algorithms
OGM
Occupancy Grid Mapping
1 Algorithms
O
Offline
1 Algorithms
PP
Personalized PageRank
1 Algorithms
PBG
Planar Bipartite Graph Perfect Matching
1 Algorithms
PCW
Polygon Clipping with Convex Clipping Polygon
1 Algorithms
PSO
Preemptive Scheduling on Many Machines, Minimize Lateness
1 Algorithms
RM
Rectangular Matrices
1 Algorithms
RML
Rectangular Matrix LU Decomposition
1 Algorithms
RH
Renamable Horn
1 Algorithms
RAI
Reporting all intersection points, convex polygons
1 Algorithms
RAI
Reporting all intersection points, general polygons
1 Algorithms
RCW
Root Computation with continuous first derivative
1 Algorithms
SSC
Sequential Substring Constrained Longest Common Subsequence
1 Algorithms
SLS
Sparse Linear System
1 Algorithms
SN
Steal, No-Force
1 Algorithms
TVC
The Vertex Cover Problem, Degrees Bounded By 3
1 Algorithms
TCO
Transitive Closure of a symmetric Boolean matrix
1 Algorithms
TP
Turnpike Problem
1 Algorithms
UIW
Undirected, Integer Weights MST
1 Algorithms
UNW
Undirected, Nonnegative Weights
1 Algorithms
UPM
Undirected, Planar MST
1 Algorithms
WD
Weighted Digraph
1 Algorithms
ABV
all but very sparse graphs
1 Algorithms
DOA
d-Neighborhood of a String
1 Algorithms
KFA
k-ANNS for a dense 3D map of geometric points
1 Algorithms
K
k-Clique
1 Algorithms
KC
k-Graph Coloring
1 Algorithms
K
k-SAT
1 Algorithms
KA3
k-coloring a 3-colorable graph
1 Algorithms
NC
n-Queens Completion
1 Algorithms
0 Algorithms
"CI
"Exists" Connectivity in Graph Timelines
0 Algorithms
#C
#2-Graph Coloring
0 Algorithms
#C
#3-Graph Coloring
0 Algorithms
#
#3SUM
0 Algorithms
#C
#4-Graph Coloring
0 Algorithms
#C
#5-Graph Coloring
0 Algorithms
#MT
#All-Edges Monochromatic Triangle
0 Algorithms
#
#Convolution-3SUM
0 Algorithms
#AE
#Real All-Edges Exact Triangle
0 Algorithms
#
#SSR
0 Algorithms
#C
#k-Graph Coloring
0 Algorithms
$\P
$(\min, \leq)$ Product
0 Algorithms
$T
$\Delta$-Matching Triangles
0 Algorithms
$NA
$\ell_1$ Necklace Alignment
0 Algorithms
$NA
$\ell_\infty$ Necklace Alignment
0 Algorithms
(IP
(3-Dimensional, i.e. project onto a 2D plane)
0 Algorithms
(AP
(5/3)-approximate ap-shortest paths
0 Algorithms
(+C
(max, +) Convolution Lower Bound Testing
0 Algorithms
(+C
(max, +) Convolution Upper Bound Testing
0 Algorithms
(+C
(median, +) Convolution
0 Algorithms
(+C
(min, +) Convolution
0 Algorithms
0K
0-1 Knapsack
0 Algorithms
0LP
0-1 Linear Programming
0 Algorithms
1P
1-Fillability Problem
0 Algorithms
13L
1-Partite 3-variate Linear Degeneracy Testing, Non-Trivial
0 Algorithms
14L
1-Partite 4-variate Linear Degeneracy Testing, Non-Trivial
0 Algorithms
1SH
1-Sided Segment Hausdorff Distance under Translation
0 Algorithms
1
1-in-3SAT
0 Algorithms
1(S
1-sensitive (3/2)-approximate ss-shortest paths
0 Algorithms
1(D
1-sensitive (4/3)-approximate decremental diameter
0 Algorithms
1(D
1-sensitive (4/3)-approximate decremental eccentricity
0 Algorithms
1DD
1-sensitive decremental diameter
0 Algorithms
1DS
1-sensitive decremental st-shortest paths
0 Algorithms
1IS
1-sensitive incremental ss-reach
0 Algorithms
2SC
2 Strong Components (dynamic)
0 Algorithms
2C
2-Graph Coloring
0 Algorithms
2(S
2-sensitive (7/5)-approximate st-shortest paths
0 Algorithms
2DS
2-sensitive decremental st-shortest paths
0 Algorithms
2IS
2-sensitive incremental st-reach
0 Algorithms
2MS
2D Maximum Square Subarray
0 Algorithms
2
2SAT
0 Algorithms
3PO
3 Points on Line
0 Algorithms
3
3-OV
0 Algorithms
33L
3-Partite 3-variate Linear Degeneracy Testing, Non-Trivial
0 Algorithms
3MP
3D Motion Planning
0 Algorithms
3
3SAT-5
0 Algorithms
3
3SUM
0 Algorithms
3
3SUM'
0 Algorithms
4L
4-Cycle Listing
0 Algorithms
5C
5-Graph Coloring
0 Algorithms
AOD
APSP on Dense Directed Unweighted Graphs
0 Algorithms
AOD
APSP on Directed Graphs with Real-Valued Weights
0 Algorithms
AOS
APSP on Sparse Directed Graphs with Arbitrary Weights
0 Algorithms
AOS
APSP on Sparse Directed Unweighted Graphs
0 Algorithms
ATC
AST to Code Translation
0 Algorithms
ASF
Abelian Square Factor Centers Enumeration
0 Algorithms
ASF
Additive Square Factor Detection in Integer Strings
0 Algorithms
ADH
All Distant Horizon Edges
0 Algorithms
APM
All Pairs Minimum Witness
0 Algorithms
APM
All Pairs Minimum Witness (APMW)
0 Algorithms
ATC
All-Color-Pairs Triangle Collection
0 Algorithms
ATC
All-Color-Pairs Triangle Collection*
0 Algorithms
AET
All-Edges Exact Triangle
0 Algorithms
AMT
All-Edges Monochromatic Triangle
0 Algorithms
A
All-Equal-SAT
0 Algorithms
A3
All-Integers 3SUM
0 Algorithms
AMP
All-Nodes Median Parity
0 Algorithms
AMF
All-Pairs Maximum Flow
0 Algorithms
A3
All-Reals 3SUM
0 Algorithms
ABC
Approximate Betweenness Centrality
0 Algorithms
AD
Approximate Diameter
0 Algorithms
ADO
Approximate Distance Oracle
0 Algorithms
AHS
Approximate Hard-Margin SVM
0 Algorithms
AMV
Approximate Max-Area Visible Polygon
0 Algorithms
ARC
Approximate Reach Centrality
0 Algorithms
BD
BCNF Decomposition
0 Algorithms
BC
Betweenness Centrality
0 Algorithms
BC(
Betweenness Centrality (BC)
0 Algorithms
BHC
Bichromatic Hamming Close Pair
0 Algorithms
BSP
Binary Space Partitioning
0 Algorithms
BDS
Boolean d-Attribute Stable Matching
0 Algorithms
BBM
Bounded Bandwidth Matrix Multiplication
0 Algorithms
BNQ
Bounded Norm Quantum Linear System
0 Algorithms
CN
Chromatic Number
0 Algorithms
CKR
Closest-Weight k-Enclosing Rectangle
0 Algorithms
CBM
Colorful Boolean Matrix Multiplication
0 Algorithms
CB
Combinatorial BMM
0 Algorithms
CTD
Combinatorial Triangle Detection
0 Algorithms
CRQ
Conjunctive Reachability Queries in MDPs
0 Algorithms
CSQ
Conjunctive Safety Queries in MDPs
0 Algorithms
CS
Connected Subgraph
0 Algorithms
CPC
Convex Polygon Containment under Rotation
0 Algorithms
CPC
Convex Polygon Containment under Rotation and Translation
0 Algorithms
C3
Convolution 3SUM
0 Algorithms
CW
Convolution Witness
0 Algorithms
DB
Decisional BCNF
0 Algorithms
DD
Decremental Diameter
0 Algorithms
D
Diameter
0 Algorithms
D2V
Diameter 2 vs 3
0 Algorithms
D3V
Diameter 3 vs 7
0 Algorithms
DKV
Diameter k vs 2k-1
0 Algorithms
DMW
Dictionary Matching with One Gap
0 Algorithms
DMW
Dictionary Matching with One Gap*
0 Algorithms
DAP
Directed All-Nodes Positive Betweenness Centrality
0 Algorithms
DAR
Directed All-Nodes Reach Centrality
0 Algorithms
DM
Directed Median
0 Algorithms
DR
Directed Radius
0 Algorithms
DS
Directed st-Reach
0 Algorithms
DWA
Directed, Weighted APSP
0 Algorithms
DNF
Disjunctive Normal Form SAT
0 Algorithms
DQO
Disjunctive Queries of Safety in Graphs
0 Algorithms
DRQ
Disjunctive Reachability Queries in MDPs
0 Algorithms
DSQ
Disjunctive Safety Queries in MDPs
0 Algorithms
DCO
Disjunctive coBüchi Objectives
0 Algorithms
DP
Distance Product
0 Algorithms
DPV
Distance Product Verification
0 Algorithms
D3A
Double 3-Term Arithmetic Progression
0 Algorithms
DS
Dual-Horn SAT
0 Algorithms
DEO
Duplicate Elimination on Dirty Data
0 Algorithms
D$
Dynamic $k$-Mismatch
0 Algorithms
D$P
Dynamic $st$-Shortest Path
0 Algorithms
D4
Dynamic 4/3-Diameter
0 Algorithms
DBM
Dynamic Bipartite Maximum-Weight Matching
0 Algorithms
DCS
Dynamic Connected Subgraph
0 Algorithms
DDR
Dynamic Dihedral Rotation Queries
0 Algorithms
DM
Dynamic MaxSCC
0 Algorithms
DPP
Dynamic Personalized PageRank
0 Algorithms
DS
Dynamic ST-Reach
0 Algorithms
DSC
Dynamic Strong Connectivity
0 Algorithms
DTW
Dynamic Time Warping
0 Algorithms
DVT
Dynamic Vertex Triangle Listing
0 Algorithms
E
Eccentricity
0 Algorithms
ETC
Edge Triangle Counting
0 Algorithms
ETD
Edge Triangle Detection
0 Algorithms
ED
Edit Distance
0 Algorithms
ED
Equal Distance
0 Algorithms
ET
Exact Triangle
0 Algorithms
EW3
Exact Weight 3-Matching Detection
0 Algorithms
EW3
Exact Weight 3-Star Detection
0 Algorithms
EK
Exact k-Clique
0 Algorithms
FD
Frechet Distance
0 Algorithms
FE
Fredholm Equations
0 Algorithms
GBG
Generalized Büchi Games
0 Algorithms
GB
Geometric Base
0 Algorithms
GSM
Grammar-Compressed Square-Matrix-Vector Multiplication
0 Algorithms
GVI
Grammar-Compressed Vector Inner Product
0 Algorithms
GIT
Graph Isomorphism, Trivalent Graphs
0 Algorithms
GMS
Graph Motif Search
0 Algorithms
HIU
Hole in Union
0 Algorithms
HS
Horn SAT
0 Algorithms
HE
Huffman Encoding
0 Algorithms
ISQ
Independent Set Queries
0 Algorithms
ISP
Induced Subgraph Problem
0 Algorithms
ILP
Integer Linear Programming
0 Algorithms
IRA
Integer Relation Among Integers
0 Algorithms
JI
Jumbled Indexing
0 Algorithms
K
K-MSA
0 Algorithms
KHF
Keyed Hash Functions
0 Algorithms
LCS
Largest Common Subtree
0 Algorithms
LPW
Linear Programming with Reals
0 Algorithms
LA
Link Analysis/PageRank
0 Algorithms
LA
Local Alignment
0 Algorithms
LMA
Local Multiple Alignment
0 Algorithms
LRA
Local Register Allocation
0 Algorithms
LFS
Log-Counting Frequent Sets
0 Algorithms
LCS
Longest Common Substring with don't cares
0 Algorithms
LCA
Lowest Common Ancestors with Linking and Cutting
0 Algorithms
MPV
Matrix Product Verification
0 Algorithms
MD
Max Depth
0 Algorithms
MVP
Max-Area Visible Polygon
0 Algorithms
MFS
Max-Cardinality Frequent Set
0 Algorithms
M4
Max-Weight 4-Clique
0 Algorithms
MR
Max-Weight Rectangle
0 Algorithms
MK
Max-Weight k-Clique
0 Algorithms
M
MaxSAT
0 Algorithms
MCS
Maximum Consecutive Subsums
0 Algorithms
MIP
Maximum Inner Product Search
0 Algorithms
MLE
Maximum Local Edge Connectivity
0 Algorithms
MSC
Maximum Strongly Connected Component
0 Algorithms
MS
Maximum Subarray
0 Algorithms
MT
Maximum TSP
0 Algorithms
M
Median
0 Algorithms
MSP
Median String Problem with Binary Alphabets
0 Algorithms
MSP
Median String Problem with Bounded Alphabets
0 Algorithms
M
Metricity
0 Algorithms
MIS
Min-Cardinality Infrequent Set
0 Algorithms
MK
Min-Weight k-Clique
0 Algorithms
MK
Min-Weight k-Cycle
0 Algorithms
MKR
Min-Weight k-Enclosing Rectangle
0 Algorithms
MC
Minimal Coloring
0 Algorithms
MT
Minimum Triangle
0 Algorithms
MWT
Minimum Weight Triangle
0 Algorithms
MWF
Minimum Witness Finding
0 Algorithms
MSH
Minimum-Area Star-Shaped Hull, Restricted
0 Algorithms
MSH
Minimum-Area Star-Shaped Hull, Unestricted
0 Algorithms
MF
Minimum-Cost Flow
0 Algorithms
MC
Mono Convolution
0 Algorithms
M1
Monotone 1-in-3SAT
0 Algorithms
M3
Monotone 3SAT
0 Algorithms
MN3
Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT)
0 Algorithms
MN
Monotone Not-Exactly-1-in-3SAT
0 Algorithms
MO
Most OV
0 Algorithms
MLA
Multiple Local Alignment
0 Algorithms
MSA
Multiple Sequence Alignment
0 Algorithms
MLM
Multivariate Least Median-of-Squares Estimator
0 Algorithms
MLS
Multivariate Least-Quantile Squares Estimator
0 Algorithms
NTD
Negative Triangle Detection
0 Algorithms
NTL
Negative Triangle Listing
0 Algorithms
NTS
Negative Triangle Search
0 Algorithms
NF
No-Steal, Force
0 Algorithms
NMF
Non-integer Maximum Flow
0 Algorithms
NT
Nondecreasing Triangle
0 Algorithms
NDF
Nonequispaced Discrete Fourier Transform
0 Algorithms
N3(
Not-All-Equal 3-SAT (NAE 3SAT)
0 Algorithms
OAS
Odd Abelian Square Factor Detection
0 Algorithms
OMM
Online Matrix-Vector Multiplication
0 Algorithms
OVM
Online Vector-Matrix-Vector Multiplication
0 Algorithms
OS
Overdetermined System
0 Algorithms
PC
Partial Convolution
0 Algorithms
PCI
Partial Convolution Indexing
0 Algorithms
PM
Partial Match
0 Algorithms
PMM
Partial Matrix Multiplication
0 Algorithms
PMM
Partial Matrix Multiplication Indexing
0 Algorithms
PDN
Pattern Distance, Normalized Hamming Distance under Shifts
0 Algorithms
PDN
Pattern Distance, Normalized Hamming Distance under Shifts and Scaling
0 Algorithms
P2B
Perfect 2D Binary Space Partitioning
0 Algorithms
PMP
Planar Motion Planning
0 Algorithms
PC
Point Covering
0 Algorithms
PHD
Point Hausdorff Distance under Translation
0 Algorithms
PO3
Point on 3 Lines
0 Algorithms
PCU
Polygon Containment under Translation
0 Algorithms
PI
Polynomial Interpolation
0 Algorithms
PBC
Positive Betweenness Centrality
0 Algorithms
P[2
Positive [1, 2] Betweenness Centrality
0 Algorithms
PQ
Price Query
0 Algorithms
QLS
Quantum Linear System
0 Algorithms
RF
RNA Folding
0 Algorithms
R
Radius
0 Algorithms
RC
Reach Centrality
0 Algorithms
RIM
Reachability in MDPs
0 Algorithms
RAE
Real All-Edges Exact Triangle
0 Algorithms
RET
Real Exact Triangle
0 Algorithms
RRC
Real Root Computation
0 Algorithms
RPP
Replacement Paths Problem
0 Algorithms
RPP
Replacement Paths Problem (RPP)
0 Algorithms
S
SAT
0 Algorithms
SF
ST-Maximum Flow
0 Algorithms
S
ST-Reach
0 Algorithms
SIG
Safety in Graphs
0 Algorithms
SIM
Safety in MDPs
0 Algorithms
SSS
Second Shortest Simple Path
0 Algorithms
SHD
Segment Hausdorff Distance under Translation
0 Algorithms
SCP
Segments Containing Points
0 Algorithms
S
Separator1
0 Algorithms
S
Separator2
0 Algorithms
SAW
Sequence-to-Graph Alignment with DAGs
0 Algorithms
SD
Set Disjointness
0 Algorithms
SI
Set Intersection
0 Algorithms
SC
Shortest Cycle
0 Algorithms
SK
Shortest k-Cycle
0 Algorithms
SPP
Single-Sourced Personalized PageRank
0 Algorithms
SCS
Smallest Color-Spanning Strip
0 Algorithms
SKR
Smallest k-Enclosing Rectangle
0 Algorithms
STM
Solutions to Multidimensional Nonlinear Equations
0 Algorithms
SFT
Sparse Fourier Transform
0 Algorithms
SQL
Sparse Quantum Linear System
0 Algorithms
SS
Sparse Solution
0 Algorithms
SDT
Spherical Delaunay Triangulation
0 Algorithms
SMV
Stable Matching Verification
0 Algorithms
SPC
Stable Pair Checking
0 Algorithms
SDR
Static Dihedral Rotation Queries
0 Algorithms
SCB
Strips Cover Box
0 Algorithms
SC(
Strong Connectivity (dynamic)
0 Algorithms
SQ
Subset Query
0 Algorithms
SI
Subtree Isomorphism
0 Algorithms
ST
Superadditivity Testing
0 Algorithms
TVC
The Vertex Cover Problem for Two-Terminal Series-Parallel Graphs
0 Algorithms
TQL
Toeplitz Quantum Linear System
0 Algorithms
TFC
Top-k Frequent Closed Itemsets
0 Algorithms
TS
Tree Sparsity
0 Algorithms
TC
Triangle Collection
0 Algorithms
TC
Triangle Collection*
0 Algorithms
TD
Triangle Detection
0 Algorithms
TL
Triangle Listing
0 Algorithms
TM
Triangle Measure
0 Algorithms
TIU
Triangle in Unweighted Graph
0 Algorithms
TCT
Triangles Cover Triangle
0 Algorithms
UV
UNLISTED VARIATION
0 Algorithms
UO
Unbalanced OV
0 Algorithms
UK
Unbounded Knapsack
0 Algorithms
UAP
Undirected All-Nodes Positive Betweenness Centrality
0 Algorithms
UAR
Undirected All-Nodes Reach Centrality
0 Algorithms
UM
Undirected Median
0 Algorithms
UR
Undirected Radius
0 Algorithms
UWI
Undirected Wiener Index
0 Algorithms
UWA
Undirected, Weighted APSP
0 Algorithms
ULM
Univariate Least Median-of-Squares Estimator
0 Algorithms
ULS
Univariate Least-Quantile Squares Estimator
0 Algorithms
UIS
Unweighted Interval Scheduling
0 Algorithms
UMF
Unweighted Maximum Flow
0 Algorithms
VTL
Vertex Triangle Listing
0 Algorithms
VBS
Visibility Between Segments
0 Algorithms
VFI
Visibility From Infinity
0 Algorithms
VT
Visible Triangle
0 Algorithms
VE
Volterra Equations
0 Algorithms
WD
Weighted Depth
0 Algorithms
X
XOR-SAT
0 Algorithms
A
ap-reach
0 Algorithms
CS(
constant sensitivity (4/3)-approximate incremental diameter
0 Algorithms
CSI
constant sensitivity incremental ST-Reach
0 Algorithms
DDT
d-Dimensional Delaunay Triangulation
0 Algorithms
DMS
dD Maximum Square Subarray
0 Algorithms
DMS
dD Maximum Subarray
0 Algorithms
DSF
dynamic st-Maximum Flow
0 Algorithms
N
n-Player
0 Algorithms
SI#
sensitive incremental #SSR
0 Algorithms
SIS
sensitive incremental ST-Reach
0 Algorithms
SC
small#-Graph Coloring
0 Algorithms
SP
st-Shortest Path
0 Algorithms