![]() | 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, Berenbrink, Petra and Cooper, Colin
(2012)
Chains-into-bins processes.
Journal of Discrete Algorithms, 14.
pp. 21-28.
ISSN 1570-8667
Batu, Tugkan ORCID: 0000-0003-3914-4645, Berenbrink, Petra and Sohler, Christian
(2009)
A sublinear-time approximation scheme for bin packing.
Theoretical Computer Science, 410 (47-49).
pp. 5082-5092.
ISSN 0304-3975
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, Trehan, Amitabh and Trehan, Chhaya
ORCID: 0000-0002-3249-3212
(2024)
All you need are random walks: fast and simple distributed conductance testing.
In: Emek, Yuval, (ed.)
Structural Information and Communication Complexity: 31st International Colloquium, SIROCCO 2024, Vietri sul Mare, Italy, May 27–29, 2024, Proceedings.
Lecture Notes in Computer Science.
Springer, Cham, CH, 64 - 82.
ISBN 9783031606021
Batu, Tugkan ORCID: 0000-0003-3914-4645 and Canonne, Clément L.
(2017)
Generalized uniformity testing.
In:
Proceedings of the Annual Symposium on Foundations of Computer Science.
IEEE Computer Society, Washington, USA, pp. 880-889.
ISBN 9781538634646
Batu, Tugkan ORCID: 0000-0003-3914-4645 and Taptagaporn, Pongphat
(2016)
Competitive portfolio selection using stochastic predictions.
In:
Lecture Notes in Artificial Intelligence.
Lecture Notes in Computer Science.
Springer Berlin / Heidelberg, Cham, Switzerland, pp. 288-302.
ISBN 9783319463797
Batu, Tugkan ORCID: 0000-0003-3914-4645, 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 Berlin / Heidelberg, pp. 314-325.
ISBN 9783642192210
Batu, Tugkan ORCID: 0000-0003-3914-4645, Ergun, Funda and Cenk, Sahinalp
(2006)
Oblivious string embeddings and edit distance approximations.
In:
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm.
ACM Press, New York, US, pp. 792-801.
ISBN 9780898716054
Batu, Tugkan ORCID: 0000-0003-3914-4645 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 Berlin / Heidelberg, Berlin, pp. 22-35.
ISBN 3540265465
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, Fischer, E., Fortnow, L., Kumar, R., 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, pp. 442-451.
Batu, Tugkan ORCID: 0000-0003-3914-4645, Fortnow, L., Rubinfeld, R., 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, pp. 259-269.
Batu, Tugkan ORCID: 0000-0003-3914-4645, Berenbrink, Petra and Cooper, Colin
(2010)
Chains-into-bins processes.
.
arXiv.org.
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, Berenbrink, Petra and Sohler, Christian
(2007)
A sublinear-time approximation scheme for bin packing.
CDAM Research Reports (LSE-CDAM-2007-33).
London School of Economics and Political Science, London, UK.
Batu, Tugkan ORCID: 0000-0003-3914-4645, Berenbrink, Petra and Cooper, Colin
(2007)
Balanced allocations: balls-into-bins revisited and chains-into-bins.
LSE-CDAM-2007-34.
London School of Economics and Political Science, London, UK.
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.
Batu, Tugkan ORCID: 0000-0003-3914-4645, Kannan, Sampath, Khanna, Sanjeev and McGregor, Andrew
(2004)
Reconstructing strings from random traces.
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004-01-11 - 2004-01-13, New Orleans, United States, USA.
Batu, Tugkan ORCID: 0000-0003-3914-4645, Ergun, Funda, Kilian, Joe, Magen, Avner, Raskhodnikova, Sofya, Rubinfeld, Robin and Sami, Rahul
(2003)
A sublinear algorithm for weakly approximating edit distance.
In: 35th ACM Symposium on Theory of Computing (STOC), 2003-06-09 - 2003-06-11, California, United States, USA.
(Submitted)
Batu, Tugkan ORCID: 0000-0003-3914-4645, Guha, Sudipto and Kannan, Sampath
(2004)
Inferring mixtures of Markov chains.
Lecture Notes in Computer Science.
, 3120/2
Springer Berlin / Heidelberg.
ISBN 9783540222828