On the public citation graph

A Lower Bound for Distribution-Free Monotonicity Testing

https://doi.org/10.1007/11538462_28
0 signed · 38 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.1006/jcss.1999.1692openalex-snapshot
Spot-Checkers
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-48224-5_41openalex-snapshot
Testing Hypergraph Coloring
inferredcites →https://doi.org/10.1007/978-1-4615-0013-1openalex-snapshot
Handbook of Randomized Computing
inferredcites →https://doi.org/10.1007/978-3-540-27821-4_35openalex-snapshot
Distribution-Free Connectivity Testing
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_61openalex-snapshot
Testing Monotonicity over Graph Products
inferredcites →https://doi.org/10.1007/978-3-540-45198-3_29openalex-snapshot
Tight Bounds for Testing Bipartiteness in General Graphs
inferredcites →https://doi.org/10.1007/978-3-540-48413-4_10openalex-snapshot
Improved Testing Algorithms for Monotonicity
inferredcites →https://doi.org/10.1007/978-3-540-48413-4_25openalex-snapshot
Fast Approximate PCPs for Multidimensional Bin-Packing Problems
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.ic.2003.09.003openalex-snapshot
On the strength of comparisons in property testing
inferredcites →https://doi.org/10.1090/dimacs/043/04openalex-snapshot
Combinatorial property testing (a survey)
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.2001.959922openalex-snapshot
Three theorems regarding testing graph properties
inferredcites →https://doi.org/10.1109/sfcs.2002.1181886openalex-snapshot
A lower bound for testing 3-colorability in bounded-degree graphs
inferredcites →https://doi.org/10.1109/sffcs.1999.814642openalex-snapshot
Efficient testing of large graphs
inferredcites →https://doi.org/10.1137/050645804openalex-snapshot
Distribution-Free Property-Testing
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/258533.258627openalex-snapshot
Property testing in bounded degree graphs
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.1145/380752.380812openalex-snapshot
Testing of matrix properties
inferredcites →https://doi.org/10.1145/509907.509977openalex-snapshot
Monotonicity testing over general poset domains
inferredcites →https://doi.org/10.7551/mitpress/3897.001.0001openalex-snapshot
An Introduction to Computational Learning 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.20211openalex-snapshot
Testing monotonicity over graph products
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_36openalex-snapshot
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_40openalex-snapshot
Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries
inferred← citeshttps://doi.org/10.1109/focs.2012.64openalex-snapshot
Active Property Testing
inferred← citeshttps://doi.org/10.1137/1.9781611973730.121openalex-snapshot
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties
inferred← citeshttps://doi.org/10.1145/1798596.1798605openalex-snapshot
Approximating the distance to monotonicity in high dimensions
inferred← citeshttps://doi.org/10.1145/3039241openalex-snapshot
Property Testing on Product Distributions
inferred← citeshttps://doi.org/10.1184/r1/6720509openalex-snapshot
Mathematical Theories of Interaction with Oracles
inferred← citeshttps://doi.org/10.1561/2200000004openalex-snapshot
Property Testing: A Learning Theory Perspective
inferred← citeshttps://doi.org/10.4086/toc.2009.v005a010openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2011.v007a011openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5545openalex-snapshot
$L_p$-Testers for Bounded Derivative Properties on Product Distributions
inferred← citeshttps://doi.org/10.5555/2722129.2722250openalex-snapshot
Property testing on product distributions: optimal testers for bounded derivative properties
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.