Search the dblp DataBase
Funda Ergün: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha
Biased Skip Lists for Highly Skewed Access Patterns. [Citation Graph (0, 0)][DBLP]
ALENEX, 2001, pp:216-230 [Conf] - Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
On Learning Bounded-Width Branching Programs. [Citation Graph (0, 0)][DBLP]
COLT, 1995, pp:361-368 [Conf] - Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
Learning Distributions from Random Walks. [Citation Graph (0, 0)][DBLP]
COLT, 1997, pp:243-249 [Conf] - 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. [Citation Graph (0, 0)][DBLP]
CPM, 2002, pp:249-261 [Conf] - Petra Berenbrink, Funda Ergün, Tom Friedetzky
Finding Frequent Patterns in a String in Sublinear Time. [Citation Graph (0, 0)][DBLP]
ESA, 2005, pp:746-757 [Conf] - Funda Ergün, Joe Kilian, Ravi Kumar
A Note on the Limits of Collusion-Resistant Watermarks. [Citation Graph (0, 0)][DBLP]
EUROCRYPT, 1999, pp:140-149 [Conf] - Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
Approximate Checking of Polynomials and Functional Equations (extended abstract). [Citation Graph (0, 0)][DBLP]
FOCS, 1996, pp:592-601 [Conf] - Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp
Comparing Sequences with Segment Rearrangements. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2003, pp:183-194 [Conf] - Bruno Codenotti, Funda Ergün, Peter Gemmell, Ravi Kumar
Checking Properties of Polynomials (Extended Abstract). [Citation Graph (0, 0)][DBLP]
ICALP, 1997, pp:203-213 [Conf] - Funda Ergün, Suvo Mittra, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha
A Dynamic Lookup Scheme for Bursty Access Patterns. [Citation Graph (0, 0)][DBLP]
INFOCOM, 2001, pp:1444-1453 [Conf] - Funda Ergün, Rakesh K. Sinha, Lisa Zhang
QoS Routing with Performance-Dependent Costs. [Citation Graph (0, 0)][DBLP]
INFOCOM, 2000, pp:137-146 [Conf] - Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp
Sublinear Methods for Detecting Periodic Trends in Data Streams. [Citation Graph (0, 0)][DBLP]
LATIN, 2004, pp:16-28 [Conf] - Dan Wang, Funda Ergün, Zhan Xu
Unicast and Multicast QoS Routing with Multiple Constraints. [Citation Graph (0, 0)][DBLP]
QoS-IP, 2005, pp:481-494 [Conf] - Dan Wang, Funda Ergün
Path Protection with Pre-identification for MPLS Networks. [Citation Graph (0, 0)][DBLP]
QSHINE, 2005, pp:46- [Conf] - Tugkan Batu, Funda Ergün, Süleyman Cenk Sahinalp
Oblivious string embeddings and edit distance approximations. [Citation Graph (0, 0)][DBLP]
SODA, 2006, pp:792-801 [Conf] - Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler
Sublinear-time approximation of Euclidean minimum spanning tree. [Citation Graph (0, 0)][DBLP]
SODA, 2003, pp:813-822 [Conf] - Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami
A sublinear algorithm for weakly approximating edit distance. [Citation Graph (0, 0)][DBLP]
STOC, 2003, pp:316-324 [Conf] - Funda Ergün
Testing multivariate linear functions: overcoming the generator bottleneck. [Citation Graph (0, 0)][DBLP]
STOC, 1995, pp:407-416 [Conf] - Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan
Spot-Checkers. [Citation Graph (0, 0)][DBLP]
STOC, 1998, pp:259-268 [Conf] - Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
Fast Approximate PCPs. [Citation Graph (0, 0)][DBLP]
STOC, 1999, pp:41-50 [Conf] - Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha
Biased dictionaries with fast insert/deletes. [Citation Graph (0, 0)][DBLP]
STOC, 2001, pp:483-491 [Conf] - Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
Fast approximate probabilistically checkable proofs. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2004, v:189, n:2, pp:135-159 [Journal] - Funda Ergün, Rakesh K. Sinha, Lisa Zhang
An improved FPTAS for Restricted Shortest Path. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2002, v:83, n:5, pp:287-291 [Journal] - Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün
Identifying Uniformly Mutated Segments within Repeats. [Citation Graph (0, 0)][DBLP]
J. Bioinformatics and Computational Biology, 2004, v:2, n:4, pp:657-668 [Journal] - Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan
Spot-Checkers. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 2000, v:60, n:3, pp:717-751 [Journal] - 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. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2005, v:35, n:1, pp:91-109 [Journal] - Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
Checking Approximate Computations of Polynomials and Functional Equations. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2001, v:31, n:2, pp:550-576 [Journal] - Funda Ergün, Ravi Kumar, D. Sivakumar
Self-Testing without the Generator Bottleneck. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2000, v:29, n:5, pp:1630-1651 [Journal]
Periodicity in Streams. [Citation Graph (, )][DBLP]
On distance to monotonicity and longest increasing subsequence of a data stream. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002