default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFunda Ergün
Person information
- affiliation: Simon Fraser University, Burnaby, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j12]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:
Fast intratumor heterogeneity inference from single-cell sequencing data. Nat. Comput. Sci. 2(9): 577-583 (2022)- 2020
- [j11]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:
PhISCS-BnB: a fast branch and bound algorithm for the perfect tumor phylogeny reconstruction problem. Bioinform. 36(Supplement-1): i169-i176 (2020) - [j10]Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Periodicity in Data Streams with Wildcards. Theory Comput. Syst. 64(1): 177-197 (2020)
2010 – 2019
- 2018
- [c30]Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Periodicity in Data Streams with Wildcards. CSR 2018: 90-105 - [i3]Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Periodicity in Data Streams with Wildcards. CoRR abs/1802.07375 (2018) - 2017
- [c29]Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Streaming Periodicity with Mismatches. APPROX-RANDOM 2017: 42:1-42:21 - [i2]Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Streaming Periodicity with Mismatches. CoRR abs/1708.04381 (2017) - 2015
- [j9]Funda Ergün, Hossein Jowhari:
On the monotonicity of a data stream. Comb. 35(6): 641-653 (2015) - [c28]Yanfang Le, Feng Wang, Jiangchuan Liu, Funda Ergün:
On Datacenter-Network-Aware Load Balancing in MapReduce. CLOUD 2015: 485-492 - 2014
- [c27]Rakesh K. Sinha, Funda Ergün, Kostas N. Oikonomou, K. K. Ramakrishnan:
Network design for tolerating multiple link failures using Fast Re-route (FRR). DRCN 2014: 1-8 - [c26]Yanfang Le, Jiangchuan Liu, Funda Ergün, Dan Wang:
Online load balancing for MapReduce with skewed data input. INFOCOM 2014: 2004-2012 - [c25]Petra Berenbrink, Funda Ergün, Frederik Mallmann-Trenn, Erfan Sadeqi Azer:
Palindrome Recognition In The Streaming Model. STACS 2014: 149-161 - 2013
- [i1]Petra Berenbrink, Funda Ergün, Frederik Mallmann-Trenn, Erfan Sadeqi Azer:
Palindrome Recognition In The Streaming Model. CoRR abs/1308.3466 (2013) - 2010
- [j8]Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp:
Periodicity testing with sublinear samples and space. ACM Trans. Algorithms 6(2): 43:1-43:14 (2010) - [c24]Funda Ergün, Hossein Jowhari, Mert Saglam:
Periodicity in Streams. APPROX-RANDOM 2010: 545-559
2000 – 2009
- 2008
- [c23]Funda Ergün, Hossein Jowhari:
On distance to monotonicity and longest increasing subsequence of a data stream. SODA 2008: 730-736 - 2006
- [c22]Tugkan Batu, Funda Ergün, Süleyman Cenk Sahinalp:
Oblivious string embeddings and edit distance approximations. SODA 2006: 792-801 - 2005
- [j7]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) - [c21]Petra Berenbrink, Funda Ergün, Tom Friedetzky:
Finding Frequent Patterns in a String in Sublinear Time. ESA 2005: 746-757 - [c20]Dan Wang, Funda Ergün, Zhan Xu:
Unicast and Multicast QoS Routing with Multiple Constraints. QoS-IP 2005: 481-494 - [c19]Dan Wang, Funda Ergün:
Path Protection with Pre-identification for MPLS Networks. QSHINE 2005: 46 - [c18]Dan Wang, Yan Long, Funda Ergün:
A layered architecture for delay sensitive sensor networks. SECON 2005: 24-34 - 2004
- [j6]Funda Ergün, Ravi Kumar, Ronitt Rubinfeld:
Fast approximate probabilistically checkable proofs. Inf. Comput. 189(2): 135-159 (2004) - [j5]Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün:
Identifying Uniformly Mutated Segments within Repeats. J. Bioinform. Comput. Biol. 2(4): 657-668 (2004) - [c17]Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp:
Sublinear Methods for Detecting Periodic Trends in Data Streams. LATIN 2004: 16-28 - 2003
- [c16]Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp:
Comparing Sequences with Segment Rearrangements. FSTTCS 2003: 183-194 - [c15]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 - [c14]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
- [j4]Funda Ergün, Rakesh K. Sinha, Lisa Zhang:
An improved FPTAS for Restricted Shortest Path. Inf. Process. Lett. 83(5): 287-291 (2002) - [c13]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 - 2001
- [j3]Funda Ergün, Ravi Kumar, Ronitt Rubinfeld:
Checking Approximate Computations of Polynomials and Functional Equations. SIAM J. Comput. 31(2): 550-576 (2001) - [c12]Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha:
Biased Skip Lists for Highly Skewed Access Patterns. ALENEX 2001: 216-230 - [c11]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 - [c10]Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha:
Biased dictionaries with fast insert/deletes. STOC 2001: 483-491 - 2000
- [j2]Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan:
Spot-Checkers. J. Comput. Syst. Sci. 60(3): 717-751 (2000) - [j1]Funda Ergün, Ravi Kumar, D. Sivakumar:
Self-Testing without the Generator Bottleneck. SIAM J. Comput. 29(5): 1630-1651 (2000) - [c9]Funda Ergün, Rakesh K. Sinha, Lisa Zhang:
QoS Routing with Performance-Dependent Costs. INFOCOM 2000: 137-146
1990 – 1999
- 1999
- [c8]Funda Ergün, Joe Kilian, Ravi Kumar:
A Note on the Limits of Collusion-Resistant Watermarks. EUROCRYPT 1999: 140-149 - [c7]Funda Ergün, Ravi Kumar, Ronitt Rubinfeld:
Fast Approximate PCPs. STOC 1999: 41-50 - 1998
- [c6]Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan:
Spot-Checkers. STOC 1998: 259-268 - 1997
- [c5]Funda Ergün, Ravi Kumar, Ronitt Rubinfeld:
Learning Distributions from Random Walks. COLT 1997: 243-249 - [c4]Bruno Codenotti, Funda Ergün, Peter Gemmell, Ravi Kumar:
Checking Properties of Polynomials (Extended Abstract). ICALP 1997: 203-213 - 1996
- [c3]Funda Ergün, Ravi Kumar, Ronitt Rubinfeld:
Approximate Checking of Polynomials and Functional Equations (extended abstract). FOCS 1996: 592-601 - 1995
- [c2]Funda Ergün, Ravi Kumar, Ronitt Rubinfeld:
On Learning Bounded-Width Branching Programs. COLT 1995: 361-368 - [c1]Funda Ergün:
Testing multivariate linear functions: overcoming the generator bottleneck. STOC 1995: 407-416
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
