On the public citation graph
Optimal Reconstruction of Graphs under the Additive Model
0 signed · 85 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-68535-9_23openalex-snapshot
On the Power of Additive Combinatorial Search Model
inferredcites →https://doi.org/10.1007/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1016/0020-0190(89)90214-7openalex-snapshot
A generalized model for understanding evasiveness
inferredcites →https://doi.org/10.1016/0166-218x(86)90026-0openalex-snapshot
Search problems on graphs
inferredcites →https://doi.org/10.1016/0166-218x(90)90022-5openalex-snapshot
The optimal procedures for quantitative group testing
inferredcites →https://doi.org/10.1016/0166-218x(92)90260-hopenalex-snapshot
An improved algorithm for quantitative group testing
inferredcites →https://doi.org/10.1109/istcs.1997.595169openalex-snapshot
Optimal query bounds for reconstructing a Hamiltonian cycle in complete graphs
inferredcites →https://doi.org/10.1109/sfcs.1996.548493openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.1145/258533.258627openalex-snapshot
Property testing in bounded degree graphs
inferredcites →https://doi.org/10.4153/cmb-1965-034-2openalex-snapshot
On a Combinatorial Problem in Number Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20417openalex-snapshot
Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
inferred← citeshttps://doi.org/10.1007/11604686_2openalex-snapshot
Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-25027-0_10openalex-snapshot
Optimal Channel Utilization with Limited Feedback
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_12openalex-snapshot
Learning a Hidden Subgraph
inferred← citeshttps://doi.org/10.1007/978-3-540-75225-7_24openalex-snapshot
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
inferred← citeshttps://doi.org/10.1007/978-3-642-04414-4_12openalex-snapshot
Reconstructing Weighted Graphs with Minimal Query Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_21openalex-snapshot
Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_18openalex-snapshot
Superselectors: Efficient Constructions and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_40openalex-snapshot
On the Coin Weighing Problem with the Presence of Noise
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_62openalex-snapshot
Graph Reconstruction via Distance Oracles
inferred← citeshttps://doi.org/10.1007/s10878-007-9067-3openalex-snapshot
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
inferred← citeshttps://doi.org/10.1007/s10878-010-9291-0openalex-snapshot
Reconstruction of hidden graphs and threshold group testing
inferred← citeshttps://doi.org/10.1007/s11590-017-1131-zopenalex-snapshot
Learning a hidden uniform hypergraph
inferred← citeshttps://doi.org/10.1016/j.artint.2010.02.003openalex-snapshot
Optimal query complexity bounds for finding graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.035openalex-snapshot
Reconstructing Markov processes from independent and anonymous experiments
inferred← citeshttps://doi.org/10.1016/j.disc.2017.11.004openalex-snapshot
Query complexity of mastermind variants
inferred← citeshttps://doi.org/10.1016/j.ic.2018.12.001openalex-snapshot
Communication and location discovery in geometric ring networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.08.011openalex-snapshot
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.01.004openalex-snapshot
Optimal channel utilization with limited feedback
inferred← citeshttps://doi.org/10.1016/j.jpdc.2023.104718openalex-snapshot
Information-theoretic and algorithmic aspects of parallel and distributed reconstruction from pooled data
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.055openalex-snapshot
Reconstructing weighted graphs with minimal query complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.09.005openalex-snapshot
Toward a deterministic polynomial time algorithm with optimal additive query complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.034openalex-snapshot
Exact learning from an honest teacher that answers membership queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.01.006openalex-snapshot
Reconstruction and verification of chordal graphs with a distance oracle
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.026openalex-snapshot
Generalized framework for Group Testing: Queries, feedbacks and adversaries
inferred← citeshttps://doi.org/10.1023/b:joco.0000017381.11696.c6openalex-snapshot
The Incremental Group Testing Model for Gap Closing in Sequencing Long Molecules
inferred← citeshttps://doi.org/10.1109/allerton.2019.8919924openalex-snapshot
Reconstructing a Bounded-Degree Directed Tree Using Path Queries
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00055openalex-snapshot
Cut Query Algorithms with Star Contraction
inferred← citeshttps://doi.org/10.1109/icassp.2015.7179016openalex-snapshot
Compressive graph clustering from random sketches
inferred← citeshttps://doi.org/10.1109/icdcs.2010.50openalex-snapshot
Towards Power-Sensitive Communication on a Multiple-Access Channel
inferred← citeshttps://doi.org/10.1109/icdcs.2015.59openalex-snapshot
Deterministic Symmetry Breaking in Ring Networks
inferred← citeshttps://doi.org/10.1109/icdcs54860.2022.00018openalex-snapshot
Distributed Reconstruction of Noisy Pooled Data
inferred← citeshttps://doi.org/10.1109/icdcs60910.2024.00027openalex-snapshot
Distributed Pooled Data Intrusion Detection: Lessons Learned from Quantitative Group Testing
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00048openalex-snapshot
On the Parallel Reconstruction from Pooled Data
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206896openalex-snapshot
Non-adaptive Quantitative Group Testing via Plotkin-Type Constructions
inferred← citeshttps://doi.org/10.1109/itw44776.2019.8989403openalex-snapshot
Sparse Graph Codes for Non-adaptive Quantitative Group Testing
inferred← citeshttps://doi.org/10.1109/tcomm.2022.3222341openalex-snapshot
Reconstruction of Sets of Strings From Prefix/Suffix Compositions
inferred← citeshttps://doi.org/10.1109/tpami.2023.3283784openalex-snapshot
Learning Hidden Graphs From Samples
inferred← citeshttps://doi.org/10.1109/tsp.2017.2780053openalex-snapshot
Optimal Nested Test Plan for Combinatorial Quantitative Group Testing
inferred← citeshttps://doi.org/10.1137/1.9781611973075.51openalex-snapshot
Optimally Reconstructing Weighted Graphs Using Queries: (Extended Abstract)
inferred← citeshttps://doi.org/10.1137/1.9781611973105.50openalex-snapshot
Playing Mastermind with Many Colors
inferred← citeshttps://doi.org/10.1137/1.9781611976465.59openalex-snapshot
Quantum algorithms for graph problems with cut queries
inferred← citeshttps://doi.org/10.1137/120881129openalex-snapshot
On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$
inferred← citeshttps://doi.org/10.1137/23m1604928openalex-snapshot
Approximate Message Passing with Rigorous Guarantees for Pooled Data and Quantitative Group Testing
inferred← citeshttps://doi.org/10.1145/1374376.1374484openalex-snapshot
Optimal query complexity bounds for finding graphs
inferred← citeshttps://doi.org/10.1145/3313906openalex-snapshot
Tight Lower Bounds for the Complexity of Multicoloring
inferred← citeshttps://doi.org/10.1145/3397484openalex-snapshot
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints
inferred← citeshttps://doi.org/10.1145/3409964.3461822openalex-snapshot
Parallel Network Mapping Algorithms
inferred← citeshttps://doi.org/10.1145/3798129.3800904openalex-snapshot
Combinatorial Optimization using Comparison Oracles
inferred← citeshttps://doi.org/10.21248/gups.62449openalex-snapshot
Statistical inference on random factor graphs
inferred← citeshttps://doi.org/10.21248/gups.68926openalex-snapshot
On the evidence for a statistical-computational gap raised by the Group Testing Problem
inferred← citeshttps://doi.org/10.23638/dmtcs-20-1-9openalex-snapshot
Non-adaptive Group Testing on Graphs
inferred← citeshttps://doi.org/10.3150/24-bej1784openalex-snapshot
On a near-optimal and efficient algorithm for the sparse pooled data problem
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.7openalex-snapshot
Constructing Large Matchings via Query Access to a Maximal Matching Oracle
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2496openalex-snapshot
Optimal Query Complexity for Reconstructing Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1201.3793openalex-snapshot
Finding Weighted Graphs by Combinatorial Search
inferred← citeshttps://doi.org/10.48550/arxiv.1207.0773openalex-snapshot
Playing Mastermind with Many Colors
inferred← citeshttps://doi.org/10.48550/arxiv.1407.2283openalex-snapshot
Optimal Nested Test Plan for Combinatorial Quantitative Group Testing
inferred← citeshttps://doi.org/10.48550/arxiv.1504.07127openalex-snapshot
Deterministic Symmetry Breaking in Ring Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2009.13409openalex-snapshot
Constructing Large Matchings via Query Access to a Maximal Matching Oracle
inferred← citeshttps://doi.org/10.48550/arxiv.2011.08611openalex-snapshot
Quantum algorithms for learning a hidden graph and beyond
inferred← citeshttps://doi.org/10.48550/arxiv.2108.04342openalex-snapshot
Near optimal efficient decoding from pooled data
inferred← citeshttps://doi.org/10.5070/c63261997openalex-snapshot
Optimal schemes for combinatorial query problems with integer feedback
inferred← citeshttps://doi.org/10.5555/1873601.1873652openalex-snapshot
Optimally reconstructing weighted graphs using queries
inferred← citeshttps://doi.org/10.5555/2133036.2133142openalex-snapshot
On parity check (0, 1)-matrix over Zp
inferred← citeshttps://doi.org/10.70675/599c608bz9f80z4d28za6c4zb85acff92df5openalex-snapshot
Graph algorithms : network inference and planar graph optimization
inferred← citeshttps://doi.org/10.7907/1a1j-sa64.openalex-snapshot
Convex Analysis for Minimizing and Learning Submodular Set Functions
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.