Spot-Checkers F Ergun, S Kannan, SR Kumar, R Rubinfeld Journal of Computer and System Sciences 60 (3), 717-751, 2000 | 295 | 2000 |

A note on the limits of collusion-resistant watermarks F Ergun, J Kilian, R Kumar Advances in Cryptology—EUROCRYPT’99: International Conference on the Theory …, 1999 | 156 | 1999 |

An improved FPTAS for restricted shortest path F Ergun, R Sinha, L Zhang Information Processing Letters 83 (5), 287-291, 2002 | 144 | 2002 |

Oblivious string embeddings and edit distance approximations T Batu, F Ergun, C Sahinalp SODA 6 (197), 792-801, 2006 | 116 | 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 | 112 | 2003 |

QoS routing with performance-dependent costs F Ergun, R Sinha, L Zhang Proceedings IEEE INFOCOM 2000. Conference on Computer Communications …, 2000 | 87 | 2000 |

Online load balancing for mapreduce with skewed data input Y Le, J Liu, F Ergün, D Wang IEEE INFOCOM 2014-IEEE Conference on Computer Communications, 2004-2012, 2014 | 70 | 2014 |

A dynamic lookup scheme for bursty access patterns F Ergun, S Mittra, SC Sahinalp, J Sharp, RK Sinha Proceedings IEEE INFOCOM 2001. Conference on Computer Communications …, 2001 | 55 | 2001 |

Approximating the weight of the euclidean minimum spanning tree in sublinear time A Czumaj, F Ergün, L Fortnow, A Magen, I Newman, R Rubinfeld, ... SIAM Journal on Computing 35 (1), 91-109, 2005 | 54 | 2005 |

Periodicity in streams F Ergun, H Jowhari, M Sağlam Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010 | 45 | 2010 |

On distance to monotonicity and longest increasing subsequence of a data stream F Ergun, H Jowhari Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008 | 45 | 2008 |

Comparing sequences with segment rearrangements F Ergun, S Muthukrishnan, SC Sahinalp FSTTCS, 183-194, 2003 | 44 | 2003 |

Fast approximate probabilistically checkable proofs F Ergün, R Kumar, R Rubinfeld Information and Computation 189 (2), 135-159, 2004 | 38 | 2004 |

Sublinear-time approximation of Euclidean minimum spanning tree. A Czumaj, F Ergün, L Fortnow, A Magen, I Newman, R Rubinfeld, ... SODA, 813-822, 2003 | 38 | 2003 |

Fast approximate pcps F Ergün, R Kumar, R Rubinfeld Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 37 | 1999 |

On learning bounded-width branching programs F Ergün, SR Kumar, R Rubinfeld Proceedings of the eighth annual conference on Computational learning theory …, 1995 | 34 | 1995 |

Approximate checking of polynomials and functional equations F Ergun, SR Kumar, R Rubinfeld Proceedings of 37th Conference on Foundations of Computer Science, 592-601, 1996 | 33 | 1996 |

Biased dictionaries with fast insert/deletes F Ergun, SC Sahinalp, J Sharp, R Sinha Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 24 | 2001 |

Network design for tolerating multiple link failures using Fast Re-route (FRR) RK Sinha, F Ergun, KN Oikonomou, KK Ramakrishnan 2014 10th International Conference on the Design of Reliable Communication …, 2014 | 23 | 2014 |

Sublinear methods for detecting periodic trends in data streams F Ergun, S Muthukrishnan, SC Sahinalp LATIN 2004: Theoretical Informatics: 6th Latin American Symposium, Buenos …, 2004 | 22 | 2004 |