No article text was recorded for this version.
deterministic parallel complexity
Version 1 of 129 papers60 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Planar Graph Perfect Matching Is in NC
- Blog: Fractional Linear Matroid Matching Is in Quasi-NC
- Blog: NC Algorithms for Weighted Planar Perfect Matching and Related Problems
- Blog: A Pseudo-Deterministic RNC Algorithm for General Graph Perfect Matching
- Blog: The Matching Problem in General Graphs is in Quasi-NC
- Blog: Perfect matchings in o(n log n) time in regular bipartite graphs
- Blog: Bipartite Perfect Matching in Pseudo-Deterministic NC
- Blog: On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem
- Blog: Perfect Matchings in Õ (n 1.5) Time in Regular Bipartite Graphs
- Blog: Perfect Matchings in O(nlog n) Time in Regular Bipartite Graphs
- Blog: The Demand Query Model for Bipartite Matching
- Blog: Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
- Blog: Walrasian Equilibria in Markets with Small Demands
- Blog: On the spectrum of the forced matching number of graphs
- Blog: Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
- Blog: Cut-Query Algorithms with Few Rounds
- Blog: Parallel Graph Connectivity in Log Diameter Rounds
- Blog: Largest Weight Common Subtree Embeddings with Distance Penalties
- Blog: Perfect Matchings with Crossings
- Blog: Bipartite perfect matching as a real polynomial
- Blog: A Deterministic Parallel APSP Algorithm and its Applications
- Blog: Massively Parallel Algorithms for b-Matching
- Blog: Parallel Planar Subgraph Isomorphism and Vertex Connectivity
- Blog: Perfect Matchings with Crossings
- Blog: Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
- Blog: On the Complexity of Equivalence and Minimisation for Q-weighted Automata
- Blog: Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs
- Blog: Parallel Complexity of Geometric Bipartite Matching
- Blog: Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
History & citation
Current · Permanent link
- Deterministic Parallel Algorithms for Perfect Matching merged into this direction (53% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_deterministic_parallel_complexity_5ea14338,
title = {deterministic parallel complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/deterministic-parallel-complexity/rdr_5ea143389136433cb03d245e48fca8fe},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_deterministic_parallel_complexity_5ea14338_v1,
title = {deterministic parallel complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/deterministic-parallel-complexity/rdr_5ea143389136433cb03d245e48fca8fe/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}