Published by the Department of Computer Science University of Chicago.

• 2014 Articles
  • 1. Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem by Thomas Watson
  • 2. Reachability in K_{3,3}-free and K_5-free Graphs is in Unambiguous Logspace by Thomas Thierauf and Fabian Wagner
  • 3. Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction by Mark Huber
  • 4. Quantum Adversary Lower Bound for Element Distinctness with Small Range by Ansis Rosmanis
  • 5. Complexity of Testing Reachability in Matroids by B. V. Raghavendra Rao and Jayalal Sarma
  • 6. A composition theorem for decision tree complexity by Ashley Montanaro
  • 7. Computing in Permutation Groups Without Memory by Peter J. Cameron, Ben Fairbairn and Maximilien Gadouleau
  • 8. Computing in Matrix Groups Without Memory by Peter J. Cameron, Ben Fairbairn and Maximilien Gadouleau
  • 9. A Note on Subspace Evasive Sets by Avraham Ben-Aroya, and Igor Shinkar
  • 10. Simpler Exact Leader Election via Quantum Reduction by Hirotada Kobayashi, Keiji Matsumoto, and Seiichiro Tani
• 2014 Abstracts

Volume 2013

Published articles