% The Chicago Journal of Theoretical Computer Science, Volume 1995, Article 1
% Bibliography

@string{articleid="{\section*{}
  \textbf{References for CJTCS Volume 1995, Article 1}}"
}

@preamble{articleid}

@inproceedings{cj95-01-1,
  author={M. Ajtai and J. Komlos and E. Szemeredi},
  title={An \(\orderof{(n\log n)}\) sorting network},
  booktitle={Proceedings of the 15th ACM Symposium on Theory of Computing},
  organization={Association for Computing Machinery},
  year={1983},
  pages={1--9}
}

@inproceedings{cj95-01-2,
  author={R. Aleliunas and R. M. Karp and R. J. Lipton and
    L. Lovasz and C. Rackoff},
  title={Random walks, universal sequences and the complexity
    of maze problems},
  booktitle={Proceedings of the 20th Annual IEEE Symposium on the
    Foundations of Computer Science},
  organization={Institute of Electrical and Electronics Engineers},
  year={1979}
}

@inproceedings{cj95-01-3,
  author={Y. {Ben-Asher} and D. Peleg and A. Schuster},
  title={The Complexity of Reconfiguring Networks Models},
  booktitle={Proceedings of the Israel Symposium on the Theory
    of Computing and Systems},
  note={To appear in \emph{Information and Computation}},
  month={May},
  year={1992}
}

@article{cj95-01-4,
  author={A. Borodin and  S. A. Cook and  P. W. Dymond and W. L. Ruzzo and
    M. Tompa},
  title={Two applications of inductive counting for complementation problems},
  journal={SIAM Journal on Computing},
  year={1989},
  volume={18},
  number={3},
  pages={559--578}
}

@inproceedings{cj95-01-5,
  author={M. Grigni and M. Sipser},
  title={Monotone Separation of Logspace from \({NC}^1\)},
  booktitle={Annual Conference on Structure in Complexity Theory},
  year={1991}
}

@article{cj95-01-6,
  author={N. Immerman},
  title={Nondeterministic Space Is Closed under Complementation},
  journal={SIAM Journal on Computing},
  volume={17},
  year={1988}
}

@inproceedings{cj95-01-7,
  author={M. Karchmer and A. Wigderson},
  title={Monotone circuits for connectivity require
    super-logarithmic depth},
  booktitle={Proceedings of the 20th ACM Symposium on Theory of Computing},
  organization={Association for Computing Machinery},
  year={1988},
  pages={539--550}
}

@inproceedings{cj95-01-8,
  author={M. Karchmer and A. Wigderson},
  title={On Span Programs},
  booktitle={Annual Conference on Structure in Complexity Theory},
  year={1993}
}

@article{cj95-01-9,
  author={H. R. Lewis and C. H. Papadimitriou},
  title={Symmetric Space-Bounded Computation},
  journal={Theoretical Computer Science},
  volume={19},
  year={1982}
}

@inproceedings{cj95-01-10,
  author={N. Nisan},
  title={\({RL}\subseteq{SC}\)},
  booktitle={Proceedings of the 24th ACM Symposium on Theory of Computing},
  organization={Association for Computing Machinery},
  year={1992},
  pages={619--623}
}

@inproceedings{cj95-01-11,
  author={N. Nisan and E. Szemeredi and A. Wigderson},
  title={Undirected connectivity in
    \(\orderof{(\log^{1.5}n)}\) space},
  booktitle={Proceedings of the 33th IEEE Symposium on Foundations of Computer
    Science},
  organization={Institute of Electrical and Electronics Engineers},
  year={1992},
  pages={24--29}
}

@inproceedings{cj95-01-12,
  author={A. Razborov},
  title={Lower Bounds for Deterministic and Nondeterministic
    Branching Programs},
  booktitle={Fundamentals of Computation Theory: 8th International
    Conference, Lecture Notes in Computer Science,
    {\fontshape{n}\selectfont 529}},
  year={1991},
  publisher={Springer-Verlag},
  address={New York/Berlin},
  pages={47--60}
}

@inproceedings{cj95-01-13,
  author={J. H. Reif},
  title={Symmetric complementation},
  booktitle={Proceedings of the 14th ACM Symposium on Theory of Computing},
  organization={ACM SIGACT},
  year={1982},
  pages={201--214}
}

@article{cj95-01-14,
  author={L. Ruzzo and J. Simon and M. Tompa},
  title={Space-Bounded Hierarchies and Probabilistic Computations},
  journal={Journal of Computer and System Sciences},
  volume={28},
  pages={216--230},
  month={April},
  year={1984}
}

@article{cj95-01-15,
  author={S. Skyum and L. Valiant},
  title={A Complexity Theory Based on Boolean Algebra},
  journal={Journal of the ACM},
  year={1985}
}

@article{cj95-01-16,
  author={R. Szelepcsenyi},
  title={The Method of Forced Enumeration for Nondeterministic Automata},
  journal={Acta Informatica},
  volume={26},
  year={1988}
}