|
Search the dblp DataBase
Lyle A. McGeoch:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator
Competitive Algorithms for On-line Problems [Citation Graph (3, 0)][DBLP] STOC, 1988, pp:322-333 [Conf]
- Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
Competitive Paging Algorithms. [Citation Graph (3, 0)][DBLP] J. Algorithms, 1991, v:12, n:4, pp:685-699 [Journal]
- Jill Cirasella, David S. Johnson, Lyle A. McGeoch, Weixiong Zhang
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests. [Citation Graph (0, 0)][DBLP] ALENEX, 2001, pp:32-59 [Conf]
- Scott F. Kaplan, Lyle A. McGeoch, Megan F. Cole
Adaptive caching for demand prepaging. [Citation Graph (0, 0)][DBLP] MSP/ISMM, 2002, pp:221-232 [Conf]
- Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer
Data Structures for Traveling Salesmen. [Citation Graph (0, 0)][DBLP] SODA, 1993, pp:145-154 [Conf]
- David S. Johnson, Lyle A. McGeoch, Edward E. Rothberg
Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound. [Citation Graph (0, 0)][DBLP] SODA, 1996, pp:341-350 [Conf]
- Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki
Competitive Randomized Algorithms for Non-Uniform Problems. [Citation Graph (0, 0)][DBLP] SODA, 1990, pp:301-309 [Conf]
- Jon Louis Bentley, David S. Johnson, Frank Thomson Leighton, Catherine C. McGeoch, Lyle A. McGeoch
Some Unexpected Expected Behavior Results for Bin Packing [Citation Graph (0, 0)][DBLP] STOC, 1984, pp:279-288 [Conf]
- Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study [Citation Graph (0, 0)][DBLP] STOC, 1991, pp:230-240 [Conf]
- Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki
Competitive Randomized Algorithms for Nonuniform Problems. [Citation Graph (0, 0)][DBLP] Algorithmica, 1994, v:11, n:6, pp:542-571 [Journal]
- Lyle A. McGeoch, Daniel Dominic Sleator
A Strongly Competitive Randomized Paging Algorithm. [Citation Graph (0, 0)][DBLP] Algorithmica, 1991, v:6, n:6, pp:816-825 [Journal]
- Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
Competitive Paging Algorithms [Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal]
- Merrick L. Furst, Jonathan L. Gross, Lyle A. McGeoch
Finding a maximum-genus graph imbedding. [Citation Graph (0, 0)][DBLP] J. ACM, 1988, v:35, n:3, pp:523-534 [Journal]
- Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer
Data Structures for Traveling Salesmen. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:18, n:3, pp:432-479 [Journal]
- Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator
Competitive Algorithms for Server Problems. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1990, v:11, n:2, pp:208-230 [Journal]
Search in 0.004secs, Finished in 0.005secs
|