Batu, Tugkan and
Berenbrink, Petra and
Cooper, Colin
(2012)
Chains-into-bins processes
Journal of Discrete Algorithms, 14. 21-28. ISSN 1570-8667
Batu, Tugkan and
Berenbrink, Petra and
Cooper, Colin
(2011)
Chains-into-bins processes
In:
Iliopoulos, Costas S. and
Smyth, William F., (eds.)
Combinatorial Algorithms. Lecture notes in computer science (6460). Springer, 314-325. ISBN 9783642192210
Batu, Tugkan and
Berenbrink, Petra and
Cooper, Colin
(2010)
Chains-into-bins processes
arXiv.org.
Batu, Tugkan and
Berenbrink, Petra and
Sohler, Christian
(2007)
A sublinear-time approximation scheme for bin packing
LSE-CDAM-2007-33. London School of Economics and Political Science, London, UK.
Batu, Tugkan and
Dasgupta, Sanjoy and
Kumar, Ravi and
Rubinfeld, Ronitt
(2005)
The complexity of approximating the entropy
SIAM Journal on Computing, 35 (1). 132-150. ISSN 0097-5397
Batu, Tugkan and
Cenk Sahinalp, Suhleyman
(2005)
Locally consistent parsing and applications to approximate string comparisons
In:
De Felice, Clelia and
Restivo, Antonio, (eds.)
Developments in Language Theory, 9th International Conference, Dlt 2005. Lecture notes in computer science 3572. Springer-Verlag Berlin and Heidelberg, Berlin, 22-35. ISBN 3540265465
Batu, Tugkan and
Guha, Sudipto and
Kannan, Sampath
(2004)
Inferring mixtures of Markov chains
Lecture Notes in Computer Science, 3120/2. Springer Berlin / Heidelberg, 186-199. ISBN 9783540222828
Batu, Tugkan and
Kumar, Ravi and
Rubinfeld, Ronitt
(2004)
Sublinear algorithms for testing monotone and unimodal distributions.
In: 36th ACM Symposium on Theory of Computing (STOC), 13-15 Jun 2004, Chicago, IL., USA
Batu, Tugkan and
Kannan, Sampath and
Khanna, Sanjeev and
McGregor, Andrew
(2004)
Reconstructing strings from random traces.
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 11-13 Jan 2004, New Orleans, USA
Batu, Tugkan and
Ergun, Funda and
Kilian, Joe and
Magen, Avner and
Raskhodnikova, Sofya and
Rubinfeld, Robin and
Sami, Rahul
(2003)
A sublinear algorithm for weakly approximating edit distance.
In: 35th ACM Symposium on Theory of Computing (STOC), 9-11 June 2003, San Diego, California, USA
Batu, Tugkan and
Dasgupta, Sanjoy and
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, New York, USA, 678-687. ISBN 1581134959
Batu, Tugkan and
Fischer, E. and
Fortnow, L. and
Kumar, R. and
Rubinfeld, R. and
White, P.
(2001)
Testing random variables for independence and identity
In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (Focs). Foundations of Computer Science. IEEE, New York, USA, 442-451.
Batu, Tugkan and
Fortnow, L. and
Rubinfeld, R. and
Smith, W. D. and
White, P.
(2000)
Testing that distributions are close
In: Proceedings 41st Annual Symposium on Foundations of Computer Science. IEEE, New York, USA, 259-269.