Fetching the paper…
Reading the bibliography…
We study the Convex Set Disjointness (CSD) problem, where two players have input sets taken from an arbitrary fixed domain~$U\subseteq \mathbb{R}^d$ of size $\lvert U\rvert = n$.
Über den Variabilitätsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmen
C. Carathéodory · 1907
Earlier work this paper cites.
The perceptron: A probabilistic model for information storage and organization in the brain
F. Rosenblatt · 1958
Earlier work this paper cites.
Some complexity questions related to distributive computing (preliminary report)
Andrew Chi-Chih Yao · 1979
Earlier work this paper cites.
Epsilon-nets and simplex range queries
David Haussler and Emo Welzl · 1986
Earlier work this paper cites.
A randomized algorithm for closest-point queries
Kenneth L. Clarkson · 1988
Earlier work this paper cites.
Learnability and the Vapnik-Chervonenkis dimension
A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth · 1989
Earlier work this paper cites.
The probabilistic communication complexity of set intersection
Bala Kalyanasundaram and Georg Schintger · 1992
Earlier work this paper cites.
Communication complexity and combinatorial lattice theory
László Lovăsz and Michael Saks · 1993
Earlier work this paper cites.
Computing with noisy information
Uriel Feige, David Peleg, Prabhakar Raghavan, and Eli Upfal · 1994
Cited alongside, same era.
Vapnik-chervonenkis dimension and (pseudo-)hyperplane arrangements
Bernd Gärtner and Emo Welzl · 1994
Cited alongside, same era.
Las vegas algorithms for linear and integer programming when the dimension is small
Kenneth L. Clarkson · 1995
Cited alongside, same era.
Sphere packing numbers for subsets of the boolean n-cube with bounded vapnik-chervonenkis dimension
David Haussler · 1995
Cited alongside, same era.
Communication complexity
Eyal Kushilevitz and Noam Nisan · 1997
Cited alongside, same era.
Handbook of Discrete and Computational Geometry, Second Edition
Jacob E. Goodman and Joseph O’Rourke, editors · 2004
Cited alongside, same era.
The communication complexity of addition
Emanuele Viola · 2013
Later among the works it cites.
On the uniform convergence of relative frequencies of events to their probabilities
Vladimir N Vapnik and A Ya Chervonenkis · 2015
Later among the works it cites.
Communication efficient distributed agnostic boosting
Shang-Tse Chen, Maria-Florina Balcan, and Duen Horng Chau · 2016
Later among the works it cites.
Federated learning: Strategies for improving communication efficiency
Jakub Konečný, H. Brendan McMahan, Felix X. Yu, Peter Richtarik, Ananda Theertha Suresh, and Dave Bacon · 2016
Later among the works it cites.
The method of hypergraph containers, 2018
Jozsef Balogh, Robert Morris, and Wojciech Samotij · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Distributed learning, communication complexity and privacy
Maria-Florina Balcan, Avrim Blum, Shai Fine, and Yishay Mansour · 2012
Cited alongside, same era.
Efficient protocols for distributed classification and optimization
Hal Daumé III, Jeff M. Phillips, Avishek Saha, and Suresh Venkatasubramanian · 2012
Cited alongside, same era.
Yuval Dagan, Gil Kur, and Ohad Shamir · 2019
Closest in time.
On communication complexity of classification problems
Daniel M. Kane, Roi Livni, Shay Moran, and Amir Yehudayoff · 2019
Closest in time.
The communication complexity of optimization, 2019
Santosh S. Vempala, Ruosong Wang, and David P. Woodruff · 2019
Closest in time.