Follow
Funda Ergun
Funda Ergun
Other namesAyse Funda Ergun, A. Funda Ergun
Professor of Computer Science, Indiana University
Verified email at iu.edu
Title
Cited by
Cited by
Year
Spot-Checkers
F Ergun, S Kannan, SR Kumar, R Rubinfeld
Journal of Computer and System Sciences 60 (3), 717-751, 2000
3032000
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
1511999
An improved FPTAS for restricted shortest path
F Ergun, R Sinha, L Zhang
Information Processing Letters 83 (5), 287-291, 2002
1482002
Oblivious string embeddings and edit distance approximations
T Batu, F Ergun, C Sahinalp
SODA 6 (197), 792-801, 2006
1212006
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
1202003
QoS routing with performance-dependent costs
F Ergun, R Sinha, L Zhang
Proceedings IEEE INFOCOM 2000. Conference on Computer Communications …, 2000
872000
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
712014
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
592005
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
552001
Periodicity in streams
F Ergun, H Jowhari, M Sağlam
International Workshop on Randomization and Approximation Techniques in …, 2010
472010
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
462008
Comparing sequences with segment rearrangements
F Ergun, S Muthukrishnan, SC Sahinalp
International Conference on Foundations of Software Technology and …, 2003
422003
Fast approximate probabilistically checkable proofs
F Ergün, R Kumar, R Rubinfeld
Information and Computation 189 (2), 135-159, 2004
392004
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
392003
Fast approximate pcps
F Ergün, R Kumar, R Rubinfeld
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
361999
On learning bounded-width branching programs
F Ergün, SR Kumar, R Rubinfeld
Proceedings of the eighth annual conference on Computational learning theory …, 1995
361995
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
341996
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
242001
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
232014
Sublinear methods for detecting periodic trends in data streams
F Ergun, S Muthukrishnan, SC Sahinalp
Latin American Symposium on Theoretical Informatics, 16-28, 2004
222004
The system can't perform the operation now. Try again later.
Articles 1–20