Tugkan Batu, Ph.D.
Affiliations: | 2001 | Cornell University, Ithaca, NY, United States |
Area:
Computer Science, StatisticsGoogle:
"Tugkan Batu"Parents
Sign in to add mentor| Ronitt Rubinfeld | grad student | 2001 | Cornell | |
| (Testing properties of distributions.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Batu T, Fortnow L, Rubinfeld R, et al. (2013) Testing closeness of discrete distributions Journal of the Acm. 60 |
| Batu T, Berenbrink P, Cooper C. (2012) Chains-into-bins processes Journal of Discrete Algorithms. 14: 21-28 |
| Batu T, Berenbrink P, Sohler C. (2009) A sublinear-time approximation scheme for bin packing Theoretical Computer Science. 410: 5082-5092 |
| Batu T, Ergun F, Sahinalp C. (2006) Oblivious string embeddings and edit distance approximations Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 792-801 |
| Batu T, Dasgupta S, Kumar R, et al. (2006) The complexity of approximating the entropy Siam Journal On Computing. 35: 132-150 |
| Batu T, Rubinfeld R, White P. (2005) Fast approximate PCPs for multidimensional bin-packing problems Information and Computation. 196: 42-56 |
| Batu T, Kumar R, Rubinfeld R. (2004) Sublinear algorithms for testing monotone and unimodal distributions Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 381-390 |
| Batu T, Kannan S, Khanna S, et al. (2004) Reconstructing Strings from Random Traces Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 903-911 |
| Batu T, Ergün F, Kilian J, et al. (2003) A sublinear algorithm for weakly approximating edit distance Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 316-324 |
| Batu T, Dasgupta S, Kumar R, et al. (2002) The complexity of approximating entropy Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 678-687 |