Funda Ergün

2008
29	EE	Funda Ergün, Hossein Jowhari: On distance to monotonicity and longest increasing subsequence of a data stream. SODA 2008: 730-736
2006
28	EE	Tugkan Batu, Funda Ergün, Süleyman Cenk Sahinalp: Oblivious string embeddings and edit distance approximations. SODA 2006: 792-801
2005
27	EE	Petra Berenbrink, Funda Ergün, Tom Friedetzky: Finding Frequent Patterns in a String in Sublinear Time. ESA 2005: 746-757
26	EE	Dan Wang, Funda Ergün: Path Protection with Pre-identification for MPLS Networks. QSHINE 2005: 46
25	EE	Dan Wang, Funda Ergün, Zhan Xu: Unicast and Multicast QoS Routing with Multiple Constraints. QoS-IP 2005: 481-494
24	EE	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)
2004
23	EE	Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp: Sublinear Methods for Detecting Periodic Trends in Data Streams. LATIN 2004: 16-28
22	EE	Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: Fast approximate probabilistically checkable proofs. Inf. Comput. 189(2): 135-159 (2004)
21	EE	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)
2003
20	EE	Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp: Comparing Sequences with Segment Rearrangements. FSTTCS 2003: 183-194
19	EE	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
18	EE	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
2002
17	EE	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
16	EE	Funda Ergün, Rakesh K. Sinha, Lisa Zhang: An improved FPTAS for Restricted Shortest Path. Inf. Process. Lett. 83(5): 287-291 (2002)
2001
15	EE	Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha: Biased Skip Lists for Highly Skewed Access Patterns. ALENEX 2001: 216-230
14	EE	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
13	EE	Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha: Biased dictionaries with fast insert/deletes. STOC 2001: 483-491
12	EE	Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: Checking Approximate Computations of Polynomials and Functional Equations. SIAM J. Comput. 31(2): 550-576 (2001)
2000
11	EE	Funda Ergün, Rakesh K. Sinha, Lisa Zhang: QoS Routing with Performance-Dependent Costs. INFOCOM 2000: 137-146
10		Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan: Spot-Checkers. J. Comput. Syst. Sci. 60(3): 717-751 (2000)
9		Funda Ergün, Ravi Kumar, D. Sivakumar: Self-Testing without the Generator Bottleneck. SIAM J. Comput. 29(5): 1630-1651 (2000)
1999
8	EE	Funda Ergün, Joe Kilian, Ravi Kumar: A Note on the Limits of Collusion-Resistant Watermarks. EUROCRYPT 1999: 140-149
7	EE	Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: Fast Approximate PCPs. STOC 1999: 41-50
1998
6	EE	Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan: Spot-Checkers. STOC 1998: 259-268
1997
5	EE	Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: Learning Distributions from Random Walks. COLT 1997: 243-249
4		Bruno Codenotti, Funda Ergün, Peter Gemmell, Ravi Kumar: Checking Properties of Polynomials (Extended Abstract). ICALP 1997: 203-213
1996
3		Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: Approximate Checking of Polynomials and Functional Equations (extended abstract). FOCS 1996: 592-601
1995
2	EE	Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: On Learning Bounded-Width Branching Programs. COLT 1995: 361-368
1	EE	Funda Ergün: Testing multivariate linear functions: overcoming the generator bottleneck. STOC 1995: 407-416

Coauthor Index

1	Tugkan Batu	[18] [28]
2	Petra Berenbrink	[17] [21] [27]
3	Bruno Codenotti	[4]
4	Artur Czumaj	[19] [24]
5	Evan E. Eichler	[17] [21]
6	Lance Fortnow	[19] [24]
7	Tom Friedetzky	[17] [21] [27]
8	Peter Gemmell	[4]
9	Paul W. Goldberg	[17] [21]
10	Hossein Jowhari	[29]
11	Sampath Kannan	[6] [10]
12	Joe Kilian	[8] [18]
13	Ravi Kumar (S. Ravi Kumar)	[2] [3] [4] [5] [6] [7] [8] [9] [10] [12] [22]
14	Avner Magen	[18] [19] [24]
15	Suvo Mittra	[14]
16	S. Muthukrishnan (S. Muthu Muthukrishnan)	[20] [23]
17	Ilan Newman	[19] [24]
18	Sofya Raskhodnikova	[18]
19	Ronitt Rubinfeld	[2] [3] [5] [6] [7] [10] [12] [18] [19] [22] [24]
20	Süleyman Cenk Sahinalp	[13] [14] [15] [17] [20] [21] [23] [28]
21	Rahul Sami	[18]
22	Jonathan Sharp	[13] [14] [15]
23	Rakesh K. Sinha	[11] [13] [14] [15] [16]
24	D. Sivakumar	[9]
25	Christian Sohler	[19] [24]
26	Mahesh Viswanathan	[6] [10]
27	Dan Wang	[25] [26]
28	Zhan Xu	[25]
29	Lisa Zhang	[11] [16]

Colors in the list of coauthors