| Spot-Checkers F Ergun, S Kannan, SR Kumar, R Rubinfeld Journal of Computer and System Sciences 60 (3), 717-751, 2000 | 309 | 2000 |
| An improved FPTAS for restricted shortest path F Ergun, R Sinha, L Zhang Information Processing Letters 83 (5), 287-291, 2002 | 152 | 2002 |
| 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 | 151 | 1999 |
| Oblivious string embeddings and edit distance approximations T Batu, F Ergun, C Sahinalp SODA 6 (197), 792-801, 2006 | 125 | 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 | 122 | 2003 |
| QoS routing with performance-dependent costs F Ergun, R Sinha, L Zhang Proceedings IEEE INFOCOM 2000. Conference on Computer Communications …, 2000 | 84 | 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 | 71 | 2014 |
| 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 | 63 | 2005 |
| 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 | 54 | 2001 |
| 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 | 47 | 2008 |
| Periodicity in streams F Ergun, H Jowhari, M Sağlam International Workshop on Randomization and Approximation Techniques in …, 2010 | 46 | 2010 |
| Fast approximate probabilistically checkable proofs F Ergün, R Kumar, R Rubinfeld Information and Computation 189 (2), 135-159, 2004 | 46 | 2004 |
| Comparing sequences with segment rearrangements F Ergun, S Muthukrishnan, SC Sahinalp International Conference on Foundations of Software Technology and …, 2003 | 44 | 2003 |
| 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 | 39 | 2003 |
| On learning bounded-width branching programs F Ergün, SR Kumar, R Rubinfeld Proceedings of the eighth annual conference on Computational learning theory …, 1995 | 39 | 1995 |
| Fast approximate pcps F Ergün, R Kumar, R Rubinfeld Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 36 | 1999 |
| 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 | 34 | 1996 |
| 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 | 25 | 2014 |
| Biased skip lists for highly skewed access patterns F Ergun, S Cenk Şahinalp, J Sharp, RK Sinha Algorithm Engineering and Experimentation: Third International Workshop …, 2001 | 25 | 2001 |
| 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 | 23 | 2001 |
