NP-Complete Problems in Cellular Automata. - Frederic Green (Complex Syst., 1987)

An Oracle Separating +P From PPph. - Frederic Green (SCT, 1990)

An Oracle Separating oplus P from PP^PH. - Frederic Green (Inf. Process. Lett., 1991)

The Power of the Middle Bit. - Frederic Green; Johannes Köbler; Jacobo Torán (SCT, 1992)

On the Power of Deterministic Reductions to C=P. - Frederic Green (Math. Syst. Theory, 1993)

Lower Bounds for Depth-Three Circuits With Equals and Mod-Gates. - Frederic Green (STACS, 1995)

Lower Bounds for Circuits with Mod Gates and One Exact Threshold Gate - Frederic Green (Electron. Colloquium Comput. Complex., 1995)

The Power of the Middle Bit of a #P Function. - Frederic Green; Johannes Köbler; Kenneth W. Regan; Thomas Schwentick; Jacobo Torán (J. Comput. Syst. Sci., 1995)

A Lower Bound for Monotone Perceptrons. - Frederic Green (Math. Syst. Theory, 1995)

On the Correlation of Symmetric Functions. - Jin-yi Cai; Frederic Green; Thomas Thierauf (Math. Syst. Theory, 1996)

Complements of Multivalued Functions. - Stephen A. Fenner; Frederic Green; Steven Homer; Alan L. Selman; Thomas Thierauf; Heribert Vollmer (Chic. J. Theor. Comput. Sci., 1999)

Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy - Stephen A. Fenner; Frederic Green; Steven Homer; Randall J. Pruim (Electron. Colloquium Comput. Complex., 1999)

Exponential Sums and Circuits with a Single Threshold Gate and Mod-Gates. - Frederic Green (Theory Comput. Syst., 1999)

On the Complexity of Quantum ACC. - Frederic Green; Steven Homer; Chris Pollett (CCC, 2000)

A complex-number Fourier technique for lower bounds on the Mod-m degree. - Frederic Green (Comput. Complex., 2000)

Relativized separation of EQP from PNP. - Frederic Green; Randall J. Pruim (Inf. Process. Lett., 2001)

Counting, fanout and the complexity of quantum ACC. - Frederic Green; Steven Homer; Cristopher Moore; Christopher Pollett (Quantum Inf. Comput., 2002)

The correlation between parity and quadratic polynomials mod 3. - Frederic Green (J. Comput. Syst. Sci., 2004)

Bounds on the Power of Constant-Depth Quantum Circuits. - Stephen A. Fenner; Frederic Green; Steven Homer; Yong Zhang 053 (FCT, 2005)

Quantum lower bounds for fanout. - M. Fang; Stephen A. Fenner; Frederic Green; Steven Homer; Yong Zhang 053 (Quantum Inf. Comput., 2006)

Uniqueness of Optimal Mod 3 Circuits for Parity. - Frederic Green; Amitabha Roy 001 (Algebraic Methods in Computational Complexity, 2007)

Small depth quantum circuits. - Debajyoti Bera; Frederic Green; Steven Homer (SIGACT News, 2007)

Review of "Mathematics of Physics and Engineering by Edward K. Blum and Sergey V. Lototsky, " World Scientific. - Frederic Green (SIGACT News, 2007)

Universal Quantum Circuits. - Debajyoti Bera; Stephen A. Fenner; Frederic Green; Steven Homer (Electron. Colloquium Comput. Complex., 2008)

Efficient universal quantum circuits. - Debajyoti Bera; Stephen A. Fenner; Frederic Green; Steven Homer (Quantum Inf. Comput., 2010)

In Brute-Force Search of Correlation Bounds for Polynomials. - Frederic Green; Daniel Kreymer; Emanuele Viola (Electron. Colloquium Comput. Complex., 2011)

Review quantum computing since democritus by Scott Aaronson. - Frederic Green (SIGACT News, 2013)

Review of: Incredible Numbers by Ian Stewart. - Frederic Green (SIGACT News, 2015)

Circuit Complexity of Powering in Fields of Odd Characteristic. - Arkadev Chattopadhyay; Frederic Green; Howard Straubing (Chic. J. Theor. Comput. Sci., 2016)

Review of: The Nature of Computation by Cristopher Moore and Stephan Mertens. - Frederic Green (SIGACT News, 2016)

Review of: Primality Testing for Beginners by Lasse Rempe-Gillen and Rebecca Waldecker. - Frederic Green (SIGACT News, 2016)

Review of: Quantum Algorithms via Linear Algebra by Richard J. Lipton and Kenneth W. Regan. - Frederic Green (SIGACT News, 2016)

Review of: The Fascinating World of Graph Theory by Arthur Benjamin, Gary Chartrand and Ping Zhang. - Frederic Green (SIGACT News, 2016)

Block-symmetric polynomials correlate with parity better than symmetric. - Frederic Green; Daniel Kreymer; Emanuele Viola (Comput. Complex., 2017)

Review of Art in the Life of Mathematicians by Anna Kepes Szemerédi. - Frederic Green (SIGACT News, 2017)

Review of Quantum Walks and Search Algorithms by Renato Portugal. - Frederic Green (SIGACT News, 2017)

Joint Review of The Magic of Math by Arthur Benjamin and How to Bake by Eugenia Cheng. - Frederic Green (SIGACT News, 2017)

Review of Set Theory: A First Course by Daniel W. Cunningham. - Frederic Green (SIGACT News, 2017)

The Book Review Column. - Frederic Green (SIGACT News, 2017)

Fixed-Parameter Extrapolation and Aperiodic Order: Open Problems. - Stephen A. Fenner; Frederic Green; Steven Homer (SIGACT News, 2018)

Joint Review of Quadratic Residues and Non-Residues by Steve Wright and The Quadratic Reciprocity Law by Oswald Baumgart Edited and translated by Franz Lemmermeyer. - Frederic Green (SIGACT News, 2018)

Review of Number Theory: An Introduction via the Density of Primes, second edition. - Frederic Green (SIGACT News, 2019)

Review of Modern Cryptography and Elliptic Curves, A Beginner's Guide by Thomas R. Shemanske. - Frederic Green (SIGACT News, 2019)

Review of Handbook of Graph Theory, Combinatorial Optimization, and Algorithms. - Frederic Green (SIGACT News, 2019)

The Book Review Column1. - Frederic Green (SIGACT News, 2020)

Review of Forbidden Configurations in Discrete Geometry by David Eppstein. - Frederic Green (SIGACT News, 2020)

Review of A Short Course in Computational Geometry and Topology by Herbert Edelsbrunner. - Abdulai Gassama; Frederic Green (SIGACT News, 2021)

Review of Mathematics and Computation by Avi Wigderson. - Frederic Green (SIGACT News, 2021)

Review of Three Lectures on Complexity and Black Holes by Leonard Susskind. - Frederic Green (SIGACT News, 2021)

Review of Complexity Dichotomies for Counting Problems Volume 1: Boolean Domain by Jin-Yi Cai and Xi Chen. - Frederic Green (SIGACT News, 2022)

Review of "Mathematical Muffin Morsels - Nobody wants a small piece by William Gasarch, Erik Metz, Jacob Prinz, and Daniel Smolyak World Scientific, 2021 210 pages, Softcover, $59.99.". - Frederic Green (SIGACT News, 2022)

Review of Feasible Computations and Provable Complexity Properties by Juris Hartmanis. - Frederic Green (SIGACT News, 2022)