Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 209,921,005 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Computer scientist
D-Wave Two
Empirical algorithmics
The 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
James King
,
S. Yarkoni
,
+5 authors
Catherine C. McGeoch
Journal of the Physical Society of Japan
2017
Corpus ID: 44153604
A recent Google study [Phys. Rev. X, 6:031015 (2016)] compared a D-Wave 2X quantum processing unit (QPU) to two classical Monte…
Expand
2013
2013
The fossil history of Grévy's zebra (Equus grevyi) in equatorial East Africa
J. Faith
,
C. Tryon
,
D. Peppe
,
D. Fox
2013
Corpus ID: 15982990
Within the last several decades, Grévy's zebra (Equus grevyi) has undergone a massive reduction in geographical range and…
Expand
Highly Cited
2010
Highly Cited
2010
Building Character: Effects of Lay Theories of Self-Control on the Selection of Products for Children
A. Mukhopadhyay
,
Catherine Yeung
2010
Corpus ID: 13905469
This research studies the effect of consumers’ lay theories of self-control on their choices of products for young children. The…
Expand
Review
2007
Review
2007
Global dung beetle response to tropical forest modification and fragmentation: A quantitative literature review and meta-analysis
Elizabeth S Nichols
,
T. Larsen
,
+4 authors
K. Vulinec
2007
Corpus ID: 85273355
Highly Cited
2001
Highly Cited
2001
Experimental Analysis of Heuristics for the Stsp
ATSPDavid S. JohnsonAT
2001
Corpus ID: 9880817
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…
Expand
1997
1997
Proactive interference plays a role in the word-length effect
J. S. Nairne
,
I. Neath
,
M. Serra
1997
Corpus ID: 15655638
The word-length effect is the advantage that lists of short words show over lists of long words in immediate recall. Typically…
Expand
Highly Cited
1997
Highly Cited
1997
A polylog(n)-competitive algorithm for metrical task systems
Y. Bartal
,
A. Blum
,
C. Burch
,
A. Tomkins
Symposium on the Theory of Computing
1997
Corpus ID: 2681679
We present a randomized on-line algorithm for the Metrical Task System problem that achieves a competitive ratio of O(log6 n) for…
Expand
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…
Expand
Highly Cited
1990
Highly Cited
1990
Affective Responses to Autobiographical Memories and Their Relationship to Long‐Term Goals
J. Singer
1990
Corpus ID: 13784415
It was hypothesized that affective responses to memories could be predicted from a memory's relevance to the attainment or…
Expand
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)
ACCEPT & CONTINUE