default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCatherine C. McGeoch
Person information
- affiliation: D-Wave Systems, Canada
- affiliation: Amherst College, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Nicholas Chancellor, Catherine C. McGeoch, Susan M. Mniszewski, David Bernal Niera:
Editorial: Experience with quantum annealing computation. Frontiers Comput. Sci. 6 (2024)- [i4]Catherine C. McGeoch:
How NOT to Fool the Masses When Giving Performance Results for Quantum Computers. CoRR abs/2411.08860 (2024) - 2023
- [i3]Catherine C. McGeoch, Pau Farré:
Milestones on the Quantum Utility Highway. CoRR abs/2305.00883 (2023) - 2022
- [c11]Catherine C. McGeoch, Pau Farré:
Milestones on the Quantum Utility Highway. SEC 2022: 393-399 - [i2]Jack Raymond, Radomir Stevanovic, William Bernoudy, Kelly Boothby, Catherine C. McGeoch, Andrew J. Berkley, Pau Farré, Andrew D. King:
Hybrid quantum annealing for larger-than-QPU lattice-structured problems. CoRR abs/2202.03044 (2022) - 2020
- [j16]Catherine C. McGeoch:
Theory versus practice in annealing-based quantum computing. Theor. Comput. Sci. 816: 169-183 (2020)
2010 – 2019
- 2019
- [j15]Catherine C. McGeoch
, Richard Harris, Steven P. Reinhardt, Paul I. Bunyk:
Practical Annealing-Based Quantum Computing. Computer 52(6): 38-46 (2019) - 2017
- [c10]Catherine C. McGeoch:
Principles and Guidelines for Quantum Performance Analysis. QTOP@NetSys 2017: 36-48 - 2016
- [j14]Catherine C. McGeoch:
In Memoriam: David S. Johnson. ACM J. Exp. Algorithmics 21(1): 1.1e:1 (2016) - [r2]Catherine C. McGeoch:
Experimental Methods for Algorithm Analysis. Encyclopedia of Algorithms 2016: 702-705 - 2014
- [b2]Catherine C. McGeoch:
Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice. Synthesis Lectures on Quantum Computing, Morgan & Claypool Publishers 2014, ISBN 978-3-031-01390-4 - [e5]Catherine C. McGeoch, Ulrich Meyer:
2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2014, Portland, Oregon, USA, January 5, 2014. SIAM 2014, ISBN 978-1-61197-319-8 [contents] - [i1]Andrew D. King, Catherine C. McGeoch:
Algorithm engineering for a quantum annealing platform. CoRR abs/1410.2628 (2014) - 2013
- [c9]Catherine C. McGeoch, Cong Wang:
Experimental evaluation of an adiabiatic quantum system for combinatorial optimization. Conf. Computing Frontiers 2013: 23:1-23:11 - 2012
- [b1]Catherine C. McGeoch:
A Guide to Experimental Algorithmics. Cambridge University Press 2012, ISBN 978-0-521-17301-8, pp. I-X, 1-261 - 2010
- [j13]Catherine C. McGeoch:
Preface. ACM J. Exp. Algorithmics 15 (2010)
2000 – 2009
- 2009
- [j12]Catherine C. McGeoch:
Experimental algorithms for undergraduates: keynote address. J. Comput. Sci. Coll. 24(3): 5 (2009) - 2008
- [e4]Catherine C. McGeoch:
Experimental Algorithms, 7th International Workshop, WEA 2008, Provincetown, MA, USA, May 30-June 1, 2008, Proceedings. Lecture Notes in Computer Science 5038, Springer 2008, ISBN 978-3-540-68548-7 [contents] - [r1]Catherine C. McGeoch:
Experimental Methods for Algorithm Analysis. Encyclopedia of Algorithms 2008 - 2007
- [j11]Catherine C. McGeoch:
Experimental algorithmics. Commun. ACM 50(11): 27-31 (2007) - [c8]Larry Rudolph, Daniel A. Menascé, Fabián E. Bustamante, Catherine C. McGeoch, Ethan L. Miller:
Report on education roundtable: experimentaion in the computer science curriculum. Experimental Computer Science 2007: 9 - 2002
- [e3]Michael H. Goldwasser, David S. Johnson, Catherine C. McGeoch:
Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, Proceedings of a DIMACS Workshop, USA, 1999. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59, DIMACS/AMS 2002, ISBN 978-0-8218-2892-2 [contents] - 2000
- [c7]Catherine C. McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, Doina Precup:
Using Finite Experiments to Study Asymptotic Performance. Experimental Algorithmics 2000: 93-126
1990 – 1999
- 1999
- [j10]Catherine C. McGeoch, Bernard M. E. Moret:
How to present a paper on experimental work with algorithms. SIGACT News 30(4): 85-90 (1999) - [c6]Catherine C. McGeoch:
A bibliography of algorithm experimentation. Data Structures, Near Neighbor Searches, and Methodology 1999: 251-256 - [e2]Michael T. Goodrich, Catherine C. McGeoch:
Algorithm Engineering and Experimentation, International Workshop ALENEX '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers. Lecture Notes in Computer Science 1619, Springer 1999, ISBN 3-540-66227-8 [contents] - 1997
- [j9]Alfred V. Aho, David S. Johnson, Richard M. Karp, S. Rao Kosaraju, Catherine C. McGeoch, Christos H. Papadimitriou, Pavel A. Pevzner:
Emerging opportunities for theoretical computer science. SIGACT News 28(3): 65-74 (1997) - [c5]Catherine C. McGeoch, Paul R. Cohen:
How to Find Big-Oh in Your Data Set (and How Not To). AISTATS 1997: 347-354 - [c4]Catherine C. McGeoch, Doina Precup, Paul R. Cohen:
How to Find Big-Oh in Your Data Set (and How Not to). IDA 1997: 41-52 - 1996
- [j8]Catherine C. McGeoch:
Research in the Curriculum, and the Web. ACM Comput. Surv. 28(4es): 98 (1996) - [j7]Catherine C. McGeoch:
Feature Article - Toward an Experimental Method for Algorithm Simulation. INFORMS J. Comput. 8(1): 1-15 (1996) - [j6]Catherine C. McGeoch:
Rejoinder - Challenges in Algorithm Simulation. INFORMS J. Comput. 8(1): 27-28 (1996) - [j5]Catherine C. McGeoch:
Experimental Studies of Algorithms. Math. Syst. Theory 29(1): 3-4 (1996) - 1995
- [j4]Catherine C. McGeoch:
All-Pairs Shortest Paths and the Essential Subgraph. Algorithmica 13(5): 426-441 (1995) - [j3]Catherine C. McGeoch, J. D. Tygar:
Optimal Sampling Strategies for Quicksort. Random Struct. Algorithms 7(4): 287-300 (1995) - 1993
- [e1]David S. Johnson, Catherine C. McGeoch:
Network Flows And Matching, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 14-16, 1991. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 12, DIMACS/AMS 1993, ISBN 978-0-8218-6598-9 [contents] - 1992
- [j2]Catherine C. McGeoch:
Analyzing Algorithms by Simulation: Variance Reduction Techniques and Simulation Speedups. ACM Comput. Surv. 24(2): 195-212 (1992) - 1991
- [c3]Catherine C. McGeoch:
Appendix A: Electronically Available Materials. Network Flows And Matching 1991: 577-582 - [c2]David S. Johnson, Catherine C. McGeoch:
Preface. Network Flows And Matching 1991: xi-
1980 – 1989
- 1985
- [j1]Jon Louis Bentley, Catherine C. McGeoch:
Amortized Analyses of Self-Organizing Sequential Search Heuristics. Commun. ACM 28(4): 404-411 (1985) - 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 2025-07-02 18:53 CEST 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:
