 | 2009 |
|---|
| 37 |       | Chad R. Meiners,
Alex X. Liu,
Eric Torng:
Topological transformation approaches to optimizing TCAM-based packet classification systems.
SIGMETRICS/Performance 2009: 73-84 |
| 2008 |
|---|
| 36 | | Alex X. Liu,
Eric Torng,
Chad R. Meiners:
Firewall Compressor: An Algorithm for Minimizing Firewall Policies.
INFOCOM 2008: 176-180 |
| 35 | | Chad R. Meiners,
Alex X. Liu,
Eric Torng:
Algorithmic approaches to redesigning tcam-based systems.
SIGMETRICS 2008: 467-468 |
| 34 | | Eric Torng,
Jason McCullough:
SRPT optimally utilizes faster machines to minimize flow time.
ACM Transactions on Algorithms 5(1): (2008) |
| 33 | | Charles Ofria,
Wei Huang,
Eric Torng:
On the Gradual Evolution of Complexity and the Sudden Emergence of Complex Features.
Artificial Life 14(3): 255-263 (2008) |
| 32 | | Christopher J. Osborn,
Eric Torng:
List's worst-average-case or WAC ratio.
J. Scheduling 11(3): 213-215 (2008) |
| 2007 |
|---|
| 31 | | Chad R. Meiners,
Eric Torng:
Mixed Criteria Packet Scheduling.
AAIM 2007: 120-133 |
| 30 | | Chad R. Meiners,
Alex X. Liu,
Eric Torng:
TCAM Razor: A Systematic Approach Towards Minimizing Packet Classifiers in TCAMs.
ICNP 2007: 266-275 |
| 2006 |
|---|
| 29 | | Carl Bussema,
Eric Torng:
Greedy multiprocessor server scheduling.
Oper. Res. Lett. 34(4): 451-458 (2006) |
| 2004 |
|---|
| 28 | | Jason McCullough,
Eric Torng:
SRPT optimally utilizes faster machines to minimize flow time.
SODA 2004: 350-358 |
| 27 | | George I. Hagstrom,
Dehua H. Hang,
Charles Ofria,
Eric Torng:
Using Avida to Test the Effects of Natural Selection on Phylogenetic Reconstruction Methods.
Artificial Life 10(2): 157-166 (2004) |
| 26 | | Mark Brehob,
Stephen Wagner,
Eric Torng,
Richard J. Enbody:
Optimal Replacement Is NP-Hard for Nonstandard Caches.
IEEE Trans. Computers 53(1): 73-76 (2004) |
| 2003 |
|---|
| 25 | | Dehua H. Hang,
Charles Ofria,
Thomas M. Schmidt,
Eric Torng:
The Effect of Natural Selection on Phylogeny Reconstruction Algorithms.
GECCO 2003: 13-24 |
| 24 |  | Mark Brehob,
Richard J. Enbody,
Eric Torng,
Stephen Wagner:
On-line Restricted Caching.
J. Scheduling 6(2): 149-166 (2003) |
| 2002 |
|---|
| 23 | | April Rasala,
Clifford Stein,
Eric Torng,
Patchrawat Uthaisombut:
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives.
SODA 2002: 723-731 |
| 22 | | Cynthia A. Phillips,
Clifford Stein,
Eric Torng,
Joel Wein:
Optimal Time-Critical Scheduling via Resource Augmentation.
Algorithmica 32(2): 163-200 (2002) |
| 2001 |
|---|
| 21 | | Mark Brehob,
Richard J. Enbody,
Eric Torng,
Stephen Wagner:
On-line restricted caching.
SODA 2001: 374-383 |
| 20 | | Houman Alborzi,
Eric Torng,
Patchrawat Uthaisombut,
Stephen Wagner:
The k-Client Problem.
J. Algorithms 41(2): 115-173 (2001) |
| 2000 |
|---|
| 19 | | Mark Brehob,
Eric Torng,
Patchrawat Uthaisombut:
Applying extra-resource analysis to load balancing.
SODA 2000: 560-561 |
| 18 | | Todd Gormley,
Nick Reingold,
Eric Torng,
Jeffery Westbrook:
Generating adversaries for request-answer games.
SODA 2000: 564-565 |
| 17 | | Bala Kalyanasundaram,
Kirk Pruhs,
Eric Torng:
Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks.
Algorithmica 28(3): 269-270 (2000) |
| 16 | | Barbara D. Gannod,
Abdol-Hossein Esfahanian,
Eric Torng:
Source-limited inclusive routing: A new paradigm for multicast communication.
Networks 35(1): 40-55 (2000) |
| 1999 |
|---|
| 15 | | Hugh M. Smith,
Matt W. Mutka,
Eric Torng:
Bandwidth Allocation for Layered Multicasted Video.
ICMCS, Vol. 1 1999: 232-237 |
| 14 | | Eric Torng,
Patchrawat Uthaisombut:
Lower Bounds for SRPT-Subsequence Algorithms for Nonpreemptive Scheduling.
SODA 1999: 973-974 |
| 13 | | Eric Torng,
Patchrawat Uthaisombut:
A Tight Lower Bound for the Best-alpha Algorithm.
Inf. Process. Lett. 71(1): 17-22 (1999) |
| 1998 |
|---|
| 12 | | Eric Torng:
A Unified Analysis of Paging and Caching.
Algorithmica 20(2): 175-200 (1998) |
| 11 | | Rajeev Motwani,
Vijay A. Saraswat,
Eric Torng:
Online Scheduling with Lookahead: Multipass Assembly Lines.
INFORMS Journal on Computing 10(3): 331-340 (1998) |
| 1997 |
|---|
| 10 | | Barbara D. Birchler,
Abdol-Hossein Esfahanian,
Eric Torng:
Sufficient Conditions for Optimal Multicast Communication.
ICPP 1997: 390- |
| 9 | | Houman Alborzi,
Eric Torng,
Patchrawat Uthaisombut,
Stephen Wagner:
The k-Client Problem.
SODA 1997: 73-82 |
| 8 | | Cynthia A. Phillips,
Clifford Stein,
Eric Torng,
Joel Wein:
Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract).
STOC 1997: 140-149 |
| 1996 |
|---|
| 7 | | Jin Kim,
James R. Cole,
Eric Torng,
Sakti Pramanik:
Inferring Relatedness of a Macromolecule to a Sequence Database Without Sequencing.
ISMB 1996: 125-133 |
| 6 | | David R. Karger,
Steven J. Phillips,
Eric Torng:
A Better Algorithm for an Ancient Scheduling Problem.
J. Algorithms 20(2): 400-430 (1996) |
| 1995 |
|---|
| 5 | | Eric Torng:
A Unified Analysis of Paging and Caching.
FOCS 1995: 194-203 |
| 4 | | Barbara D. Birchler,
Abdol-Hossein Esfahanian,
Eric Torng:
Toward a General Theory of Unicast-Based Multicast Communication.
WG 1995: 237-251 |
| 1994 |
|---|
| 3 | | David R. Karger,
Steven J. Phillips,
Eric Torng:
A Better Algorithm for an Ancient Scheduling Problem.
SODA 1994: 132-140 |
| 2 | | Rajeev Motwani,
Steven Phillips,
Eric Torng:
Non-Clairvoyant Scheduling.
Theor. Comput. Sci. 130(1): 17-47 (1994) |
| 1993 |
|---|
| 1 | | Rajeev Motwani,
Steven J. Phillips,
Eric Torng:
Non-Clairvoyant Scheduling.
SODA 1993: 422-431 |
