Skip to search formSkip to main contentSkip to account menu

Catherine McGeoch

Known as: McGeoch 
Catherine Cole McGeoch is an American computer scientist specializing in empirical algorithmics and heuristics for NP-hard problems. She is currently… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Computer scientistD-Wave TwoEmpirical algorithmicsThe New York Times

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Quantum Annealing amid Local Ruggedness and Global Frustration
A recent Google study [Phys. Rev. X, 6:031015 (2016)] compared a D-Wave 2X quantum processing unit (QPU) to two classical Monte… 
2013
2013
The fossil history of Grévy's zebra (Equus grevyi) in equatorial East Africa
Within the last several decades, Grévy's zebra (Equus grevyi) has undergone a massive reduction in geographical range and… 
Highly Cited
2010
Highly Cited
2010
Building Character: Effects of Lay Theories of Self-Control on the Selection of Products for Children
This research studies the effect of consumers’ lay theories of self-control on their choices of products for young children. The… 
Review
2007
Review
2007
Global dung beetle response to tropical forest modification and fragmentation: A quantitative literature review and meta-analysis
Highly Cited
2001
Highly Cited
2001
Experimental Analysis of Heuristics for the Stsp
Review
1999
Review
1999
A theoretician's guide to the experimental analysis of algorithms
  • David S. Johnson
  • Data Structures, Near Neighbor Searches, and…
  • 1999
  • Corpus ID: 11281694
This paper presents an informal discussion of issues that arise when one attempts to analyze algorithms experimentally. It is… 
1997
1997
Proactive interference plays a role in the word-length effect
The word-length effect is the advantage that lists of short words show over lists of long words in immediate recall. Typically… 
Highly Cited
1997
Highly Cited
1997
A polylog(n)-competitive algorithm for metrical task systems
We present a randomized on-line algorithm for the Metrical Task System problem that achieves a competitive ratio of O(log6 n) for… 
Highly Cited
1991
Highly Cited
1991
The harmonic online K-server algorithm is competitive
  • E. Grove
  • Symposium on the Theory of Computing
  • 1991
  • Corpus ID: 16906921
We show that the Harmonic algorithm for the online K-server problem is ( ~11 x 2K – 2K)competitive against an adaptive online… 
Highly Cited
1990
Highly Cited
1990
Affective Responses to Autobiographical Memories and Their Relationship to Long‐Term Goals
It was hypothesized that affective responses to memories could be predicted from a memory's relevance to the attainment or… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)