Amanote Research
Register
Sign In
Set Reconciliation With Nearly Optimal Communication Complexity
doi 10.1109/isit.2001.936095
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
Y. Minsky
A. Trachtenberg
R. Zippel
Publisher
IEEE
Related search
Nearly Optimal Edge Estimation With Independent Set Queries
Distributed Agreement With Optimal Communication Complexity
The Communication Complexity of Set Intersection and Multiple Equality Testing
Byzantine Set-Union Consensus Using Efficient Set Reconciliation
Eurasip Journal on Information Security
Computer Science Applications
Signal Processing
Optimal Non-Negative Forecast Reconciliation
Statistics and Computing
Statistics
Probability
Uncertainty
Mathematics
Computational Theory
Theoretical Computer Science
Finding Nearly Optimal GDT Scores
Journal of Computational Biology
Genetics
Molecular Biology
Computational Theory
Simulation
Computational Mathematics
Mathematics
Modeling
Optimal Inference in Regression Models With Nearly Integrated Regressors
Econometrica
Economics
Econometrics
Learning Complexity vs Communication Complexity
Combinatorics Probability and Computing
Statistics
Probability
Applied Mathematics
Mathematics
Computational Theory
Theoretical Computer Science
(Nearly) Sample-Optimal Sparse Fourier Transform
