On the public citation graph
Constructing a perfect matching is in random NC
0 signed · 243 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0022-0000(79)90045-xopenalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1016/0304-3975(82)90092-5openalex-snapshot
The maximum flow problem is log space complete for P
inferredcites →https://doi.org/10.1016/s0019-9958(83)80060-6openalex-snapshot
Parallel computation for well-endowed rings and space-bounded probabilistic machines
inferredcites →https://doi.org/10.1145/22145.22147openalex-snapshot
The two-processor scheduling problem is in R-NC
inferredcites →https://doi.org/10.1145/22145.22197openalex-snapshot
Are search and decision programs computationally equivalent?
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/358141.358144openalex-snapshot
An overview of computational complexity
inferredcites →https://doi.org/10.1145/800220.806702openalex-snapshot
N-processors graphs distributively achieve perfect matchings in O(log2N) beats
inferredcites →https://doi.org/10.6028/jres.071b.033openalex-snapshot
Systems of distinct representatives and linear algebra
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.3230230105openalex-snapshot
Efficient parallel algorithms for bipartite permutation graphs
inferred← citeshttps://doi.org/10.1006/jagm.1993.1046openalex-snapshot
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs
inferred← citeshttps://doi.org/10.1006/jagm.1995.1006openalex-snapshot
The Parallel Complexity of Tree Embedding Problems
inferred← citeshttps://doi.org/10.1006/jagm.1996.0820openalex-snapshot
Parallel Algorithms for Reducible Flow Graphs
inferred← citeshttps://doi.org/10.1006/jcss.1997.1532openalex-snapshot
(De)randomized Construction of Small Sample Spaces in NC
inferred← citeshttps://doi.org/10.1006/jcss.1998.1592openalex-snapshot
Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth
inferred← citeshttps://doi.org/10.1006/jcss.1999.1646openalex-snapshot
Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds
inferred← citeshttps://doi.org/10.1006/jcss.2000.1740openalex-snapshot
Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems
inferred← citeshttps://doi.org/10.1006/jpdc.1996.1257openalex-snapshot
Competitive Analysis of Network Load Balancing
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1425openalex-snapshot
A Parallel Priority Queue with Constant Time Operations
inferred← citeshttps://doi.org/10.1007/11561071_18openalex-snapshot
Improved Approximation Algorithms for Metric Max TSP
inferred← citeshttps://doi.org/10.1007/11758471_30openalex-snapshot
A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small
inferred← citeshttps://doi.org/10.1007/11786986_25openalex-snapshot
Weighted Bipartite Matching in Matrix Multiplication Time
inferred← citeshttps://doi.org/10.1007/11786986_40openalex-snapshot
On the Bipartite Unique Perfect Matching Problem
inferred← citeshttps://doi.org/10.1007/3-540-17179-7_24openalex-snapshot
Connectivity algorithms using rubber bands
inferred← citeshttps://doi.org/10.1007/3-540-17218-1_59openalex-snapshot
Applications of parallel scheduling to perfect graphs
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_27openalex-snapshot
The probabilistic and deterministic parallel complexity of symmetric functions
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_27openalex-snapshot
NC algorithms for computing the number of perfect matchings in K 3,3-free graphs and related problems
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_149openalex-snapshot
Pfaffian orientations, 0/1 permanents, and even cycles in directed graphs
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_7openalex-snapshot
Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45414-4_19openalex-snapshot
Efficient Routing in Networks with Long Range Contacts
inferred← citeshttps://doi.org/10.1007/3-540-50647-0_110openalex-snapshot
Fast parallel algorithms and the complexity of parallelism (basic issues and recent advances)
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_13openalex-snapshot
Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_170openalex-snapshot
The parallel complexity of tree embedding problems (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_37openalex-snapshot
Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_214openalex-snapshot
Extended graph connectivity and its gradually increasing parallel complexity
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_78openalex-snapshot
On parallel complexity of maximum f-matching and the degree sequence problem
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_91openalex-snapshot
Finding largest common embeddable subtrees
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_67openalex-snapshot
Parallel vs. parametric complexity
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_326openalex-snapshot
Randomized Parallel Approximations to Max Flow
inferred← citeshttps://doi.org/10.1007/978-1-4612-1492-2_9openalex-snapshot
Randomized Parallel Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_32openalex-snapshot
Randomized Parallel Algorithms for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3400-2_2openalex-snapshot
Parallel Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4939-0808-0_10openalex-snapshot
The Shortest Superstring Problem
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_326openalex-snapshot
Randomized Parallel Approximations to Max Flow
inferred← citeshttps://doi.org/10.1007/978-3-030-80627-9_7openalex-snapshot
Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-28684-6_6openalex-snapshot
Shortest Augmenting Paths for Online Matchings on Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_43openalex-snapshot
Seeking a Vertex of the Planar Matching Polytope in NC
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_5openalex-snapshot
Algebraic Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_18openalex-snapshot
Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-32820-6_68openalex-snapshot
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_3openalex-snapshot
An Overview of Randomized Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_35openalex-snapshot
Testing Equivalence of Polynomials under Shifts
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_4openalex-snapshot
Basic Parallel Algorithms in Graph Theory
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_5openalex-snapshot
Applications of Parallel Scheduling Algorithms to Families of Perfect Graphs
inferred← citeshttps://doi.org/10.1007/bf01302965openalex-snapshot
Directeds-t numberings, Rubber bands, and testing digraphk-vertex connectivity
inferred← citeshttps://doi.org/10.1007/bf01961540openalex-snapshot
Designing checkers for programs that run in parallel
inferred← citeshttps://doi.org/10.1007/bf02122548openalex-snapshot
A random 1-011-011-01algorithm for depth first search
inferred← citeshttps://doi.org/10.1007/bf02125897openalex-snapshot
Constructing disjoint paths on expander graphs
inferred← citeshttps://doi.org/10.1007/bf02186483openalex-snapshot
Parallel computing in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/bf02579264openalex-snapshot
A las vegas rnc algorithm for maximum matching
inferred← citeshttps://doi.org/10.1007/bf02579320openalex-snapshot
A parallel algorithm for the maximal path problem
inferred← citeshttps://doi.org/10.1007/bf02585470openalex-snapshot
Singular spaces of matrices and their application in combinatorics
inferred← citeshttps://doi.org/10.1007/bfb0020792openalex-snapshot
Tight RNC approximations to Max Flow
inferred← citeshttps://doi.org/10.1007/bfb0028269openalex-snapshot
Representing and enumerating edge connectivity cuts in RNC
inferred← citeshttps://doi.org/10.1007/bfb0040382openalex-snapshot
Computing a perfect matching in a line graph
inferred← citeshttps://doi.org/10.1007/s00224-007-9018-5openalex-snapshot
Processor Efficient Parallel Matching
inferred← citeshttps://doi.org/10.1007/s00224-009-9204-8openalex-snapshot
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00224-013-9469-9openalex-snapshot
Log-Space Algorithms for Paths and Matchings in k-Trees
inferred← citeshttps://doi.org/10.1007/s00224-017-9838-xopenalex-snapshot
Shortest Augmenting Paths for Online Matchings on Trees
inferred← citeshttps://doi.org/10.1007/s00453-013-9865-1openalex-snapshot
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows
inferred← citeshttps://doi.org/10.1007/s00453-023-01184-2openalex-snapshot
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision
inferred← citeshttps://doi.org/10.1007/s101070100271openalex-snapshot
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
inferred← citeshttps://doi.org/10.1007/s10878-006-9023-7openalex-snapshot
Improved approximation algorithms for metric MaxTSP
inferred← citeshttps://doi.org/10.1007/s11856-023-2515-7openalex-snapshot
Connections between graphs and matrix spaces
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90173-fopenalex-snapshot
Las Vegas RNC algorithms for unary weighted perfect matching and T-join problems
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90055-eopenalex-snapshot
Approximating matchings in parallel
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90027-xopenalex-snapshot
The complexity of parallel search
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90053-xopenalex-snapshot
Pfaffian orientations, 0–1 permanents, and even cycles in directed graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90081-mopenalex-snapshot
Subtree isomorphism is in random NC
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90086-copenalex-snapshot
An introduction to randomized algorithms
inferred← citeshttps://doi.org/10.1016/0167-6377(93)90068-ropenalex-snapshot
Parallel algorithms for the assignment and minimum-cost flow problems
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00007-0openalex-snapshot
Partitioning graphs into Hamiltonian ones
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90005-9openalex-snapshot
Maximum matchings in general graphs through randomization
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90015-1openalex-snapshot
The parallel complexity of TSP heuristics
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90010-vopenalex-snapshot
Parallel recognition of the consecutive ones property with applications
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90192-kopenalex-snapshot
A complexity theory of efficient parallel algorithms
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90003-5openalex-snapshot
Parallel approximation algorithms for bin packing
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90017-5openalex-snapshot
NC algorithms for computing the number of perfect matchings in K3,3-free graphs and related problems
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot
A Catalog of Complexity Classes
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105295openalex-snapshot
Derandomization of quantum algorithm for triangle finding
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.03.011openalex-snapshot
Improved deterministic approximation algorithms for Max TSP
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.03.005openalex-snapshot
Approximating weighted matchings in parallel
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2005.04.009openalex-snapshot
The 2004 Benjamin Franklin Medal in Computer and Cognitive Science presented to Richard M. Karp
inferred← citeshttps://doi.org/10.1016/j.orl.2022.02.008openalex-snapshot
Two dimensional maximum weight matching using Manhattan topology
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.028openalex-snapshot
Maximum weight bipartite matching in matrix multiplication time
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.024openalex-snapshot
A combinatoric interpretation of dual variables for weighted matching and f -factors
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00103-9openalex-snapshot
A remark on maximum matching of line graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00128-9openalex-snapshot
Parallel approximation algorithms for maximum weighted matching in general graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(96)00181-0openalex-snapshot
Nearly-perfect hypergraph packing is in NC
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00015-xopenalex-snapshot
A faster parallel algorithm for k-connectivity
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00196-8openalex-snapshot
A note on parallel complexity of maximum f-matching
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80069-8openalex-snapshot
The probabilistic method yields deterministic parallel algorithms
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00358-5openalex-snapshot
Cardinality constrained minimum cut problems: complexity and algorithms
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70395-9openalex-snapshot
Matching and Vertex Packing: How “hard” are They?
inferred← citeshttps://doi.org/10.1016/s0196-6774(96)90033-5openalex-snapshot
α-Connectivity: A Gradually Nonparallel Graph Problem
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80206-3openalex-snapshot
Chapter 9 Computational complexity
inferred← citeshttps://doi.org/10.1017/s0963548300000559openalex-snapshot
Threshold Functions for H -factors
inferred← citeshttps://doi.org/10.1017/s0963548300002054openalex-snapshot
Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
inferred← citeshttps://doi.org/10.1080/10637199408915410openalex-snapshot
PARALLEL APPROXIMATE MATCHING
inferred← citeshttps://doi.org/10.1080/10637199508915506openalex-snapshot
THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗†
inferred← citeshttps://doi.org/10.1109/71.238627openalex-snapshot
A parallel algorithm for an efficient mapping of grids in hypercubes
inferred← citeshttps://doi.org/10.1109/ccc.1998.694594openalex-snapshot
Isolation, matching, and counting
inferred← citeshttps://doi.org/10.1109/ccc.2010.21openalex-snapshot
On the Matching Problem for Special Graph Classes
inferred← citeshttps://doi.org/10.1109/focs.2012.72openalex-snapshot
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings
inferred← citeshttps://doi.org/10.1109/focs.2015.35openalex-snapshot
Deterministic Divisibility Testing via Shifted Partial Derivatives
inferred← citeshttps://doi.org/10.1109/focs.2017.70openalex-snapshot
The Matching Problem in General Graphs Is in Quasi-NC
inferred← citeshttps://doi.org/10.1109/focs.2018.00068openalex-snapshot
Planar Graph Perfect Matching Is in NC
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00013openalex-snapshot
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization
inferred← citeshttps://doi.org/10.1109/glocom.2010.5683975openalex-snapshot
An Optimal Solution to the Distributed Data Retrieval Problem
inferred← citeshttps://doi.org/10.1109/hicss.1993.284099openalex-snapshot
Parallel approximate matching
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302904openalex-snapshot
Parallel maximum weight bipartite matching algorithms for scheduling in input-queued switches
inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00083openalex-snapshot
NC Algorithms for Popular Matchings in One-Sided Preference Systems and Related Problems
inferred← citeshttps://doi.org/10.1109/isit.2003.1228458openalex-snapshot
Network coding from a network flow perspective
inferred← citeshttps://doi.org/10.1109/sfcs.1986.1openalex-snapshot
A Las Vegas - NC algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21935openalex-snapshot
Sublinear-time parallel algorithms for matching and related problems
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21936openalex-snapshot
Optimal parallel algorithm for the Hamiltonian cycle problem on dense graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63464openalex-snapshot
Flow in planar graphs with multiple sources and sinks
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63502openalex-snapshot
Interior-point methods in parallel computation
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267786openalex-snapshot
Approximate max flow on small depth networks
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365689openalex-snapshot
(De)randomized construction of small sample spaces in /spl Nscr//spl Cscr/
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892080openalex-snapshot
On the hardness of graph isomorphism
inferred← citeshttps://doi.org/10.1109/spdp.1990.143503openalex-snapshot
The maximum weight perfect matching problem for complete weighted graphs is in PC
inferred← citeshttps://doi.org/10.1109/spdp.1990.143506openalex-snapshot
Deterministic load balancing in computer networks
inferred← citeshttps://doi.org/10.1109/tit.2006.881746openalex-snapshot
A Random Linear Network Coding Approach to Multicast
inferred← citeshttps://doi.org/10.1137/0218076openalex-snapshot
The Two-Processor Scheduling Problem is in Random NC
inferred← citeshttps://doi.org/10.1137/0220004openalex-snapshot
Simple Local Search Problems that are Hard to Solve
inferred← citeshttps://doi.org/10.1137/0221011openalex-snapshot
Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
inferred← citeshttps://doi.org/10.1137/0402012openalex-snapshot
Parallel Algorithms for Zero-One Supply-Demand Problems
inferred← citeshttps://doi.org/10.1137/0805036openalex-snapshot
Fast Interior Point Methods for Bipartite Matching
inferred← citeshttps://doi.org/10.1137/1034049openalex-snapshot
Complexity of Computations with Matrices and Polynomials
inferred← citeshttps://doi.org/10.1137/110824516openalex-snapshot
Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in
inferred← citeshttps://doi.org/10.1137/16m1097870openalex-snapshot
Bipartite Perfect Matching is in Quasi-NC
inferred← citeshttps://doi.org/10.1137/17m1130538openalex-snapshot
Derandomizing Isolation in Space-Bounded Settings
inferred← citeshttps://doi.org/10.1137/19m1256221openalex-snapshot
NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs
inferred← citeshttps://doi.org/10.1137/19m1299128openalex-snapshot
From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces
inferred← citeshttps://doi.org/10.1137/22m147685xopenalex-snapshot
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection
inferred← citeshttps://doi.org/10.1137/s009753970241096xopenalex-snapshot
On the Hardness of Graph Isomorphism
inferred← citeshttps://doi.org/10.1137/s009753970444661xopenalex-snapshot
Localized Client-Server Load Balancing without Global Information
inferred← citeshttps://doi.org/10.1137/s0097539789162997openalex-snapshot
Flow in Planar Graphs with Multiple Sources and Sinks
inferred← citeshttps://doi.org/10.1137/s0097539791195245openalex-snapshot
Randomized parallel algorithms for matroid union and intersection, with applications to arboresences and edge-disjoint spanning trees
inferred← citeshttps://doi.org/10.1137/s0097539792232021openalex-snapshot
Existence and Construction of Edge-Disjoint Paths on Expander Graphs
inferred← citeshttps://doi.org/10.1137/s0097539792236717openalex-snapshot
Approximate Max-Flow on Small Depth Networks
inferred← citeshttps://doi.org/10.1137/s0097539793250330openalex-snapshot
Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539793256223openalex-snapshot
Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory
inferred← citeshttps://doi.org/10.1137/s0097539794273083openalex-snapshot
An $\NC$ Algorithm for Minimum Cuts
inferred← citeshttps://doi.org/10.1137/s0097539794282930openalex-snapshot
Lower Bounds in a Parallel Model without Bit Operations
inferred← citeshttps://doi.org/10.1137/s0097539798341600openalex-snapshot
Reducing Randomness via Irrational Numbers
inferred← citeshttps://doi.org/10.1137/s0895480194267932openalex-snapshot
Realizing Degree Sequences in Parallel
inferred← citeshttps://doi.org/10.1145/1073970.1073994openalex-snapshot
Processor efficient parallel matching
inferred← citeshttps://doi.org/10.1145/1121341.1121486openalex-snapshot
Teaching the power of randomization using a simple game
inferred← citeshttps://doi.org/10.1145/1124706.1121486openalex-snapshot
Teaching the power of randomization using a simple game
inferred← citeshttps://doi.org/10.1145/129712.129727openalex-snapshot
Existence and construction of edge disjoint paths on expander graphs
inferred← citeshttps://doi.org/10.1145/1378533.1378558openalex-snapshot
Improved distributed approximate matching
inferred← citeshttps://doi.org/10.1145/165231.165238openalex-snapshot
Parallel and output sensitive algorithms for combinatorial and linear algebra problems
inferred← citeshttps://doi.org/10.1145/165231.166107openalex-snapshot
Fast parallel matching in expander graphs
inferred← citeshttps://doi.org/10.1145/167088.167213openalex-snapshot
Randomness-optimal unique element isolation, with applications to perfect matching and related problems
inferred← citeshttps://doi.org/10.1145/167088.167281openalex-snapshot
An Õ(n 2 ) algorithm for minimum cuts
inferred← citeshttps://doi.org/10.1145/174666.174667openalex-snapshot
On randomization in sequential and distributed algorithms
inferred← citeshttps://doi.org/10.1145/195058.195241openalex-snapshot
Derandomization through approximation
inferred← citeshttps://doi.org/10.1145/22145.22149openalex-snapshot
A parallel algorithm for the maximal path problem
inferred← citeshttps://doi.org/10.1145/2325296.2325330openalex-snapshot
Enriching introductory programming courses with non-intuitive probability experiments component
inferred← citeshttps://doi.org/10.1145/234533.234534openalex-snapshot
A new approach to the minimum cut problem
inferred← citeshttps://doi.org/10.1145/258533.258583openalex-snapshot
Reducing randomness via irrational numbers
inferred← citeshttps://doi.org/10.1145/258533.258586openalex-snapshot
Is there an algebraic proof for P ≠ NC? (extended abstract)
inferred← citeshttps://doi.org/10.1145/2591796.2591816openalex-snapshot
Hitting sets for multilinear read-once algebraic branching programs, in any order
inferred← citeshttps://doi.org/10.1145/2635822openalex-snapshot
The complexity of the comparator circuit value problem
inferred← citeshttps://doi.org/10.1145/2736283openalex-snapshot
Algorithmic Applications of Baur-Strassen’s Theorem
inferred← citeshttps://doi.org/10.1145/28395.28424openalex-snapshot
Constructing disjoint paths on expander graphs
inferred← citeshttps://doi.org/10.1145/28395.28430openalex-snapshot
A random NC algorithm for depth first search
inferred← citeshttps://doi.org/10.1145/28395.383347openalex-snapshot
Matching is as easy as matrix inversion
inferred← citeshttps://doi.org/10.1145/2897518.2897564openalex-snapshot
Bipartite perfect matching is in quasi-NC
inferred← citeshttps://doi.org/10.1145/3041402openalex-snapshot
Exact Perfect Matching in Complete Graphs
inferred← citeshttps://doi.org/10.1145/3170709openalex-snapshot
Identity Testing and Lower Bounds for Read- k Oblivious Algebraic Branching Programs
inferred← citeshttps://doi.org/10.1145/3293611.3331603openalex-snapshot
Weighted Matchings via Unweighted Augmentations
inferred← citeshttps://doi.org/10.1145/3306208openalex-snapshot
A deterministic parallel algorithm for bipartite perfect matching
inferred← citeshttps://doi.org/10.1145/3323165.3323206openalex-snapshot
NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs
inferred← citeshttps://doi.org/10.1145/335305.335346openalex-snapshot
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)
inferred← citeshttps://doi.org/10.1145/3406325.3451123openalex-snapshot
Fractionally log-concave and sector-stable polynomials: counting planar matchings and more
inferred← citeshttps://doi.org/10.1145/3665800openalex-snapshot
Hitting Sets for Orbits of Circuit Classes and Polynomial Families
inferred← citeshttps://doi.org/10.1145/3694906.3743356openalex-snapshot
Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
inferred← citeshttps://doi.org/10.1145/3708508openalex-snapshot
Robustness for Space-Bounded Statistical Zero Knowledge
inferred← citeshttps://doi.org/10.1145/3717823.3718316openalex-snapshot
Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions and Near-Optimal Separations
inferred← citeshttps://doi.org/10.1145/62212.62263openalex-snapshot
Almost-optimum speed-ups of algorithms for bipartite matching and related problems
inferred← citeshttps://doi.org/10.1146/annurev.cs.03.060188.001313openalex-snapshot
Parallel Algorithmic Techniques For Combinational Computation
showing the first 200 of 231 · page through all 231
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.