Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Tuğkan Batu
Observed names:
Batu, Tugkan,
T. Batu,
Tugkan Batu,
Tuǧkan Batu
Institution:
London School of Economics and Political Science
Observed institutions:
NEC (Japan),
Simon Fraser University,
Cornell University,
University of Pennsylvania,
The University of Texas at Austin,
London School of Economics and Political Science
show all 6
ORCID:
0000-0003-3914-4645
Observed ORCID:
0000-0003-3914-4645
OpenAlex ID:
A5074019785
Testing that distributions are close
2002
·
T. Batu
, L. Fortnow
, et al.
·
Annual Symposium on Foundations of Computer Science
·
320
Testing random variables for independence and identity
2001
·
T. Batu
, E. Fischer
, et al.
·
Annual Symposium on Foundations of Computer Science
·
259
Testing Closeness of Discrete Distributions
2013
·
Tuğkan Batu
, Lance Fortnow
, et al.
·
Journal of the ACM
·
196
PDF
Sublinear algorithms for testing monotone and unimodal distributions
2004
·
Tugkan Batu
, Ravi Kumar
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
149
Reconstructing Strings from Random Traces
2004
·
Tugkan Batu
, Sampath Kannan
, et al.
·
London School of Economics and Political Science Research Online (London School of Economics and Political Science)
·
139
The Complexity of Approximating the Entropy
2005
·
Tugkan Batu
, Sanjoy Dasgupta
, et al.
·
SIAM Journal on Computing
·
133
A sublinear algorithm for weakly approximating edit distance
2003
·
Tugkan Batu
, Funda Ergün
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
108
Oblivious string embeddings and edit distance approximations
2006
·
Tuğkan Batu
, Funda Ergun
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
107
Oblivious string embeddings and edit distance approximations
2006
·
Tuğkan Batu
, Funda Ergün
, et al.
·
Symposium on Discrete Algorithms
·
72
The complexity of approximating entropy
2002
·
Tuǧkan Batu
, Sanjoy Dasgupta
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
51
Fast approximate PCPs for multidimensional bin-packing problems
2004
·
Tuğkan Batu
, Ronitt Rubinfeld
, et al.
·
Information and Computation
·
43
Generalized Uniformity Testing
2017
·
Tugkan Batu
, Clement L. Canonne
·
Annual Symposium on Foundations of Computer Science
·
41
PDF
Testing properties of distributions
2001
·
Ronitt Rubinfeld
, Tuğkan Batu
·
40
Inferring Mixtures of Markov Chains
2004
·
Tuğkan Batu
, Sudipto Guha
, et al.
·
Lecture notes in computer science
·
34
Fast Approximate PCPs for Multidimensional Bin-Packing Problems
1999
·
Tuğkan Batu
, Ronitt Rubinfeld
, et al.
·
Lecture notes in computer science
·
25
The complexity of approximating the entropy
2003
·
T. Batu
, S. Dasgupta
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
24
A sublinear-time approximation scheme for bin packing
2009
·
Tuğkan Batu
, Petra Berenbrink
, et al.
·
Theoretical Computer Science
·
15
PDF
The complexity of approximating entropy
2002
·
Tuǧkan Batu
, Sanjoy Dasgupta
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
11
Locally Consistent Parsing and Applications to Approximate String Comparisons
2005
·
Tuğkan Batu
, S. Cenk Sahinalp
·
Lecture notes in computer science
·
8
Balanced allocations: balls-into-bins revisited and chains-into-bins
2007
·
Tuğkan Batu
, Petra Berenbrink
, et al.
·
5
All You Need are Random Walks: Fast and Simple Distributed Conductance Testing
2024
·
Tuğkan Batu
, Amitabh Trehan
, et al.
·
Lecture notes in computer science
·
4
Chains-into-bins processes
2011
·
Tuğkan Batu
, Petra Berenbrink
, et al.
·
Journal of Discrete Algorithms
·
4
PDF
GenCore: Genomic distance estimation using Locally Consistent Parsing
2026
·
Akmuhammet Ashyralyyev
, Ege Sirvan
, et al.
·
bioRxiv (Cold Spring Harbor Laboratory)
·
3
PDF
A Distributed Conductance Tester Without Global Information Collection
2023
·
Batu, Tugkan
, Trehan, Amitabh
, et al.
·
arXiv (Cornell University)
·
2
PDF
A Continuous Paradoxical Colouring Rule Using Group Action
2021
·
Batu, Tugkan
, Simon, Robert Samuel
, et al.
·
arXiv (Cornell University)
·
2
PDF
Show more works
View as search
Works count:
30
Citation count:
1,880
H-index:
17
I10-index:
19
Year
Topic
Type