The SCEAS System
| |||||||

## Search the dblp DataBase
Tugkan Batu:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld
**The Complexity of Approximating the Entropy.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:17- [Conf] - Tugkan Batu, Sudipto Guha, Sampath Kannan
**Inferring Mixtures of Markov Chains.**[Citation Graph (0, 0)][DBLP] COLT, 2004, pp:186-199 [Conf] - Tugkan Batu, Süleyman Cenk Sahinalp
**Locally Consistent Parsing and Applications to Approximate String Comparisons.**[Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2005, pp:22-35 [Conf] - Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White
**Testing Random Variables for Independence and Identity.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:442-451 [Conf] - Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White
**Testing that distributions are close.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:259-269 [Conf] - Tugkan Batu, Ronitt Rubinfeld, Patrick White
**Fast Approximate PCPs for Multidimensional Bin-Packing Problems.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 1999, pp:245-256 [Conf] - Tugkan Batu, Funda Ergün, Süleyman Cenk Sahinalp
**Oblivious string embeddings and edit distance approximations.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:792-801 [Conf] - Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andrew McGregor
**Reconstructing strings from random traces.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:910-918 [Conf] - Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami
**A sublinear algorithm for weakly approximating edit distance.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:316-324 [Conf] - Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
**Sublinear algorithms for testing monotone and unimodal distributions.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:381-390 [Conf] - Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld
**The complexity of approximating entropy.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:678-687 [Conf] - Tugkan Batu, Ronitt Rubinfeld, Patrick White
**Fast approximate PCPs for multidimensional bin-packing problems.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2005, v:196, n:1, pp:42-56 [Journal] - Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld
**The Complexity of Approximating the Entropy.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:35, n:1, pp:132-150 [Journal] **Chains-into-Bins Processes**[Citation Graph (, )][DBLP]
Search in 0.123secs, Finished in 0.124secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |