Batu, Tugkan
Dr Tugkan Batu
|
|
|
|
|
Experience keywords:
algorithms on massive data sets; string algorithms; property testing; algorithmic statistics; randomised computation; algorithms; theory of computation
|
|
Dr Batu is interested in algorithms and the theory of computation in general. In particular, he is interested in randomised computation, (sublinear) algorithms on massive data sets, property testing, and statistical testing.
|
|
|
|
|
Languages: Turkish [Spoken: Fluent, Written: Fluent]
|
|
|
|
|
|
|
|
The following references are sourced from LSE Research Online|. References that are linked lead to the full text.
Batu, Tugkan and Fortnow, Lance and Rubinfeld, Ronitt and Smith, Warren D. and White, Patrick (2013) Testing closeness of discrete distributions. Journal of the ACM, 60 (1). ISSN 0004-5411 Batu, Tugkan and Berenbrink, Petra and Cooper, Colin (2012) Chains-into-bins processes. Journal of discrete algorithms, 14 pp. 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. Springer, pp. 314-325. ISSN 0302-9743 Batu, Tugkan and Berenbrink, Petra and Cooper, Colin (2010) Chains-into-bins processes. arXiv.org Batu, Tugkan and Fortnow, Lance and Rubinfeld, Ronitt and Smith, Warren D. and White, Patrick (2010) Testing closeness of discrete distributions. arXiv.org Batu, Tugkan and Berenbrink, Petra and Cooper, Colin (2007) Balanced allocations: balls-into-bins revisited and chains-into-bins. London School of Economics and Political Science, London, UK Batu, Tugkan and Berenbrink, Petra and Sohler, Christian (2007) A sublinear-time approximation scheme for bin packing. London School of Economics and Political Science, London, UK Batu, Tugkan and 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 and Dasgupta, Sanjoy and 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 and 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 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. Springer-Verlag Berlin and Heidelberg, Berlin, pp. 22-35. ISBN 3540265465 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 Guha, Sudipto and Kannan, Sampath (2004) Inferring mixtures of Markov chains. Springer Berlin / Heidelberg. ISBN 9783540222828 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, pp. 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). IEEE, New York, USA, pp. 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, pp. 259-269. Batu, Tugkan and 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
LSE Research Online is the primary resource for references to publications. For queries or updates please email the LSE Research Online team at lseresearchonline@lse.ac.uk|.
|
|
|
|
Browse the Experts Directory:
|
Collection of LSE research outputs
Service providing unique access
to LSE's expertise
[access restricted to staff]
Short articles about LSE research
|