On the public citation graph
Settling the Query Complexity of Non-adaptive Junta Testing
0 signed · 54 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-85363-3_26openalex-snapshot
Improved Bounds for Testing Juntas
inferredcites →https://doi.org/10.1007/978-3-642-03685-9_48openalex-snapshot
Testing ±1-weight halfspace
inferredcites →https://doi.org/10.1007/978-3-642-03685-9_51openalex-snapshot
Testing Computability by Width Two OBDDs
inferredcites →https://doi.org/10.1007/978-3-642-16367-8openalex-snapshot
Property testing: current research and surveys
inferredcites →https://doi.org/10.1007/978-3-642-32512-0_37openalex-snapshot
Tight Bounds for Testing k-Linearity
inferredcites →https://doi.org/10.1007/s00037-012-0040-xopenalex-snapshot
Property Testing Lower Bounds via Communication Complexity
inferredcites →https://doi.org/10.1016/0012-365x(76)90058-3openalex-snapshot
A note on the edges of the n-cube
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/0097-3165(83)90038-9openalex-snapshot
On the trace of finite sets
inferredcites →https://doi.org/10.1016/j.ipl.2004.01.023openalex-snapshot
A lower bound for testing juntas
inferredcites →https://doi.org/10.1017/9781108135252openalex-snapshot
Introduction to Property Testing
inferredcites →https://doi.org/10.1017/cbo9780511581274openalex-snapshot
Concentration of Measure for the Analysis of Randomized Algorithms
inferredcites →https://doi.org/10.1080/00029890.1964.11992272openalex-snapshot
Assignment of Numbers to Vertices
inferredcites →https://doi.org/10.1109/ccc.2011.31openalex-snapshot
Property Testing Lower Bounds via Communication Complexity
inferredcites →https://doi.org/10.1109/focs.2007.70openalex-snapshot
Cryptography from Sunspots: How to Use an Imperfect Reference String
inferredcites →https://doi.org/10.1109/focs.2010.54openalex-snapshot
Optimal Testing of Reed-Muller Codes
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.1137/0112012openalex-snapshot
Optimal Assignments of Numbers to Vertices
inferredcites →https://doi.org/10.1137/0115129openalex-snapshot
Maximally Connected Arrays on the n -Cube
inferredcites →https://doi.org/10.1137/1.9780898715859openalex-snapshot
Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/100785429openalex-snapshot
Testing Fourier Dimensionality and Sparsity
inferredcites →https://doi.org/10.1137/s0040585x9797821xopenalex-snapshot
Binomial Approximation to the Poisson Binomial Distribution: The Krawtchouk Expansion
inferredcites →https://doi.org/10.1137/s0895480101407444openalex-snapshot
Testing Basic Boolean Formulae
inferredcites →https://doi.org/10.1145/1536414.1536437openalex-snapshot
Testing juntas nearly optimally
inferredcites →https://doi.org/10.1145/2488608.2488660openalex-snapshot
A o(n) monotonicity tester for boolean functions over the hypercube
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/2897518.2897567openalex-snapshot
A polynomial lower bound for testing monotonicity
inferredcites →https://doi.org/10.1145/509907.509977openalex-snapshot
Monotonicity testing over general poset domains
inferredcites →https://doi.org/10.1155/jia/2006/64307openalex-snapshot
Exact Kolmogorov and total variation distances between some familiar discrete distributions
inferredcites →https://doi.org/10.1561/0400000029openalex-snapshot
Algorithmic and Analysis Techniques in Property Testing
inferredcites →https://doi.org/10.1561/2200000004openalex-snapshot
Property Testing: A Learning Theory Perspective
inferredcites →https://doi.org/10.4230/lipics.approx-random.2016.37openalex-snapshot
An ~O(n) Queries Adaptive Tester for Unateness
inferredcites →https://doi.org/10.48550/arxiv.1209.3849openalex-snapshot
The non-adaptive query complexity of testing k-parities
inferredcites →https://doi.org/10.48550/arxiv.1608.06980openalex-snapshot
A $\widetilde{O}(n)$ Non-Adaptive Tester for Unateness
inferredcites →https://doi.org/10.48550/arxiv.1608.07652openalex-snapshot
Testing Unateness of Real-Valued Functions
inferredcites →https://doi.org/10.5555/2627817.2627913openalex-snapshot
Exponentially improved algorithms and lower bounds for testing signed majorities
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.1007/s00037-018-0168-4openalex-snapshot
An adaptivity hierarchy theorem for property testing
inferred← citeshttps://doi.org/10.1007/s10957-023-02353-7openalex-snapshot
Algorithms for Cardinality-Constrained Monotone DR-Submodular Maximization with Low Adaptivity and Query Complexity
inferred← citeshttps://doi.org/10.1007/s11128-020-02652-2openalex-snapshot
Quantum and classical query complexities for generalized Deutsch–Jozsa problems
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00107openalex-snapshot
A strong composition theorem for junta complexity and the boosting of property testers
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00108openalex-snapshot
New Lower Bounds for Adaptive Tolerant Junta Testing
inferred← citeshttps://doi.org/10.1109/tpami.2025.3528648openalex-snapshot
On Testing and Learning Quantum Junta Channels
inferred← citeshttps://doi.org/10.1145/3188745.3188842openalex-snapshot
Distribution-free junta testing
inferred← citeshttps://doi.org/10.1145/3618260.3649687openalex-snapshot
Optimal Non-adaptive Tolerant Junta Testing via Local Estimators
inferred← citeshttps://doi.org/10.3233/fi-2021-2076openalex-snapshot
Testing Boolean Functions Properties
inferred← citeshttps://doi.org/10.3934/jimo.2022031openalex-snapshot
An adaptive algorithm for maximization of non-submodular function with a matroid constraint
inferred← citeshttps://doi.org/10.48550/arxiv.2106.00287openalex-snapshot
Junta Distance Approximation with Sub-Exponential Queries
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.