Testing that distributions are close T Batu, L Fortnow, R Rubinfeld, WD Smith, P White Proceedings 41st Annual Symposium on Foundations of Computer Science, 259-269, 2000 | 351 | 2000 |

Testing random variables for independence and identity T Batu, E Fischer, L Fortnow, R Kumar, R Rubinfeld, P White Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 442-451, 2001 | 256 | 2001 |

The complexity of approximating entropy T Batu, S Dasgupta, R Kumar, R Rubinfeld Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 208 | 2002 |

Testing closeness of discrete distributions T Batu, L Fortnow, R Rubinfeld, WD Smith, P White Journal of the ACM (JACM) 60 (1), 1-25, 2013 | 192 | 2013 |

Reconstructing strings from random traces T Batu, S Kannan, S Khanna, A McGregor SODA 4, 910-918, 2004 | 166 | 2004 |

Sublinear algorithms for testing monotone and unimodal distributions T Batu, R Kumar, R Rubinfeld Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 139 | 2004 |

Oblivious string embeddings and edit distance approximations T Batu, F Ergun, C Sahinalp SODA 6 (197), 792-801, 2006 | 123 | 2006 |

A sublinear algorithm for weakly approximating edit distance T Batu, F Ergün, J Kilian, A Magen, S Raskhodnikova, R Rubinfeld, ... Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 119 | 2003 |

Fast approximate PCPs for multidimensional bin-packing problems T Batu, R Rubinfeld, P White Information and Computation 196 (1), 42-56, 2005 | 48 | 2005 |

Testing properties of distributions T Batu Cornell University, 2001 | 40 | 2001 |

Fast approximate PCPs for multidimensional bin-packing problems T Batu, R Rubinfeld, P White International Workshop on Randomization and Approximation Techniques in …, 1999 | 37 | 1999 |

Generalized uniformity testing T Batu, CL Canonne 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 36 | 2017 |

Inferring mixtures of Markov chains T Batu, S Guha, S Kannan Learning Theory: 17th Annual Conference on Learning Theory, COLT 2004, Banff …, 2004 | 36 | 2004 |

A sublinear-time approximation scheme for bin packing T Batu, P Berenbrink, C Sohler Theoretical computer science 410 (47-49), 5082-5092, 2009 | 12 | 2009 |

Locally consistent parsing and applications to approximate string comparisons T Batu, SC Sahinalp International Conference on Developments in Language Theory, 22-35, 2005 | 7 | 2005 |

Chains-into-bins processes T Batu, P Berenbrink, C Cooper Journal of Discrete Algorithms 14, 21-28, 2012 | 6 | 2012 |

Balanced allocations: Balls-into-bins revisited and chains-into-bins T Batu, P Berenbrink, C Cooper CDAM Research Report LSE-CDAM-2007-34, 2007 | 4 | 2007 |

A Distributed Conductance Tester Without Global Information Collection T Batu, A Trehan, C Trehan arXiv preprint arXiv:2305.14178, 2023 | 1 | 2023 |

Competitive portfolio selection using stochastic predictions T Batu, P Taptagaporn International Conference on Algorithmic Learning Theory, 288-302, 2016 | 1 | 2016 |

Runtime Verification of Remotely Executed Code using Probabilistically Checkable Proof Systems T Batu, R Rubinfeld, P White Proc. FLoC Workshop on Run-Time Result Verification, 1999, 1999 | 1 | 1999 |