Funda Ergün

Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp: Periodicity testing with sublinear samples and space. ACM Transactions on Algorithms 6(2) (2010)

Funda Ergün, Hossein Jowhari, Mert Saglam: Periodicity in Streams. APPROX-RANDOM 2010: 545-559

Funda Ergün, Hossein Jowhari: On distance to monotonicity and longest increasing subsequence of a data stream. SODA 2008: 730-736

Tugkan Batu, Funda Ergün, Süleyman Cenk Sahinalp: Oblivious string embeddings and edit distance approximations. SODA 2006: 792-801

Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler: Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM J. Comput. 35(1): 91-109 (2005)

Petra Berenbrink, Funda Ergün, Tom Friedetzky: Finding Frequent Patterns in a String in Sublinear Time. ESA 2005: 746-757

Dan Wang, Funda Ergün, Zhan Xu: Unicast and Multicast QoS Routing with Multiple Constraints. QoS-IP 2005: 481-494

Dan Wang, Funda Ergün: Path Protection with Pre-identification for MPLS Networks. QSHINE 2005: 46

Dan Wang, Yan Long, Funda Ergün: A layered architecture for delay sensitive sensor networks. SECON 2005: 24-34

Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: Fast approximate probabilistically checkable proofs. Inf. Comput. 189(2): 135-159 (2004)

Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün: Identifying Uniformly Mutated Segments within Repeats. J. Bioinformatics and Computational Biology 2(4): 657-668 (2004)

Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp: Sublinear Methods for Detecting Periodic Trends in Data Streams. LATIN 2004: 16-28

Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp: Comparing Sequences with Segment Rearrangements. FSTTCS 2003: 183-194

Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler: Sublinear-time approximation of Euclidean minimum spanning tree. SODA 2003: 813-822

Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami: A sublinear algorithm for weakly approximating edit distance. STOC 2003: 316-324

Funda Ergün, Rakesh K. Sinha, Lisa Zhang: An improved FPTAS for Restricted Shortest Path. Inf. Process. Lett. 83(5): 287-291 (2002)

Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün: Statistical Identification of Uniformly Mutated Segments within Repeats. CPM 2002: 249-261

Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: Checking Approximate Computations of Polynomials and Functional Equations. SIAM J. Comput. 31(2): 550-576 (2001)

Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha: Biased Skip Lists for Highly Skewed Access Patterns. ALENEX 2001: 216-230

Funda Ergün, Suvo Mittra, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha: A Dynamic Lookup Scheme for Bursty Access Patterns. INFOCOM 2001: 1444-1453

Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha: Biased dictionaries with fast insert/deletes. STOC 2001: 483-491

Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan: Spot-Checkers. J. Comput. Syst. Sci. 60(3): 717-751 (2000)

Funda Ergün, Ravi Kumar, D. Sivakumar: Self-Testing without the Generator Bottleneck. SIAM J. Comput. 29(5): 1630-1651 (2000)

Funda Ergün, Rakesh K. Sinha, Lisa Zhang: QoS Routing with Performance-Dependent Costs. INFOCOM 2000: 137-146

Funda Ergün, Joe Kilian, Ravi Kumar: A Note on the Limits of Collusion-Resistant Watermarks. EUROCRYPT 1999: 140-149

Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: Fast Approximate PCPs. STOC 1999: 41-50

Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan: Spot-Checkers. STOC 1998: 259-268

Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: Learning Distributions from Random Walks. COLT 1997: 243-249

Bruno Codenotti, Funda Ergün, Peter Gemmell, Ravi Kumar: Checking Properties of Polynomials (Extended Abstract). ICALP 1997: 203-213

Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: Approximate Checking of Polynomials and Functional Equations (extended abstract). FOCS 1996: 592-601

Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: On Learning Bounded-Width Branching Programs. COLT 1995: 361-368

Funda Ergün: Testing multivariate linear functions: overcoming the generator bottleneck. STOC 1995: 407-416