Funda Ergün

1.2k total citations
31 papers, 565 citations indexed

About

Funda Ergün is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Funda Ergün has authored 31 papers receiving a total of 565 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Computational Theory and Mathematics, 18 papers in Artificial Intelligence and 11 papers in Computer Networks and Communications. Recurrent topics in Funda Ergün's work include Complexity and Algorithms in Graphs (17 papers), Machine Learning and Algorithms (12 papers) and Algorithms and Data Compression (9 papers). Funda Ergün is often cited by papers focused on Complexity and Algorithms in Graphs (17 papers), Machine Learning and Algorithms (12 papers) and Algorithms and Data Compression (9 papers). Funda Ergün collaborates with scholars based in United States, Canada and United Kingdom. Funda Ergün's co-authors include Ronitt Rubinfeld, Rakesh K. Sinha, Lisa Zhang, Tuğkan Batu, Sampath Kannan, Mahesh Viswanathan, Rakesh Sinha, S. Ravi Kumar, Cenk Sahinalp and Jiangchuan Liu and has published in prestigious journals such as Bioinformatics, SIAM Journal on Computing and Journal of Computer and System Sciences.

In The Last Decade

Funda Ergün

30 papers receiving 526 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Funda Ergün United States	14	281	251	251	74	74	31	565
Adam L. Buchsbaum United States	14	333 1.2×	202 0.8×	296 1.2×	59 0.8×	34 0.5×	41	623
Jeffery Westbrook United States	17	223 0.8×	356 1.4×	479 1.9×	37 0.5×	60 0.8×	34	766
Marijn J. H. Heule United States	13	346 1.2×	325 1.3×	159 0.6×	53 0.7×	72 1.0×	61	617
Joan Boyar Denmark	16	442 1.6×	230 0.9×	388 1.5×	98 1.3×	96 1.3×	74	835
Tadao Takaoka New Zealand	10	162 0.6×	200 0.8×	118 0.5×	20 0.3×	43 0.6×	50	402
Francis Y. L. Chin Hong Kong	12	126 0.4×	110 0.4×	311 1.2×	30 0.4×	120 1.6×	50	641
Hans van Maaren Netherlands	11	274 1.0×	294 1.2×	174 0.7×	33 0.4×	30 0.4×	33	520
Alan Siegel United States	11	262 0.9×	230 0.9×	220 0.9×	10 0.1×	88 1.2×	34	521
Man‐Tak Shing United States	13	164 0.6×	155 0.6×	162 0.6×	155 2.1×	41 0.6×	79	504
Inês Lynce Portugal	15	329 1.2×	308 1.2×	287 1.1×	87 1.2×	66 0.9×	82	684

Countries citing papers authored by Funda Ergün

Since Specialization

Citations

This map shows the geographic impact of Funda Ergün's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Funda Ergün with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Funda Ergün more than expected).

Fields of papers citing papers by Funda Ergün

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Funda Ergün. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Funda Ergün. The network helps show where Funda Ergün may publish in the future.

Co-authorship network of co-authors of Funda Ergün

This figure shows the co-authorship network connecting the top 25 collaborators of Funda Ergün. A scholar is included among the top collaborators of Funda Ergün based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Funda Ergün. Funda Ergün is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Mehrabadi, Farid Rashidi, Eva Pérez‐Guijarro, Kerrie L. Marie, et al.. (2022). Fast intratumor heterogeneity inference from single-cell sequencing data. Nature Computational Science. 2(9). 577–583. 3 indexed citations

Mehrabadi, Farid Rashidi, Salem Malikić, Osnat Bartok, et al.. (2020). PhISCS-BnB: a fast branch and bound algorithm for the perfect tumor phylogeny reconstruction problem. Bioinformatics. 36(Supplement_1). i169–i176. 14 indexed citations

Wang, Feng, et al.. (2015). On Datacenter-Network-Aware Load Balancing in MapReduce. 485–492. 2 indexed citations

Liu, Jiangchuan, et al.. (2014). Online load balancing for MapReduce with skewed data input. PolyU Institutional Research Archive (Hong Kong Polytechnic University). 2004–2012. 49 indexed citations

Ergün, Funda & Hossein Jowhari. (2014). On the monotonicity of a data stream. COMBINATORICA. 35(6). 641–653. 3 indexed citations

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

Ergün, Funda & Hossein Jowhari. (2008). On distance to monotonicity and longest increasing subsequence of a data stream. Symposium on Discrete Algorithms. 730–736. 12 indexed citations

Batu, Tuğkan, Funda Ergün, & Cenk Sahinalp. (2006). Oblivious string embeddings and edit distance approximations. Symposium on Discrete Algorithms. 792–801. 30 indexed citations

Batu, Tuğkan, Funda Ergün, & Cenk Sahinalp. (2006). Oblivious string embeddings and edit distance approximations. London School of Economics and Political Science Research Online (London School of Economics and Political Science). 792–801. 24 indexed citations

10.

Wang, Dan & Funda Ergün. (2005). Path Protection with Pre-identification for MPLS Networks. Rare & Special e-Zone (The Hong Kong University of Science and Technology). 3469. 46–46. 2 indexed citations

11.

Czumaj, Artur, Funda Ergün, Lance Fortnow, et al.. (2005). Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM Journal on Computing. 35(1). 91–109. 24 indexed citations

12.

Czumaj, Artur, Funda Ergün, Lance Fortnow, et al.. (2003). Sublinear-time approximation of Euclidean minimum spanning tree. Symposium on Discrete Algorithms. 813–822. 14 indexed citations

13.

Ergün, Funda, Ravi Kumar, & Ronitt Rubinfeld. (2003). Fast approximate probabilistically checkable proofs. Information and Computation. 189(2). 135–159. 20 indexed citations

14.

Batu, Tuğkan, Funda Ergün, Joe Kilian, et al.. (2003). A sublinear algorithm for weakly approximating edit distance. 316–324. 41 indexed citations

15.

Batu, Tuğkan, Funda Ergün, Joe Kilian, et al.. (2003). A sublinear algorithm for weakly approximating edit distance. 4 indexed citations

16.

Ergün, Funda, Rakesh K. Sinha, & Lisa Zhang. (2002). An improved FPTAS for Restricted Shortest Path. Information Processing Letters. 83(5). 287–291. 82 indexed citations

17.

Ergün, Funda, S. Ravi Kumar, & Ronitt Rubinfeld. (2001). Checking Approximate Computations of Polynomials and Functional Equations. SIAM Journal on Computing. 31(2). 550–576. 2 indexed citations

18.

Ergün, Funda, et al.. (2000). Spot-Checkers. Journal of Computer and System Sciences. 60(3). 717–751. 69 indexed citations

19.

Ergün, Funda, Ravi Kumar, & Ronitt Rubinfeld. (1999). Fast approximate PCPs. 41–50. 13 indexed citations

20.

Ergün, Funda, Ravi Kumar, & Ronitt Rubinfeld. (1996). Approximate Checking of Polynomials and Functional Equations (extended abstract).. 14. 592–601. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact