2006 |
13 | EE | Tugkan Batu,
Funda Ergün,
Süleyman Cenk Sahinalp:
Oblivious string embeddings and edit distance approximations.
SODA 2006: 792-801 |
2005 |
12 | EE | Tugkan Batu,
Süleyman Cenk Sahinalp:
Locally Consistent Parsing and Applications to Approximate String Comparisons.
Developments in Language Theory 2005: 22-35 |
11 | EE | Tugkan Batu,
Ronitt Rubinfeld,
Patrick White:
Fast approximate PCPs for multidimensional bin-packing problems.
Inf. Comput. 196(1): 42-56 (2005) |
10 | EE | Tugkan Batu,
Sanjoy Dasgupta,
Ravi Kumar,
Ronitt Rubinfeld:
The Complexity of Approximating the Entropy.
SIAM J. Comput. 35(1): 132-150 (2005) |
2004 |
9 | EE | Tugkan Batu,
Sudipto Guha,
Sampath Kannan:
Inferring Mixtures of Markov Chains.
COLT 2004: 186-199 |
8 | EE | Tugkan Batu,
Sampath Kannan,
Sanjeev Khanna,
Andrew McGregor:
Reconstructing strings from random traces.
SODA 2004: 910-918 |
7 | EE | Tugkan Batu,
Ravi Kumar,
Ronitt Rubinfeld:
Sublinear algorithms for testing monotone and unimodal distributions.
STOC 2004: 381-390 |
2003 |
6 | EE | Tugkan Batu,
Funda Ergün,
Joe Kilian,
Avner Magen,
Sofya Raskhodnikova,
Ronitt Rubinfeld,
Rahul Sami:
A sublinear algorithm for weakly approximating edit distance.
STOC 2003: 316-324 |
2002 |
5 | EE | Tugkan Batu,
Sanjoy Dasgupta,
Ravi Kumar,
Ronitt Rubinfeld:
The Complexity of Approximating the Entropy.
IEEE Conference on Computational Complexity 2002: 17 |
4 | EE | Tugkan Batu,
Sanjoy Dasgupta,
Ravi Kumar,
Ronitt Rubinfeld:
The complexity of approximating entropy.
STOC 2002: 678-687 |
2001 |
3 | | Tugkan Batu,
Lance Fortnow,
Eldar Fischer,
Ravi Kumar,
Ronitt Rubinfeld,
Patrick White:
Testing Random Variables for Independence and Identity.
FOCS 2001: 442-451 |
2000 |
2 | | Tugkan Batu,
Lance Fortnow,
Ronitt Rubinfeld,
Warren D. Smith,
Patrick White:
Testing that distributions are close.
FOCS 2000: 259-269 |
1999 |
1 | | Tugkan Batu,
Ronitt Rubinfeld,
Patrick White:
Fast Approximate PCPs for Multidimensional Bin-Packing Problems.
RANDOM-APPROX 1999: 245-256 |