No article text was recorded for this version.
algorithmic implementation complexity
Version 2 of 2126 papers133 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers
- Blog: A Root of a Problem: Optimizing Single-Root Dependency Parsing
- Blog: A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization
- Blog: Visibility and Intersection Problems in Plane Geometry
- Blog: Gomory-Hu Trees in Quadratic Time
- Blog: A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon
- Blog: Maximum st-flow in directed planar graphs via shortest paths
- Blog: Change Propagation Without Joins
- Blog: L2/L2-foreach sparse recovery with low risk
- Blog: Algorithm Engineering of SSSP With Negative Edge Weights
- Blog: Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
- Blog: Faster Sparse Minimum Cost Flow by Electrical Flow Localization
- Blog: Improved Approximation for Node-Disjoint Paths in Planar Graphs
- Blog: Dominating Sets and Connected Dominating Sets in Dynamic Graphs
- Blog: Directed Shortest Paths via Approximate Cost Balancing
- Blog: Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
- Blog: Maintaining Contour Trees of Dynamic Terrains
- Blog: Deterministic Almost-Linear-Time Gomory-Hu Trees
- Blog: Three-coloring triangle-free planar graphs in linear time
- Blog: Noisy Adaptive Group Testing via Noisy Binary Search
- Blog: An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow
- Blog: Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
- Blog: Local Flow Partitioning for Faster Edge Connectivity
- Blog: Efficient Estimation of Graph Trussness
- Blog: Output sensitive algorithms for approximate incidences and their applications
- Blog: Fast Generation of Random Spanning Trees and the Effective Resistance Metric
- Blog: Privacy-preserving Prediction
- Blog: Solving Empirical Risk Minimization in the Current Matrix Multiplication Time
- Blog: A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs
- Blog: The First Optimal Algorithm for Smooth and Strongly-Convex-Strongly-Concave Minimax Optimization
- Blog: Algorithmic Meta Theorems
- Blog: Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player
- Blog: Faster Algorithms for Internal Dictionary Queries
- Blog: Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane
- Blog: Simple Algorithms for Fully Dynamic Edge Connectivity
- Blog: Boundary-to-boundary flows in planar graphs
- Blog: Fast Deterministic Fully Dynamic Distance Approximation
- Blog: Streaming Quantiles Algorithms with Small Space and Update Time
- Blog: Thematic issue on data management for graphs
- Blog: Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms
- Blog: Practical Minimum Cut Algorithms
- Blog: On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms
- Blog: Faster All-Pairs Optimal Electric Car Routing
- Blog: Backtracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs
- Blog: Faster generation of random spanning trees
- Blog: Selection from heaps, row-sorted matrices and X+Y using soft heaps
- Blog: The Number of Minimum k-Cuts: Improving the Karger-Stein Bound
- Blog: Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes
- Blog: Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
- Blog: Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs
- Blog: A Faster Isomorphism Test for Graphs of Small Degree
- Blog: Bootstrapping Dynamic APSP via Sparsification
- Blog: On the Structure of Hamiltonian Graphs with Small Independence Number
- Blog: Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval
- Blog: Obtaining a Planar Graph by Vertex Deletion
- Blog: An O(n log n)-Time Algorithm for the k-Center Problem in Trees
- Blog: A Simple Solution to the Level-Ancestor Problem
- Blog: The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
- Blog: Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
- Blog: Two-Point L1 Shortest Path Queries in the Plane
Showing 60 of 126 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_algorithmic_implementation_complexity_9cfaa7f4,
title = {algorithmic implementation complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/algorithmic-implementation-complexity/rdr_9cfaa7f4f33546928e38adbc59b401c9},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 2, frozen text):
@misc{lacuna_algorithmic_implementation_complexity_9cfaa7f4_v2,
title = {algorithmic implementation complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/algorithmic-implementation-complexity/rdr_9cfaa7f4f33546928e38adbc59b401c9/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-21},
}