default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLyle A. McGeoch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[r2]Lyle A. McGeoch:
Implementation Challenge for TSP Heuristics. Encyclopedia of Algorithms 2016: 952-954
2000 – 2009
- 2008
- [r1]Lyle A. McGeoch:
Implementation Challenge for TSP Heuristics. Encyclopedia of Algorithms 2008 - 2002
- [c8]Scott F. Kaplan, Lyle A. McGeoch, Megan F. Cole
:
Adaptive caching for demand prepaging. MSP/ISMM 2002: 221-232 - [i1]Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young:
Competitive Paging Algorithms. CoRR cs.DS/0205038 (2002) - 2001
- [c7]Jill Cirasella, David S. Johnson, Lyle A. McGeoch, Weixiong Zhang:
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests. ALENEX 2001: 32-59
1990 – 1999
- 1996
- [c6]David S. Johnson, Lyle A. McGeoch, Edward E. Rothberg:
Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound. SODA 1996: 341-350 - 1995
- [j8]Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer:
Data Structures for Traveling Salesmen. J. Algorithms 18(3): 432-479 (1995) - 1994
- [j7]Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki:
Competitive Randomized Algorithms for Nonuniform Problems. Algorithmica 11(6): 542-571 (1994) - 1993
- [c5]Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer:
Data Structures for Traveling Salesmen. SODA 1993: 145-154 - 1992
- [e1]Lyle A. McGeoch, Daniel Dominic Sleator:
On-Line Algorithms, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, February 11-13, 1991. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 7, DIMACS/AMS 1992, ISBN 978-0-8218-6596-5 [contents] - 1991
- [j6]Lyle A. McGeoch, Daniel Dominic Sleator:
A Strongly Competitive Randomized Paging Algorithm. Algorithmica 6(6): 816-825 (1991) - [j5]David S. Johnson, Cecilia R. Aragon, Lyle A. McGeoch, Catherine Schevon:
Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning. Oper. Res. 39(3): 378-406 (1991) - [j4]Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young:
Competitive Paging Algorithms. J. Algorithms 12(4): 685-699 (1991) - [c4]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. STOC 1991: 230-240 - 1990
- [j3]Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator:
Competitive Algorithms for Server Problems. J. Algorithms 11(2): 208-230 (1990) - [c3]Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki:
Competitive Randomized Algorithms for Non-Uniform Problems. SODA 1990: 301-309
1980 – 1989
- 1989
- [j2]David S. Johnson, Cecilia R. Aragon, Lyle A. McGeoch, Catherine Schevon:
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning. Oper. Res. 37(6): 865-892 (1989) - 1988
- [j1]Merrick L. Furst, Jonathan L. Gross, Lyle A. McGeoch:
Finding a maximum-genus graph imbedding. J. ACM 35(3): 523-534 (1988) - [c2]Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator:
Competitive Algorithms for On-line Problems. STOC 1988: 322-333 - 1984
- [c1]Jon Louis Bentley, David S. Johnson, Frank Thomson Leighton, Catherine C. McGeoch, Lyle A. McGeoch:
Some Unexpected Expected Behavior Results for Bin Packing. STOC 1984: 279-288
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
