On the public citation graph
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
0 signed · 152 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/0020-0190(80)90042-3openalex-snapshot
A note on the parallel complexity of computing the rank of order n matrices
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/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.1109/sfcs.1983.74openalex-snapshot
The parallel complexity of the abelian permutation group membership problem
inferredcites →https://doi.org/10.1109/sfcs.1985.26openalex-snapshot
Fast parallel computation with permutation groups
inferredcites →https://doi.org/10.1137/0205040openalex-snapshot
Fast Parallel Matrix Inversion Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1996.0820openalex-snapshot
Parallel Algorithms for Reducible Flow Graphs
inferred← citeshttps://doi.org/10.1006/jagm.2001.1177openalex-snapshot
Computing Chow Forms and Some Applications
inferred← citeshttps://doi.org/10.1006/jcom.1997.0447openalex-snapshot
Some Complexity Results for Polynomial Ideals
inferred← citeshttps://doi.org/10.1006/jcom.1998.0472openalex-snapshot
On the Parallel Complexity of the Polynomial Ideal Membership Problem
inferred← citeshttps://doi.org/10.1006/jcss.1998.1589openalex-snapshot
Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets
inferred← citeshttps://doi.org/10.1006/jcss.1998.1615openalex-snapshot
Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis
inferred← citeshttps://doi.org/10.1006/jcss.1999.1648openalex-snapshot
On Arithmetic Branching Programs
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/jsco.2000.0369openalex-snapshot
The Projective Noether Maple Package: Computing the Dimension of a Projective Variety
inferred← citeshttps://doi.org/10.1006/jsco.2001.0471openalex-snapshot
Squarefree Decomposition of Univariate Polynomials Depending on a Parameter. Application to the Integration of Parametric Rational Functions
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_7openalex-snapshot
Secure Distributed Linear Algebra in a Constant Number of Rounds
inferred← citeshttps://doi.org/10.1007/3-540-51517-8_134openalex-snapshot
Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal form of polynomial matrices
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_142openalex-snapshot
Parallel computations with algebraic numbers a case study: Jordan normal form of matrices
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_167openalex-snapshot
Verifying the determinant in parallel
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_100openalex-snapshot
On the complexity of computing the greatest common divisor of several univariate polynomials
inferred← citeshttps://doi.org/10.1007/3-540-60114-7_4openalex-snapshot
How lower and upper complexity bounds meet in elimination theory
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_26openalex-snapshot
On the existence of hard sparse sets under weak reductions
inferred← citeshttps://doi.org/10.1007/978-1-4612-0441-1_8openalex-snapshot
Efficient Algorithms and Bounds for Wu-Ritt Characteristic Sets
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_3openalex-snapshot
Sparse Sets versus Complexity Classes
inferred← citeshttps://doi.org/10.1007/978-1-4612-2566-9_12openalex-snapshot
Bounded Arithmetic and Lower Bounds in Boolean Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-57808-4_20openalex-snapshot
A Practical Approach to the Secure Computation of the Moore–Penrose Pseudoinverse over the Rationals
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_3openalex-snapshot
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
inferred← citeshttps://doi.org/10.1007/978-3-031-22318-1_24openalex-snapshot
ABE for Circuits with Constant-Size Secret Keys and Adaptive Security
inferred← citeshttps://doi.org/10.1007/978-3-031-58723-8_15openalex-snapshot
A General Framework for Lattice-Based ABE Using Evasive Inner-Product Functional Encryption
inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_26openalex-snapshot
Complexity of Minimal Faithful Permutation Degree for Fitting-Free Groups
inferred← citeshttps://doi.org/10.1007/978-3-319-17142-5_26openalex-snapshot
Bounded Treewidth and Space-Efficient Linear Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_64openalex-snapshot
Counting Complexity Classes over the Reals I: The Additive Case
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_25openalex-snapshot
The Enumerability of P Collapses P to NC
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_34openalex-snapshot
A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-74510-5_28openalex-snapshot
On the Complexity of Matrix Rank and Rigidity
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_9openalex-snapshot
Iterative Rounding for Multi-Objective Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_46openalex-snapshot
Approximation Schemes for Multi-Budgeted Independence Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-30642-6_4openalex-snapshot
The Complexity of Intersecting Finite Automata Having Few Final States
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_41openalex-snapshot
A Remark on One-Wayness versus Pseudorandomness
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_37openalex-snapshot
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-60539-0_20openalex-snapshot
The Space Complexity of Elimination Theory: Upper Bounds
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_30openalex-snapshot
Dynamic Complexity of Directed Reachability and Other Problems
inferred← citeshttps://doi.org/10.1007/bf01200407openalex-snapshot
On the efficiency of effective Nullstellens�tze
inferred← citeshttps://doi.org/10.1007/bf01202040openalex-snapshot
Lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1007/bf01272520openalex-snapshot
Decomposition of algebras over finite fields and number fields
inferred← citeshttps://doi.org/10.1007/bfb0040375openalex-snapshot
O(log(n)) parallel time finite field inversion
inferred← citeshttps://doi.org/10.1007/pl00001596openalex-snapshot
Verifying the determinant in parallel
inferred← citeshttps://doi.org/10.1007/s00037-014-0089-9openalex-snapshot
The complexity of intersecting finite automata having few final states
inferred← citeshttps://doi.org/10.1007/s00037-016-0143-xopenalex-snapshot
Non-commutative Edmonds’ problem and matrix semi-invariants
inferred← citeshttps://doi.org/10.1007/s00224-008-9136-8openalex-snapshot
On the Complexity of Matrix Rank and Rigidity
inferred← citeshttps://doi.org/10.1007/s004930050058openalex-snapshot
Superpolynomial Lower Bounds for Monotone Span Programs
inferred← citeshttps://doi.org/10.1007/s10107-013-0703-7openalex-snapshot
New approaches to multi-objective optimization
inferred← citeshttps://doi.org/10.1007/s10208-002-0076-4openalex-snapshot
Vandermonde Matrices, NP-Completeness, and Transversal Subspaces
inferred← citeshttps://doi.org/10.1007/s10208-012-9123-yopenalex-snapshot
Castelnuovo–Mumford Regularity and Computing the de Rham Cohomology of Smooth Projective Varieties
inferred← citeshttps://doi.org/10.1007/s10208-014-9222-zopenalex-snapshot
A Complexity Theory of Constructible Functions and Sheaves
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90203-2openalex-snapshot
An NC2 algorithm for testing similarity of matrices
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90044-xopenalex-snapshot
Parallel algorithms for solvable permutation groups
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90024-dopenalex-snapshot
The complexity of circuit value and network stability
inferred← citeshttps://doi.org/10.1016/0022-4049(90)90159-fopenalex-snapshot
Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
inferred← citeshttps://doi.org/10.1016/0024-3795(90)90028-bopenalex-snapshot
Parallel algorithms for matrix normal forms
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90109-aopenalex-snapshot
The membership problem for unmixed polynomial ideals is solvable in single exponential time
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90157-wopenalex-snapshot
On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90078-gopenalex-snapshot
Boolean circuits versus arithmetic circuits
inferred← citeshttps://doi.org/10.1016/0893-9659(91)90069-8openalex-snapshot
Parallel algebraic reductions among numerical problems
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.ipl.2011.04.013openalex-snapshot
How strong is Nisanʼs pseudo-random generator?
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2006.03.026openalex-snapshot
Modules projectifs de type fini, applications linéaires croisées et inverses généralisés
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2012.03.008openalex-snapshot
Polynomial bounds for invariant functions separating orbits
inferred← citeshttps://doi.org/10.1016/j.jco.2012.04.005openalex-snapshot
Software Engineering and complexity in effective Algebraic Geometry
inferred← citeshttps://doi.org/10.1016/j.jco.2021.101588openalex-snapshot
A promenade through correct test sequences I: Degree of constructible sets, Bézout's Inequality and density
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.02.009openalex-snapshot
On the complexity of counting components of algebraic varieties
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.06.020openalex-snapshot
On a generalization of Stickelberger’s Theorem
inferred← citeshttps://doi.org/10.1016/j.laa.2005.06.028openalex-snapshot
Computing greatest common divisors and squarefree decompositions through matrix methods: The parametric and approximate cases
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.009openalex-snapshot
Deformation techniques to solve generalised Pham systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.010openalex-snapshot
The enumerability of P collapses P to NC
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/s0022-4049(00)00135-3openalex-snapshot
Computing bases of complete intersection rings in Noether position
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00161-8openalex-snapshot
On parallel block algorithms for exact triangularizations
inferred← citeshttps://doi.org/10.1090/dimacs/039/15openalex-snapshot
Algebraic models of computation and interpolation for algebraic proof systems
inferred← citeshttps://doi.org/10.1090/jams/864openalex-snapshot
Geometric complexity theory V: Efficient algorithms for Noether normalization
inferred← citeshttps://doi.org/10.1109/ccc.1998.694592openalex-snapshot
On arithmetic branching programs
inferred← citeshttps://doi.org/10.1109/ccc.2001.933886openalex-snapshot
On the power of nonlinear secret-sharing
inferred← citeshttps://doi.org/10.1109/fscs.1990.89616openalex-snapshot
Interpolation of sparse rational functions without knowing bounds on exponents
inferred← citeshttps://doi.org/10.1109/ictai.2008.14openalex-snapshot
Straight Line Programs: A New Linear Genetic Programming Approach
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/sct.1989.41817openalex-snapshot
The complexity of circuit value and network stability
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.1992.267779openalex-snapshot
Processor-efficient parallel solution of linear systems. II. The positive characteristic and singular cases
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492492openalex-snapshot
The resolution of a Hartmanis conjecture
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492669openalex-snapshot
Lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548470openalex-snapshot
Solving systems of polynomial congruences modulo a large prime
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238216openalex-snapshot
Separating the power of monotone span programs over different fields
inferred← citeshttps://doi.org/10.1109/spdp.1991.218278openalex-snapshot
Efficient parallel independent subsets and matrix factorizations
inferred← citeshttps://doi.org/10.1109/synasc.2006.61openalex-snapshot
Pivot-Free Block Matrix Inversion
inferred← citeshttps://doi.org/10.1109/tsp.2018.2872006openalex-snapshot
Linear Independent Component Analysis Over Finite Fields: Algorithms and Bounds
inferred← citeshttps://doi.org/10.1134/s0361768823020160openalex-snapshot
Effective Lower Bounds on the Matrix Rank and Their Applications
inferred← citeshttps://doi.org/10.1134/s0361768824020142openalex-snapshot
Lower Bounds for the Rank of a Matrix with Zeros and Ones outside the Leading Diagonal
inferred← citeshttps://doi.org/10.1134/s0965542523010116openalex-snapshot
Generalization of the Subset Sum Problem and Cubic Forms
inferred← citeshttps://doi.org/10.1137/0608057openalex-snapshot
Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
inferred← citeshttps://doi.org/10.1137/1.9781611974782.77openalex-snapshot
Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász Local Lemma
inferred← citeshttps://doi.org/10.1137/20m1321231openalex-snapshot
Nondeterministic Quasi-Polynomial Time is Average-Case Hard for \(\textsf{ACC}\) Circuits
inferred← citeshttps://doi.org/10.1137/s0097539702415950openalex-snapshot
Counting Complexity Classes for Numeric Computations I: Semilinear Sets
inferred← citeshttps://doi.org/10.1137/s0097539704444038openalex-snapshot
Separating the Power of Monotone Span Programs over Different Fields
inferred← citeshttps://doi.org/10.1137/s0895479802418860openalex-snapshot
Generalizing Cramer's Rule: Solving Uniformly Linear Systems of Equations
inferred← citeshttps://doi.org/10.1137/s0895480102412868openalex-snapshot
On the Power of Nonlinear Secret-Sharing
inferred← citeshttps://doi.org/10.1142/s0218213009000391openalex-snapshot
A NEW LINEAR GENETIC PROGRAMMING APPROACH BASED ON STRAIGHT LINE PROGRAMS: SOME THEORETICAL AND EXPERIMENTAL ASPECTS
inferred← citeshttps://doi.org/10.1145/103418.103431openalex-snapshot
Effective Noether irreducibility forms and applications
inferred← citeshttps://doi.org/10.1145/120694.120696openalex-snapshot
Algorithms for sparse rational interpolation
inferred← citeshttps://doi.org/10.1145/1277548.1277558openalex-snapshot
Differential forms in computational algebraic geometry
inferred← citeshttps://doi.org/10.1145/146637.146661openalex-snapshot
The membership problem in aperiodic transformation monoids
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/236869.237082openalex-snapshot
Computing Popov and Hermite forms of polynomial matrices
inferred← citeshttps://doi.org/10.1145/237814.238010openalex-snapshot
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1145/3087604.3087640openalex-snapshot
Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits
inferred← citeshttps://doi.org/10.1145/3230651openalex-snapshot
Deterministic Parallel Algorithms for Fooling Polylogarithmic Juntas and the Lovász Local Lemma
inferred← citeshttps://doi.org/10.1145/3313276.3316406openalex-snapshot
Parallelizing greedy for submodular set function maximization in matroids and beyond
inferred← citeshttps://doi.org/10.1145/3452143.3465530openalex-snapshot
Cyclotomic Identity Testing and Applications
inferred← citeshttps://doi.org/10.1145/378580.378743openalex-snapshot
A parallel block algorithm for exact triangularization of rectangular matrices
inferred← citeshttps://doi.org/10.1145/3798129.3800911openalex-snapshot
Negations Are Powerful Even in Small Depth
inferred← citeshttps://doi.org/10.1145/49456.49457openalex-snapshot
Parallelism and algorithms for algebraic manipulation: current work
inferred← citeshttps://doi.org/10.1145/780506.780534openalex-snapshot
Some observations on familiar numbers
inferred← citeshttps://doi.org/10.1145/96877.96909openalex-snapshot
Arithmetic with real algebraic numbers is in NC
inferred← citeshttps://doi.org/10.17654/nt045010013openalex-snapshot
COMPUTING THE DIMENSION OF IDEALS IN GROUP ALGEBRAS, WITH AN APPLICATION TO CODING THEORY
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cbcopenalex-snapshot
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
inferred← citeshttps://doi.org/10.31857/s0044466923010118openalex-snapshot
Generalization of the Subset Sum Problem and Cubic Forms
inferred← citeshttps://doi.org/10.31857/s0132347423020176openalex-snapshot
Effective Lower Bounds on the Matrix Rank and Their Applications
inferred← citeshttps://doi.org/10.31857/s0132347424020133openalex-snapshot
Lower bounds for the rank of a matrix with zeros and ones outside the leading diagonal
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.20-23.265openalex-snapshot
Research on the Secure Multi-Party Computation of some Linear Algebra Problems
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2021.36openalex-snapshot
Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:2)2023openalex-snapshot
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
inferred← citeshttps://doi.org/10.48550/arxiv.0909.2694openalex-snapshot
Singularity of Sparse Circulant Matrices is NP-complete
inferred← citeshttps://doi.org/10.48550/arxiv.1110.3030openalex-snapshot
Software Engineering and Complexity in Effective Algebraic Geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1604.00795openalex-snapshot
Méthodes Matricielles Introduction à la Complexité Algébrique
inferred← citeshttps://doi.org/10.48550/arxiv.1605.04832openalex-snapshot
Commutative algebra: Constructive methods. Finite projective modules
inferred← citeshttps://doi.org/10.48550/arxiv.1903.00783openalex-snapshot
Chain complex reduction via fast digraph traversal
inferred← citeshttps://doi.org/10.5802/xups.1997-01openalex-snapshot
Bases standard, élimination et complexité
inferred← citeshttps://doi.org/10.5860/choice.33-3959openalex-snapshot
Limits to parallel computation: P-completeness theory
inferred← citeshttps://doi.org/10.70675/2d0acbb1zac72z4ad7zb20azc815497f8dabopenalex-snapshot
Secure and efficient outsourced computation protocols for linear algebra
inferred← citeshttps://doi.org/10.7146/dpb.v20i358.7955openalex-snapshot
Parallel Construction of Irreducible Polynomials
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.