The SCEAS System
| |||||||

## Search the dblp DataBase
Eric Torng:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- David R. Karger, Steven J. Phillips, Eric Torng
**A Better Algorithm for an Ancient Scheduling Problem.**[Citation Graph (1, 0)][DBLP] SODA, 1994, pp:132-140 [Conf] - Eric Torng
**A Unified Analysis of Paging and Caching.**[Citation Graph (0, 0)][DBLP] FOCS, 1995, pp:194-203 [Conf] - Dehua Hang, Charles Ofria, Thomas M. Schmidt, Eric Torng
**The Effect of Natural Selection on Phylogeny Reconstruction Algorithms.**[Citation Graph (0, 0)][DBLP] GECCO, 2003, pp:13-24 [Conf] - Hugh M. Smith, Matt W. Mutka, Eric Torng
**Bandwidth Allocation for Layered Multicasted Video.**[Citation Graph (0, 0)][DBLP] ICMCS, Vol. 1, 1999, pp:232-237 [Conf] - Barbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng
**Sufficient Conditions for Optimal Multicast Communication.**[Citation Graph (0, 0)][DBLP] ICPP, 1997, pp:390-0 [Conf] - Jin Kim, James R. Cole, Eric Torng, Sakti Pramanik
**Inferring Relatedness of a Macromolecule to a Sequence Database Without Sequencing.**[Citation Graph (0, 0)][DBLP] ISMB, 1996, pp:125-133 [Conf] - Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, Stephen Wagner
**The**[Citation Graph (0, 0)][DBLP]*k*-Client Problem. SODA, 1997, pp:73-82 [Conf] - Mark Brehob, Richard J. Enbody, Eric Torng, Stephen Wagner
**On-line restricted caching.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:374-383 [Conf] - Mark Brehob, Eric Torng, Patchrawat Uthaisombut
**Applying extra-resource analysis to load balancing.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:560-561 [Conf] - Todd Gormley, Nick Reingold, Eric Torng, Jeffery Westbrook
**Generating adversaries for request-answer games.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:564-565 [Conf] - Rajeev Motwani, Steven J. Phillips, Eric Torng
**Non-Clairvoyant Scheduling.**[Citation Graph (0, 0)][DBLP] SODA, 1993, pp:422-431 [Conf] - Jason McCullough, Eric Torng
**SRPT optimally utilizes faster machines to minimize flow time.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:350-358 [Conf] - April Rasala, Clifford Stein, Eric Torng, Patchrawat Uthaisombut
**Existence theorems, lower bounds and algorithms for scheduling to meet two objectives.**[Citation Graph (0, 0)][DBLP] SODA, 2002, pp:723-731 [Conf] - Eric Torng, Patchrawat Uthaisombut
**Lower Bounds for SRPT-Subsequence Algorithms for Nonpreemptive Scheduling.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:973-974 [Conf] - Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein
**Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract).**[Citation Graph (0, 0)][DBLP] STOC, 1997, pp:140-149 [Conf] - Barbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng
**Toward a General Theory of Unicast-Based Multicast Communication.**[Citation Graph (0, 0)][DBLP] WG, 1995, pp:237-251 [Conf] - Bala Kalyanasundaram, Kirk Pruhs, Eric Torng
**Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2000, v:28, n:3, pp:269-270 [Journal] - Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein
**Optimal Time-Critical Scheduling via Resource Augmentation.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:32, n:2, pp:163-200 [Journal] - Eric Torng
**A Unified Analysis of Paging and Caching.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1998, v:20, n:2, pp:175-200 [Journal] - Eric Torng, Patchrawat Uthaisombut
**A Tight Lower Bound for the Best-alpha Algorithm.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:71, n:1, pp:17-22 [Journal] - Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, Stephen Wagner
**The k-Client Problem.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:115-173 [Journal] - David R. Karger, Steven J. Phillips, Eric Torng
**A Better Algorithm for an Ancient Scheduling Problem.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:20, n:2, pp:400-430 [Journal] - Barbara D. Gannod, Abdol-Hossein Esfahanian, Eric Torng
**Source-limited inclusive routing: A new paradigm for multicast communication.**[Citation Graph (0, 0)][DBLP] Networks, 2000, v:35, n:1, pp:40-55 [Journal] - Carl Bussema, Eric Torng
**Greedy multiprocessor server scheduling.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2006, v:34, n:4, pp:451-458 [Journal] - Mark Brehob, Richard J. Enbody, Eric Torng, Stephen Wagner
**On-line Restricted Caching.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2003, v:6, n:2, pp:149-166 [Journal] - Mark Brehob, Stephen Wagner, Eric Torng, Richard J. Enbody
**Optimal Replacement Is NP-Hard for Nonstandard Caches.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 2004, v:53, n:1, pp:73-76 [Journal] - Rajeev Motwani, Steven Phillips, Eric Torng
**Non-Clairvoyant Scheduling.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:130, n:1, pp:17-47 [Journal] - Chad R. Meiners, Eric Torng
**Mixed Criteria Packet Scheduling.**[Citation Graph (0, 0)][DBLP] AAIM, 2007, pp:120-133 [Conf] **TCAM Razor: A Systematic Approach Towards Minimizing Packet Classifiers in TCAMs.**[Citation Graph (, )][DBLP]**Bit Weaving: A Non-prefix Approach to Compressing Packet Classifiers in TCAMs.**[Citation Graph (, )][DBLP]**Firewall Compressor: An Algorithm for Minimizing Firewall Policies.**[Citation Graph (, )][DBLP]**Topological transformation approaches to optimizing TCAM-based packet classification systems.**[Citation Graph (, )][DBLP]**Algorithmic approaches to redesigning tcam-based systems.**[Citation Graph (, )][DBLP]**Efficient multicast for link-heterogeneous wireless mesh networks.**[Citation Graph (, )][DBLP]**Using Avida to Test the Effects of Natural Selection on Phylogenetic Reconstruction Methods.**[Citation Graph (, )][DBLP]**On the Gradual Evolution of Complexity and the Sudden Emergence of Complex Features.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |