Tuğkan Batu

ScholarGPS® ID: 46665761987678

Affiliation

London School of Economics and Political Science, London, United Kingdom

Affiliation History

Field

Physical Sciences and Mathematics

Discipline

Mathematics

Metrics Summary

Publication Count

Predicted Citations

964

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Generalized Uniformity Testing (conference) Batu, Tugkan \| Canonne, Clement L. 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (2017) Berkeley, CA 10.1109/FOCS.2017.86 Cited by (7) \| Cite \| Source \| Open Access
Competitive Portfolio Selection Using Stochastic Predictions (book chapter) In Algorithmic Learning Theory Batu, Tuğkan \| Taptagaporn, Pongphat Springer International Publishing (2016) 10.1007/978-3-319-46379-7_20 Cite \| Source \| Open Access
Testing Closeness of Discrete Distributions (journal article) Batu, Tuğkan \| Fortnow, Lance \| Rubinfeld, Ronitt \| Smith, Warren D. \| White, Patrick Journal of the ACM, volume 60, issue 1, pages 1-25 (2013). 10.1145/2432622.2432626 Cited by (72) \| Cite \| Source \| Open Access
Chains-into-bins processes (journal article) Batu, Tuğkan \| Berenbrink, Petra \| Cooper, Colin Journal of Discrete Algorithms, volume 14 (2012). 10.1016/j.jda.2011.12.006 Cite \| Source \| Open Access
Chains-into-Bins Processes (book chapter) In Combinatorial Algorithms Batu, Tuğkan \| Berenbrink, Petra \| Cooper, Colin Springer Berlin Heidelberg (2011) 10.1007/978-3-642-19222-7_32 Cite \| Source \| Open Access
A sublinear-time approximation scheme for bin packing (journal article) Batu, Tuğkan \| Berenbrink, Petra \| Sohler, Christian Theoretical Computer Science, volume 410, issue 47-49, pages 5082-5092 (2009). 10.1016/j.tcs.2009.08.006 Cited by (10) \| Cite \| Source \| Open Access
Oblivious string embeddings and edit distance approximations (conference) Batu, Tuğkan \| Ergun, Funda \| Sahinalp, Cenk the seventeenth annual ACM-SIAM symposium (2006) Miami, Florida 10.1145/1109557.1109644 Cited by (53) \| Cite \| Source \| Open Access
The Complexity of Approximating the Entropy (journal article) Batu, Tugkan \| Dasgupta, Sanjoy \| Kumar, Ravi \| Rubinfeld, Ronitt SIAM Journal on Computing, volume 35, issue 1, pages 132-150 (2005). 10.1137/S0097539702403645 Cited by (62) \| Cite \| Source \| Open Access
Locally Consistent Parsing and Applications to Approximate String Comparisons (book chapter) In Developments in Language Theory Batu, Tuğkan \| Sahinalp, S. Cenk Springer Berlin Heidelberg (2005) 10.1007/11505877_3 Cited by (2) \| Cite \| Source \| Open Access
Fast approximate PCPs for multidimensional bin-packing problems (journal article) Batu, Tuğkan \| Rubinfeld, Ronitt \| White, Patrick Information and Computation, volume 196, issue 1, pages 42-56 (2005). 10.1016/j.ic.2004.10.001 Cited by (34) \| Cite \| Source \| Open Access
Sublinear algorithms for testing monotone and unimodal distributions (conference) Batu, Tugkan \| Kumar, Ravi \| Rubinfeld, Ronitt STOC04: Symposium of Theory of Computing 2004 (2004) Chicago IL USA 10.1145/1007352.1007414 Cited by (53) \| Cite \| Source \| Open Access
Inferring Mixtures of Markov Chains (book chapter) In Learning Theory Batu, Tuğkan \| Guha, Sudipto \| Kannan, Sampath Springer Berlin Heidelberg (2004) 10.1007/978-3-540-27819-1_13 Cited by (20) \| Cite \| Source \| Open Access
A sublinear algorithm for weakly approximating edit distance (conference) Batu, Tugkan \| Ergün, Funda \| Kilian, Joe \| Magen, Avner \| Raskhodnikova, Sofya \| Rubinfeld, Ronitt \| Sami, Rahul STOC03: The 35th Annual ACM Symposium on Theory of Computing (2003) San Diego CA USA 10.1145/780542.780590 Cited by (55) \| Cite \| Source \| Open Access
A sublinear algorithm for weakly approximating edit distance (conference) Batu, Tugkan \| Ergün, Funda \| Kilian, Joe \| Magen, Avner \| Raskhodnikova, Sofya \| Rubinfeld, Ronitt \| Sami, Rahul the thirty-fifth ACM symposium (2003) San Diego, CA, USA 10.1145/780587.780590 Cited by (6) \| Cite \| Source \| Open Access
The complexity of approximating entropy (conference) Batu, Tuǧkan \| Dasgupta, Sanjoy \| Kumar, Ravi \| Rubinfeld, Ronitt STOC02: Symposium on the Theory of Computing (2002) Montreal Quebec Canada 10.1145/509907.510005 Cited by (41) \| Cite \| Source \| Open Access
The complexity of approximating the entropy (conference) Batu, T. \| Dasgupta, S. \| Kumar, R. \| Rubinfeld, R. 17th IEEE Annual Conference on Computational Complexity (2002) Montreal, Que., Canada 10.1109/CCC.2002.1004329 Cited by (10) \| Cite \| Source \| Open Access
The complexity of approximating entropy (conference) Batu, Tuǧkan \| Dasgupta, Sanjoy \| Kumar, Ravi \| Rubinfeld, Ronitt the thiry-fourth annual ACM symposium (2002) Montreal, Quebec, Canada 10.1145/510002.510005 Cited by (2) \| Cite \| Source \| Open Access
Testing random variables for independence and identity (conference) Batu, T. \| Fischer, E. \| Fortnow, L. \| Kumar, R. \| Rubinfeld, R. \| White, P. Proceedings 42nd IEEE Symposium on Foundations of Computer Science (2001) Newport Beach, CA, USA 10.1109/SFCS.2001.959920 Cited by (96) \| Cite \| Source \| Open Access
Testing that distributions are close (conference) Batu, T. \| Fortnow, L. \| Rubinfeld, R. \| Smith, W.D. \| White, P. 41st Annual Symposium on Foundations of Computer Science (2000) Redondo Beach, CA, USA 10.1109/SFCS.2000.892113 Cited by (125) \| Cite \| Source \| Open Access
Fast Approximate PCPs for Multidimensional Bin-Packing Problems (book chapter) In Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques Batu, Tuğkan \| Rubinfeld, Ronitt \| White, Patrick Springer Berlin Heidelberg (1999) 10.1007/978-3-540-48413-4_25 Cited by (17) \| Cite \| Source \| Open Access