Eric Torng

About

Eric Torng is an Associate Professor in the Department of Computer Science and Engineering (CSE) and currently serves as Associate Chair for Research and Faculty Development for CSE and Associate Dean for MSU's Graduate School. He received his Ph.D. degree from Stanford University in 1994 and an NSF Career Award in 1997. He has published over 100 technical papers and has served as a PI or co-PI on 10 external grants worth over $2,000,000 in total funding. Eric Torng's research interests include algorithms, on-line algorithms, scheduling, perimeter defense, and packet processing.

Education

• Ph.D., Computer Science, Stanford University 1994
• M.S., Computer Science, Stanford University 1992
• B.A., Computer Science, Princeton University 1989

Selected publications

• Multi-vehicle perimeter defense in conical environments, Coauthors: S. Bajaj, S. Bopardiar, A. Von Moll, D. Casbeer, IEEE Transactions on Robotics (T-RO), Volune 40, pages 1439-1456, 2024.
• TupleMerge: Fast Software Packet Processing for Online Packet Classification, Coauthors J. Daly, V. Bruschi, L. Linguaglossa, S. Pontarelli, D. Rossi, J. Tollet, and A. Yourtchenko, IEEE/ACM Transactions on Networking (ToN), Volume 27, Number 4, pages 1417-1431, 2019.
• Optimal Time-Critical Scheduling Via Resource Augmentation, Coauthors C. Phillips, C. Stein, J. Wein, Algorithmica, Volume 32, pages 163-200, 2002.
• A Better Algorithm for an Ancient Scheduling Problem, Coauthors D. Karger, S. Phillips. Journal of Algorithms, Volume 20, pages 400-430, 1996.
• Non-clairvoyant Scheduling, Coauthors R. Motwani, S. Phillips. Theoretical Computer Science, Volume 130, pages 17-47, 1994.