Funda Ergün

According to our database, Funda Ergün authored at least 40 papers between 1995 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2022

Fast intratumor heterogeneity inference from single-cell sequencing data.

Can Kizilkale, Farid Rashidi Mehrabadi, Erfan Sadeqi Azer, Eva Pérez-Guijarro, Kerrie Marie, Maxwell P. Lee, Chi-Ping Day, Glenn Merlino, Funda Ergün, Aydin Buluç, Süleyman Cenk Sahinalp, Salem Malikic

Nat. Comput. Sci., 2022

2020

Periodicity in Data Streams with Wildcards.

Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou

Theory Comput. Syst., 2020

PhISCS-BnB: a fast branch and bound algorithm for the perfect tumor phylogeny reconstruction problem.

Erfan Sadeqi Azer, Farid Rashidi Mehrabadi, Salem Malikic, Xuan Cindy Li, Osnat Bartok, Kevin Litchfield, Ronen Levy, Yardena Samuels, Alejandro A. Schäffer, E. Michael Gertz, Chi-Ping Day, Eva Pérez-Guijarro, Kerrie Marie, Maxwell P. Lee, Glenn Merlino, Funda Ergün, Süleyman Cenk Sahinalp

Bioinform., 2020

2017

Streaming Periodicity with Mismatches.

Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou

Proceedings of the Approximation, 2017

2015

On the monotonicity of a data stream.

Funda Ergün, Hossein Jowhari

Comb., 2015

On Datacenter-Network-Aware Load Balancing in MapReduce.

Yanfang Le, Feng Wang, Jiangchuan Liu, Funda Ergün

Proceedings of the 8th IEEE International Conference on Cloud Computing, 2015

2014

Palindrome Recognition In The Streaming Model.

Petra Berenbrink, Funda Ergün, Frederik Mallmann-Trenn, Erfan Sadeqi Azer

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Online load balancing for MapReduce with skewed data input.

Yanfang Le, Jiangchuan Liu, Funda Ergün, Dan Wang

Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Network design for tolerating multiple link failures using Fast Re-route (FRR).

Rakesh K. Sinha, Funda Ergün, Kostas N. Oikonomou, K. K. Ramakrishnan

Proceedings of the 10th International Conference on the Design of Reliable Communication Networks, 2014

2010

Periodicity testing with sublinear samples and space.

Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp

ACM Trans. Algorithms, 2010

Periodicity in Streams.

Funda Ergün, Hossein Jowhari, Mert Saglam

Proceedings of the Approximation, 2010

2008

On distance to monotonicity and longest increasing subsequence of a data stream.

Funda Ergün, Hossein Jowhari

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2006

Oblivious string embeddings and edit distance approximations.

Tugkan Batu, Funda Ergün, Süleyman Cenk Sahinalp

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.

Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler

SIAM J. Comput., 2005

A layered architecture for delay sensitive sensor networks.

Dan Wang, Yan Long, Funda Ergün

Proceedings of the Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005

Path Protection with Pre-identification for MPLS Networks.

Dan Wang, Funda Ergün

Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE 2005), 2005

Unicast and Multicast QoS Routing with Multiple Constraints.

Dan Wang, Funda Ergün, Zhan Xu

Proceedings of the Quality of Service in Multiservice IP Networks, 2005

Finding Frequent Patterns in a String in Sublinear Time.

Petra Berenbrink, Funda Ergün, Tom Friedetzky

Proceedings of the Algorithms, 2005

2004

Identifying Uniformly Mutated Segments within Repeats.

Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün

J. Bioinform. Comput. Biol., 2004

Fast approximate probabilistically checkable proofs.

Funda Ergün, Ravi Kumar, Ronitt Rubinfeld

Inf. Comput., 2004

Sublinear Methods for Detecting Periodic Trends in Data Streams.

Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003

A sublinear algorithm for weakly approximating edit distance.

Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Sublinear-time approximation of Euclidean minimum spanning tree.

Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Comparing Sequences with Segment Rearrangements.

Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002

An improved FPTAS for Restricted Shortest Path.

Funda Ergün, Rakesh K. Sinha, Lisa Zhang

Inf. Process. Lett., 2002

Statistical Identification of Uniformly Mutated Segments within Repeats.

Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001

Checking Approximate Computations of Polynomials and Functional Equations.

Funda Ergün, Ravi Kumar, Ronitt Rubinfeld

SIAM J. Comput., 2001

Biased dictionaries with fast insert/deletes.

Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

A Dynamic Lookup Scheme for Bursty Access Patterns.

Funda Ergün, Suvo Mittra, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha

Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

Biased Skip Lists for Highly Skewed Access Patterns.

Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha

Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000

Self-Testing without the Generator Bottleneck.

Funda Ergün, Ravi Kumar, D. Sivakumar

SIAM J. Comput., 2000

Spot-Checkers.

Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan

J. Comput. Syst. Sci., 2000

QoS Routing with Performance-Dependent Costs.

Funda Ergün, Rakesh K. Sinha, Lisa Zhang

Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

1999

Fast Approximate PCPs.

Funda Ergün, Ravi Kumar, Ronitt Rubinfeld

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

A Note on the Limits of Collusion-Resistant Watermarks.

Funda Ergün, Joe Kilian, Ravi Kumar

Proceedings of the Advances in Cryptology, 1999

1997

Checking Properties of Polynomials (Extended Abstract).

Bruno Codenotti, Funda Ergün, Peter Gemmell, Ravi Kumar

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Learning Distributions from Random Walks.

Funda Ergün, Ravi Kumar, Ronitt Rubinfeld

Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

1996

Approximate Checking of Polynomials and Functional Equations (extended abstract).

Funda Ergün, Ravi Kumar, Ronitt Rubinfeld

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

Testing multivariate linear functions: overcoming the generator bottleneck.

Funda Ergün

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

On Learning Bounded-Width Branching Programs.

Funda Ergün, Ravi Kumar, Ronitt Rubinfeld

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995