On the public citation graph

Local Monotonicity Reconstruction

https://doi.org/10.1137/080728561
0 signed · 82 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rsa.20167openalex-snapshot
Estimating the distance to a monotone function
inferredcites →https://doi.org/10.1002/rsa.v36:4openalex-snapshot
inferredcites →https://doi.org/10.1006/jcss.1999.1692openalex-snapshot
Spot-Checkers
inferredcites →https://doi.org/10.1006/jcss.2000.1730openalex-snapshot
Pseudorandom Generators without the XOR Lemma
inferredcites →https://doi.org/10.1007/978-3-540-30551-4_4openalex-snapshot
Property-Preserving Data Reconstruction
inferredcites →https://doi.org/10.1007/978-3-540-31856-9_36openalex-snapshot
Information Theory in Property Testing and Monotonicity Testing in Higher Dimension
inferredcites →https://doi.org/10.1007/978-3-540-48413-4_10openalex-snapshot
Improved Testing Algorithms for Monotonicity
inferredcites →https://doi.org/10.1007/bf01275486openalex-snapshot
BPP has subexponential time simulations unlessEXPTIME has publishable proofs
inferredcites →https://doi.org/10.1007/s00453-007-9075-9openalex-snapshot
Property-Preserving Data Reconstruction
inferredcites →https://doi.org/10.1007/s00493-003-0025-0openalex-snapshot
Improved Low-Degree Testing and its Applications
inferredcites →https://doi.org/10.1007/s004930070011openalex-snapshot
Testing Monotonicity
inferredcites →https://doi.org/10.1016/0022-0000(93)90044-wopenalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1016/j.aim.2009.10.018openalex-snapshot
Every minor-closed property of sparse graphs is testable
inferredcites →https://doi.org/10.1016/j.ic.2003.09.003openalex-snapshot
On the strength of comparisons in property testing
inferredcites →https://doi.org/10.1016/j.ic.2004.10.001openalex-snapshot
Fast approximate PCPs for multidimensional bin-packing problems
inferredcites →https://doi.org/10.1016/j.jcss.2006.03.002openalex-snapshot
Tolerant property testing and distance approximation
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1090/dimacs/043/04openalex-snapshot
Combinatorial property testing (a survey)
inferredcites →https://doi.org/10.1109/focs.2008.65openalex-snapshot
Noise Tolerance of Expanders and Sublinear Expander Reconstruction
inferredcites →https://doi.org/10.1109/sct.1991.160263openalex-snapshot
BPP has subexponential time simulations unless EXPTIME has publishable proofs
inferredcites →https://doi.org/10.1137/06064888xopenalex-snapshot
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
inferredcites →https://doi.org/10.1137/060652324openalex-snapshot
Testing versus Estimation of Graph Properties
inferredcites →https://doi.org/10.1137/060667177openalex-snapshot
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1142/9789812562494_0014openalex-snapshot
THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING
inferredcites →https://doi.org/10.1145/100216.100225openalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1145/103418.103428openalex-snapshot
Checking computations in polylogarithmic time
inferredcites →https://doi.org/10.1145/103418.103429openalex-snapshot
Self-testing/correcting for polynomials and for approximate functions
inferredcites →https://doi.org/10.1145/1060590.1060612openalex-snapshot
Testing versus estimation of graph properties
inferredcites →https://doi.org/10.1145/1132516.1132555openalex-snapshot
A combinatorial characterization of the testable graph properties
inferredcites →https://doi.org/10.1145/1798596.1798605openalex-snapshot
Approximating the distance to monotonicity in high dimensions
inferredcites →https://doi.org/10.1145/258533.258642openalex-snapshot
Improved low-degree testing and its applications
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.1145/293347.293350openalex-snapshot
Private information retrieval
inferredcites →https://doi.org/10.1145/335305.335315openalex-snapshot
On the efficiency of local decoding procedures for error-correcting codes
inferredcites →https://doi.org/10.1145/509907.509977openalex-snapshot
Monotonicity testing over general poset domains
inferredcites →https://doi.org/10.48550/arxiv.0801.2179openalex-snapshot
On the testability and repair of hereditary hypergraph properties
inferredcites →https://doi.org/10.5555/1496770.1496871openalex-snapshot
Transitive-closure spanners

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.20652openalex-snapshot
Constructing near spanning trees with few local inspections
inferred← citeshttps://doi.org/10.1002/rsa.20720openalex-snapshot
Local reconstruction of low‐rank matrices and subspaces
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_698openalex-snapshot
Local Reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-030-04693-4_12openalex-snapshot
Sublinear Graph Augmentation for Fast Query Implementation
inferred← citeshttps://doi.org/10.1007/978-3-319-58747-9_6openalex-snapshot
Can We Locally Compute Sparse Connected Subgraphs?
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_34openalex-snapshot
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_29openalex-snapshot
Local Property Reconstruction and Monotonicity
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_64openalex-snapshot
Steiner Transitive-Closure Spanners of Low-Dimensional Posets
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_698-1openalex-snapshot
Local Reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_32openalex-snapshot
Limitations of Local Filters of Lipschitz and Monotone Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_29openalex-snapshot
Local Reconstructors and Tolerant Testers for Connectivity and Diameter
inferred← citeshttps://doi.org/10.1007/s00453-016-0126-yopenalex-snapshot
Local Computation Algorithms for Graphs of Non-constant Degrees
inferred← citeshttps://doi.org/10.1007/s00453-019-00612-6openalex-snapshot
Local Algorithms for Sparse Spanning Graphs
inferred← citeshttps://doi.org/10.1007/s00493-014-2833-9openalex-snapshot
Steiner transitive-closure spanners of low-dimensional posets
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.12.001openalex-snapshot
Approximating convex functions via non-convex oracles under the relative noise model
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.05.007openalex-snapshot
New techniques and tighter bounds for local computation algorithms
inferred← citeshttps://doi.org/10.1017/9781108135252openalex-snapshot
Introduction to Property Testing
inferred← citeshttps://doi.org/10.1109/focs.2011.13openalex-snapshot
Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00015openalex-snapshot
Properly learning monotone functions via local correction
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00068openalex-snapshot
Agnostic proper learning of monotone functions: beyond the black-box correction barrier
inferred← citeshttps://doi.org/10.1137/1.9781611975994.179openalex-snapshot
Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
inferred← citeshttps://doi.org/10.1137/100808186openalex-snapshot
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
inferred← citeshttps://doi.org/10.1137/110837863openalex-snapshot
Noise Tolerance of Expanders and Sublinear Expansion Reconstruction
inferred← citeshttps://doi.org/10.1137/110840741openalex-snapshot
Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy
inferred← citeshttps://doi.org/10.1137/16m1076666openalex-snapshot
Sampling Correctors
inferred← citeshttps://doi.org/10.1137/24m1630463openalex-snapshot
Agnostic Proper Learning of Monotone Functions: Beyond the Black-Box Correction Barrier
inferred← citeshttps://doi.org/10.1145/2692372.2692373openalex-snapshot
Limitations of Local Filters of Lipschitz and Monotone Functions
inferred← citeshttps://doi.org/10.1145/2755573.2755615openalex-snapshot
Local Computation Algorithms for Graphs of Non-Constant Degrees
inferred← citeshttps://doi.org/10.1145/2840728.2840729openalex-snapshot
Sampling Correctors
inferred← citeshttps://doi.org/10.1145/3152042.3152053openalex-snapshot
Distributed Optimization via Local Computation Algorithms
inferred← citeshttps://doi.org/10.1145/3293611.3331587openalex-snapshot
Local Computation Algorithms
inferred← citeshttps://doi.org/10.1145/3350755.3400250openalex-snapshot
Simple Local Computation Algorithms for the General Lovász Local Lemma
inferred← citeshttps://doi.org/10.1145/3366696openalex-snapshot
Logarithmic Communication for Distributed Optimization in Multi-Agent Systems
inferred← citeshttps://doi.org/10.1145/3393691.3394197openalex-snapshot
Logarithmic Communication for Distributed Optimization in Multi-Agent Systems
inferred← citeshttps://doi.org/10.1145/3798129.3800833openalex-snapshot
Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
inferred← citeshttps://doi.org/10.31237/osf.io/rx6ztopenalex-snapshot
Property Testing and Probability Distributions: New Techniques, New Models, and New Goals
inferred← citeshttps://doi.org/10.31237/osf.io/rx6zt_v1openalex-snapshot
Property Testing and Probability Distributions: New Techniques, New Models, and New Goals
inferred← citeshttps://doi.org/10.48550/arxiv.1104.1377openalex-snapshot
Fast Local Computation Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1208.2956openalex-snapshot
Local reconstructors and tolerant testers for connectivity and diameter
inferred← citeshttps://doi.org/10.48550/arxiv.1312.5105openalex-snapshot
Local correlation clustering
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5398openalex-snapshot
New Techniques and Tighter Bounds for Local Computation Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1502.04022openalex-snapshot
Local Computation Algorithms for Graphs of Non-Constant Degrees
inferred← citeshttps://doi.org/10.48550/arxiv.2003.09554openalex-snapshot
Black-box Methods for Restoring Monotonicity
inferred← citeshttps://doi.org/10.7907/z9sx6b76openalex-snapshot
Distributed Optimization and Data Market Design
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.