CJTCS Volume 2010

Volume 2010

Published by the Department of Computer Science University of Chicago.

2010 Articles
- 1. Quantum Boolean Functions by Ashley Montanaro and Tobias J. Osborne. January 13, 2010.
- 2. Varieties Generated by Certain Models of Reversible Finite Automata by Marats Golovkins and Jean-Eric Pin. June 20, 2010.
- 3. $d$-collapsibility is NP-complete for $d \ge 4$ by Martin Tancer. June 21, 2010.
- 4. On Process Complexity by Adam R. Day.
  (Special Issue: Selected Papers from CATS 2009.)
- 5. On the Structure of Classes of Random Graphs by András Faragó.
  (Special Issue: Selected Papers from CATS 2009.)
- 6. Edge-Selection Heuristics for Computing Tutte Polynomials by David J. Pearce, Gary Haggard and Gordon Royle.
  (Special Issue: Selected Papers from CATS 2009.)
- 7. An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs by Wataru Matsubara, Shunsuke Inenaga and Ayumi Shinohara.
  (Special Issue: Selected Papers from CATS 2009.)
- 8. Longest Paths in Planar DAGs in Unambiguous Log-Space by Nutan Limaye, Meena Mahajan and Prajakta Nimbhorkar.
  (Special Issue: Selected Papers from CATS 2009.)
- 9. Transformation Rules for Z by Mark Utting, Petra Malik and Ian Toyn.
  (Special Issue: Selected Papers from CATS 2009.)
- 10. Type Checking and Inference for Polymorphic and Existential Types in Multiple-Quantifier and Type-Free Systems by Koji Nakazawa and Makoto Tatsutay.
  (Special Issue: Selected Papers from CATS 2009.)
- 11. An Algorithm for Affine Approximation of Binary Decision Diagrams by Kevin Henshall, Peter Schachte, Harald Søndergaard and Leigh Whiting.
  (Special Issue: Selected Papers from CATS 2009.)
- 12. Distributing Frequency-Dependent Data Stream Computations by Sumit Ganguly.
  (Special Issue: Selected Papers from CATS 2009.)
- 13. Single-Query Learning from Abelian and Non-Abelian Hamming Distance Oracles by David A. Meyer and James Pommersheim.
  August 5, 2010.
2010 Abstracts

Volume 2009
[back]

Published articles