% The Chicago Journal of Theoretical Computer Science, Volume 1996, Article 2
% Bibliography

@Article{cj96-02-01,
  author =       {C. {\`{A}}lvarez and B. Jenner},
  title =        {A very hard log-space counting class},
  journal =      {Theoretical Computer Science},
  year =         {1993},
  volume =       {107},
  pages =        {3--30}
}

@Article{cj96-02-02,
  author =       {L. Berman and J. Hartmanis},
  title =        {On isomorphisms and density of {NP} and other complete
                 sets},
  journal =      {SIAM Journal on Computing},
  volume =       {6},
  number =       {2},
  pages =        {305--322},
  year =         {1977}
}

@Article{cj96-02-03,
  author =       {G. Buntrock and C. Damm and U. Hertrampf and C.
                 Meinel},
  title =        {Structure and importance of {Logspace-MOD} class},
  journal =      {Mathematical Systems Theory},
  volume =       {25},
  year =         {1992},
  pages =        {223--237}
}

@TechReport{cj96-02-04,
  author =       {J. Cai and A. Naik and D. Sivakumar},
  title =        {On the existence of hard sparse sets under weak
                 reductions},
  institution =  {Department of Computer Science, State University of
                 New York at Buffalo},
  address =      {Buffalo, NY},
  month =        {July},
  year =         {1995},
  number =       {95-31},
  type =         {Technical Report}
}

@InProceedings{cj96-02-05,
  author =       {J. Cai and D. Sivakumar},
  title =        {The resolution of a {Hartmanis} conjecture},
  booktitle =    {Proceedings of the 36th Conference on Foundations of
                 Computer Science},
  publisher =    {IEEE Computer Society Press},
  address =      {Los Alamitos, CA},
  pages =        {362--371},
  year =         {1995}
}

@Article{cj96-02-06,
  author =       {L. Goldschlager and I. Parberry},
  title =        {On the construction of parallel computers from various
                 bases of {Boolean} functions},
  journal =      {Theoretical Computer Science},
  volume =       {43},
  pages =        {43--58},
  year =         {1986}
}

@Article{cj96-02-07,
  author =       {J. Hartmanis},
  title =        {On log-tape isomorphisms of complete sets},
  journal =      {Theoretical Computer Science},
  volume =       {7},
  number =       {3},
  pages =        {273--286},
  year =         {1978}
}

@Article{cj96-02-08,
  author =       {L. Hemaspaandra and M. Ogihara and S. Toda},
  title =        {Space-efficient recognition of sparse self-reducible
                 languages},
  journal =      {Computational Complexity},
  volume =       {4},
  pages =        {262--296},
  year =         {1994}
}

@Article{cj96-02-09,
  author =       {R. Ladner},
  title =        {The circuit value problem is log space complete for
                 {P}},
  journal =      {SIGACT News},
  volume =       {7},
  number =       {1},
  pages =        {18--20},
  year =         {1975}
}

@Article{cj96-02-10,
  author =       {S. Mahaney},
  title =        {Sparse complete sets for {NP}: solution of a
                 conjecture of {Berman} and {Hartmanis}},
  journal =      {Journal of Computer and System Sciences},
  volume =       {25},
  number =       {2},
  pages =        {130--143},
  year =         {1982}
}

@InProceedings{cj96-02-11,
  author =       {C. Papadimitriou and S. Zachos},
  title =        {Two remarks on the power of counting},
  booktitle =    {Proceedings of the 6th GI Conference on Theoretical
                 Computer Science},
  pages =        {269--276},
  publisher =    {Springer-Verlag},
  address =      {Berlin},
  series =	 {Lecture Notes in Computer Science},
  volume =       {145},
  year =         {1983}
}

@Article{cj96-02-12,
  author =       {W. Savitch},
  title =        {Relationships between nondeterministic and
                 deterministic tape complexities},
  journal =      {Journal of Computer and System Sciences},
  volume =       {4},
  pages =        {177--192},
  year =         {1970}
}

@TechReport{cj96-02-13,
  author =       {D. van Melkebeek},
  title =        {On reductions of {P} sets to sparse sets},
  month =        {August},
  type =         {Technical Report},
  institution =  {Department of Computer Science, University of
                 Chicago},
  number =       {TR95-06},
  address =      {Chicago, IL},
  year =         {1995}
}