On the public citation graph
Testing Symmetric Properties of Distributions
0 signed · 151 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.10078openalex-snapshot
Three theorems regarding testing graph properties
inferredcites →https://doi.org/10.1006/jmva.1998.1789openalex-snapshot
On the Rate of Multivariate Poisson Convergence
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.1109/tit.2011.2134250openalex-snapshot
Quantum Algorithms for Testing Properties of Distributions
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/070701649openalex-snapshot
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
inferredcites →https://doi.org/10.1137/s0097539702403645openalex-snapshot
The Complexity of Approximating the Entropy
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1145/1007352.1007414openalex-snapshot
Sublinear algorithms for testing monotone and unimodal distributions
inferredcites →https://doi.org/10.1145/1109557.1109637openalex-snapshot
Streaming and sublinear approximation of entropy and information distances
inferredcites →https://doi.org/10.1145/1132516.1132555openalex-snapshot
A combinatorial characterization of the testable graph properties
inferredcites →https://doi.org/10.1145/1250790.1250863openalex-snapshot
Testing k-wise and almost k-wise independence
inferredcites →https://doi.org/10.1145/200836.200880openalex-snapshot
Designing programs that check their work
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.1145/335168.335230openalex-snapshot
Towards estimation error guarantees for distinct values
inferredcites →https://doi.org/10.1145/509907.510005openalex-snapshot
The complexity of approximating entropy
inferredcites →https://doi.org/10.1145/73007.73015openalex-snapshot
Designing programs that check their work
inferredcites →https://doi.org/10.5555/1283383.1283418openalex-snapshot
A near-optimal algorithm for computing the entropy of a stream
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-82697-9_20openalex-snapshot
Tolerant Testing and Distance Estimation for Distributions Under Memory Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_12openalex-snapshot
Invariance in Property Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_13openalex-snapshot
Testing Monotone Continuous Distributions on High-Dimensional Real Cubes
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_27openalex-snapshot
On the Complexity of Computational Problems Regarding Distributions
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_39openalex-snapshot
A Canonical Form for Testing Boolean Function Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_57openalex-snapshot
On Approximating the Number of Relevant Variables in a Function
inferred← citeshttps://doi.org/10.1007/978-3-642-34106-9_13openalex-snapshot
New Analysis and Algorithm for Learning with Drifting Distributions
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_24openalex-snapshot
Testing Probability Distributions Underlying Aggregated Data
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0_16openalex-snapshot
Optimal Bounds for Estimating Entropy with PMF Queries
inferred← citeshttps://doi.org/10.1007/978-981-96-4656-2_5openalex-snapshot
Testing and Design of Uniform CNF Samplers: A Virtuous Cycle Enabled by Distribution Testing
inferred← citeshttps://doi.org/10.1007/s00224-010-9265-8openalex-snapshot
Sublinear Time Algorithms for Earth Mover’s Distance
inferred← citeshttps://doi.org/10.1007/s00224-017-9785-6openalex-snapshot
Testing Shape Restrictions of Discrete Distributions
inferred← citeshttps://doi.org/10.1007/s00285-012-0589-7openalex-snapshot
Methods for diversity and overlap analysis in T-cell receptor populations
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.1007/s42081-021-00144-wopenalex-snapshot
Analysis of COVID-19 evolution based on testing closeness of sequential data
inferred← citeshttps://doi.org/10.1016/j.sigpro.2014.09.016openalex-snapshot
Active data labeling for improved classifier generalizability
inferred← citeshttps://doi.org/10.1038/s41567-025-03048-8openalex-snapshot
Entanglement theory with limited computational resources
inferred← citeshttps://doi.org/10.1098/rspa.2015.0301openalex-snapshot
Quantum speedup of Monte Carlo methods
inferred← citeshttps://doi.org/10.1103/physreva.104.022428openalex-snapshot
Quantum algorithm for estimating α -Renyi entropies of quantum states
inferred← citeshttps://doi.org/10.1103/physreva.89.022313openalex-snapshot
Experimental realization of quantum algorithm for solving linear systems of equations
inferred← citeshttps://doi.org/10.1103/physrevlett.103.150502openalex-snapshot
Quantum Algorithm for Linear Systems of Equations
inferred← citeshttps://doi.org/10.1109/allerton.2018.8636068openalex-snapshot
Property Testing For Differential Privacy
inferred← citeshttps://doi.org/10.1109/focs.2007.67openalex-snapshot
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
inferred← citeshttps://doi.org/10.1109/focs.2008.76openalex-snapshot
Sketching and Streaming Entropy via Approximation Theory
inferred← citeshttps://doi.org/10.1109/focs.2014.14openalex-snapshot
An Automatic Inequality Prover and Instance Optimal Identity Testing
inferred← citeshttps://doi.org/10.1109/focs.2015.76openalex-snapshot
Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions
inferred← citeshttps://doi.org/10.1109/focs.2016.78openalex-snapshot
A New Approach for Testing Properties of Discrete Distributions
inferred← citeshttps://doi.org/10.1109/isit.2012.6283985openalex-snapshot
Classification with high-dimensional sparse samples
inferred← citeshttps://doi.org/10.1109/isit.2014.6875425openalex-snapshot
Sublinear algorithms for outlier detection and generalized closeness testing
inferred← citeshttps://doi.org/10.1109/isit.2015.7282570openalex-snapshot
Optimal entropy estimation on large alphabets via best polynomial approximation
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174055openalex-snapshot
Two-Sample Testing on Pairwise Comparison Data and the Role of Modeling Assumptions
inferred← citeshttps://doi.org/10.1109/jsait.2021.3072960openalex-snapshot
Sequential Change Detection by Optimal Weighted ℓ₂ Divergence
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.2011.2134250openalex-snapshot
Quantum Algorithms for Testing Properties of Distributions
inferred← citeshttps://doi.org/10.1109/tit.2012.2222343openalex-snapshot
Classification of Homogeneous Data With Large Alphabets
inferred← citeshttps://doi.org/10.1109/tit.2013.2283266openalex-snapshot
Generalized Error Exponents for Small Sample Universal Hypothesis Testing
inferred← citeshttps://doi.org/10.1109/tit.2016.2548468openalex-snapshot
Minimax Rates of Entropy Estimation on Large Alphabets via Best Polynomial Approximation
inferred← citeshttps://doi.org/10.1109/tit.2016.2563439openalex-snapshot
Weak Convergence Analysis of Asymptotically Optimal Hypothesis Tests
inferred← citeshttps://doi.org/10.1109/tit.2016.2620435openalex-snapshot
Estimating Renyi Entropy of Discrete Distributions
inferred← citeshttps://doi.org/10.1109/tit.2018.2883306openalex-snapshot
Quantum Query Complexity of Entropy Estimation
inferred← citeshttps://doi.org/10.1109/tit.2023.3271206openalex-snapshot
Almost Tight Sample Complexity Analysis of Quantum Identity Testing by Pauli Measurements
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.1109/tit.2024.3412107openalex-snapshot
Likelihood-Free Hypothesis Testing
inferred← citeshttps://doi.org/10.1109/tit.2024.3483995openalex-snapshot
Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing
inferred← citeshttps://doi.org/10.1109/tpds.2018.2790946openalex-snapshot
A Differentiated Caching Mechanism to Enable Primary Storage Deduplication in Clouds
inferred← citeshttps://doi.org/10.1137/070701649openalex-snapshot
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
inferred← citeshttps://doi.org/10.1137/1.9781611973105.131openalex-snapshot
Testing k-Modal Distributions: Optimal Algorithms via Reductions
inferred← citeshttps://doi.org/10.1137/1.9781611973402.88openalex-snapshot
Optimal Algorithms for Testing Closeness of Discrete Distributions
inferred← citeshttps://doi.org/10.1137/1.9781611973730.123openalex-snapshot
Testing Identity of Structured Distributions
inferred← citeshttps://doi.org/10.1137/1.9781611976465.21openalex-snapshot
Random Restrictions of High Dimensional Distributions and Uniformity Testing with Subcube Conditioning
inferred← citeshttps://doi.org/10.1137/130945508openalex-snapshot
Testing Probability Distributions using Conditional Samples
inferred← citeshttps://doi.org/10.1137/140964199openalex-snapshot
On the Power of Conditional Samples in Distribution Testing
inferred← citeshttps://doi.org/10.1137/151002526openalex-snapshot
An Automatic Inequality Prover and Instance Optimal Identity Testing
inferred← citeshttps://doi.org/10.1145/2213556.2213561openalex-snapshot
Approximating and testing k-histogram distributions in sub-linear time
inferred← citeshttps://doi.org/10.1145/2331042.2331052openalex-snapshot
Taming big probability distributions
inferred← citeshttps://doi.org/10.1145/2422436.2422497openalex-snapshot
On the power of conditional samples in distribution testing
inferred← citeshttps://doi.org/10.1145/2432622.2432626openalex-snapshot
Testing Closeness of Discrete Distributions
inferred← citeshttps://doi.org/10.1145/2493246.2493250openalex-snapshot
On Approximating the Number of Relevant Variables in a Function
inferred← citeshttps://doi.org/10.1145/2897518.2897552openalex-snapshot
The fourier transform of poisson multinomial distributions and its algorithmic applications
inferred← citeshttps://doi.org/10.1145/2897518.2897641openalex-snapshot
Instance optimal learning of discrete distributions
inferred← citeshttps://doi.org/10.1145/3170708openalex-snapshot
Communication Complexity of Statistical Distance
inferred← citeshttps://doi.org/10.1145/3188745.3188952openalex-snapshot
The query complexity of graph isomorphism: bypassing distribution testing lower bounds
inferred← citeshttps://doi.org/10.1145/3241377openalex-snapshot
Property Testing of Joint Distributions using Conditional Samples
inferred← citeshttps://doi.org/10.1145/3305270openalex-snapshot
Distribution Testing Lower Bounds via Reductions from Communication Complexity
inferred← citeshttps://doi.org/10.1145/3519935.3519987openalex-snapshot
Verifying the unseen: interactive proofs for label-invariant distribution properties
inferred← citeshttps://doi.org/10.1145/3618260.3649657openalex-snapshot
Testing Closeness of Multivariate Distributions via Ramsey Theory
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.1145/3717823.3718297openalex-snapshot
Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning
inferred← citeshttps://doi.org/10.1214/24-ejs2315openalex-snapshot
Conditional independence testing for discrete distributions: Beyond χ2- and G-tests
inferred← citeshttps://doi.org/10.1214/25-aos2498openalex-snapshot
Dualizing Le Cam’s method for functional estimation I: General theory
inferred← citeshttps://doi.org/10.1561/0100000095openalex-snapshot
Polynomial Methods in Statistical Inference: Theory and Practice
inferred← citeshttps://doi.org/10.1561/0100000114openalex-snapshot
Topics and Techniques in Distribution Testing: A Biased but Representative Sample
inferred← citeshttps://doi.org/10.1561/2200000004openalex-snapshot
Property Testing: A Learning Theory Perspective
inferred← citeshttps://doi.org/10.26421/qic19.3-4openalex-snapshot
Quantum fast-forwarding: Markov chains and graph property testing
inferred← citeshttps://doi.org/10.26421/qic22.15-16-1openalex-snapshot
Quantum approximate counting for Markov chains and collision counting
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.3150/21-bej1382openalex-snapshot
Local minimax rates for closeness testing of discrete distributions
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2022.27openalex-snapshot
Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2010.145openalex-snapshot
New Results on Quantum Property Testing
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.15openalex-snapshot
Two Party Distribution Testing: Communication and Security
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2021.11openalex-snapshot
Quantum Closeness Testing: A Streaming Algorithm and Applications
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.78openalex-snapshot
Testing Distributions of Huge Objects
inferred← citeshttps://doi.org/10.4230/lipics.sea.2018.11openalex-snapshot
A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
inferred← citeshttps://doi.org/10.4230/lipics.swat.2020.18openalex-snapshot
Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives
inferred← citeshttps://doi.org/10.46298/theoretics.23.12openalex-snapshot
Testing Distributions of Huge Objects
inferred← citeshttps://doi.org/10.48550/arxiv.0912.5079openalex-snapshot
A Lower Bound on the Complexity of Approximating the Entropy of a Markov Source
inferred← citeshttps://doi.org/10.48550/arxiv.1005.0523openalex-snapshot
New Results on Quantum Property Testing
inferred← citeshttps://doi.org/10.48550/arxiv.1009.5397openalex-snapshot
Testing Closeness of Discrete Distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1110.3100openalex-snapshot
Telling Two Distributions Apart: a Tight Characterization
inferred← citeshttps://doi.org/10.48550/arxiv.1205.4343openalex-snapshot
New Analysis and Algorithm for Learning with Drifting Distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1310.2035openalex-snapshot
A Survey of Quantum Property Testing
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.48550/arxiv.1411.7346openalex-snapshot
A Chasm Between Identity and Equivalence Testing with Conditional Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1504.04599openalex-snapshot
Testing Closeness With Unequal Sized Samples
inferred← citeshttps://doi.org/10.48550/arxiv.1702.08153openalex-snapshot
HPDedup: A Hybrid Prioritized Data Deduplication Mechanism for Primary Storage in the Cloud
inferred← citeshttps://doi.org/10.48550/arxiv.1706.05738openalex-snapshot
Fourier-Based Testing for Families of Distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1902.01999openalex-snapshot
Testing Markov Chains without Hitting
inferred← citeshttps://doi.org/10.48550/arxiv.1902.05616openalex-snapshot
Dualizing Le Cam's method for functional estimation, with applications to estimating the unseens
inferred← citeshttps://doi.org/10.48550/arxiv.1904.12053openalex-snapshot
Sample Amplification: Increasing Dataset Size even when Learning is Impossible
inferred← citeshttps://doi.org/10.48550/arxiv.1905.11947openalex-snapshot
Private Identity Testing for High-Dimensional Distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1906.04709openalex-snapshot
Communication and Memory Efficient Testing of Discrete Distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1907.03182openalex-snapshot
Towards Testing Monotonicity of Distributions Over General Posets
inferred← citeshttps://doi.org/10.48550/arxiv.1907.03190openalex-snapshot
Testing Mixtures of Discrete Distributions
inferred← citeshttps://doi.org/10.48550/arxiv.2006.11909openalex-snapshot
Two-Sample Testing on Ranked Preference Data and the Role of Modeling Assumptions
inferred← citeshttps://doi.org/10.48550/arxiv.2010.11285openalex-snapshot
Sequential Change Detection by Optimal Weighted $\ell_2$ Divergence
inferred← citeshttps://doi.org/10.48550/arxiv.2103.05952openalex-snapshot
Quantum Algorithms in Cybernetics
inferred← citeshttps://doi.org/10.48550/arxiv.2106.13414openalex-snapshot
The Price of Tolerance in Distribution Testing
inferred← citeshttps://doi.org/10.7916/d8416x8nopenalex-snapshot
On the isomorphism testing of graphs
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.