![]() | Up a level |
Batu, Tugkan ORCID: 0000-0003-3914-4645, Fortnow, Lance, Rubinfeld, Ronitt, Smith, Warren D. and White, Patrick
(2013)
Testing closeness of discrete distributions.
Journal of the ACM, 60 (1).
ISSN 0004-5411
Batu, Tugkan ORCID: 0000-0003-3914-4645, Rubinfeld, Ronitt and White, Patrick
(2005)
Fast approximate PCPs for multidimensional bin-packing problems.
Information and Computation, 196 (1).
pp. 42-56.
ISSN 0890-5401
Batu, Tugkan ORCID: 0000-0003-3914-4645, Dasgupta, Sanjoy, Kumar, Ravi and Rubinfeld, Ronitt
(2005)
The complexity of approximating the entropy.
SIAM Journal on Computing, 35 (1).
pp. 132-150.
ISSN 0097-5397
Batu, Tugkan ORCID: 0000-0003-3914-4645, Rubinfeld, Ronitt and White, Patrick
(1999)
Fast approximate PCPs for multidimensional bin-packing problem.
Lecture Notes in Computer Science, 1671.
pp. 245-256.
ISSN 0302-9743
Batu, Tugkan ORCID: 0000-0003-3914-4645, Dasgupta, Sanjoy, Kumar, Ravi and Rubinfeld, Ronitt
(2002)
The complexity of approximating entropy.
In:
Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing - Stoc '02.
ACM Press, New York, USA, pp. 678-687.
ISBN 1581134959
Batu, Tugkan ORCID: 0000-0003-3914-4645, Fortnow, Lance, Rubinfeld, Ronitt, Smith, Warren D. and White, Patrick
(2010)
Testing closeness of discrete distributions.
.
arXiv.org.
Batu, Tugkan ORCID: 0000-0003-3914-4645, Kumar, Ravi and Rubinfeld, Ronitt
(2004)
Sublinear algorithms for testing monotone and unimodal distributions.
In: 36th ACM Symposium on Theory of Computing (STOC), 2004-06-13 - 2004-06-15, IL., United States, USA.