On the public citation graph
Algorithmic and Analysis Techniques in Property Testing
0 signed · 222 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.1002/rsa.10067openalex-snapshot
Testing membership in parenthesis languages
inferredcites →https://doi.org/10.1002/rsa.10078openalex-snapshot
Three theorems regarding testing graph properties
inferredcites →https://doi.org/10.1002/rsa.10110openalex-snapshot
Functions that have read‐twice constant width branching programs are not necessarily testable
inferredcites →https://doi.org/10.1002/rsa.20037openalex-snapshot
Testing graphs for colorability properties*
inferredcites →https://doi.org/10.1006/jagm.1994.1005openalex-snapshot
The Algorithmic Aspects of the Regularity Lemma
inferredcites →https://doi.org/10.1006/jcss.1999.1656openalex-snapshot
Testing Problems with Sublearning Sample Complexity
inferredcites →https://doi.org/10.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1007/978-1-4613-9578-2openalex-snapshot
Introduction to Statistical Inference
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/bf01200056openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1007/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
inferredcites →https://doi.org/10.1007/pl00009195openalex-snapshot
Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line
inferredcites →https://doi.org/10.1007/s004930050060openalex-snapshot
A Sublinear Bipartiteness Tester for Bounded Degree Graphs
inferredcites →https://doi.org/10.1007/s004930070001openalex-snapshot
Efficient Testing of Large Graphs
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.ipl.2004.01.023openalex-snapshot
A lower bound for testing juntas
inferredcites →https://doi.org/10.1016/j.jcss.2004.04.008openalex-snapshot
Testing subgraphs in directed graphs
inferredcites →https://doi.org/10.1016/j.jcss.2006.03.002openalex-snapshot
Tolerant property testing and distance approximation
inferredcites →https://doi.org/10.1016/j.jctb.2004.08.001openalex-snapshot
Graph Minors. XX. Wagner's conjecture
inferredcites →https://doi.org/10.1016/s0020-0190(03)00230-8openalex-snapshot
Functions that have read-once branching programs of quadratic size are not necessarily testable
inferredcites →https://doi.org/10.1016/s0890-5401(03)00160-3openalex-snapshot
Testing metric properties
inferredcites →https://doi.org/10.1017/s0963548306007759openalex-snapshot
A Characterization of Easily Testable Induced Subgraphs
inferredcites →https://doi.org/10.1090/dimacs/043/04openalex-snapshot
Combinatorial property testing (a survey)
inferredcites →https://doi.org/10.1109/18.556674openalex-snapshot
Linearity testing in characteristic two
inferredcites →https://doi.org/10.1109/ccc.2004.1313803openalex-snapshot
Lower bounds for testing bipartiteness in dense graphs
inferredcites →https://doi.org/10.1109/focs.2004.64openalex-snapshot
Testing Low-Degree Polynomials over Prime Fields
inferredcites →https://doi.org/10.1109/focs.2009.77openalex-snapshot
Local Graph Partitions for Approximation and Testing
inferredcites →https://doi.org/10.1137/0217033openalex-snapshot
A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
inferredcites →https://doi.org/10.1137/060652324openalex-snapshot
Testing versus Estimation of Graph Properties
inferredcites →https://doi.org/10.1137/s0097539700366528openalex-snapshot
Regular Languages are Testable with a Constant Number of Queries
inferredcites →https://doi.org/10.1137/s009753970038211xopenalex-snapshot
Testing Membership in Languages that Have Small Width Branching Programs
inferredcites →https://doi.org/10.1137/s0097539702403645openalex-snapshot
The Complexity of Approximating the Entropy
inferredcites →https://doi.org/10.1137/s0097539703436424openalex-snapshot
Tight Bounds for Testing Bipartiteness in General Graphs
inferredcites →https://doi.org/10.1137/s009753970444199xopenalex-snapshot
Abstract Combinatorial Programs and Efficient Property Testers
inferredcites →https://doi.org/10.1137/s0097539704445445openalex-snapshot
Some 3CNF Properties Are Hard to Test
inferredcites →https://doi.org/10.1137/s0097539704445615openalex-snapshot
Testing Polynomials over General Fields
inferredcites →https://doi.org/10.1137/s0097539792234226openalex-snapshot
A Fast Algorithm for Optimally Increasing the Edge Connectivity
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1137/s0097539796302531openalex-snapshot
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
inferredcites →https://doi.org/10.1137/s0895480101407444openalex-snapshot
Testing Basic Boolean Formulae
inferredcites →https://doi.org/10.1145/226643.226652openalex-snapshot
Interactive proofs and the hardness of approximating cliques
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.1145/7531.7535openalex-snapshot
Using dual approximation algorithms for scheduling problems theoretical and practical results
inferredcites →https://doi.org/10.1561/9781933019604openalex-snapshot
Data Streams: Algorithms and Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4805894openalex-extracted
Almost Optimal Adaptive Proper Learning Polynomials
inferred← citeshttps://doi.org/10.1002/rsa.20462openalex-snapshot
Finding cycles and trees in sublinear time
inferred← citeshttps://doi.org/10.1002/rsa.20582openalex-snapshot
Two-sided error proximity oblivious testing
inferred← citeshttps://doi.org/10.1002/rsa.20639openalex-snapshot
Testing properties of functions on finite groups
inferred← citeshttps://doi.org/10.1002/rsa.21031openalex-snapshot
Erasures versus errors in local decoding and property testing
inferred← citeshttps://doi.org/10.1007/978-1-4614-6642-0_4openalex-snapshot
Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_701openalex-snapshot
Testing Bipartiteness of Graphs in Sublinear Time
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_702openalex-snapshot
Testing Bipartiteness in the Dense-Graph Model
inferred← citeshttps://doi.org/10.1007/978-3-030-43662-9_7openalex-snapshot
On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing
inferred← citeshttps://doi.org/10.1007/978-3-030-96731-4_17openalex-snapshot
An Optimal Tester for k-Linear
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_19openalex-snapshot
Almost Optimal Proper Learning and Testing Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_12openalex-snapshot
On One-Sided Testing Affine Subspaces
inferred← citeshttps://doi.org/10.1007/978-3-031-88946-2_10openalex-snapshot
On the Locally Testable Code of Dinur et al. (2021)
inferred← citeshttps://doi.org/10.1007/978-3-031-88946-2_23openalex-snapshot
On Testing Group Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_38openalex-snapshot
Hierarchy Theorems for Property Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_39openalex-snapshot
Algorithmic Aspects of Property Testing in the Dense Graphs Model
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_51openalex-snapshot
Testing Computability by Width Two OBDDs
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_30openalex-snapshot
Testing Boolean Function Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_43openalex-snapshot
On Testing Computability by Small Width OBDDs
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_1openalex-snapshot
A Brief Introduction to Property Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_17openalex-snapshot
Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_32openalex-snapshot
Lower Bounds for Testing Computability by Small Width OBDDs
inferred← citeshttps://doi.org/10.1007/978-3-642-20920-8_19openalex-snapshot
Untestable Properties in the Kahr-Moore-Wang Class
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_15openalex-snapshot
On the Average-Case Complexity of Property Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_19openalex-snapshot
Proximity Oblivious Testing and the Role of Invariances
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_32openalex-snapshot
Introduction to Testing Graph Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_33openalex-snapshot
Randomness and Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_35openalex-snapshot
Contemplations on Testing Graph Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_36openalex-snapshot
Another Motivation for Reducing the Randomness Complexity of Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_49openalex-snapshot
Proximity Oblivious Testing and the Role of Invariances
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_701-1openalex-snapshot
Testing Bipartiteness of Graphs in Sublinear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_702-1openalex-snapshot
Testing Bipartiteness in the Dense-Graph Model
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_33openalex-snapshot
Testing Formula Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_37openalex-snapshot
Tight Bounds for Testing k-Linearity
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_48openalex-snapshot
Two-Sided Error Proximity Oblivious Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_71openalex-snapshot
Testing Linear-Invariant Function Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_38openalex-snapshot
Testing Membership in Counter Automaton Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-40988-2_35openalex-snapshot
How Robust Is the Core of a Network?
inferred← citeshttps://doi.org/10.1007/978-3-662-44900-4_3openalex-snapshot
Sublinear Algorithms for Extreme-Scale Data Analysis
inferred← citeshttps://doi.org/10.1007/978-3-662-53426-7_4openalex-snapshot
Fast Distributed Algorithms for Testing Graph Properties
inferred← citeshttps://doi.org/10.1007/s00037-011-0022-4openalex-snapshot
Hierarchy Theorems for Property Testing
inferred← citeshttps://doi.org/10.1007/s00037-012-0040-xopenalex-snapshot
Property Testing Lower Bounds via Communication Complexity
inferred← citeshttps://doi.org/10.1007/s00037-014-0093-0openalex-snapshot
Testing list H-homomorphisms
inferred← citeshttps://doi.org/10.1007/s00037-016-0136-9openalex-snapshot
Non-interactive proofs of proximity
inferred← citeshttps://doi.org/10.1007/s00037-018-0168-4openalex-snapshot
An adaptivity hierarchy theorem for property testing
inferred← citeshttps://doi.org/10.1007/s00037-021-00212-3openalex-snapshot
An Exponential Separation Between MA and AM Proofs of Proximity
inferred← citeshttps://doi.org/10.1007/s00220-023-04836-0openalex-snapshot
Discrimination of Quantum States Under Locality Constraints in the Many-Copy Setting
inferred← citeshttps://doi.org/10.1007/s00224-017-9785-6openalex-snapshot
Testing Shape Restrictions of Discrete Distributions
inferred← citeshttps://doi.org/10.1007/s00446-018-0324-8openalex-snapshot
Fast distributed algorithms for testing graph properties
inferred← citeshttps://doi.org/10.1007/s00453-013-9858-0openalex-snapshot
Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities
inferred← citeshttps://doi.org/10.1007/s00453-015-9984-yopenalex-snapshot
Testing Lipschitz Functions on Hypergrid Domains
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.jcss.2012.01.007openalex-snapshot
Testable and untestable classes of first-order formulae
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.1016/j.tcs.2010.10.003openalex-snapshot
Sorting and selection on dynamic data
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.038openalex-snapshot
Testing Eulerianity and connectivity in directed sparse graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.045openalex-snapshot
Testing the (s,t) -disconnectivity of graphs and digraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.05.019openalex-snapshot
Testing piecewise functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114745openalex-snapshot
On one-sided testing affine subspaces
inferred← citeshttps://doi.org/10.1017/9781108135252openalex-snapshot
Introduction to Property Testing
inferred← citeshttps://doi.org/10.1093/imrn/rnaa017openalex-snapshot
Abelian Groups Are Polynomially Stable
inferred← citeshttps://doi.org/10.1109/ccc.2011.31openalex-snapshot
Property Testing Lower Bounds via Communication Complexity
inferred← citeshttps://doi.org/10.1109/ccc.2014.38openalex-snapshot
Lower Bounds for Testing Properties of Functions over Hypergrid Domains
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/focs.2012.53openalex-snapshot
Partially Symmetric Functions Are Efficiently Isomorphism-Testable
inferred← citeshttps://doi.org/10.1109/focs.2014.43openalex-snapshot
On Learning and Testing Dynamic Environments
inferred← citeshttps://doi.org/10.1109/focs.2016.63openalex-snapshot
Testing Assignments to Constraint Satisfaction 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/ted.2018.2832118openalex-snapshot
Determining External Quantum Efficiency From Energy Conversion Efficiency for Light-Emitting Diodes
inferred← citeshttps://doi.org/10.1109/tit.2018.2883306openalex-snapshot
Quantum Query Complexity of Entropy Estimation
inferred← citeshttps://doi.org/10.1109/tit.2024.3382037openalex-snapshot
A Quantum Algorithm Framework for Discrete Probability Distributions With Applications to Rényi Entropy Estimation
inferred← citeshttps://doi.org/10.1137/090749621openalex-snapshot
Algorithmic Aspects of Property Testing in the Dense Graphs Model
inferred← citeshttps://doi.org/10.1137/1.9781611973105.97openalex-snapshot
Testing Low Complexity Affine-Invariant Properties
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch96openalex-snapshot
Gowers Norm, Function Limits, and Parameter Estimation
inferred← citeshttps://doi.org/10.1137/100802980openalex-snapshot
An Expansion Tester for Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1137/110832677openalex-snapshot
Nearly Tight Bounds for Testing Function Isomorphism
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/130945508openalex-snapshot
Testing Probability Distributions using Conditional Samples
inferred← citeshttps://doi.org/10.1137/140971877openalex-snapshot
Partially Symmetric Functions Are Efficiently Isomorphism Testable
inferred← citeshttps://doi.org/10.1137/15m1027942openalex-snapshot
Trigger Detection for Adaptive Scientific Workflows Using Percentile Sampling
inferred← citeshttps://doi.org/10.1137/18m121085xopenalex-snapshot
Constant-Query Testability of Assignments to Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1142/s0129054112500219openalex-snapshot
TESTING FOR FORBIDDEN POSETS IN ORDERED ROOTED FORESTS
inferred← citeshttps://doi.org/10.1145/1959045.1959062openalex-snapshot
Guest column: testing linear properties
inferred← citeshttps://doi.org/10.1145/2090236.2090249openalex-snapshot
Algorithms on evolving graphs
inferred← citeshttps://doi.org/10.1145/2339530.2339539openalex-snapshot
PageRank on an evolving graph
inferred← citeshttps://doi.org/10.1145/2488608.2488662openalex-snapshot
Every locally characterized affine-invariant property is testable
inferred← citeshttps://doi.org/10.1145/2488608.2488709openalex-snapshot
Interactive proofs of proximity
inferred← citeshttps://doi.org/10.1145/2554797.2554841openalex-snapshot
Partial tests, universal tests and decomposability
inferred← citeshttps://doi.org/10.1145/2591796.2591802openalex-snapshot
A characterization of locally testable affine-invariant properties via decomposition theorems
inferred← citeshttps://doi.org/10.1145/2688073.2688079openalex-snapshot
Non-Interactive Proofs of Proximity
inferred← citeshttps://doi.org/10.1145/2746539.2746592openalex-snapshot
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
inferred← citeshttps://doi.org/10.1145/2746539.2746618openalex-snapshot
Testing Cluster Structure of Graphs
inferred← citeshttps://doi.org/10.1145/2897184openalex-snapshot
Testing Read-Once Formula Satisfaction
inferred← citeshttps://doi.org/10.1145/2897518.2897575openalex-snapshot
Relating two property testing models for bounded degree directed graphs
inferred← citeshttps://doi.org/10.1145/2925426.2926254openalex-snapshot
Graph Prefetching Using Data Structure Knowledge
inferred← citeshttps://doi.org/10.1145/2980765.2980770openalex-snapshot
Current and Future Challenges in Mining Large Networks
inferred← citeshttps://doi.org/10.1145/3055399.3055461openalex-snapshot
Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness
inferred← citeshttps://doi.org/10.1145/3087801.3087821openalex-snapshot
On the Multiparty Communication Complexity of Testing Triangle-Freeness
inferred← citeshttps://doi.org/10.1145/3088509openalex-snapshot
On Learning and Testing Dynamic Environments
inferred← citeshttps://doi.org/10.1145/3178876.3186111openalex-snapshot
Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples
inferred← citeshttps://doi.org/10.1145/3188745.3188842openalex-snapshot
Distribution-free junta testing
inferred← citeshttps://doi.org/10.1145/3212734.3212772openalex-snapshot
Distributed Uniformity Testing
inferred← citeshttps://doi.org/10.1145/3213772openalex-snapshot
Settling the Query Complexity of Non-adaptive Junta Testing
inferred← citeshttps://doi.org/10.1145/3294052.3319679openalex-snapshot
Testability of Homomorphism Inadmissibility
inferred← citeshttps://doi.org/10.1145/3357713.3384239openalex-snapshot
Testing noisy linear functions for sparsity
inferred← citeshttps://doi.org/10.1145/3717823.3718166openalex-snapshot
Testing vs Estimation for Index-Invariant Properties in the Huge Object Model
inferred← citeshttps://doi.org/10.14778/2536360.2536368openalex-snapshot
Making queries tractable on big data with preprocessing
inferred← citeshttps://doi.org/10.1561/0400000064openalex-snapshot
Higher-order Fourier Analysis and Applications
inferred← citeshttps://doi.org/10.1561/9781680831313openalex-snapshot
Scalable Algorithms for Data and Network Analysis
inferred← citeshttps://doi.org/10.1561/9781680835939openalex-snapshot
Higher-order Fourier Analysis and Applications
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8686openalex-snapshot
Sensitivity of Diffusion Dynamics to Network Uncertainty
inferred← citeshttps://doi.org/10.1613/jair.4330openalex-snapshot
Sensitivity of Diffusion Dynamics to Network Uncertainty
inferred← citeshttps://doi.org/10.17877/de290r-13142openalex-snapshot
Property testing in gradbeschränkten gerichteten Graphen unter Nichtsichtbarkeit eingehender Kanten
inferred← citeshttps://doi.org/10.2172/1227346openalex-snapshot
Final Report: Sublinear Algorithms for In-situ and In-transit Data Analysis at Exascale.
inferred← citeshttps://doi.org/10.22364/bjmc.2016.4.4.11openalex-snapshot
The Kahr-Moore-Wang Class Contains Untestable Properties
inferred← citeshttps://doi.org/10.2436/bscm.vi.67532openalex-snapshot
Endre Szemerédi, Premi Abel 2012
inferred← citeshttps://doi.org/10.31237/osf.io/fq3rnopenalex-snapshot
On Locally Verifiable Proofs of Proximity
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.3390/bdcc9100257openalex-snapshot
Tester-Guided Graph Learning with End-to-End Detection Certificates for Triangle-Based Anomalies
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.704openalex-snapshot
On Multiple Input Problems in Property Testing
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2020.5openalex-snapshot
Almost Optimal Testers for Concise Representations
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2022.48openalex-snapshot
Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2019.2openalex-snapshot
Almost Optimal Distribution-Free Junta Testing
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2019.52openalex-snapshot
Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2024.8openalex-snapshot
(Quantum) Complexity of Testing Signed Graph Clusterability
inferred← citeshttps://doi.org/10.48550/arxiv.1008.4401openalex-snapshot
Separations of Matroid Freeness Properties
inferred← citeshttps://doi.org/10.48550/arxiv.1106.3126openalex-snapshot
Testing List H-Homomorphisms
inferred← citeshttps://doi.org/10.48550/arxiv.1204.3413openalex-snapshot
Testing Formula Satisfaction
inferred← citeshttps://doi.org/10.48550/arxiv.1302.0914openalex-snapshot
Beyond Worst-Case Analysis for Joins with Minesweeper
inferred← citeshttps://doi.org/10.48550/arxiv.1304.6685openalex-snapshot
Distance-Sensitive Property Testing Lower Bounds
inferred← citeshttps://doi.org/10.48550/arxiv.1306.1360openalex-snapshot
Some properties are not even partially testable
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.1411.7346openalex-snapshot
A Chasm Between Identity and Equivalence Testing with Conditional Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1501.06783openalex-snapshot
Big Data on the Rise: Testing monotonicity of distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1602.03718openalex-snapshot
Fast Distributed Algorithms for Testing Graph Properties
inferred← citeshttps://doi.org/10.48550/arxiv.1605.00089openalex-snapshot
Dynamic Graph Stream Algorithms in $o(n)$ Space
inferred← citeshttps://doi.org/10.48550/arxiv.1704.06314openalex-snapshot
Settling the query complexity of non-adaptive junta testing
inferred← citeshttps://doi.org/10.48550/arxiv.1705.04033openalex-snapshot
Distributed Property Testing for Subgraph-Freeness Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.1705.08438openalex-snapshot
On The Multiparty Communication Complexity of Testing Triangle-Freeness
inferred← citeshttps://doi.org/10.48550/arxiv.1802.04859openalex-snapshot
Distribution-free Junta Testing
inferred← citeshttps://doi.org/10.48550/arxiv.1812.11564openalex-snapshot
Spectral methods for testing cluster structure of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1903.01432openalex-snapshot
Data Amplification: Instance-Optimal Property Estimation
inferred← citeshttps://doi.org/10.48550/arxiv.1906.03794openalex-snapshot
The Broad Optimality of Profile Maximum Likelihood
inferred← citeshttps://doi.org/10.48550/arxiv.1911.08320openalex-snapshot
Property Testing of LP-Type Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2010.04527openalex-snapshot
Constant-time connectivity tests
inferred← citeshttps://doi.org/10.5555/2133036.2133166openalex-snapshot
Nearly tight bounds for testing function isomorphism
inferred← citeshttps://doi.org/10.5555/2627817.2627913openalex-snapshot
Exponentially improved algorithms and lower bounds for testing signed majorities
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.