On the public citation graph
Notes on the Birkhoff Algorithm for Doubly Stochastic Matrices
0 signed · 48 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/bf01895652openalex-snapshot
The Birkhoff—Egerváry—Kőnig theorem for matrices over lattice ordered abelian groups
inferredcites →https://doi.org/10.1016/0012-365x(79)90105-5openalex-snapshot
The diagonal hypergraph of a matrix (bipartite graph)
inferredcites →https://doi.org/10.1016/0024-3795(79)90146-0openalex-snapshot
A unified treatment of nearly reducible and nearly decomposable matrices
inferredcites →https://doi.org/10.1016/0097-3165(77)90051-6openalex-snapshot
Convex polyhedra of doubly stochastic matrices. I. Applications of the permanent function
inferredcites →https://doi.org/10.1090/s0002-9939-1970-0252415-3openalex-snapshot
A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices
inferredcites →https://doi.org/10.1093/qmath/10.1.296openalex-snapshot
DIAGONALS OF DOUBLY STOCHASTIC MATRICES
inferredcites →https://doi.org/10.1109/cdc.1978.268126openalex-snapshot
Probabilistic tracking in a multitarget environment
inferredcites →https://doi.org/10.4153/cmb-1960-029-5openalex-snapshot
On an Algorithm of G. Birkhoff Concerning Doubly Stochastic Matrices
inferredcites →https://doi.org/10.4153/cmb-1979-011-4openalex-snapshot
An Elementary Proof of Johnson–Dulmage–Mendelsohn's Refinement of Birkhoff's Theorem on Doubly Stochastic Matrices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4612-4308-3_13openalex-snapshot
From Binary Choices to Random Utility Representations
inferred← citeshttps://doi.org/10.1007/978-3-030-66952-2_18openalex-snapshot
Appendix: Positive Matrices
inferred← citeshttps://doi.org/10.1007/978-3-030-91025-9_11openalex-snapshot
Applications of Preemptive Open Shop Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-030-91025-9_3openalex-snapshot
General Open Shop Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-319-59250-3_28openalex-snapshot
Minimum Birkhoff-von Neumann Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-319-91008-6_60openalex-snapshot
Triply Stochastic Cubes Associated with Genetic Code Numerical Mappings
inferred← citeshttps://doi.org/10.1016/0024-3795(88)90239-xopenalex-snapshot
Some applications of doubly stochastic matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90218-dopenalex-snapshot
Order independence and factor convergence in iterative scaling
inferred← citeshttps://doi.org/10.1016/0097-3165(91)90048-lopenalex-snapshot
The polytope of even doubly stochastic matrices
inferred← citeshttps://doi.org/10.1016/0378-4371(92)90235-iopenalex-snapshot
Minimum relative entropies of low-dimensional spin systems
inferred← citeshttps://doi.org/10.1016/j.aam.2016.12.001openalex-snapshot
Alternating sign matrices, extensions and related cones
inferred← citeshttps://doi.org/10.1016/j.jmp.2005.08.004openalex-snapshot
An ordinal evaluation of categorical judgement data by random utilities and a corresponding correlation analysis
inferred← citeshttps://doi.org/10.1016/j.laa.2016.02.023openalex-snapshot
Notes on Birkhoff–von Neumann decomposition of doubly stochastic matrices
inferred← citeshttps://doi.org/10.1016/j.laa.2018.05.017openalex-snapshot
Further notes on Birkhoff–von Neumann decomposition of doubly stochastic matrices
inferred← citeshttps://doi.org/10.1016/j.laa.2019.05.007openalex-snapshot
The Birkhoff theorem for unitary matrices of prime-power dimension
inferred← citeshttps://doi.org/10.1016/j.laa.2021.09.016openalex-snapshot
On the extreme points of a family of matrices related to a theorem of Birkhoff
inferred← citeshttps://doi.org/10.1016/j.matcom.2014.01.002openalex-snapshot
On stochasticity preserving methods for the computation of the matrix pth root
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)10004-0openalex-snapshot
The Marcus-de Oliveira conjecture, bilinear forms, and cones
inferred← citeshttps://doi.org/10.1068/a190403openalex-snapshot
Maximum Entropy Convex Decompositions of Doubly Stochastic and Nonnegative Matrices
inferred← citeshttps://doi.org/10.1068/a211541openalex-snapshot
Maximum-Entropy Representations in Convex Polytopes: Applications to Spatial Interaction
inferred← citeshttps://doi.org/10.1080/00029890.2020.1865065openalex-snapshot
Positional Voting and Doubly Stochastic Matrices
inferred← citeshttps://doi.org/10.1109/icdcs.2019.00020openalex-snapshot
Reco: Efficient Regularization-Based Coflow Scheduling in Optical Circuit Switches
inferred← citeshttps://doi.org/10.1109/lcomm.2018.2861771openalex-snapshot
LUMOS: A Fast and Efficient Optical Circuit Switch Scheduling Technique
inferred← citeshttps://doi.org/10.1109/tnet.2021.3058164openalex-snapshot
Regularization-Based Coflow Scheduling in Optical Circuit Switches
inferred← citeshttps://doi.org/10.1109/tnet.2021.3088327openalex-snapshot
Birkhoff’s Decomposition Revisited: Sparse Scheduling for High-Speed Circuit Switches
inferred← citeshttps://doi.org/10.1111/j.1538-4632.1984.tb00801.xopenalex-snapshot
Measuring Migration Fields of U. S. Counties
inferred← citeshttps://doi.org/10.1145/3600211.3604671openalex-snapshot
Sampling Individually-Fair Rankings that are Always Group Fair
inferred← citeshttps://doi.org/10.1145/3626570.3626598openalex-snapshot
Quantum Switch Scheduling for Information Qubits
inferred← citeshttps://doi.org/10.1515/cmam-2016-0040openalex-snapshot
Preconditioning Techniques Based on the Birkhoff–von Neumann Decomposition
inferred← citeshttps://doi.org/10.23919/acc50511.2021.9483411openalex-snapshot
Performance Analysis of First-order Optimization Methods Using Interpolation Conditions Without Function Evaluations
inferred← citeshttps://doi.org/10.4153/cmb-1988-056-5openalex-snapshot
Comments on a Paper of R. A. Brualdi
inferred← citeshttps://doi.org/10.48550/arxiv.1810.02423openalex-snapshot
Generalizing the theory of cooperative inference
inferred← citeshttps://doi.org/10.48550/arxiv.2005.01825openalex-snapshot
Finite Step Performance of First-order Methods Using Interpolation Conditions Without Function Evaluations
inferred← citeshttps://doi.org/10.48550/arxiv.2504.03832openalex-snapshot
The Quantum Optimization Benchmarking Library
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.