On the public citation graph
Improved processor bounds for combinatorial problems in RNC
0 signed · 42 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.1007/3-540-16042-6_29openalex-snapshot
Fast and efficient parallel algorithms for the exact inversion of integer matrices
inferredcites →https://doi.org/10.1007/bf02579206openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1016/0020-0190(78)90079-0openalex-snapshot
An improved parallel processor bound in fast matrix inversion
inferredcites →https://doi.org/10.1016/0020-0190(84)90018-8openalex-snapshot
On computing the determinant in small parallel time using a small number of processors
inferredcites →https://doi.org/10.1016/0378-4754(79)90115-0openalex-snapshot
The complexity of computing
inferredcites →https://doi.org/10.1016/s0019-9958(82)90766-5openalex-snapshot
Fast parallel matrix and GCD computations
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.22148openalex-snapshot
Constructing a perfect matching is in random NC
inferredcites →https://doi.org/10.1145/28395.28396openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1145/28395.383347openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.2307/2004116openalex-snapshot
A Survey of Matrix Theory and Matrix Inequalities
inferredcites →https://doi.org/10.2307/2315999openalex-snapshot
A Survey of Matrix Theory and Matrix Inequalities.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2001.3032openalex-snapshot
Computation of Approximate Polynomial GCDs and an Extension
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.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-58338-6_78openalex-snapshot
On parallel complexity of maximum f-matching and the degree sequence problem
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-88-7642-381-9openalex-snapshot
Structured Matrix Based Methods for Approximate Polynomial GCD
inferred← citeshttps://doi.org/10.1007/bf01302965openalex-snapshot
Directeds-t numberings, Rubber bands, and testing digraphk-vertex connectivity
inferred← citeshttps://doi.org/10.1007/s00224-007-9018-5openalex-snapshot
Processor Efficient Parallel Matching
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.1016/0020-0190(89)90173-7openalex-snapshot
Parallel evaluation of the determinant and of the inverse of a matrix
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90019-3openalex-snapshot
Complexity of parallel matrix computations
inferred← citeshttps://doi.org/10.1016/0898-1221(89)90081-3openalex-snapshot
Fast and efficient parallel solution of dense linear systems
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/s0167-5060(08)70395-9openalex-snapshot
Matching and Vertex Packing: How “hard” are They?
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/sfcs.1992.267786openalex-snapshot
Approximate max flow on small depth networks
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.1137/0222073openalex-snapshot
Fast and Efficient Parallel Solution of Sparse Linear Systems
inferred← citeshttps://doi.org/10.1137/1034049openalex-snapshot
Complexity of Computations with Matrices and Polynomials
inferred← citeshttps://doi.org/10.1137/s0097539792236717openalex-snapshot
Approximate Max-Flow on Small Depth Networks
inferred← citeshttps://doi.org/10.1137/s0097539793256223openalex-snapshot
Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory
inferred← citeshttps://doi.org/10.1145/1073970.1073994openalex-snapshot
Processor efficient parallel 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/234533.234534openalex-snapshot
A new approach to the minimum cut problem
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.4230/lipics.icalp.2018.97openalex-snapshot
NC Algorithms for Weighted Planar Perfect Matching and Related Problems
inferred← citeshttps://doi.org/10.5555/313559.313605openalex-snapshot
Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm
inferred← citeshttps://doi.org/10.5555/314613.314649openalex-snapshot
Approximate polynomial Gcds, Padé approximation, polynomial zeros and bipartite graphs
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.