On the public citation graph
Parameterized Property Testing of Functions
0 signed · 51 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/978-3-540-31856-9_36openalex-snapshot
Information Theory in Property Testing and Monotonicity Testing in Higher Dimension
inferredcites →https://doi.org/10.1007/s00037-012-0040-xopenalex-snapshot
Property Testing Lower Bounds via Communication Complexity
inferredcites →https://doi.org/10.1007/s00493-012-2765-1openalex-snapshot
Monotonicity testing and shortest-path routing on the cube
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.1109/ccc.2014.38openalex-snapshot
Lower Bounds for Testing Properties of Functions over Hypergrid Domains
inferredcites →https://doi.org/10.1109/focs.2014.38openalex-snapshot
New Algorithms and Lower Bounds for Monotonicity Testing
inferredcites →https://doi.org/10.1109/focs.2015.13openalex-snapshot
On Monotonicity Testing and Boolean Isoperimetric Type Theorems
inferredcites →https://doi.org/10.1109/focs.2015.75openalex-snapshot
Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability
inferredcites →https://doi.org/10.1109/sfcs.1977.24openalex-snapshot
Probabilistic computations: Toward a unified measure of complexity
inferredcites →https://doi.org/10.1137/110840741openalex-snapshot
Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy
inferredcites →https://doi.org/10.1137/13092770xopenalex-snapshot
An $o(n)$ Monotonicity Tester for Boolean Functions over the Hypercube
inferredcites →https://doi.org/10.1137/151002526openalex-snapshot
An Automatic Inequality Prover and Instance Optimal Identity Testing
inferredcites →https://doi.org/10.1137/s0097539702414026openalex-snapshot
On Testing Convexity and Submodularity
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1145/1938551.1938584openalex-snapshot
Detecting and exploiting near-sortedness for efficient relational query evaluation
inferredcites →https://doi.org/10.1145/2488608.2488661openalex-snapshot
Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids
inferredcites →https://doi.org/10.1145/2746539.2746570openalex-snapshot
Boolean Function Monotonicity Testing Requires (Almost) n 1/2 Non-adaptive Queries
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.1145/2897518.2897567openalex-snapshot
A polynomial lower bound for testing monotonicity
inferredcites →https://doi.org/10.1145/2897518.2897641openalex-snapshot
Instance optimal learning of discrete distributions
inferredcites →https://doi.org/10.1145/3039241openalex-snapshot
Property Testing on Product Distributions
inferredcites →https://doi.org/10.1145/3155296openalex-snapshot
Parameterized Property Testing of Functions
inferredcites →https://doi.org/10.1145/509907.509977openalex-snapshot
Monotonicity testing over general poset domains
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.21029openalex-snapshot
Approximating the distance to monotonicity of Boolean functions
inferred← citeshttps://doi.org/10.1002/rsa.21211openalex-snapshot
Isoperimetric inequalities for real‐valued functions with applications to monotonicity testing
inferred← citeshttps://doi.org/10.1007/s00453-018-0467-9openalex-snapshot
The Power and Limitations of Uniform Samples in Testing Properties of Figures
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114316openalex-snapshot
Improved algorithm for permutation testing
inferred← citeshttps://doi.org/10.1109/focs.2019.000-1openalex-snapshot
Finding Monotone Patterns in Sublinear Time
inferred← citeshttps://doi.org/10.1137/1.9781611975994.125openalex-snapshot
Testing convexity of functions over finite domains
inferred← citeshttps://doi.org/10.1145/3512750openalex-snapshot
Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness with One-Sided Error
inferred← citeshttps://doi.org/10.1145/3778165openalex-snapshot
Property Testing with Online Adversaries
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.100openalex-snapshot
New Sublinear Algorithms and Lower Bounds for LIS Estimation
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2022.17openalex-snapshot
Finding Monotone Patterns in Sublinear Time, Adaptively
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.90openalex-snapshot
Sublinear-Time Computation in the Presence of Online Erasures
inferred← citeshttps://doi.org/10.46298/theoretics.24.1openalex-snapshot
Strongly Sublinear Algorithms for Testing Pattern Freeness
inferred← citeshttps://doi.org/10.48550/arxiv.1910.01749openalex-snapshot
Finding monotone patterns in sublinear time
showing the first 14 of 15 · page through all 15
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.