Eric Torng

2.9k total citations
96 papers, 2.0k citations indexed

About

Eric Torng is a scholar working on Computer Networks and Communications, Hardware and Architecture and Artificial Intelligence. According to data from OpenAlex, Eric Torng has authored 96 papers receiving a total of 2.0k indexed citations (citations by other indexed papers that have themselves been cited), including 76 papers in Computer Networks and Communications, 38 papers in Hardware and Architecture and 26 papers in Artificial Intelligence. Recurrent topics in Eric Torng's work include Network Packet Processing and Optimization (32 papers), Network Security and Intrusion Detection (30 papers) and Optimization and Search Problems (29 papers). Eric Torng is often cited by papers focused on Network Packet Processing and Optimization (32 papers), Network Security and Intrusion Detection (30 papers) and Optimization and Search Problems (29 papers). Eric Torng collaborates with scholars based in United States, China and Finland. Eric Torng's co-authors include Alex X. Liu, Chad R. Meiners, Steven J. Phillips, Clifford Stein, David R. Karger, Joel Wein, Cynthia A. Phillips, Charles Ofria, Rajeev Motwani and Patchrawat Uthaisombut and has published in prestigious journals such as PLoS ONE, Analytical Biochemistry and Limnology and Oceanography.

In The Last Decade

Eric Torng

94 papers receiving 1.9k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Eric Torng United States	25	1.7k	1.0k	460	273	239	96	2.0k
William A. Wulf United States	21	817 0.5×	671 0.7×	524 1.1×	26 0.1×	75 0.3×	64	1.5k
Karl Czajkowski United States	12	1.5k 0.9×	511 0.5×	159 0.3×	20 0.1×	44 0.2×	19	1.7k
Paul W. Purdom United States	18	470 0.3×	88 0.1×	503 1.1×	44 0.2×	52 0.2×	58	1.1k
Rumen Andonov France	12	225 0.1×	118 0.1×	126 0.3×	131 0.5×	35 0.1×	43	482
Josep Carmona Spain	16	137 0.1×	149 0.1×	288 0.6×	82 0.3×	218 0.9×	73	915
Kurt Stockinger Switzerland	24	1.3k 0.7×	401 0.4×	402 0.9×	15 0.1×	16 0.1×	85	1.7k
Jason Maassen Netherlands	21	1.0k 0.6×	493 0.5×	220 0.5×	7 0.0×	58 0.2×	67	1.3k
Alexander Hall Switzerland	12	397 0.2×	76 0.1×	178 0.4×	24 0.1×	61 0.3×	27	860
Inês Lynce Portugal	15	287 0.2×	48 0.0×	329 0.7×	63 0.2×	66 0.3×	82	684
Daniel P. Miranker United States	21	682 0.4×	96 0.1×	947 2.1×	44 0.2×	15 0.1×	100	1.5k

Countries citing papers authored by Eric Torng

Since Specialization

Citations

This map shows the geographic impact of Eric Torng'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 Eric Torng with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eric Torng more than expected).

Fields of papers citing papers by Eric Torng

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Eric Torng. 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 Eric Torng. The network helps show where Eric Torng may publish in the future.

Co-authorship network of co-authors of Eric Torng

This figure shows the co-authorship network connecting the top 25 collaborators of Eric Torng. A scholar is included among the top collaborators of Eric Torng 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 Eric Torng. Eric Torng 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

Torng, Eric, et al.. (2018). Comparing fixed sampling with minimizer sampling when using k-mer indexes to find maximal exact matches. PLoS ONE. 13(2). e0189960–e0189960. 6 indexed citations

Torng, Eric, et al.. (2017). The effects of sampling on the efficiency and accuracy of k−mer indexes: Theoretical and empirical comparisons using the human genome. PLoS ONE. 12(7). e0179046–e0179046. 1 indexed citations

Liu, Alex X., et al.. (2016). A sorted partitioning approach to high-speed and fast-update OpenFlow classification. 1–10. 24 indexed citations

Liu, Alex X., et al.. (2012). Bypassing Space Explosion in Regular Expression Matching for Network Intrusion Detection and Prevention Systems.. Network and Distributed System Security Symposium. 10 indexed citations

Meiners, Chad R., et al.. (2010). Fast regular expression matching using small TCAMs for network intrusion detection and prevention systems. USENIX Security Symposium. 8–8. 81 indexed citations

Wang, Bo, Matt W. Mutka, & Eric Torng. (2008). Optimization based rate allocation and scheduling in TDMA based wireless mesh networks. 147–156. 10 indexed citations

Torng, Eric & Jason McCullough. (2008). SRPT optimally utilizes faster machines to minimize flow time. ACM Transactions on Algorithms. 5(1). 1–25. 13 indexed citations

Torng, Eric, et al.. (2007). The effect of natural selection on the performance of maximum parsimony. BMC Evolutionary Biology. 7(1). 94–94. 7 indexed citations

McCullough, Jason & Eric Torng. (2004). SRPT optimally utilizes faster machines to minimize flow time. Symposium on Discrete Algorithms. 350–358. 8 indexed citations

10.

Enbody, Richard, et al.. (2003). On-line Restricted Caching. Journal of Scheduling. 6(2). 149–166. 6 indexed citations

11.

Stein, Clifford, et al.. (2002). Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. Symposium on Discrete Algorithms. 723–731. 20 indexed citations

12.

Enbody, Richard, et al.. (2001). On-line restricted caching. Symposium on Discrete Algorithms. 374–383. 2 indexed citations

13.

Torng, Eric, et al.. (2000). Applying extra-resource analysis to load balancing. Symposium on Discrete Algorithms. 560–561. 6 indexed citations

14.

Gormley, Todd A., et al.. (2000). Generating adversaries for request-answer games. Symposium on Discrete Algorithms. 564–565. 31 indexed citations

15.

Kalyanasundaram, Bala, et al.. (2000). Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks. Algorithmica. 28(3). 269–270. 4 indexed citations

16.

Torng, Eric & Patchrawat Uthaisombut. (2000). New directions in machine scheduling. 8 indexed citations

17.

Torng, Eric & Patchrawat Uthaisombut. (1999). Lower bounds for SRPT-subsequence algorithms for nonpreemptive scheduling. Symposium on Discrete Algorithms. 973–974. 5 indexed citations

18.

Alborzi, Houman, et al.. (1997). The k-client problem. Symposium on Discrete Algorithms. 73–82. 5 indexed citations

19.

Karger, David R., Steven J. Phillips, & Eric Torng. (1994). A better algorithm for an ancient scheduling problem. Symposium on Discrete Algorithms. 132–140. 16 indexed citations

20.

Motwani, Rajeev, Steven J. Phillips, & Eric Torng. (1994). Nonclairvoyant scheduling. Theoretical Computer Science. 130(1). 17–47. 67 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