Evasive random walks and the clairvoyant demon. - Aaron Abrams; Henry Landau; Zeph Landau; James Pommersheim; Eric Zaslow (Random Struct. Algorithms, 2002)

Finding stable models via quantum computation. - David A. Meyer 001; James Pommersheim; Jeffrey B. Remmel (NMR, 2004)

Single-Query Learning from Abelian and Non-Abelian Hamming Distance Oracles. - David A. Meyer 001; James Pommersheim (Chic. J. Theor. Comput. Sci., 2010)

The geometry of quantum learning. - Markus Hunziker; David A. Meyer 001; Jihun Park; James Pommersheim; Mitch Rothstein (Quantum Inf. Process., 2010)

Multi-query Quantum Sums. - David A. Meyer 001; James Pommersheim (TQC, 2011)

On the uselessness of quantum queries. - David A. Meyer 001; James Pommersheim (Theor. Comput. Sci., 2011)

Distributions of Order Patterns of Interval Maps. - Aaron Abrams; Eric Babson; Henry Landau; Zeph Landau; James Pommersheim (Comb. Probab. Comput., 2013)

Spaces of Polygonal Triangulations and Monsky Polynomials. - Aaron Abrams; James Pommersheim (Discret. Comput. Geom., 2014)

Single-query quantum algorithms for symmetric problems. - Orest Bucicovschi; Daniel Copeland; David A. Meyer 001; James Pommersheim (Quantum Inf. Comput., 2016)

Quantum query complexity of symmetric oracle problems. - Daniel Copeland; Jamie Pommersheim (Quantum, 2021)

On Eigenvalue Gaps of Integer Matrices. - Aaron Abrams; Zeph Landau; Jamie Pommersheim; Nikhil Srivastava (CoRR, 2022)

Generalized Dissections and Monsky's Theorem. - Aaron Abrams; Jamie Pommersheim (Discret. Comput. Geom., 2022)