On the public citation graph
Independence and port oracles for matroids, with an application to computational learning theory
0 signed · 43 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.1006/jctb.1996.0049openalex-snapshot
On Inequivalent Representations of Matroids over Finite Fields
inferredcites →https://doi.org/10.1007/bf01205054openalex-snapshot
An algorithm to learn read-once threshold formulas, and transformations between learning models
inferredcites →https://doi.org/10.1016/0095-8956(77)90031-4openalex-snapshot
The matroids with the max-flow min-cut property
inferredcites →https://doi.org/10.1016/0095-8956(77)90077-6openalex-snapshot
A note on the production of matroid minors
inferredcites →https://doi.org/10.1090/s0002-9939-1960-0117173-5openalex-snapshot
An Algorithm for Determining Whether a Given Binary Matroid is Graphic
inferredcites →https://doi.org/10.1112/blms/20.1.5openalex-snapshot
On the Uniqueness of Matroid Representations Over GF(4)
inferredcites →https://doi.org/10.1112/jlms/s2-12.3.356openalex-snapshot
The Forbidden Minors of Binary Clutters
inferredcites →https://doi.org/10.1137/0112059openalex-snapshot
A Solution of the Shannon Switching Game
inferredcites →https://doi.org/10.1137/0211014openalex-snapshot
Complexity of Matroid Property Algorithms
inferredcites →https://doi.org/10.1145/138027.138061openalex-snapshot
Learning read-once formulas with queries
inferredcites →https://doi.org/10.1145/168304.168308openalex-snapshot
Learning μ-branching programs with queries
inferredcites →https://doi.org/10.1145/174644.174647openalex-snapshot
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
inferredcites →https://doi.org/10.1145/28395.28426openalex-snapshot
On the learnability of Boolean formulae
inferredcites →https://doi.org/10.1145/48014.63140openalex-snapshot
Computational limitations on learning from examples
inferredcites →https://doi.org/10.1145/73007.73049openalex-snapshot
Crytographic limitations on learning Boolean formulae and finite automata
inferredcites →https://doi.org/10.1287/moor.13.1.99openalex-snapshot
An Almost Linear-Time Algorithm for Graph Realization
inferredcites →https://doi.org/10.1287/moor.5.3.321openalex-snapshot
Converting Linear Programs to Network Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.23046openalex-snapshot
Ear‐decompositions, minimally connected matroids and rigid graphs
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_53openalex-snapshot
On combinatorial properties of binary spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-38233-8_25openalex-snapshot
Query Complexity of Matroids
inferred← citeshttps://doi.org/10.1007/s00454-025-00786-7openalex-snapshot
Minimally Rigid Tensegrity Frameworks
inferred← citeshttps://doi.org/10.1007/s10107-020-01497-yopenalex-snapshot
Complexity of packing common bases in matroids
inferred← citeshttps://doi.org/10.1007/s11005-020-01352-3openalex-snapshot
Matroid connectivity and singularities of configuration hypersurfaces
inferred← citeshttps://doi.org/10.1016/j.dam.2022.10.017openalex-snapshot
Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids
inferred← citeshttps://doi.org/10.1016/j.dam.2024.01.044openalex-snapshot
Color-avoiding connected spanning subgraphs with minimum number of edges
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115056openalex-snapshot
Matroid polytopes with small rank
inferred← citeshttps://doi.org/10.1016/j.ijar.2024.109266openalex-snapshot
On the enumeration of non-dominated matroids with imprecise weights
inferred← citeshttps://doi.org/10.1016/j.jctb.2004.11.002openalex-snapshot
Connected rigidity matroids and unique realizations of graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.01.003openalex-snapshot
Sufficient conditions for the global rigidity of graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.03.002openalex-snapshot
Global rigidity of generic frameworks on the cylinder
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.09.009openalex-snapshot
Global rigidity of periodic graphs under fixed-lattice representations
inferred← citeshttps://doi.org/10.1017/fms.2023.20openalex-snapshot
A generalization of Kruskal’s theorem on tensor decomposition
inferred← citeshttps://doi.org/10.1093/imrn/rnaa157openalex-snapshot
Global Rigidity of 2D Linearly Constrained Frameworks
inferred← citeshttps://doi.org/10.1093/imrn/rnae162openalex-snapshot
Uniquely Realisable Graphs in Analytic Normed Planes
inferred← citeshttps://doi.org/10.1137/22m152579xopenalex-snapshot
Matroid Intersection under Restricted Oracles
inferred← citeshttps://doi.org/10.19086/da.34692openalex-snapshot
Abstract 3-Rigidity and Bivariate $C_2^1$-Splines II: Combinatorial Characterization
inferred← citeshttps://doi.org/10.48550/arxiv.1403.3742openalex-snapshot
Sufficient Conditions for the Global Rigidity of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1509.05586openalex-snapshot
Ear-decompositions and the complexity of the matching polytope
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.