Catherine C. McGeoch
According to our database^{1},
Catherine C. McGeoch
authored at least 28 papers
between 1984 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at www.acm.org

at orcid.org

at dl.acm.org
On csauthors.net:
Bibliography
2019
Practical AnnealingBased Quantum Computing.
IEEE Computer, 2019
2017
Principles and Guidelines for Quantum Performance Analysis.
Proceedings of the Quantum Technology and Optimization Problems, 2017
2016
Experimental Methods for Algorithm Analysis.
Encyclopedia of Algorithms, 2016
In Memoriam: David S. Johnson.
ACM Journal of Experimental Algorithmics, 2016
2014
Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice
Synthesis Lectures on Quantum Computing, Morgan & Claypool Publishers, 2014
Algorithm engineering for a quantum annealing platform.
CoRR, 2014
2013
Experimental evaluation of an adiabiatic quantum system for combinatorial optimization.
Proceedings of the Computing Frontiers Conference, 2013
2012
A Guide to Experimental Algorithmics.
Cambridge University Press, ISBN: 9780521173018, 2012
2010
Preface.
ACM Journal of Experimental Algorithmics, 2010
2008
Experimental Methods for Algorithm Analysis.
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
2007
Experimental algorithmics.
Commun. ACM, 2007
Report on education roundtable: experimentaion in the computer science curriculum.
Proceedings of the Workshop on Experimental Computer Science, 2007
2000
Using Finite Experiments to Study Asymptotic Performance.
Proceedings of the Experimental Algorithmics, 2000
1999
How to present a paper on experimental work with algorithms.
SIGACT News, 1999
A bibliography of algorithm experimentation.
Proceedings of the Data Structures, 1999
1997
Emerging opportunities for theoretical computer science.
SIGACT News, 1997
How to Find BigOh in Your Data Set (and How Not to).
Proceedings of the Advances in Intelligent Data Analysis, 1997
1996
Experimental Studies of Algorithms.
Mathematical Systems Theory, 1996
Rejoinder  Challenges in Algorithm Simulation.
INFORMS Journal on Computing, 1996
Feature Article  Toward an Experimental Method for Algorithm Simulation.
INFORMS Journal on Computing, 1996
Research in the Curriculum, and the Web.
ACM Comput. Surv., 1996
1995
Optimal Sampling Strategies for Quicksort.
Random Struct. Algorithms, 1995
AllPairs Shortest Paths and the Essential Subgraph.
Algorithmica, 1995
1992
Analyzing Algorithms by Simulation: Variance Reduction Techniques and Simulation Speedups.
ACM Comput. Surv., 1992
1991
Appendix A: Electronically Available Materials.
Proceedings of the Network Flows And Matching, 1991
Preface.
Proceedings of the Network Flows And Matching, 1991
1985
Amortized Analyses of SelfOrganizing Sequential Search Heuristics.
Commun. ACM, 1985
1984
Some Unexpected Expected Behavior Results for Bin Packing
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984