@string{abs-ams = "Abs. Amer. Math. Soc."}
@string{beatcs = "Bull. EATCS"}
@string{bull-ams = "Bull. Amer. Math. Soc."}
@string{cacm = "Comm. Assn. Comp. Mach."}
@string{compcomp = "Computational Complexity"}
@string{ieeetc = "IEEE Trans. Comput."}
@string{ijcm = "Intern. J. Comp. Math."}
@string{ijfcs = "Intern. J. Found. Comp. Sci."}
@string{infcomp = "Inform. and Comp."}
@string{infcon = "Inform. and Control"}
@string{ipl = "Inf. Proc. Lett."}
@string{itit = "IEEE Trans. Info. Thy."}
@string{itnn = "IEEE Trans. Neural Networks"}
@string{jacm = "J. Assn. Comp. Mach."}
@string{jalg = "J. Alg"}
@string{jcta = "J. Comb. Thy. Ser. A"}
@string{jctb = "J. Comb. Thy. Ser. B"}
@string{jcss = "J. Comp. Sys. Sci."}
@string{jpdc = "J. Par. Dist. Comp."}
@string{jsl = "J. Symb. Logic"},
@string{lms = "London Math. Soc."}
@string{lncs = "Lect. Notes in Comp. Sci."},
@string{lnm = "Lect. Notes in Math."}
@string{mathann = "Math. Annalen"}
@string{mathsys = "Math. Sys. Thy."}
@string{mst = "Math. Sys. Thy."}
@string{sicomp = "SIAM J. Comput."}
@string{sigact = "SIGACT News"}
@string{sjdm = "SIAM J. Disc. Math."}
@string{springer = "Springer Verlag"}
@string{tcs = "Theor. Comp. Sci."}
@string{trans-ams = "Trans. Amer. Math. Soc."}
@string{zml = "Zeitschrift {f\"ur} Mathematische Logik und Grundlagen der
Mathematik"}
@string{unpub-mss = "Unpublished manuscript"}
@string{ieee = "IEEE"}
@string{acm = "ACM"}
@string{wcsl = "Workshop on Computer Science Logic"}
@string{afocs = "Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, California"}
@string{astoc = "Annual ACM Symposium on the Theory of Computing, ACM Press, New York"}
@string{aicalp = "Annual International Conference on Automata, Languages, and Programming"}
@string{astacs = "Annual Symposium on Theoretical Aspects of Computer Science"}
@string{aicci = "Annual International Conference on Computers and Information"}
@string{astructures = "Annual IEEE Conference on Structure in Complexity Theory, IEEE Computer Society Press, Los Alamitos, California"}
@string{alics = "Annual IEEE Conference on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos, California"}
@string{ifct = "International Conference on Fundamentals of Computation Theory"}
@string{afsttcs = "Annual Conference on Foundations of Software Technology and Theoretical Computer Science"}
@string{imfcs = "International Symposium on Mathematical Foundations of Computer
Science"}
@string{acolt = "Annual ACM Workshop on Computational Learning Theory, ACM Press, New York"}
@string{ilfcs = "International Symposium on Logical Foundations of Computer
Science"}
@string{aisaac = "Annual International Symposium on Algorithms and
Computation"}
@string{sCSL = "CSL"}
@string{sFOCS = "FOCS"}
@string{sSTOC = "STOC"}
@string{sICALP = "ICALP"}
@string{sSTACS = "STACS"}
@string{sICCI = "ICCI"}
@string{sStructures = "Structures"}
@string{sLICS = "LICS"}
@string{sFCT = "FCT"}
@string{sFSTTCS = "FSTTCS"}
@string{sMFCS = "MFCS"}
@string{sCOLT = "COLT"}
@string{sLFCS = "LFCS"}
@string{sISAAC = "ISAAC"}
% @string{csl = sCSL}
% @string{focs = sFOCS}
% @string{stoc = sSTOC}
% @string{icalp = sICALP}
% @string{stacs = sSTACS}
% @string{icci = sICCI}
% @string{structures = sStructures}
% @string{lics = sLICS}
% @string{fct = sFCT}
% @string{fsttcs = sFSTTCS}
% @string{mfcs = sMFCS}
% @string{colt = sCOLT}
% @string{lfcs = slfcs}
% @string{isaac = sISAAC}
@string{csl = wcsl}
@string{focs = afocs}
@string{stoc = astoc}
@string{icalp = aicalp}
@string{stacs = astacs}
@string{icci = aicci}
@string{structures = astructures}
@string{lics = alics}
@string{fct = ifct}
@string{fsttcs = afsttcs}
@string{mfcs = imfcs}
@string{colt = acolt}
@string{lfcs = ilfcs}
@string{isaac = aisaac}
@string{proc1 = "Proc. 1st "}
@string{proc2 = "Proc. 2nd "}
@string{proc3 = "Proc. 3rd "}
@string{proc4 = "Proc. 4th "}
@string{proc5 = "Proc. 5th "}
@string{proc6 = "Proc. 6th "}
@string{proc7 = "Proc. 7th "}
@string{proc8 = "Proc. 8th "}
@string{proc9 = "Proc. 9th "}
@string{proc10 = "Proc. 10th "}
@string{proc11 = "Proc. 11th "}
@string{proc12 = "Proc. 12th "}
@string{proc13 = "Proc. 13th "}
@string{proc14 = "Proc. 14th "}
@string{proc15 = "Proc. 15th "}
@string{proc16 = "Proc. 16th "}
@string{proc17 = "Proc. 17th "}
@string{proc18 = "Proc. 18th "}
@string{proc19 = "Proc. 19th "}
@string{proc20 = "Proc. 20th "}
@string{proc21 = "Proc. 21st "}
@string{proc22 = "Proc. 22nd "}
@string{proc23 = "Proc. 23rd "}
@string{proc24 = "Proc. 24th "}
@string{proc25 = "Proc. 25th "}
@string{proc26 = "Proc. 26th "}
@string{proc27 = "Proc. 27th "}
@string{proc28 = "Proc. 28th "}
@string{proc29 = "Proc. 29th "}
@string{proc30 = "Proc. 30th "}
@string{proc31 = "Proc. 31st "}
@string{proc32 = "Proc. 32nd "}
@string{proc33 = "Proc. 33rd "}
@string{proc34 = "Proc. 34th "}
@string{proc35 = "Proc. 35th "}
@string{proc36 = "Proc. 36th "}
@inproceedings{Aan93,
author = {S. Aanderaa},
title = {A universal Turing machine},
booktitle = proc6 # csl,
series = lncs,
volume = {702},
publisher = springer,
year = {1993},
pages = {1--4}
}
@inproceedings{Abr86,
author = {K. Abrahamson},
title = {Time-space tradeoffs for branching programs
compared with those for straight line programs},
booktitle = proc27 # focs,
year = {1986},
pages = {402--409}
}
@article{Abr87,
author = {K. Abrahamson},
title = {Generalized string matching},
journal = sicomp,
volume = {16},
year = {1987},
pages = {1039--1051}
}
@article{ADKP89,
author = {K. Abrahamson and N. Dadoun and D. Kirkpatrick and
T. Przytycka},
title = {A simple parallel tree contraction algorithm},
journal = {Journal of Algorithms},
volume = {10},
year = {1989},
pages = {287--302}
}
@inproceedings{Abr90,
author = {K. Abrahamson},
title = {A time-space tradeoff for {B}oolean matrix multiplication},
booktitle = proc31 # focs,
year = {1990},
pages = {412--419}
}
@article{Abr91,
author = {K. Abrahamson},
title = {Time-space tradeoffs for algebraic problems on
general sequential machines},
journal = jcss,
volume = {43},
year = {1991},
pages = {269--289}
}
@article{AbFe92,
author = {K. Abrahamson and M. Fellows},
title = {Finite automata, bounded treewidth, and well-quasiordering},
journal = {Contemporary Mathematics},
volume = {nnn},
year = {1992},
pages = {nnn--nnn}
}
@misc{ADF92,
author = {K. Abrahamson and R. Downey and M. Fellows},
title = {Fixed-parameter tractability and completeness {IV}:
Completeness for {W[P]} and {P-Space} analogs},
year = {1992}
}
@inproceedings{ADF93,
author = {K. Abrahamson and R. Downey and M. Fellows},
title = {Fixed-parameter intractability {II}:
On completeness for {W[1]}},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {374--385}
}
@inproceedings{ADF93II,
author = {K. Abrahamson and R. Downey and M. Fellows},
title = {Fixed-parameter tractability and completeness {II}:
On completeness for {W[1]}},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {374--385}
}
@article{ADFIV,
author = {K. Abrahamson and R. Downey and M. Fellows},
title = {Fixed-parameter tractability and completeness {IV}:
Completeness for {W[P]} and {PSPACE} analogs},
journal = {Annals of Pure and Applied Logic},
year = {1995},
note = {to appear}
}
@inproceedings{AEFM89,
author = {K. Abrahamson and J. Ellis and M. Fellows and M. Mata},
title = {On the complexity of fixed-parameter problems},
booktitle = proc30 # focs,
year = {1989},
pages = {210--215},
note = {Final version to appear in {\it J. Comput. Sys. Sci.}}
}
@techreport{AbFe92,
author = {K. Abrahamson and M. Fellows},
title = {Finite automata, bounded treewidth, and well-quasiordering},
institution = {University of British Columbia, Computer
Science Department},
year = {1992}
}
@article{AdIw84,
author = {A. Adachi and S. Iwata},
title = {Some combinatorial game problems require {$\Omega(n^k)$} time},
journal = jacm,
volume = {31},
year = {1984},
pages = {361--376}
}
@article{ATT92,
author = {E. Adamides and Ph. Tsalides and A. Thanailakis},
title = {Hierarchical cellular automata structures},
journal = {Parallel Computing},
volume = {18},
year = {1992},
pages = {517--524}
}
@INPROCEEDINGS{AdMa77,
AUTHOR = {L. Adleman and K. Manders},
TITLE = {Reducibility, randomness, and intractability},
BOOKTITLE = proc9 # stoc,
YEAR = {1977},
PAGES = {151--163}
}
@inproceedings{AdMa79,
AUTHOR = {L. Adleman and K. Manders},
TITLE = {Reductions that lie},
booktitle = proc20 # focs,
year = {1979},
pages = {397--410}
}
1992 1512 LNMATH Adleman & Huang, Primality Testing and Abelian Varieties
Over Finite Fields
@incollection{AdHu92,
author = {L. Adleman and M.-D. Huang},
title = {Primality testing and {A}belian varieties over finite fields},
booktitle = {},
series = lnm,
volume = {1512},
publisher = springer,
pages = {nnn--nnn}
}
@inproceedings{AgCh88,
author = {A. Aggarwal and A. Chandra},
title = {Virtual memory algorithms},
BOOKTITLE = proc20 # stoc,
year = {1988},
pages = {173--185}
}
@INPROCEEDINGS{AACS87,
AUTHOR = {A. Aggarwal and B. Alpern and A. Chandra and M. Snir},
TITLE = {A model for hierarchical memory},
BOOKTITLE = proc19 # stoc,
YEAR = {1987},
PAGES = {305--314}
}
@INPROCEEDINGS{ACS87,
AUTHOR = {A. Aggarwal and A. Chandra and M. Snir},
TITLE = {Hierarchical memory with block transfer},
BOOKTITLE = proc28 # focs,
YEAR = {1987},
PAGES = {204--216}
}
@article{ACS90,
author = {A. Aggarwal and A. Chandra and M. Snir},
title = {Communication complexity of {PRAMs}},
journal = tcs,
volume = {71},
year = {1990},
pages = {3--28}
}
@ARTICLE{AgVi88,
AUTHOR = {A. Aggarwal and J. Vitter},
TITLE = {The input-output complexity of sorting and related problems},
JOURNAL = cacm,
VOLUME = {31},
YEAR = {1988},
PAGES = {1116--1127}
}
@inproceedings{AMV88,
author = {G. Agnew and R. Mullin and S. Vanstone},
title = {Fast exponentialtion in {$GF(2^n)$}},
booktitle = {Proceedings, Advances in Cryptology: Eurocrypt '88},
series = lncs,
volume = {330},
publiher = springer,
year = {1988},
pages = {251--255}
}
@inproceedings{AgBi93,
author = {M. Agrawal and S. Biswas},
title = {Polynomial isomorphism of {1-L} complete sets},
booktitle = proc8 # structures,
year = {1993},
pages = {75--80}
}
@inproceedings{Agr94,
author = {M. Agrawal},
title = {On the isomorphism problem for weak reductions (extended
abstract)},
booktitle = proc9 # structures,
year = {1994},
pages = {338--355}
}
@inproceedings{AgAr95,
author = {M. Agrawal and V. Arvind},
title = {Reductions of self-reducible sets to depth-1 weighted
threshold circuit classes, and sparse sets},
booktitle = proc10 # structures,
year = {1995},
pages = {264--276}
}
@article{AhDu89,
author = {R. Ahlswede and G. Dueck},
title = {Identification via channels},
journal = itit,
volume = {35},
year = {1989},
pgaes = {15--29}
}
@article{AhDu89b,
author = {R. Ahlswede and G. Dueck},
title = {Identification in the presence of feedback---a discovery
of new capacity formulas},
journal = itit,
volume = {35},
year = {1989},
pgaes = {30--36}
}
@article{AhCs93,
author = {R. Ahlswede and I. Csisz{\`a}r},
title = {Common randomness in information theory and
cryptography---part {I}: Secret sharing},
journal = itit,
volume = {39},
year = {1993},
pages = {1121--1132}
}
@book{AHU74,
author = {A. Aho and J. Hopcroft and J. Ullman},
title = {The Design and Analysis of Computer Algorithms},
publisher = {Addison-Wesley},
address = {Reading, Mass.},
year = {1974}
}
@INCOLLECTION{Aho90,
AUTHOR = {A. Aho},
TITLE = {Algorithms for finding patterns in strings},
BOOKTITLE = {Handbook of Theoretical Computer Science},
volume = {A},
EDITOR = {J. Van Leeuwen},
PUBLISHER = {Elsevier and MIT Press},
YEAR = {1990},
PAGES = {}
}
@inproceedings{AKS83,
author = {M. Ajtai and J. Komlos and E. Szemer{\'e}di},
title = {An {$O(n \log n)$} sorting network},
booktitle = proc15 # stoc,
year = {1983},
pages = {1--9}
}
@inproceedings{AjBe84,
author = {M. Ajtai and M. {Ben-Or}},
title = {A theorem on probabilistic constant-depth circuits},
booktitle = proc16 # stoc,
year = {1984},
pages = {471--474}
}
@inproceedings{Ajt88,
author = {M. Ajtai},
title = {The complexity of the pigeonhole principle},
booktitle = proc29 # focs,
year = {1988},
pages = {346--355}
}
@incollection{AKSS89,
author = {M. Ajtai and J. Koml{\'o}s and W. Steiger and
E. Szemer{\'e}di},
title = {Almost sorting in one round},
booktitle = {Randomness and Computation},
series = {Advances in Computing Research},
volume = {5},
editor = {S. Micali},
publisher = {JAI Press},
address = {Greenwich, CT, USA},
year = {1989},
pages = {117--125}
}
@article{AjFa90,
author = {M. Ajtai and R. Fagin},
title = {Reachability is harder for directed than for undirected
finite graphs},
journal = jsl,
volume = {55},
year = {1990},
pages = {113--150}
}
@article{Ajt94,
author = {M. Ajtai},
title = {The complexity of the pigeonhole principle},
journal = {Combinatorica},
volume = {14},
year = {1994},
pages = {417--433}
}
@inproceedings{AKLLR79,
author = {R. Aleliunas and R. Karp and R. Lipton and L. Lovasz
and C. Rackoff},
title = {Random walks, universal traversal sequences,
and the complexity of maze problems},
booktitle = proc20 # focs,
year = {1979},
pages = {218--223}
}
@article{Allen91,
author = {W. Allen},
title = {Arithmetizing uniform {NC}},
journal = {Annals of Pure and Applied Logic},
volume = {53},
year = {1991},
pages = {1--50}
}
@article{All88,
author = {E. Allender},
title = {Isomorphisms and {1-L} reductions},
journal = jcss,
volume = {36},
year = {1988},
pages = {336--350}
}
@inproceedings{All89,
author = {E.~Allender},
title = {A note on the power of threshold circuits},
booktitle = proc30 # focs,
year = {1989},
pages = {580--584}
}
@techreport{All89b,
author = {E. Allender},
title = {Limitations of the upward separation technique},
institution = {Rutgers University},
number = {LCSR-TR-133},
year = {1989}
}
@article{All89c,
author = {E. Allender},
title = {Some consequences of the existence of pseudorandom
generators},
journal = jcss,
volume = {39},
year = {1989},
pages = {101--124}
}
@techreport{AlWi89,
author = {E. Allender and C. Wilson},
title = {Downward translations of equality},
institution = {Rutgers University},
number = {DCS-TR-258},
year = {1989}
}
@inproceedings{AlHe90,
author = {E. Allender and U. Hertrampf},
title = {On the power of uniform families of constant-depth
circuits},
booktitle = proc15 # mfcs,
publisher = springer,
series = lncs,
volume = {452},
year = {1990},
pages = {158--164}
}
@ARTICLE{AlWa90,
AUTHOR = {E. Allender and K. Wagner},
TITLE = {Counting Hierarchies: Polynomial Time and Constant Depth
Circuits},
JOURNAL = beatcs,
YEAR = {1990},
VOLUME = {40},
PAGES = {182--194},
MONTH = {February}
}
@article{AlWi90,
author = {E. Allender and C. Wilson},
title = {Downward translations of equality},
journal = tcs,
volume = {75},
year = {1990},
pages = {nnn--nnn}
}
@techreport{AlGo90,
author = {E. Allender and V. Gore},
title = {On strong separations from {$AC^0$}},
institution = {DIMACS},
number = {Tech. Report 90-32},
year = {1990}
}
@inproceedings{AlGo91,
author = {E. Allender and V. Gore},
title = {On strong separations from {$AC^0$}},
booktitle = proc8 # fct,
publisher = springer,
series = lncs,
volume = {529},
year = {1991},
pages = {1--15},
note = {To appear in the {DIMACS} Special Year volume, ed.\
J.-Y. Cai, {AMS} Publications}
}
@article{AlGo91b,
author = {E. Allender and V. Gore},
title = {Rudimentary reductions revisited},
journal = ipl,
volume = {40},
year = {1991},
pages = {89--95}
}
@article{All91,
author = {E. Allender},
title = {Limitations of the upward separation technique},
journal = mst,
volume = {24},
year = {1991},
pages = {nnn-nnn}
}
@techreport{AlGo92,
author = {E. Allender and V. Gore},
title = {A uniform circuit lower bound for the permanent},
institution = {DIMACS},
number = {Tech. Report 92-30},
year = {1992}
}
@inproceedings{ABI93,
author = {E. Allender and J. Balc{\'a}zar and N. Immerman},
title = {A first-order isomorphism theorem},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {163--174}
}
@techreport{ABI93tr,
author = {E. Allender and J. Balc{\'a}zar and N. Immerman},
title = {A first-order isomorphism theorem},
institution = {DIMACS},
number = {Tech. Report 93-20},
year = {1993}
}
@article{ABHH93,
author = {E. Allender and R. Beigel and U. Hertarmpf and S. Homer},
title = {Almost-everywhere complexity hierarchies for
nondeterministic time},
journal = tcs,
volume = {115},
year = {1993},
pages = {225--241}
}
@article{AlHe93,
author = {E. Allender and U. Hertrampf},
title = {Depth reduction for circuits of unbounded fan-in},
journal = infcomp,
volume = {nnn},
year = {1993},
note = {To appear}
}
@inproceedings{AlJi93,
author = {E. Allender and J. Jiao},
title = {Depth reduction for noncommutative arithmetic circuits
(extended abstract)},
booktitle = proc25 # stoc,
year = {1993},
pages = {515--522}
}
@techreport{AlOg93,
author = {E. Allender and M. Ogiwara},
title = {Relationships among {PL}, {\#L}, and the determinant},
institution = {DIMACS},
number = {Tech. Report 93-43},
year = {1993}
}
@techreport{AlSt94,
author = {E. Allender and M. Strauss},
title = {Measure on small complexity classes,
with applications for {BPP}},
institution = {Rutgers University and DIMACS},
number = {DIMACS TR 94-18},
month = {April},
year = {1994},
}
@inproceedings{AlSt94f,
author = {E. Allender and M. Strauss},
title = {Measure on small complexity classes,
with applications for {BPP}},
booktitle = proc35 # focs,
year = {1994},
pages = {807--818}
}
@misc{AlSt94c,
author = {E. Allender and M. Strauss},
note = {In preparation},
year = {1994}
}
@misc{AlSt95,
author = {E. Allender and M. Strauss},
title = {Measure on {P}: {R}obustness of the notion},
note = {In preparation},
year = {1995}
}
@misc{All94pc,
author = {E. Allender},
title = {Personal communication},
month = {August},
year = {1994}
}
@article{ABI86,
author = {N. Alon and L. Babai and A. Itai},
title = {A Fast and Simple Randomized Parallel Algorithm for
the Maximal Independent Set Problem},
journal = {Journal of Algorithms},
volume = {7},
year = {1986},
pages = {567--583}
}
@ARTICLE{AlMa88,
AUTHOR = {N. Alon and W. Maass},
TITLE = {Meanders and their application to lower bound arguments},
JOURNAL = jcss,
VOLUME = {37},
YEAR = {1988},
PAGES = {118--129}
}
@inproceedings{AGHP90,
author = {N. Alon and O. Goldreich and J. H{\aa}stad and R. Peralta},
title = {Simple constructions of almost {$k$-wise} independent
random variables},
booktitle = proc31 # focs,
year = {1990},
pages = {544--553}
}
@article{AKW90,
author = {N. Alon and M. Karchmer and A. Wigderson},
title = {Linear circuits over {GF(2)}},
journal = sicomp,
volume = {19},
year = {1990},
pages = {1064--1067}
}
@article{ABLP91,
author = {N. Alon and A. Bar-Noy and N. Linial and D. Peleg},
title = {A lower bound for radio broadcast},
journal = jcss,
volume = {43},
year = {1991},
pages = {290--298}
}
@book{AS92,
author = {N. Alon and J. Spencer},
title = {The Probabilistic Method},
publisher = {Wiley},
year = {1992},
note = {With an appendix by P. Erd{\H{o}}s}
}
@article{ABNNR92,
author = {N. Alon and J. Bruck and J. Naor and M. Naor and R. Roth},
title = {Construction of asymptotically good low-rate
error-correcting codes through pseudo-random graphs},
journal = itit,
volume = {38},
number = {2},
month = {March},
year = {1992},
pages = {509--512}
}
@incollection{AGHP92,
author = {N. Alon and O. Goldreich and J. H{\aa}stad and R. Peralta},
title = {Simple constructions of almost {$k$-wise}
independent random variables},
booktitle = {Random Structures and Algorithms},
publisher = {Wiley},
year = {1992},
pages = {nnn-nnn},
note = {An earlier version appeared in Proc.\ 31st FOCS,
1990, 544--553}
}
@incollection{AGHP93,
author = {N. Alon and O. Goldreich and J. H{\aa}stad and R. Peralta},
title = {Addendum to ``Simple constructions of almost {$k$-wise}
independent random variables''},
booktitle = {Random Structures and Algorithms},
publisher = {Wiley},
year = {1993},
pages = {nnn-nnn}
}
@INPROCEEDINGS{ACF90,
AUTHOR = {B. Alpern and L. Carter and E. Feig},
TITLE = {Uniform memory hierarchies},
BOOKTITLE = proc31 # focs,
YEAR = {1990},
PAGES = {600--608}
}
@inproceedings{Alt83,
author = {H. Alt},
title = {Multiplication is the easiest nontrivial function},
booktitle = proc24 # focs,
year = {1983},
pages = {320--322}
}
@techreport{AlJe91,
author = {C. Alvarez and B. Jenner},
title = {A very hard log-space counting class},
institution = {Fachbereich Informatik, Universitaet Hamburg},
number = {FBI-HH-147/91},
year = {1991}
}
@inproceedings{AlJe94,
author = {C. Alvarez and B. Jenner},
title = {On adaptive {D}logtime and {P}olylogtime reductions},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {301--312}
}
@article{AKN92,
author = {S. Amari and K. Kurata and H. Nagaoka},
title = {Information geometry of {B}oltzmann machines},
journal = itnn,
volume = {3},
month = {March},
year = {1992},
pages = {260--271}
}
@inproceedings{A-S85,
author = {K. Amb{os-Spies}},
title = {Three theorems on polynomial degrees of {NP} sets},
booktitle = proc26 # focs,
year = {1985},
pages = {51--55}
}
@article{A-S85b,
author = {K. Amb{os-Spies}},
title = {Sublattices of the polynomial time degrees},
journal = infcon,
volume = {65},
year = {1985},
pages = {63--84}
}
@article{A-S86,
author = {K. Amb{os-Spies}},
title = {A note on complete problems for complexity classes},
journal = ipl,
volume = {23},
year = {1986},
pages = {nnn--nnn}
}
@article{A-S86b,
author = {K. Amb{os-Spies}},
title = {Inhomogeneities in the polynomial-time degrees: the
degrees of super sparse sets},
journal = ipl,
volume = {22},
year = {1986},
pages = {nnn-nnn}
}
@incollection{A-S86c,
author = {K. Amb{os-Spies}},
title = {Minimal pairs for polynomial reducibilities},
booktitle = {R{\"o}dding Volume},
editor = {E. B\"orger},
series = lncs,
publisher = springer,
volume = {270},
year = {1986},
pages = {nnn--nnn}
}
@article{A-S86d,
author = {K. Amb{os-Spies}},
title = {An inhomogeneity in the structure of {Karp} degrees},
journal = sicomp,
volume = {15},
year = {1986},
pages = {nnn--nnn}
}
@inproceedings{A-S86e,
author = {K. Amb{os-Spies}},
title = {Relativizations, randomness, and polynomial reducibilities},
booktitle = {Proceedings, First Annual Conference on Structure
in Complexity Theory},
series = lncs,
volume = {223},
publisher = springer,
year = {1986},
pages = {23--34}
}
@inproceedings{A-S87,
author = {K. Amb{os-Spies}},
title = {Honest polynomial reducibilities, recursively enumerable sets,
and the {P =? NP} problem},
booktitle = proc2 # structures,
year = {1987},
pages = {60--68}
}
@article{AFH87,
author = {K. Amb{os-Spies} and H. Fleischhack and H. Huwig},
title = {Diagonalizations over polynomial computable sets},
journal = tcs,
volume = {51},
year = {1987},
pages = {177--204}
}
@incollection{A-S88,
author = {K. Amb{os-Spies}},
title = {Polynomial time degrees of {NP}-sets},
booktitle = {Trends in Theoretical Computer Science},
publisher = {Computer Science Press},
editor = {E. B{\"o}rger},
year = {1988},
pages = {95--142}
}
@inproceedings{AFH88,
author = {K. Amb{os-Spies} and H. Fleischhack and H. Huwig},
title = {Diagonalizing over deterministic polynomial time},
booktitle = proc1 # csl,
series = lncs,
volume = {329},
publisher = springer,
year = {1988},
pages = {1--16},
note = {A full version is Forschungsbericht Nr. 1/88,
Fachbereich Informatik der Universit\"at Oldenburg}
}
@article{A-S89,
author = {K. Amb{os-Spies}},
title = {Honest polynomial time reducibilities and the
{P =? NP} problem},
journal = jcss,
volume = {39},
year = {1989},
pages = {nnn-nnn}
}
@article{A-S89b,
author = {K. Amb{os-Spies}},
title = {On the relative complexity of hard problems for complexity
classes without complete problems},
journal = tcs,
volume = {63},
year = {1989},
pages = {nnn--nnn}
}
@inproceedings{AHS92,
author = {K. Amb{os-Spies} and S. Homer and R. Soare},
title = {Minimal pairs and complete problems},
booktitle = proc9 # stacs,
series = lncs,
volume = {nnn},
publisher = springer,
year = {1992},
pages = {nnn--nnn}
}
@inproceedings{ANT94,
author = {K. Amb{os-Spies} and H.-C. Neis and S. Terwijn},
title = {Genericity and measure for exponential time},
booktitle = proc19 # mfcs,
series = lncs,
volume = {841},
publisher = springer,
year = {1994},
pages = {221--232}
}
@inproceedings{ATX94,
author = {K. Amb{os-Spies} and S. Terwijn and Z. Xizhong},
title = {Resource bounded randomness and weakly complete problems},
booktitle = {Algorithms and Computation: Proceedings, ISAAC'94},
series = lncs,
volume = {834},
publisher = springer,
year = {1994},
pages = {369--377}
}
@article{AmGa88,
author = {A. Amir and W. Gasarch},
title = {Polynomial terse sets},
journal = infcon,
volume = {77},
year = {1988},
pages = {37--56}
}
@inproceedings{ABG90,
author = {A. Amir and R. Beigel and W. Gasarch},
title = {Some connections between bounded query classes
and nonuniform complexity},
booktitle = proc5 # structures,
year = {1990},
pages = {232--243}
}
@ARTICLE{AmTr92,
AUTHOR = {T. Amtoft and J.L. Tr\"aff},
TITLE = {Partial memoization for obtaining linear time behavior
of a {2DPDA}},
JOURNAL = tcs,
VOLUME = {98},
YEAR = {1992},
PAGES = {347--356}
}
@inproceedings{AHNR95,
author = {A. Andersson and T. Hagerup and S. Nilsson and R. Raman},
title = {Sorting in linear time?},
booktitle = proc27 # stoc,
year = {1995},
pages = {427--436}
}
@ARTICLE{AnVa79,
AUTHOR = {D. Angluin and L. Valiant},
TITLE = {Fast probabilistic algorithms for {H}amiltonian circuits and
matchings},
JOURNAL = jcss,
VOLUME = {18},
YEAR = {1979},
PAGES = {155--193}
}
@article{Ang80,
author = {D. Angluin},
title = {Counting problems and the polynomial-time hierarchy},
journal = tcs,
volume = {12},
year = {1980},
pages = {nnn--nnn}
}
@article{AnSm83,
author = {D. Angluin and C. Smith},
title = {Inductive inference: Theory and methods},
journal = {ACM Computing Surveys},
volume = {15},
year = {1983},
pages = {237--269}
}
@article{AnAn93,
author = {I. Anshel and M. Anshel},
title = {From the {Post}-{Markov} theorem through decision problems
to public-key cryptography},
journal = {Amer. Math. Monthly},
volume = {100},
year = {1993},
month = {November},
pages = {835--844}
}
@book{Arb68,
editor = {M. Arbib},
title = {Algebraic Theory of Machines, Languages, and Semigroups},
publisher = {Academic Press},
year = {1968}
}
@inproceedings{ArSa92,
author = {S. Arora and S. Safra},
title = {Probabilistic checking of proofs},
booktitle = proc33 # focs,
YEAR = {1992},
pages = {2--13}
}
@INPROCEEDINGS{ALMSS92,
author = {S. Arora and C. Lund and R. Motwani and M. Sudan
and M. Szegedy},
title = {Proof Verification and Hardness of Approximation Problems},
BOOKTITLE = proc33 # focs,
YEAR = {1992},
PAGES = {14--23}
}
@inproceedings{Ars87},
author = {M. Arslanov},
title = {The {R}ecursion {T}heorem, approximations, and
classifying index sets of recursively enumerable sets},
booktitle = proc6 # fct,
publisher = springer,
series = lncs,
volume = {nnn}
year = {1987},
pages = {34--37}
}
@techreport{AKM92,
author = {V. Arvind and J. K{\"o}bler and M. Mundhenk},
title = {Reliable reductions, high sets and low sets},
number = {Nr.\ 92-12},
institution = {Informatik, Universit{\"a}t Ulm},
year = {1992}
}
@inproceedings{ABFR91,
author = {J. Aspnes and R. Beigel and M. Furst and S. Rudich},
title = {The expressive power of voting polynomials},
booktitle = proc33 # focs,
year = {1991},
pages = {402--409}
}
@article{ABFR94,
author = {J. Aspnes and R. Beigel and M. Furst and S. Rudich},
title = {The expressive power of voting polynomials},
journal = {Combinatorica},
volume = {14},
year = {1994},
pages = {1--14}
}
@article{AtVi84,
author = {M. Atallah and U. Vishkin},
title = {Finding {Euler} tours in parallel},
journal = jcss,
volume = {29},
year = {1984},
pages = {330--337}
}
@article{ACG89,
author = {M. Atallah and R. Cole and M. Goodrich},
title = {Cascading divide-and-conquer: A technique for designing
parallel algorithms},
journal = sicomp,
volume = {18},
year = {1989},
pages = {499--532}
}
@article{Ata92,
author = {A. Atanasiu},
title = {A class of coders based on gsm},
journal = {Acta Informatica},
volume = {29},
year = {1992},
pages = {779--791}
}
@article{AuMi70,
author = {G. Auguston and J. Minker},
title = {An analysis of some graph-theoretical clustering techniques},
journal = jacm,
volume = {17},
number = {4},
year = {1970},
pages = {571--588}
}
@article{ABK92,
author = {A. Averbuch and N. Bshouty and M. Kaminski},
title = {A classification of algorithms for multiplying polynomials of
small degree over finite fields},
journal = {J. Algorithms},
volume = {13},
year = {1992},
pages = {577--588}
}
@INPROCEEDINGS{Bab85,
AUTHOR = {L. Babai},
TITLE = {Trading group theory for randomness},
BOOKTITLE = proc17 # stoc,
YEAR = {1985},
PAGES = {421--429}
}
@ARTICLE{Bab87,
AUTHOR = {L. Babai},
TITLE = {Random oracles separate {PSPACE} from the polynomial-time
hierarchy},
JOURNAL = ipl,
YEAR = {1987},
VOLUME = {26},
PAGES = {51--53}
}
@ARTICLE{BaMo88,
AUTHOR = {L. Babai and S. Moran},
TITLE = {Arthur-Merlin Games: A randomized proof system, and
a hierarchy of complexity classes},
JOURNAL = jcss,
VOLUME = {36},
YEAR = {1988},
PAGES = {254--276}
}
@inproceedings{BNS89,
author = {L. Babai and N. Nisan and M. Szegedy},
title = {Multiparty protocols and logspace-hard pseudorandom
sequences},
booktitle = proc21 # stoc,
year = {1989},
pages = {1--11}
}
@inproceedings{BaFo90,
author = {L. Babai and L. Fortnow},
title = {A characterization of {\#P} by arithmetic straight-line
programs},
booktitle = proc31 # focs,
year = {1990},
pages = {26--34}
}
@inproceedings{BFLS91,
author = {L. Babai and L. Fortnow and L. Levin and M. Szegedy},
title = {Checking computations in polylogarithmic time},
booktitle = proc23 # stoc,
year = {1991},
pages = {21--31}
}
@inproceedings{Bab93,
author = {L. Babai},
title = {Transparent (holographic) proofs},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {525--534}
}
@article{BDS93,
author = {E. Bach and J. Driscoll and J. Shallit},
title = {Factor refinement},
journal = jalg,
volume = {15},
year = {1993},
pages = {199--222}
}
@article{Bak79,
author = {T. Baker},
title = {On `provable' analogs of {P} and {NP}},
journal = mst,
volume = {12},
year = {1979},
pages = {213--218}
}
@article{BGS75,
author = {T. Baker and J. Gill and R. Solovay},
title = {relativizations of the {P=NP?} question},
journal = sicomp,
volume = {4},
year = {1975},
pages = {431--442}
}
@article{BaYu86,
author = {E. Balas and C. Yu},
title = {Finding a maximum clique in an arbitrary graph},
journal = sicomp,
volume = {15},
year = {1986}
}
@article{BaSc85,
author = {J. Balc{\'a}zar and U. Sch{\"o}ning},
title = {Bi-immune sets for complexity classes},
journal = mst,
volume = {18},
year = {1985},
pages = {1--10}
}
@article{BBS86a,
author = {J. Balc{\'a}zar and R. Book and U. Sch{\"o}ning},
title = {Sparse sets, lowness, and highness},
journal = sicomp,
volume = {15},
year = {1986},
pages = {739--747}
}
@article{BBS86b,
author = {J. Balc{\'a}zar and R. Book and U. Sch{\"o}ning},
title = {The polynomial-time hierarchy and sparse oracles},
journal = jacm,
volume = {33},
year = {1986},
pages = {603--617}
}
@BOOK{BDG88,
AUTHOR = {J. Balc{\'a}zar and J. D{\'\i}az and J. Gabarr{\'o}},
TITLE = {Structural Complexity Theory},
PUBLISHER = springer,
YEAR = {1988}
}
@article{Bal90,
author = "J. Balc\'{a}zar",
title = "Self-Reducibility Structures and solutions of
{N}{P} problems",
year = "1990",
month = "Dec.",
journal = "Rivesta Matematica",
volume = "4",
number = "4",
pages = "175-184"
}
@techreport{BGS93,
author = {J. Balc\'{a}zar and R. Gavald{\'a} and H. Siegelmann},
title = {Computational power of neural networks: a {K}olmogorov
complexity characterization},
institution = {Dpto. LSI, Universitat Polit{\'e}cnica de Catalunya,
Barcelona},
number = {nnn},
month = {December},
year = {1993}
}
@misc{BaSh92,
author = {G. Baliga and A. Shende},
title = {All acceptable programming systems provide good control
structures},
year = {1992}
}
@misc{BaSh93,
author = {G. Baliga and A. Shende},
title = {On space-bounded server algorithms},
year = {1993}
}
@misc{BaSh93b,
author = {G. Baliga and A. Shende},
title = {How far do finitary recursion theorems go?},
year = {1993}
}
@techreport{BaRa94,
author = {D. Ballard and R. Rao},
title = {Seeing behind occlusions},
institution = {Computer Science, University of Rochester},
number = {487},
month = {February},
year = {1994}
}
@inproceedings{BaRu91,
author = {G. Barnes and W. Ruzzo},
title = {Determinitsic algorithms for undirected s-t connectivity
using polynomial time and sublinear space},
booktitle = proc23 # stoc,
year = {1991},
pages = {43--53}
}
@misc{BBRS94,
author = {G. Barnes and J. Buss and W. Ruzzo and B. Schieber},
title = {A sublinear space, polynomial time algorithm for
directed {$s$-$t$} connectivity},
month = {May},
year = {1994}
}
@inproceedings{Bar86,
author = {D. Mix Barrington},
title = {Bounded-width polynomial-size branching programs
recognize exactly those languages in {NC$^1$}},
booktitle = proc18 # stoc,
year = {1986},
pages = {1--5}
}
@article{Bar89,
author = {D. Mix Barrington},
title = {Bounded-width polynomial-size branching programs
recognize exactly those languages in {NC$^1$}},
journal = jcss,
volume = {38},
year = {1989},
pages = {150--164}
}
@article{Bar90,
author = {D. Mix Barrington},
title = {Extensions of an idea of {McNaughton}},
journal = mst,
volume = {23},
year = {1990},
pages = {147--164}
}
@INPROCEEDINGS{BIS88,
AUTHOR = {D. Mix Barrington and N. Immerman and H. Straubing},
TITLE = {On uniformity within {$\NC^1$}},
BOOKTITLE = proc3 # structures,
YEAR = {1988},
PAGES = {47--59}
}
@article{BIS90,
AUTHOR = {D. Mix Barrington and N. Immerman and H. Straubing},
TITLE = {On uniformity within {$\NC^1$}},
journal = jcss,
volume = {41},
year = {1990},
pages = {274--306}
}
@article{BST90,
author = {D. Mix Barrington and H. Straubing and D. Th{\'e}rien},
title = {Non-uniform automata over groups},
journal = infcomp,
volume = {89},
year = {1990},
pages = {109--132}
}
@article{BaTh88,
author = {D. Mix Barrington and D. Th{\'e}rien},
title = {Finite monoids and the fine structure of {NC$^1$}},
journal = jacm,
volume = {35},
year = {1988},
pages = {941--952}
}
@article{BaCo89,
author = {D. Mix Barrington and J. Corbett},
title = {On the relative complexity of some languages in {$\NC^1$}},
journal = ipl,
volume = {32},
year = {1989},
pages = {251--256}
}
@article{BaCo91,
author = {D. Mix Barrington and J. Corbett},
title = {A note on some languages in uniform {ACC$^0$}},
journal = tcs,
volume = {78},
year = {1991},
pages = {357--362}
}
@article{BaMcK91,
author = {D. Mix Barrington and P. McKenzie},
title = {Oracle branching programs and {L}ogspace versus {P}},
journal = infcon,
volume = {95},
year = {1991},
pages = {96--115}
}
@inproceedings{BaSt91,
author = {D. Mix Barrington and H. Straubing},
title = {Superlinear lower bounds for bounded-width branching
programs},
booktitle = proc6 # structures,
year = {1991},
pages = {305--313}
}
@techreport{BaSt91b,
author = {D. Mix Barrington and H. Straubing},
title = {Complex polynomials and circuit lower bounds for
modular counting},
institution = {Boston College, Computer Science Dept.},
number = {BCCS-91-5},
month = {June},
year = {1991}
}
@article{BCST92,
author = {D. Mix Barrington and K. Compton and H. Straubing and
D. Th{\'e}rien},
title = {Regular languages in {NC$^1$}},
journal = jcss,
volume = {44},
year = {1992},
pages = {478--499}
}
@incollection{Bar92,
author = {D. Mix Barrington},
title = {Some problems involving {R}azborov-{S}molensky polynomials},
booktitle = {Boolean Function Complexity},
editor = {M. Paterson},
series = {LMS Lecture Note Series},
volume = {169},
publisher = lms,
year = {1992},
note = {Proceedings of an LMS Symposium in Durham, July 1990},
pages = {109--128}
}
@inproceedings{Bar92q,
author = {D. Mix Barrington},
title = {Quasipolynomial size circuit classes},
booktitle = proc7 # structures,
year = {1992},
pages = {86--93}
}
@inproceedings{BBR92,
author = {D. Mix Barrington and R. Beigel and S. Rudich},
title = {Representing {B}oolean functions as polynomials modulo
composite numbers},
booktitle = proc24 # stoc,
year = {1992},
pages = {455-461}
}
@article{BBR94,
author = {D. Mix Barrington and R. Beigel and S. Rudich},
title = {Representing {B}oolean functions as polynomials modulo
composite numbers},
journal = compcomp,
volume = {4},
year = {1994},
pages = {367--382}
}
@inproceedings{BaIm94,
author = {D. Mix Barrington and N. Immerman},
title = {Time, hardware, and uniformity},
booktitle = proc9 # structures,
year = {1994},
pages = {176--185}
}
@article{BaSt94,
author = {D. Mix Barrington and H. Straubing},
title = {Complex polynomials and circuit lower bounds for
modular counting},
journal = compcomp,
volume = {4},
year = {1994},
pages = {325--338}
}
@article{BaSt95,
author = {D. Mix Barrington and H. Straubing},
title = {Superlinear lower bounds for bounded-width branching
programs},
journal = jcss,
volume = {50},
year = {1995},
pages = {374--381}
}
@article{BCKO93,
author = {R. Bar-Yehuda and B. Chor and E. Kushilevitz and
A. Orlitsky},
title = {Privacy, additional information, and communication},
journal = itit,
volume = {39},
year = {1993},
pages = {1930--1943}
}
@inproceedings{BaMa93,
author = {D. Basin and S. Matthews},
title = {A conservative extension of first-order logic
and its applications to theorem proving},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {151--160}
}
@article{BCH86,
author = {P. Beame and S. Cook and H. Hoover},
title = {Log depth circuits for divison and related problems},
journal = sicomp,
volume = {15},
year = {1986},
pages = {994--1003}
}
@inproceedings{Bea89,
author = {P. Beame},
title = {A general sequential time-space tradeoff for finding
unique elements},
booktitle = proc21 # stoc,
year = {1989},
pages = {197--203}
}
@article{Bea91,
author = {P. Beame},
title = {A general sequential time-space tradeoff for finding
unique elements},
journal = sicomp,
volume = {20},
year = {1991},
pages = {270--277}
}
@inproceedings{Bea87,
author = {M. Beaudry},
title = {Testing membership in commutative transformation semigroups},
booktitle = proc14 # icalp,
series = lncs,
publisher = springer,
volume = {nnn},
year = {1987},
pages = {nnn--nnn}
}
@article{Bea88,
author = {M. Beaudry},
title = {Testing membership in commutative transformation semigroups},
journal = {infcon},
volume = {79},
year = {1988},
pages = {nnn--nnn}
}
@inproceedings{BKP93,
author = {M. Beaudry and P. McKenzie and P. P{\'e}ladeau},
title = {Circuits with monoidal gates},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {555--565}
}
@article{BeMcK95,
author = {M. Beaudry and P. McKenzie},
title = {Circuits, matrices, and non-associative computation},
journal = jcss,
volume = {50},
year = {1995},
pages = {441--455}
}
@article{BLM93,
author = {F. B{\'e}dard and F. Lemieux and P McKenzie},
title = {Extensions to {B}arrington's {M}-program model},
journal = tcs,
volume = {107},
year = {1993},
pages = {31--61}
}
@inproceedings{Bei87,
author = {R. Beigel},
title = {A structural theorem that depends quantitatively
on the complexity of {SAT}},
booktitle = proc2 # structures,
year = {1987},
pages = {28--32}
}
@phdthesis{Bei87t,
author = {R. Beigel},
title = {Query-limited reducibilities},
school = {Stanford University},
year = {1987}
}
@article{BGH89,
author = {R. Beigel and W. Gasarch and L. Hay},
title = {Bounded query classes and the difference hierarchy},
journal = {Archive for Mathematical Logic},
volume = {29},
year = {1989},
pages = {69--84}
}
@article{Bei91,
author = {R. Beigel},
title = {Bounded queries to {SAT} and the {B}oolean hierarchy},
journal = tcs,
volume = {83},
year = {1991},
pages = {199--223}
}
@inproceedings{BBFG91,
author = {R. Beigel and M. Bellare and J. Feigenbaum and
S. Goldwasser},
title = {Languages that are easier than their proofs},
booktitle = proc32 # focs,
year = {1991},
pages = {19--28}
}
@inproceedings{BeigelBellareFeigenbaumGoldwasser91,
author = {R. Beigel and M. Bellare and J. Feigenbaum and
S. Goldwasser},
title = {Languages that are easier than their proofs},
booktitle = proc32 # focs,
year = {1991},
pages = {19--28}
}
@techreport{Bei92,
author = {R. Beigel},
title = {Communicating with low-diffraction lasers and mirrors},
institution = {ICSI, Berkeley},
number = {TR-92-024},
year = {1992}
}
@inproceedings{Bei92b,
author = {R. Beigel},
title = {When do extra majority gates help? {P}olylog($n$)
majority gates are equivalent to one},
booktitle = proc24 # stoc,
year = {1992},
pages = {450--454}
}
@book{BF93,
author = {R. Beigel and R. Floyd},
title = {Machines, Languages, and Computation},
publisher = {Pitman},
year = {1993}
}
@inproceedings{BeTa91,
author = {R. Beigel and J. Tarui},
title = {On {ACC}},
booktitle = proc32 # focs,
year = {1991},
pages = {783--792}
}
@inproceedings{BRS91,
author = {R. Beigel and N. Reingold and D. Spielman},
title = {The perceptron strikes back},
booktitle = proc6 # structures,
year = {1991},
pages = {286--291}
}
@inproceedings{BRS91b,
author = {R. Beigel and N. Reingold and D. Spielman},
title = {{PP} is closed under intersection},
booktitle = proc23 # stoc,
year = {1991},
pages = {1--9}
}
@inproceedings{BTT92,
author = {R. Beigel and J. Tarui and S. Toda},
title = {On probabilistic {ACC} circuits with an exact threshold gate},
booktitle = proc3 # "Annual International Symposium on Algorithms and Computation",
publisher = springer,
series = lncs,
volume = {650},
year = {1992},
pages = {420--429}
}
@article{BeFe92,
author = {R. Beigel and J. Feigenbaum},
title = {On being incoherent without being very hard},
journal = {Computational Complexity},
volume = {2},
year = {1992},
pages = {1--17}
}
@article{BeGi92,
author = {R. Beigel and J. Gill},
title = {Counting classes: thresholds, parity, modes, and fewness},
journal = tcs,
volume = {103},
year = {1993},
pages = {293--310}
}
@inproceedings{Bei93,
author = {R. Beigel},
title = {The polynomial method in circuit complexity},
booktitle = proc8 # structures,
year = {1993},
pages = {82--95},
note = {Revised version, 1995}
}
@article{BCO93,
author = {R. Beigel and R. Chang and M. Ogiwara},
title = {A relationship between difference hierarchies and
relativized polynomial hierarchies},
journal = mst,
volume = {26},
year = {1993},
pages = {150--164}
}
@article{BGGO93,
author = {R. Beigel and W. Gasarch and J. Gill and C. Owings},
title = {Terse, superterse, and verbose sets},
journal = infcomp,
volume = {103},
year = {1993},
pages = {68--85}
}
@inproceedings{BKS92,
author = {R. Beigel and M. Kummer and F. Stephan},
title = {Quantifying the amount of verboseness},
booktitle = {Logical Foundations of Computer Science---Tver '92},
series = lncs,
volume = {620},
publisher = springer,
year = {1992},
pages = {21--32}
}
@unpublished{BKS93,
author = "R. Beigel and M. Kummer and F. Stephan",
title = "Approximable sets",
year = "1993",
note = "manuscript",
annote = "",
key = ""
}
@inproceedings{BKS94,
author = {R. Beigel and M. Kummer and F. Stephan},
title = {Approximable sets},
booktitle = proc9 # structures,
year = {1994},
pages = {12--23}
}
@article{Bei94a,
author = {R. Beigel},
title = {Perceptrons, {PP}, and the polynomial hierarchy},
journal = compcomp,
volume = {4},
year = {1994},
pages = {339--349}
}
@article{Bei94b,
author = {R. Beigel},
title = {When do extra majority gates help? polylog(n) majority
gates are equivalent to one},
journal = compcomp,
volume = {4},
year = {1994},
pages = {314--324}
}
@inproceedings{BeGo94,
author = {R. Beigel and J. Goldsmith},
title = {Downward separation fails catastrophically for
limited nondeterminism classes},
booktitle = proc9 # structures,
year = {1994},
pages = {134--138}
}
@article{BeTa94,
author = {R. Beigel and J. Tarui},
title = {On {ACC}},
journal = compcomp,
volume = {4},
year = {1994},
pages = {350--366}
}
@article{BRS95,
author = {R. Beigel and N. Reingold and D. Spielman},
title = {{PP} is closed under intersection},
journal = jcss,
volume = {50},
year = {1995},
pages = {191--202}
}
@book{BM77,
author = {J. Bell and M. Machover},
title = {A First Course in Mathematical Logic},
publisher = {North-Holland},
address = {Amsterdam},
year = {1977}
}
@inproceedings{BeGo92,
author = {M. Bellare and O. Goldreich},
title = {On defining proofs of knowledge},
booktitle = {Proceedings, CRYPTO'92},
year = {1992},
pages = {390--420}
}
@inproceedings{BGLR93,
author = {M. Bellare and S. Goldwasser and C. Lund and A. Russell},
title = {Efficient probabilistically checkable proofs and
applications to approximation},
booktitle = proc25 # stoc,
year = {1993},
pages = {294--304}
}
@inproceedings{BeSu94,
author = {M. Bellare and M. Sudan},
title = {Improved non-approximability results},
booktitle = proc26 # stoc,
year = {1994},
pages = {184--193}
}
@article{Bel91,
author = {S. Bellantoni},
title = {Parallel random access machines with bounded
memory wordsize},
journal = infcomp,
volume = {91},
year = {1991},
pages = {259--273}
}
@inproceedings{BeGa88,
author = {A. {Ben-Amram} and Z. Galil},
totle = {On pointers versus addresses},
booktitle = proc29 # focs,
year = {1988},
pages = {532--538}
}
@inproceedings{BeGa91,
author = {A. {Ben-Amram} and Z. Galil},
title = {Lower bounds for data structure problems on {RAMs}},
booktitle = proc32 # focs,
year = {1991},
pages = {622--631}
}
@article{BeGa92,
author = {A. {Ben-Amram} and Z. Galil},
title = {On pointers versus addresses},
journal = jacm,
volume = {39},
year = {1992},
pages = {617--648}
}
@inproceedings{BCGL89,
author = {S. {Ben-David} and B. Chor and O. Goldreich and M. Luby},
title = {On the theory of average-case complexity},
booktitle = proc21 # stoc,
year = {1989},
pages = {204--216}
}
@misc{BeHa91,
author = {S. {Ben-David} and S. Halevi},
title = {On the independence of {P} and {NP}},
institution = {Computer Science, Technion, Haifa},
year = {1991}
}
@ARTICLE{BG81,
AUTHOR = {C. Bennett and J. Gill},
TITLE = {Relative to a random oracle {$A$},
{$\P^A \neq \NP^A \neq \coNP^A$} with probability 1},
JOURNAL = sicomp,
YEAR = {1981},
VOLUME = {10},
PAGES = {96--113}
}
@ARTICLE{BeGi81,
AUTHOR = {C. Bennett and J. Gill},
TITLE = {Relative to a random oracle {$A$},
{$\P^A \neq \NP^A \neq \coNP^A$} with probability 1},
JOURNAL = sicomp,
YEAR = {1981},
VOLUME = {10},
PAGES = {96--113}
}
@article{Ben89,
author = {C. Bennett},
title = {Time-space tradeoffs for reversible computation},
journal = sicomp,
volume = {18},
year = {1989},
pages = {766--776}
}
@inproceedings{BenOr83,
author = {M. {Ben-Or}},
title = {Lower bounds for algebraic computation trees},
booktitle = proc15 # stoc,
year = {1983},
pages = {80--86}
}
@inproceedings{BCS83,
author = {M. {Ben-Or}, and B. Chor and A. Shamir},
title = {On the cryptographic security of single RSA bits},
booktitle = proc15 # stoc,
year = {1983},
pages = {421--430}
}
@inproceedings{BeCl88,
author = {M. {Ben-Or} and R. Cleve},
title = {Computing algebraic formulas using a constant number of
registers},
booktitle = proc20 # stoc,
year = {1988},
pages = {254--257}
}
@techreport{Ben83,
author = {D. Benson},
title = {Counting paths: Nondeterminism as linear lagebra},
institution = {University of Edinburgh, Department of Computer Science},
number = {CSR-134-83},
year = {1983}
}
@article{BeFr94,
author = {D. Berend and C. Frougny},
title = {Computability by finite automata and {P}isot bases},
journal = mst,
volume = {27},
year = {1994},
pages = {275--282}
}
@article{Ber84,
author = {S. Berkowitz},
title = {On computing the determinant in small parallel time using a
small number of processors},
journal = ipl,
volume = {18},
year = {1984},
pages = {147--150}
}
@article{BeHa77,
author = {L. Berman and J. Hartmanis},
title = {On isomorphisms and density of {NP} and other complete sets},
journal = sicomp,
volume = {6},
year = {1977},
pages = {305--321}
}
@inproceedings{BhNa93,
author = {P. Bhattacharyya and G. Nagaraja},
title = {Learning classes of regular and linear languages
in {V}aliant's learnability framework},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {444--453}
}
@incollection{Big90,
author = {N. Biggs},
title = {Some heuristics for graph colouring},
booktitle = {Graph Colourings},
editor = {R. Nelson and R. Wilson},
series = {Research Notes in Mathematics},
volume = {218},
publisher = {Pitman},
year = {1990},
pages = {87--96}
}
@article{BiPr89,
author = {G. Bilardi and F. Preparata},
title = {Size-time complexity of Boolean networks for prefix
computation},
journal = jacm,
volume = {36},
year = {1989},
pages = {362--382}
}
@article{BiPr90,
author = {G. Bilardi and F. Preparata},
title = {Characterization of associative operations with
prefix circuits of constant depth and linear size},
journal = sicomp,
volume = {19},
year = {1990},
pages = {246--255}
}
@article{BSGG92,
author = {G. Bilbro and W. Snyder and S. Garnier and J. Gault},
title = {Mean-{Field Annealing}: A formalism for constructing
{GNC}-like algorithms},
journal = {IEEE Transactions on Neural Networks},
volume = {3},
year = {1992},
pages = {131--138}
}
@article{Bir92,
author = {J.-C. Birget},
title = {Intersection and union of regular languages and state
complexity},
journal = ipl,
volume = {43},
year = {1992},
pages = {185--190}
}
@article{Bir85,
author = {I. Birkhoff},
title = {A direct routing algorithm for the bit-reversal permutation
on a shuffle-exchange network},
journal = ipl,
volume = {21},
year = {1985},
pages = {259--268}
}
@article{BiVe90,
author = {S. Biswas and S. Venkatesh},
title = {Codes, sparsity, and capacity in neural associative memory},
journal = itit,
volume = {nnn},
year = {nnnn},
pages = {nnn--nnn}
}
@inproceedings{BLY92,
author = {A. Bjorner and L. Lovasz and A. Yao},
title = {Linear decision trees: volume estimates and topological
bounds},
booktitle = proc24 # stoc,
year = {1992},
pages = {170--177}
}
@article{BlGu82,
author = {A. Blass and Y. Gurevich},
title = {On the unique satisfiability problem},
journal = infcon,
volume = {55},
year = {1982},
pages = {80--88}
}
@inproceedings{Ble87,
author = {G. Blelloch},
title = {Scans as primitive parallel operations},
booktitle = proc5 # "International Conference on Parallel Processing",
year = {1987},
pages = {355--362}
}
@book{Ble90b,
author = {G. Blelloch},
title = {Vector Models for Data-Parallel Computing},
publisher = {MIT Press},
year = {1990}
}
@techreport{Ble90,
author = {G. Blelloch},
title = {Prefix sums and their applications},
institution = {Carnegie-Mellon University, Computer Science
Department},
number = {CMU--CS--90--190},
month = {November},
year = {1990}
}
@INPROCEEDINGS{Blo92,
AUTHOR = {S. Bloch},
TITLE = {Functional characterizations of uniform log-depth and polylog-
depth circuit families},
BOOKTITLE = proc7 # structures,
YEAR = {1992},
PAGES = {193--206}
}
@techreport{Blo92b,
author = {S. Bloch},
title = {Alternating function classes within {P}},
institution = {University of Manitoba Computer Science Department},
year = {1992}
}
@techreport{BlGo92b,
author = {S. Bloch and J. Goldsmith},
title = {Sharply bounded alternation within {P}},
institution = {University of Manitoba Computer Science Department},
year = {1992}
}
@article{BBG94,
author = {S. Bloch and J. Buss and J. Goldsmith},
title = {How hard are {$n^2$}-hard problems?},
journal = sigact,
volume = {25},
number = {2},
month = {June},
year = {1994},
pages = {83--85}
}
@inproceedings{BFJKMR94,
author = {A. Blum and M. Furst and J. Jackson and M. Kearns
and Y. Mansour and S. Rudich},
title = {Weakly learning {DNF} and characterizing statistical
query learning using {F}ourier analysis},
booktitle = proc26 # stoc,
year = {1994},
pages = {253--262}
}
@ARTICLE{Blum67,
AUTHOR = {M.~Blum},
TITLE = {A machine-independent theory of the complexity of recursive
functions},
JOURNAL = jacm,
VOLUME = {14},
YEAR = {1967},
PAGES = {322--336}
}
@inproceedings{Blum93,
author = {M. Blum},
title = {Program result checking: a new approach to making
programs more reliable},
booktitle = proc20 # icalp,
series = lncs,
volume = {700},
publisher = springer,
year = {1993},
pages = {1--14}
}
@inproceedings{BlGo92,
author = {M. Blum and O. Goldreich},
title = {Towards a computational theory of statistical tests},
booktitle = proc33 # focs,
year = {1992},
pages = {406--416}
}
@article{Bod93,
author = {H. Bodl{\"a}nder},
title = {On linear-time minor tests with depth-dirst search},
journal = jalg,
volume = {15},
year = {1993},
pages = {nnn--nnn}
}
@inproceedings{BFH94,
author = {H. Bodl{\"a}nder and M. Fellows and M. Hallett},
title = {Beyond {NP}-completeness for problems of bounded width:
hardness for the {$W$} hierarchy},
booktitle = proc26 # stoc,
year = {1994},
pages = {449--458}
}
@BOOK{Bol79,
AUTHOR = {B. Bollob\'as},
TITLE = {Extremal Graph Theory},
PUBLISHER = {Academic Press},
YEAR = {1979}
}
@article{BCN81,
author = {L. Boasson and B. Courcelle and M. Nivat},
title = {The rational index: A complexity measure for languages},
journal = sicomp,
volume = {10},
number = {2},
year = {1981},
pages = {284--296}
}
@article{BoEr76,
author = {B. Bollob{\'a}s and P. Erd{\H{o}}s},
title = {Cliques in random graphs},
journal = {Proc. Camb. Phil. Soc.},
volume = {80},
year = {1976},
pages = {419--427}
}
@article{BoTh85,
author = {B.~Bollob{\'a}s and A.~Thomason},
title = {Random graphs of small order},
journal = {Annals of Discrete Math},
volume = {28},
year = {1985},
pages = {47--97}
}
@article{Bol88,
author = {B.~Bollob{\'a}s},
title = {The chromatic number of random graphs},
journal = {Combinatorica},
volume = {8},
year = {1988},
pages = {49--55}
}
@phdthesis{Bon91,
author = {M. Bonet},
title = {The lengths of propositional proofs and the deduction rule},
school = {Univ. of California at Berkeley},
year = {1991}
}
@inproceedings{BoBu91,
author = {M. Bonet and S. Buss},
title = {On the deduction rule and the number of proof lines},
booktitle = proc6 # lics,
year = {1991},
pages = {286--297}
}
@incollection{Bon93,
author = {M. Bonet},
title = {Number of symbols in {F}rege proofs with and without the
deduction rule},
booktitle = {Arithmetic, Proof Theory, and Computational
Complexity},
editor = {P. Clote and J. Kraj{\'\i\v{c}}ek},
publisher = {Oxford University Press},
year = {1993},
pages = {61--95}
}
@article{BoBu93,
author = {M. Bonet and S. Buss},
title = {The deduction rule and linear and near-linear proof
simulations},
journal = jsl,
volume = {58},
year = {1993},
pages = {688--709}
}
@article{BoBu94,
author = {M.L. Bonet and S. Buss},
title = {Size-depth tradeoffs for {B}oolean formulae},
journal = ipl,
volume = {29},
year = {1994},
pages = {151--155}
}
@incollection{BBP95,
author = {M. Bonet and S. Buss and T. Pitassi},
title = {Are there hard examples for {F}rege systems?},
booktitle = {Feasible Mathematics {II}},
editor = {P. Clote and J. Remmel},
publisher = {Birkhauser},
year = {1995},
pages = {31--56}
}
@article{BoGr70,
author = {R. Book and S. Greibach},
title = {Quasi-realtime languages},
journal = mathsys,
volume = {4},
year = {1970},
pages = {97--111}
}
@article{Book72,
author = {R. Book},
title = {On languages accepted in polynomial time},
journal = sicomp,
year = {1972},
volume = {1},
pages = {281--287}
}
@misc{BoYa77,
author = {R. Book and C. Yap},
title = {On the computational power of reversal-bounded machines},
series = lncs,
volume = {52},
publisher = springer,
year = {1977},
pages = {111--119}
}
@article{BoBr80,
author = {R. Book and F.-J. Brandenburg},
title = {Equality sets and complexity classes},
journal = sicomp,
volume = {9},
year = {1980},
pages = {729--743}
}
@article{Book81,
author = {R. Book},
title = {Bounded query machines: on {NP} and {PSPACE}},
journal = tcs,
volume = {15},
year = {1981},
pages = {27--39}
}
@article{BoWr81,
author = {R. Book and C. Wrathall},
title = {Bounded query machines: on {NP()} and {NPQUERY()}},
journal = tcs,
volume = {15},
year = {1981},
pages = {41--50}
}
@article{BWM82,
author = {R. Book and C. Wilson and X. Mei-Rui},
title = {Relativizing time, space, and time-space},
journal = sicomp,
volume = {11},
year = {1982},
pages = {571--581}
}
@article{BLS84,
author = {R. Book and T. Long and A. Selman},
title = {Quantitative relativizations of complexity classes},
journal = sicomp,
volume = {13},
year = {1984},
pages = {461--487}
}
@article{BLS85,
author = {R. Book and T. Long and A. Selman},
title = {Qualitative relativizations of complexity classes},
journal = jcss,
volume = {30},
year = {1985},
pages = {395--413}
}
@article{BoDu87,
author = {R. Book and D.-Z. Du},
title = {The existence and density of generalized
complexity cores},
journal = jacm,
volume = {34},
year = {1987},
pages = {718--730}
}
@inproceedings{BoKo87,
author = {R. Book and K. Ko},
title = {On sets reducible to sparse sets},
booktitle = proc2 # structures,
year = {1987},
pages = {147--154}
}
@inproceedings{BLM94,
author = {R. Book and J. Lutz and K. Wagner},
title = {The global power of additional queries to
random oracles},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {403--414}
}
@article{BLW94,
author = {R. Book and J. Lutz and K. Wagner},
title = {An observation on probability versus randomness with
applications to complexity classes},
journal = mst,
volume = {27},
year = {1994},
pages = {201--210}
}
@book{BJ74,
author = {G. Boolos and R. Jeffrey},
title = {Computability and Logic},
publisher = {Cambridge University Press},
year = {1974}
}
@incollection{BoHi89,
author = {R. Boppana and R. Hirschfeld},
title = {Pseudorandom generators and complexity classes},
booktitle = {Randomness and Computation},
series = {Advances in Computing Research},
volume = {5},
editor = {S. Micali},
publisher = {JAI Press},
address = {Greenwich, CT, USA},
year = {1989},
pages = {1--26}
}
@incollection{BoSi90,
author = {R. Boppana and M. Sipser},
title = {The complexity of finite functions},
BOOKTITLE = {Handbook of Theoretical Computer Science},
volume = {A},
EDITOR = {J. Van Leeuwen},
PUBLISHER = {Elsevier and MIT Press},
YEAR = {1990},
PAGES = {757--804}
}
@inproceedings{BoNa93,
author = {R. Boppana and B. Narayanan},
title = {The biased coin problem},
booktitle = proc25 # stoc,
year = {1993},
pages = {252--257}
}
@inproceedings{Bor94,
author = {B. Borchert},
title = {On the acceptance power of regular languages},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {533--542},
}
@techreport{Bor94b,
author = {B. Borchert},
title = {On the acceptance power of regular languages},
institution = {Universit{\"a}t Heidelberg, Mathematisches Institut},
number = {Bericht Nr. 6},
month = {February},
year = {1994}
}
@techreport{Bor94b,
author = {B. Borchert},
title = {Predicate classes and promise classes},
institution = {Universit{\"a}t Heidelberg, Mathematisches Institut},
number = {Bericht Nr. 7},
month = {April},
year = {1994}
}
@article{BPT92,
author = {R. Borie and R.G. Parker and C. Tovey},
title = {Automatic generation of linear-time algorithms from
predicate calculus descriptions of problems on recursively constructed
graph families},
journal = {Algorithmica},
volume = {7},
year = {1992},
pages = {555--581}
}
@techreport{BoDe76,
author = {A. Borodin and A. Demers},
title = {Some comments on functional self-reducibility and the
{NP} hierarchy},
institution = {Cornell Univ. Comp. Sci. Dept.},
number = {76-284},
year = {1976}
}
@techreport{BorodinDemers76,
author = {A. Borodin and A. Demers},
title = {Some comments on functional self-reducibility and the
{NP} hierarchy},
institution = {Cornell Univ. Comp. Sci. Dept.},
number = {TR 76-284},
year = {1976}
}
@article{Bor77,
author = {A. Borodin},
title = {On relating time and space to size and depth},
journal = sicomp,
volume = {6},
year = {1977},
pages = {733--744}
}
@ARTICLE{BFKLT81,
AUTHOR = {A. Borodin and M. Fischer and D. Kirkpatrick and N. Lynch and
M. Tompa},
TITLE = {A time-space tradeoff for sorting on non-oblivious machines},
JOURNAL = jcss,
VOLUME = {22},
YEAR = {1981},
PAGES = {351--364}
}
@article{BoCo82,
author = {A. Borodin and S. Cook},
title = {A time-space tradeoff for sorting on a general
sequential model of computation},
journal = sicomp,
volume = {11},
year = {1982},
pages = {287--297}
}
@article{BCP83,
author = {A. Borodin and S. Cook and N. Pippenger},
title = {Parallel computation for well-endowed rings, and
space-bounded probabilistic machines},
journal = infcon,
volume = {58},
year = {1983},
pages = {113--136}
}
@article{BoHo85,
author = {A. Borodin and J. Hopcroft},
title = {Routing, merging, and sorting on parallel models of
computation},
journal = jcss,
volume = {30},
year = {1985},
pages = {130--145}
}
@article{BFMUW87,
author = {A. Borodin and M. Fischer and F. {Meyer auf der Heide}
and E. Upfal and A. Wigderson},
title = {A time-space tradeoff for element distinctness},
journal = sicomp,
volume = {16},
year = {1987},
pages = {97--99}
}
@article{BCDRT89,
author = {A. Borodin and S. Cook and P. Dymond and W. Ruzzo and
M. Tompa},
title = {Two applications of inductive counting for complementation
problems},
journal = sicomp,
volume = {18},
year = {1989},
pages = {559--578}
}
@article{BRS93,
author = {A. Borodin and A. Razborov and R. Smolensky},
title = {On lower bounds for read-{$k$}-times branching programs},
journal = compcomp,
volume = {3},
year = {1993},
pages = {1--18}
}
@inproceedings{BoGa93,
author = {E. Borowsky and E. Gafni},
title = {Generalized {FLP} impossibility result for {$t$}-resilient
asynchronous computations},
booktitle = proc25 # stoc,
year = {1993},
pages = {91--100}
}
@article{BoRC60,
author = {R. Bose and D. Ray-Chaudhuri},
title = {On a class of error correcting binary group codes},
journal = infcon,
volume = {3},
year = {1960},
pages = {68--79}
}
@inproceedings{BBP91,
author = {J. Boyar and G. Brassard and R. Peralta},
title = {Subquadratic zero-knowledge},
booktitle = proc32 # focs,
year = {1991},
pages = {69--78}
}
@article{BFS92,
author = {J. Boyar and G. Frandsen and C. Sturtivant},
title = {An arithmetic model of computation equivalent to
threshold circuits},
journal = tcs,
volume = {93},
year = {1992},
pages = {303--319}
}
@ARTICLE{BoMo77,
AUTHOR = {R. Boyer and J. Moore},
TITLE = {A fast string-searching algorithm},
JOURNAL = cacm,
VOLUME = {20},
YEAR = {1977},
PAGES = {762--772}
}
@article{Bra86,
author = {U. Brandt},
title = {The position of index sets of identifiable sets in the
arithmetical hierarchy},
journal = infcon,
volume = {68},
year = {1986},
pages = {185--195}
}
@article{Bra88,
author = {U. Brandt},
title = {Index sets in the arithmetical hierarchy},
journal = {Ann. Pure Appl. Logic},
volume = {37},
year = {1988},
pages = {101--110}
}
@inproceedings{vBr93,
author = {B. von Braunm{\"u}hl},
title = {Alternation for two-way machines with sublogarithmic space},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {5--15}
}
@article{Bre74,
author = {R. Brent},
title = {The parallel evaluation of general arithmetic expressions},
journal = jacm,
volume = {21},
year = {1974},
pages = {201--206}
}
@article{Bre78,
author = {S. Breidtbart},
title = {On splitting recursive sets},
journal = jcss,
volume = {17},
year = {1978},
pages = {56--64}
}
@misc{BrSh93,
author = {Y. Breitbart and J. Shallit},
title = {Automaticity: Properties of a measure of descriptional
complexity},
month = {November},
year = {1993},
note = {Long version of STACS'94 paper}
}
@article{BrKu82,
author = {R. Brent and H. Kung},
title = {A regular layout for parallel adders},
journal = {IEEE Transactions on Computers},
volume = {C-31},
year = {1982},
pages = {260--264}
}
@article{BrTa80,
author = {M. Brown and R. Tarjan},
title = {Design and analysis of a data structure for representing
sorted lists},
journal = sicomp,
volume = {9},
year = {1980},
pages = {594--614}
}
@article{BrBl89,
author = {J. Bruck and M. Blaum},
title = {Neural networks, error-correcting codes, and polynomials
over the binary {$n$-cube}},
journal = itit,
volume = {35},
year = {1989},
pages = {976--987}
}
@article{BrSm92,
author = {J. Bruck and R. Smolensky},
title = {Polynomial threshold functions, {$\AC^0$} functions,
and spectral norms},
journal = sicomp,
volume = {21},
year = {1992},
pages = {33--42}
}
@article{BsKa90,
author = {N. Bshouty and M. Kaminski},
title = {Multiplication of polynomials over finite fields},
journal = sicomp,
volume = {19},
year = {1990},
pages = {452--456}
}
@article{BsSe90,
author = {N. Bshouty and G. Seroussi},
title = {Generalizations of the normal basis theorem of
finite fields},
journal = sjdm,
volume = {3},
year = {1990},
pages = {330--337}
}
@inproceedings{BCE91,
author = {N. Bshouty and R. Cleve and W. Eberly},
title = {Size-Depth Tradeoffs for Algebraic Formulae},
booktitle = proc32 # focs,
year = {1991},
pages = {334-341}
}
@inproceedings{Bsh93,
author = {N. Bshouty},
title = {Exact learning via the monotone theory},
booktitle = proc34 # focs,
year = {1993},
pages = {302--311}
}
@incollection{BuSi90,
author = {W. Buchholz and W. Sieg},
title = {A note on polynomial time computable arithmetic},
booktitle = {Contemporary Mathematics},
number = {106},
year = {1990},
pages = {51--55}
}
@inproceedings{BuSh91,
author = {J. Buchmann and V. Shoup},
title = {Constructing nonresidues in finite fields and the
extended {R}iemann hypothesis},
booktitle = proc23 # stoc,
year = {1991},
pages = {72--79}
}
@article{BuAn82,
author = {T. Budd and D. Angluin},
title = {Two notions of correctness and their relation to testing},
journal = {Acta Informatica},
volume = {18},
year = {1982},
pages = {31--45}
}
@inproceedings{BST91,
author = {H. Buhrman and E. Spaan and L. Torenvliet},
title = {Bounded reductions},
booktitle = proc8 # stacs,
series = lncs,
volume = {480},
publisher = springer},
year = {1991},
pages = {410--421}
}
@article{BST93,
author = {H. Buhrman and E. Spaan and L. Torenvliet},
title = {The relative power of logspace and polynomial-time
reductions},
journal = compcomp,
volume = {3},
year = {1993},
pages = {231--244}
}
@inproceedings{BuTo94,
author = {H. Buhrman and L. Torenvliet},
title = {On the cutting edge of relativization: the resource-bounded
injury method},
booktitle = proc21 # icalp,
series = lncs,
publisher = springer,
volume = {820},
year = {1994},
pages = {263--273}
}
@article{BuHe90,
author = {M. Bull and A. Hemmerling},
title = {Finite embedded trees and simply connected mazes
cannot be searched by halting finite automata},
journal = {J. Inform. Process. Cybern.},
volume = {EIK 26},
year = {1990},
pages = {65--73}
}
@article{BuGo93,
author = {J. Buss and J. Goldsmith},
title = {Nondeterminism within {P}},
journal = sicomp,
volume = {22},
year = {1993},
pages = {560--572}
}
@inproceedings{Buss86,
author = {S. Buss},
title = {The polynomial hierarchy and intuitionistic bounded
arithmetic},
booktitle = proc1 # structures,
series = lncs,
volume = {223},
publisher = springer,
year = {1986},
pages = {77--103}
}
@inproceedings{Buss87,
author = {S. Buss},
title = {The Boolean formula value problem is in {ALOGTIME}},
booktitle = proc19 # stoc,
year = {1987},
pages = {123--131}
}
@article{Buss87b,
author = {S. Buss},
title = {Polynomial-size proofs of the propositional pigeonhole
principle},
journal = jsl,
volume = {52},
year = {1987},
pages = {916--927}
}
@article{BuTu88,
author = {S. Buss and G. Tur{\'a}n},
title = {Resolution proofs of generalized pigeonhole principles},
journal = tcs,
volume = {62},
year = {1988},
pages = {311--317}
}
@article{BuHa91,
author = {S. Buss and L. Hay},
title = {On truth-table reducibility to {SAT}},
journal = infcomp,
volume = {91},
year = {1991},
pages = {86--102}
}
@article{Buss92,
author = {S. Buss},
title = {The graph of multiplication is equivalent to counting},
journal = ipl,
volume = {41},
year = {1992},
pages = {199--201}
}
@incollection{Buss92b,
author = {S. Buss},
title = {A note on bootstrapping intuitionistic bounded
arithmetic},
booktitle = {Proof theory},
editor = {P. Aczel and S. Wainer},
publisher = {Cambridge Univ. Press},
year = {1992},
pages = {149--169}
}
@ARTICLE{BCGR92,
AUTHOR = {S. Buss and S. Cook and A. Gupta and V. Ramachandran},
title = {An optimal parallel algorithm for formula evaluation},
journal = sicomp,
volume = {21},
year = {1992},
pages = {755--780}
}
@incollection{Buss92I,
author = {S. Buss},
title = {On {G\"o}del's theorems on lengths of proofs {I}: Number
of lines and speedup for arithmetics},
booktitle = {Logical Methods in Mathematics and Computer Science:
A Symposium in Honor of Anil Nerode on the Occasion of His Sixtieth Birthday},
year = {1992},
note = "To appear in the " # jsl
}
@incollection{Buss93,
author = {S. Buss},
title = {Algorithms for {B}oolean formula evaluation and for
tree contraction},
booktitle = {Arithmetic, Proof Theory, and Computational
Complexity},
editor = {P. Clote and J. Kraj{\'\i\v{c}}ek},
publisher = {Oxford University Press},
year = {1993},
pages = {96--115}
}
@article{Buss94I,
title = {On {G\"o}del's theorems on lengths of proofs {I}: Number
of lines and speedup for arithmetics},
journal = jsl,
volume = {39},
year = {1994},
pages = {737--756}
}
@incollection{Buss94II,
author = {S. Buss},
title = {On {G\"o}del's theorems on lengths of proofs {II}: Lower
bounds for recognizing $k$ symbol provability},
booktitle = {Feasible Mathematics {II}},
editor = {P. Clote and J. Remmel},
publisher = {Birkhauser},
year = {1995},
pages = {57--90}
}
@article{BuKr94,
author = {S. Buss and J. Kraj{\'\i\v{c}}ek},
title = {An application of {B}oolean complexity to separation
problems in bounded arithmetic},
journal = {Proc. London Math. Soc.},
volume = {69},
year = {1994},
pages = {1--21}
}
@misc{Buss95,
author = {S. Buss},
title = {Some remarks on lengths of propositional proofs},
year = {1995},
note = {Submitted to {\it Archiv f{\"u}r Mathematische Logik\/}}
}
@ARTICLE{Cai89,
AUTHOR = {J.-Y. Cai},
TITLE = {With probability one, a random oracle separates
{$\PSPACE$} from the polynomial-time hierarchy},
JOURNAL = jcss,
YEAR = {1989},
VOLUME = {38},
PAGES = {68--85}
}
@article{CaHe89,
author = {J.-Y. Cai and L. Hemachandra},
title = {Enumerative counting is hard},
journal = infcomp,
volume = {92},
year = {1989},
pages = {34--44}
}
@inproceedings{CaHe89b,
author = {J.-Y. Cai and L. Hemachandra},
title = {On the power of parity},
booktitle = proc9 # stacs,
series = lncs,
volume = {349},
publisher = springer,
year = {1989},
pages = {229--240}
}
@article{CaHe91,
author = {J.-Y. Cai and L. Hemachandra},
title = {A note on enumerative counting},
journal = ipl,
volume = {38},
year = {1991},
pages = {215--219}
}
@misc{CGT93,
author = {J.-Y. Cai and F. Green and T. Thierauf},
title = {On the correlation of symmetric functions},
year = {1993}
}
@techreport{CaCh94,
author = {J.-Y. Cai and S. Chari},
title = {On the impossibility of amplifying the independence
of random variables},
institution = {Department of Computer Science, University
at Buffalo},
number = {UB-CS TR 94-15},
month = {April},
year = {1994}
}
@article{CaLi94,
author = {J.-Y. Cai and R. Lipton},
title = {Subquadratic simulations of balanced formulae by branching
programs},
journal = sicomp,
volume = {23},
year = {1994},
pages = {563--572}
}
@inproceedings{CCDF94,
author = {L. Cai and J. Chen and R. Downey and M. Fellows},
title = {On the structure of parametrized problems in {NP}},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {509--520}
}
@article{CaCh95,
author = {L. Cai and J. Chen},
title = {On input read-modes of alternating {T}uring machines},
journal = tcs,
volume = {148},
year = {1995},
pages = {33--55}
}
@misc{CCH95,
author = {L. Cai and J. Chen and J. H{\aa}stad},
title = {Circuit bottom fan-in and computational power},
year = {1995}
}
@article{CaGo93,
author = {R. Canetti and O. Goldreich},
title = {Bounds on tradeoffs between randomness and communication
complexity},
journal = compcomp,
volume = {3},
year = {1993},
pages = {141--167}
}
@article{Car92,
author = {I. Carlstrom},
title = {Foreground automata},
journal = jcss,
volume = {45},
year = {1992},
pages = {367--384}
}
@article{CaWe79,
author = {J. Carter and M. Wegman},
title = {Universal classes of hash functions},
journal = jcss,
volume = {18},
year = {1979},
pages = {143--154}
}
@techreport{CaRo86,
author = {J. Case and J. Royer},
title = {Progressions of relatively succinct programs in
subrecursive hierarchies},
institution = {Computer Science Department, The University of
Chicago},
number = {86-007},
year = {1986}
}
@article{Cau89,
author = {H.J. Caulfield},
title = {Computing with light},
journal = {Byte},
volume = {14},
year = {1989},
month = {October},
pages = {231--237}
}
@article{CHW87,
author = {M. Chams and A. Hertz and D. deWerra},
title = {Some experiments with simulated annealing for
coloring graphs},
journal = {European J. Oper. Research},
volume = {32},
year = {1987},
pages = {260--266}
}
@article{CSV84,
author = {A. Chandra and L. Stockmeyer and U. Vishkin},
title = {Constant-depth reducibility},
journal = sicomp,
volume = {13},
year = {1984},
pages = {423--439}
}
@article{CFL85,
author = {A. Chandra and S. Fortune and R. Lipton},
title = {Unbounded fan-in circuits and associative functions},
journal = jcss,
volume = {30},
year = {1985},
pages = {222--234}
}
@ARTICLE{CKS81,
AUTHOR = {A. Chandra and D. Kozen and L. Stockmeyer},
TITLE = {Alternation},
JOURNAL = jacm,
VOLUME = {28},
YEAR = {1981},
PAGES = {114--133}
}
@article{CIV88,
author = {J. Chang and O. Ibarra and A. Vergis},
title = {On the power of one-way communication},
journal = jacm,
volume = {35},
year = {1988},
pages = {697--726}
}
@article{CIP89,
author = {J. Chang and O. Ibarra and M. Palis},
title = {Efficient simulations of simple models of parallel
computation by time-bounded {ATMs} and space-bounded {TM}s},
journal = tcs,
volume = {68},
year = {1989},
pages = {19--36}
}
@article{ChRa89,
author = {J. Chang and B. Ravikumar},
title = {Strong nondeterministic {T}uring reduction--a technique
for proving intractability},
journal = jcss,
volume = {39},
year = {1989},
pages = {nnn--nnn}
}
@inproceedings{ChKR91,
author = {R. Chang and J. Kadin and P. Rohatgi},
title = {Connections between the complexity of unique satisfiability
and the threshold behavior of randomized reductions},
booktitle = proc6 # structures,
year = {1991},
pages = {255--269},
note = jcss # ", to appear"
}
@inproceedings{CRS93,
author = {S.~Chari and P.~Rohatgi and A.~Srinivasan},
title = {Randomness-optimal unique element isolation, with
applications to perfect matching and related problems},
booktitle = proc25 # stoc,
year = {1993},
pages = {458--467}
}
@inproceedings{ChRo93,
author = {S. Chari and P. Rohatgi},
title = {On completeness under random reductions},
booktitle = proc8 # structures,
year = {1993},
pages = {176--184}
}
@phdthesis{Cha94,
author = {S. Chari},
title = {Randomness as a Computational Resource: Issues in
Efficient Computation},
school = {Cornell University, Computer Science Dept.},
year = {1994},
note = {Available as Cornell CS-TR-94-1449, August 31, 1994}
}
@inproceedings{CRS94,
author = {S.~Chari and P.~Rohatgi and A.~Srinivasan},
title = {Improved algorithms via approximations of probability
distributions},
booktitle = proc26 # stoc,
year = {1994},
pages = {584--592}
}
@inproceedings{ChRa92,
author = {S. Chaudhuri and J. Radhakrishnan},
title = {The complexity of parallel prefix problems on small
domains},
booktitle = proc33 # focs,
year = {1992},
pages = {638--647}
}
@inproceedings{CHLT93,
author = {S. Chaudhuri and M. Herlihy and N. Lynch and M. Tuttle},
title = {A tight lower bound for {$k$}-set agreement},
booktitle = proc34 # focs,
year = {1993},
pages = {206--215}
}
@article{ChMo85,
author = {B. Chazelle and L. Monier},
title = {A model of computation for {VLSI} with related complexity
results},
journal = jacm,
volume = {32},
year = {1985},
pages = {573--588}
}
@ARTICLE{ChYa91,
AUTHOR = {J. Chen and C. Yap},
TITLE = {Reversal complexity},
JOURNAL = sicomp,
VOLUME ={20},
YEAR = {1991},
PAGES = {622--638}
}
@article{ChHo92,
author = {R.-J. Chen and Y.-S. Hou},
title = {Non-associative parallel prefix computation},
journal = ipl,
volume = {44},
year = {1992},
pages = {91--94}
}
@article{ChFa91,
author = {W.-T. Chen and M.-Y. Fang},
title = {An efficient procedure for theorem proving in
propositional logic on vector computers},
journal = {Parallel Computing},
volume = {17},
year = {1991},
pages = {983--995}
}
@article{ChSa92,
author = {L. Cheng and A. Sawchuk},
title = {Three-dimensional {O}mega networks for optical
implementation},
journal = {Applied Optics},
volume = {31},
number = {26},
year = {1992},
pages = {5468--5479}
}
@ARTICLE{ChMa81,
AUTHOR = {P. Chew and M. Machtey},
TITLE = {A note on structure and looking-back applied to the
relative complexity of computable functions},
JOURNAL = jcss,
YEAR = {1981},
VOLUME = {22},
PAGES = {53--59}
}
@article{ChNi85,
author = {N. Chiba and T. Nishizeki},
title = {Arboricity and subgraph listing algorithms},
journal = sicomp,
volume = {14},
year = {1985},
pages = {210--223}
}
@ARTICLE{Cho77,
AUTHOR = {C. Choffrut},
TITLE ={Une caract\'erisation des fonctions s\'equentielles et des
fonctions sous-s\'equentielles en tant des relations rationelles},
JOURNAL = tcs,
VOLUME = {5},
YEAR = {1977},
PAGES = {325--337}
}
@ARTICLE{ChCu83,
AUTHOR = {C. Choffrut and K. Culik},
TITLE = {Properties of finite and pushdown transducers},
JOURNAL = sicomp,
YEAR = {1983},
PAGES = {300--315}
}
@inproceedings{ChGo85,
author = {B. Chor and O. Goldreich},
title = {Unbiased bits from sources of weak randomness and
probabilistic communication complexity},
booktitle = proc26 # focs,
year = {1985},
pages = {230--261}
}
@article{ChGo88,
author = {B. Chor and O. Goldreich},
title = {Unbiased bits from sources of weak randomness and
probabilistic communication complexity},
journal = sicomp,
volume = {17},
year = {1988},
pages = {230--261}
}
@article{Chr86,
author = {M. Chrobak},
title = {Hierarchies of one-way multihead automata languages},
journal = tcs,
volume = {48},
year = {1986},
pages = {153--181}
}
@article{CKR91,
author = {M. Chrobak and H. Karloff and T. Razdik},
title = {Connectivity vs. reachability},
journal = infcomp,
volume = {91},
year = {1991},
pages = {177--188}
}
%! Useful for "query computing with partial information queries".
@article{Cle91,
author = {R. Cleve},
title = {Towards optimal simulations of formulas by bounded-width
programs},
journal = {Computational Complexity},
volume = {1},
year = {1991},
pages = {91--105}
}
@INCOLLECTION{Clo90,
AUTHOR = {P. Clote},
TITLE = {Sequential, machine-independent characterizations of the
parallel complexity classes {$\ALOGTIME$, $\NC^1$, $AC^0$, and $\NC$}},
BOOKTITLE = {Feasible Mathematics},
EDITOR = {S. Buss and P. Scott},
PUBLISHER = {Birkh{\"a}user},
YEAR = {1990},
PAGES = {49--70}
}
@inproceedings{Clo90b,
author = {P. Clote},
title = {Bounded arithmetic and computational complexity},
booktitle = proc5 # structures,
year = {1990},
pages = {186--199}
}
@incollection{Clo90c,
author = {P. Clote},
title = {A smash-based hierarchy between {PTIME} and {PSPACE}},
booktitle = {Contemporary Mathematics},
publisher = {American Mathematical Society},
volume = {108},
year = {1990},
pages = {85--100}
}
@misc{Clo91,
author = {P. Clote},
title = {Stack-register machines, non-determinism, the linear time
hierarchy, and uniform boolean circuit classes},
year = {1991}
}
@article{ClTa92,
author = {P. Clote and G. Takeuti},
title = {Bounded arithmetic for {NC, ALogTIME, L, and NL}},
journal = {Annals of Pure and Applied Logic},
volume = {56},
year = {1992},
pages = {73--117}
}
@incollection{ClKr93,
author = {P. Clote and J. Kraj{\'\i\v{c}}ek},
title = {Some open problems in arithmetic, proof theory, and
computational complexity},
booktitle = {Arithmetic, Proof Theory, and Computational
Complexity},
editor = {P. Clote and J. Kraj{\'\i\v{c}}ek},
publisher = {Oxford University Press},
year = {1993},
pages = {2--19}
}
@inproceedings{Cob64,
author = {A. Cobham},
title = {The intrinsic computational difficulty of functions},
booktitle = {Proc.\ 1964 Congress for Logic, Mathematics,
and Philosophy of Science},
year = {1964},
pages = {24--30}
}
@article{CoGo90,
author = {J. Coffey and R. Goodman},
title = {Any code of which we cannot think is good},
journal = itit,
volume = {36},
year = {1990},
pages = {1453--1461}
}
@book{Coh91,
author = {D. Cohen},
title = {Introduction to Computer Theory (revised edition)},
publisher = {Wiley},
address = {New York},
year = {1991}
}
@inproceedings{CHZ94,
author = {G. Cohen and L. Huguet and G. Z{\'e}mor},
title = {Bounds on generalized weights},
booktitle = {Algebraic Coding---First French-Israeli Workshop,
Paris, July 1993},
series = lncs,
volume = {781},
publisher = springer,
year = {1994},
pages = {270--277}
}
@article{Cole77,
author = {R. Cole},
title = {Slowing down sorting networks to obtain faster sorting
algorithms},
journal = jacm,
volume = {34},
year = {1987},
pages = {200--208}
}
@article{Cole88,
author = {R. Cole},
title = {Parallel merge sort},
journal = sicomp,
volume = {17},
year = {1988},
pages = {770--785},
note = {Corrigendum in vol. 22, 1993, p1349}
}
@article{CoVi86,
author = {R. Cole and U. Vishkin},
title = {Deterministic coin tossing with applications to optimal
parallel list ranking},
journal = infcon,
volume = {70},
year = {1986},
pages = {32--53}
}
@article{CoVi88,
author = {R. Cole and U. Vishkin},
title = {Approximate parallel scheduling. Part {I}:
The basic technique with applications to optimal parallel list ranking in
logarithmic time},
journal = sicomp,
volume = {17},
year = {1988},
pages = {128--142}
}
@article{CoVi88b,
author = {R. Cole and U. Vishkin},
title = {The accelerated centroid decomposition technique for
optimal parallel tree evaluation in logarithmic time},
journal = {Algorithmica},
volume = {3},
year = {1988},
pages = {329--346}
}
@article{CoVi89,
author = {R.~Cole and U.~Vishkin},
title = {Faster optimal parallel prefix sums and list ranking},
journal = infcomp,
volume = {81},
year = {1989},
pages = {334--352}
}
@article{Cole69,
author = {S. Cole},
title = {Real-time computation by {$n$}-dimensional iterative
arrays of finite-state machines},
journal = {IEEE Transactions on Computing},
volume = {C--18},
year = {1969},
pages = {346--365}
}
@article{Cole71,
author = {S.~Cole},
title = {Deterministic pushdown store machines and realtime
computations},
journal = jacm,
volume = {18},
year = {1971},
pages = {306--328}
}
@ARTICLE{CoLF90,
AUTHOR = {K. Compton and C. LaFlamme},
TITLE = {An algebra and a logic for {$\NC^1$}},
JOURNAL = infcomp,
VOLUME = {87},
YEAR = {1990},
PAGES = {241--263}
}
@article{Con93,
author = {A. Condon},
title = {The complexity of the {M}ax {W}ord problem and the
power of one-way interactive proof systems},
journal = compcomp,
volume = {3},
year = {1993},
pages = {292--305}
}
@inproceedings{CHPW94,
author = {A. Condon and L. Hellerstein and S. Pottle and
A. Wigderson},
title = {On the power of finite automata with both nondeterministic
and probabilistic states},
booktitle = proc26 # stoc,
year = {1994},
pages = {676--685}
}
@article{Con90,
author = {M. Conner},
title = {Sequential machines realized by group representations},
journal = infcomp,
volume = {85},
year = {1990},
pages = {183--201}
}
@book{Nuprl86,
author = {R.L. Constable and S.F. Allen and H.M. Bromley and
W.R. Cleaveland and J.F. Cremer and R.W. Harper and D.J. Howe and
T.B. Knoblock and N.P. Mendler and P. Panangaden and J.T. Sasaki and
S.F. Smith},
title = {Implementing Mathematics with the Nuprl Proof
Development System},
publisher = {Prentice-Hall},
address = {Englewood Cliffs, NJ},
year = {1986}
}
@article{CoAa69,
author = {S. Cook and S. Aanderaa},
title = {On the minimum computation time of functions},
journal = trans-ams,
volume = {142},
year = {1969},
pages = {294--314}
}
@INPROCEEDINGS{Cook71c,
AUTHOR = {S. Cook},
TITLE = {Linear time simulation of deterministic two-way pushdown
automata},
BOOKTITLE = {Proceedings, IFIP '71},
PUBLISHER = {North--Holland},
YEAR = {1971},
PAGES = {75--80}
}
@article{Cook71b,
author = {S. Cook},
title = {Characterizations of pushdown machines in terms of
time-bounded computers},
journal = jacm,
volume = {18},
year = {1971},
pages = {4--18}
}
@inproceedings{Cook71,
author = {S. Cook},
title = {The complexity of theorem-proving procedures},
booktitle = proc3 # stoc,
year = {1971},
pages = {151--158}
}
@ARTICLE{CoRe73,
AUTHOR = {S. Cook and R. Reckhow},
TITLE = {Time bounded random access machines},
JOURNAL = jcss,
VOLUME = {7},
YEAR = {1973},
PAGES = {354--375}
}
@article{Cook74,
author = {S. Cook},
title = {An observation on time-storage trade off},
journal = jcss,
volume = {9},
year = {1974},
pages = {308--316}
}
@inproceedings{Cook75,
author = {S. Cook},
title = {Feasibly constructive proofs and the propositional
calculus},
booktile = proc7 # stoc,
year = {1975},
pages = {87--93}
}
@article{CoRe79,
author = {S. Cook and R. Reckhow},
title = {The relative efficiency of propositional proof systems},
journal = jsl,
volume = {44},
year = {1979},
pages = {36--50}
}
@article{Cook85,
author = {S.~Cook},
title = {A taxonomy of problems with fast parallel algorithms},
journal = infcon,
volume = {64},
year = {1985},
pages = {2--22}
}
@article{CoMcK87,
author = {S. Cook and P. McKenzie},
title = {Problems complete for deterministic logarithmic space},
journal = {Journal of Algorithms},
volume = {8},
year = {1987},
pages = {385--394}
}
@article{CoUr93,
author = {S. Cook and A. Urquhart},
title = {Functional interpretations of feasibly constructive
arithmetic},
journal = {Annals of Pure and Applied Logic},
volume = {63},
year = {1993}
}
@article{CCT87,
author = {W. Cook and C. Coullard and G. Tur{\'a}n},
title = {On the complexity of cutting-plane proofs},
journal = {Discrete Applied Mathematics},
volume = {18},
year = {1987},
pages = {25--38}
}
@article{CoWi90,
author = {D. Coppersmith and S. Winograd},
title = {Matrix multiplication via arithmetical progressions},
journal = {J. Symbolic Computation},
volume = {9},
year = {1990},
pages = {251--280}
}
@article{Cor90,
author = {J. Corcoran},
title = {Categoricity},
journal = {History of Philosophy and Logic},
volume = {1},
year = {1980},
pages = {187--207}
}
@book{CLR90,
author = {T. Cormen and C. Leiserson and R. Rivest},
title = {Introduction to Algorithms},
publisher = {MIT Press},
year = {1990}
}
@inproceedings{Cre93,
author = {N. Creignou},
title = {The class of problems that are linearly equivalent to
{S}atisfiability, or a uniform method for proving {NP}-completeness},
booktitle = proc6 # csl,
series = lncs,
volume = {702},
publisher = springer,
year = {1993},
pages = {115--133}
}
@article{CrSi93,
author = {P. Crescenzi and R. Silvestri},
title = {Average measure, descriptive complexity, and approximation
of maximization problems},
journal = ijfcs,
volume = {4},
year = {1993},
pages = {15--30}
}
@ARTICLE{CrPe91,
AUTHOR = {M. Crochemore and D. Perrin},
TITLE = {Two-way string matching},
JOURNAL = jacm,
VOLUME = {38},
YEAR = {1991},
PAGES = {651--675}
}
@article{CrRy91,
author = {M. Crochemore and W. Rytter},
title = {Usefulness of the {Karp-Miller-Rosenberg} algorithm
in parallel computations on strings and arrays},
journal = tcs,
volume = {88},
year = {1991},
pages = {59--82}
}
@techreport{CrSh93a,
author = {J. Crossley and J. Shepherdson},
title = {Extracting programs from proofs by an extension of the
{C}urry-{H}oward process: {Part I}},
institution = {Department of Mathematics, Monash University},
address = {Clayton, Victoria, Australia 3168},
number = {79a},
month = {March},
year = {1993}
}
@techreport{CrSh93b,
author = {J. Crossley and J. Shepherdson},
title = {Extracting programs from proofs by an extension of the
{C}urry-{H}oward process: {Part II}},
institution = {Department of Mathematics, Monash University},
address = {Clayton, Victoria, Australia 3168},
number = {79b},
month = {March},
year = {1993}
}
@inproceedings{CuRo93,
author = {F. Cucker and F. Rossell{\'o}},
title = {Recursiveness over the complex numbers is time-bounded},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {260--267}
}
@article{CGS84,
author = {K. Culik and J. Gruska and A. Salomaa},
title = {Systolic trellis automata},
journal = {Internat. J. Comput. Math.},
volume = {16},
year = {1984},
pages = {3--22}
}
@article{CuKa94,
author = {K. {Culik II} and J. Karhum{\"a}ki},
title = {Finite automata computing real functions},
journal = sicomp,
volume = {23},
year = {1994},
pages = {789--814}
}
@inproceedings{CKetal93,
author = {D. Culler and R. Karp and D. Patterson and A. Sahay
and K.E. Schauser and E. Santos and R. Subramonian and T. von Eicken},
title = {Log{P}: Towards a realistic model of parallel computation},
booktitle = proc4 # "ACM SIGPLAN",
year = {1993},
pages = {nnn--nnn}
}
@book{Cut80,
author = {N. Cutland},
title = {Computability},
publisher = {Cambridge University Press},
year = {1980}
}
@inproceedings{Damm90,
author = {C. Damm},
title = {The complexity of symmetric functions in parity normal forms},
booktitle = proc15 # mfcs,
series = lncs,
volume = {452},
publisher = springer,
year = {1990},
pages = {232--238}
}
@article{Damm90b,
author = {C. Damm},
title = {On problems complete for {$\oplus$L}},
journal = ipl,
volume = {36},
year = {1990},
pages = {247--250}
}
@article{DaMe92,
author = {C. Damm and C. Meinel},
title = {Separating complexity classes related to
{$\Omega$}-decision trees},
journal = tcs,
volume = {106},
year = {1992},
pages = {351--360}
}
@article{DFH92,
author = {N. Davidson and A. Friesem and E. Hasman},
title = {On the limits of optical interconnects},
journal = {Applied Optics},
volume = {31},
number = {26},
year = {1992},
pages = {5426--5430}
}
@article{Dav81,
author = {M. Davio},
title = {Kronecker products and shuffle algebra},
journal = {IEEE Transactions on Computers},
volume = {C-30},
month = {February},
year = {1981},
pages = {116--125}
}
@article{DeLu92,
author = {B. DeIaco and F. Luccio},
title = {Finding all the palindromes in a binary tree in
linear time and space},
journal = ipl,
volume = {44},
year = {1992},
pages = {73--77}
}
@article{DeLi78,
author = {R. DeMillo and R. Lipton},
title = {A Probabilistic Remark on Algebraic Program Testing},
journal = ipl,
year = {1978},
volume = {7},
pages = {193--195}
}
@inproceedings{DeLi79,
author = {R. DeMillo and R. Lipton},
title = {Some connections between mathematical logic and complexity
theory},
booktitle = proc11 # stoc,
year = {1979},
pages = {45--57}
}
@inproceedings{DeLi80,
author = {R. DeMillo and R. Lipton},
title = {The consistency of {``P=NP''} and related problems
with fragments of number theory},
booktitle = proc12 # stoc,
year = {1980},
pages = {45--57}
}
@article{DGS86,
author = {L. Denenberg and Y. Gurevich and S. Shelah},
title = {Definability by constant-depth polynomial-size circuits},
journal = infcon,
volume = {70},
year = {1986},
pages = {216--240}
}
@inproceedings{DePe92,
author = {A. De Santis and G. Persiano},
title = {Zero-knowledge proofs of knowledge without interaction},
booktitle = proc32 # focs,
year = {1992},
pages = {427--436}
}
@techreport{Dew81,
author = {A.K. Dewdney},
title = {Fast {T}uring reductions between problems in {NP}},
institution = {Department of Computer Science, University
of Western Ontario},
address = {London, Ontario, Canada N6A 5B9},
year = {1981},
note = {Reports \#68--\#76, subtitled as chapters 1--9,
the last four in 1982--1984}
}
@article{Dew82,
author = {A.K. Dewdney},
title = {Linear time transformations between combinatorial
problems},
journal = ijcm,
volume = {11},
year = {1982},
pages = {91--110}
}
@inproceedings{Dew89,
author = {A.K. Dewdney},
title = {Fast {T}uring reductions of combinatorial problems
and their algorithms},
booktitle = {Combinatorial Mathematics: Proceedings of the
Third International Conference},
editor = {G. Bloom and R. Graham and J. Malkevitch},
series = {Annals of the New York Academy of Sciences},
volume = {555},
year = {1989},
pages = {171--180}
}
@article{DiTo90,
author = {J. D{\'i}az and J. Tor{\'a}n},
title = {Classes of bounded nondeterminism},
journal = mst,
volume = {23},
year = {1990},
pages = {21--32}
}
@techreport{DSZ93,
author = {P. Dietz and J. Seiferas and J. Zhang},
title = {A tight lower bound for on-line monotonic list labeling},
institution = {Computer Science, University of Rochester},
number = {478},
month = {November},
year = {1993}
}
@techreport{DMS93,
author = {P. Dietz and I. Macarie and J. Seiferas},
title = {Bits and relative order from residues,
space efficiently},
institution = {Computer Science, University of Rochester},
number = {464},
month = {October},
year = {1993}
}
@ARTICLE{DMS91,
AUTHOR = {M. Dietzfelbinger and W. Maass and G. Schnitger},
TITLE = {The complexity of matrix transposition on one-tape off-line
{Turing} machines},
JOURNAL = tcs,
VOLUME = {82},
YEAR = {1991},
PAGES = {113--129}
}
@inproceedings{DGMP92,
author = {M. Dietzfelbinger and J. Gil and Y. Matias and
N. Pippenger},
title = {Polynomial hash functions are reliable},
booktitle = proc19 # icalp,
PUBLISHER = springer,
SERIES = lncs,
VOLUME = {623},
YEAR = {1992},
PAGES = {235--246}
}
@article{DiMa93,
author = {M. Dietzfelbinger and W. Maass},
title = {The complexity of matrix transposition on one-tape off-line
Turing machines with output tape},
journal = tcs,
volume = {108},
year = {1993},
pages = {271--290}
}
@inproceedings{Die93,
author = {M. Dietzfelbinger},
title = {Simulations between different models of parallel computers},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {16--30}
}
@article{DoFe92,
author = {D. Dolev and T. Feder},
title = {Determinism vs. nondeterminism in multiparty communication
complexity},
journal = sicomp,
volume = {21},
year = {1992},
pages = {889--895}
}
@book{Doob,
author = {J. Doob},
title = {Measure Theory},
publisher = springer,
address = {New York},
year = {1991}
}
@book{Doob91,
author = {J. Doob},
title = {Measure Theory},
publisher = springer,
address = {New York},
year = {1991}
}
@unpublished{Dowd85,
author = {M. Dowd},
title = {Model-theoretic aspects of {$\P \neq \NP$}},
year = {1985},
note = {Typewritten manuscript}
}
@misc{Dowd86,
author = {M. Dowd},
title = {Notes on log space representation},
year = {1986},
note = "Typewritten manuscript"
}
@inproceedings{DoFe92a,
author = {R. Downey and M. Fellows},
title = {Fixed-parameter intractability (extended abstract)},
booktitle = proc7 # structures,
year = {1992},
pages = {36--49},
note = sicomp # ", to appear"
}
@misc{DoFeI,
author = {R. Downey and M. Fellows},
title = {Fixed-parameter tractability and completeness {I}: Basic
results},
year = {1992},
note = sicomp # ", to appear"
}
@misc{DoFeII,
author = {R. Downey and M. Fellows},
title = {Fixed-parameter tractability and completeness {II}:
On completeness for {W[1]}},
year = {1992},
note = tcs # ", to appear"
}
@misc{DoFe92II,
author = {R. Downey and M. Fellows},
title = {Fixed-parameter tractability and completeness {II}:
On completeness for {W[1]}},
year = {1992},
note = tcs # ", to appear"
}
@incollection{DoFe93III,
author = {R. Downey and M. Fellows},
title = {Fixed-parameter tractability and completeness {III}:
{S}ome structural aspects of the {$W$} hierarchy},
booktitle = {Complexity Theory: Current Research},
editor = {K. A{mbos-Spies} and S. Homer and U. Sch{\"o}ning},
publisher = {Cambridge Univ. Press},
year = {1993},
pages = {191--226}
}
@inproceedings{DEF93,
author = {R. Downey and P. Evans and M. Fellows},
title = {Parameterized learning complexity},
booktitle = proc6 # colt,
year = {1993},
pages = {51--57}
}
@inproceedings{DFKHW94,
author = {R. Downey and M. Fellows and B. Kapron and
M. Hallett and H. Wareham},
title = {The parameterized complexity of some problems in
logic and linguistics},
booktitle = proc3 # lfcs,
series = lncs,
publisher = springer,
year = {1994},
note = "to appear"
}
@incollection{DoFe94,
author = {R. Downey and M. Fellows},
title = {Parameterized computational feasibility},
booktitle = {Feasible Mathematics II},
publisher = {Birkh{\"a}user},
year = {1994},
note = "to appear"
}
@inproceedings{DMRT93,
author = {D. Dubhashi and K. Mehlhorn and D. Ranjan and C. Thiel},
title = {Searching, sorting, and randomised algorithms for
central elements and ideal counting in posets},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {436--443}
}
@inproceedings{DuZw92,
author = {M. Dubiner and U. Zwick},
title = {Amplification and percolation},
booktitle = proc33 # focs,
year = {1990},
pages = {258--267}
}
@book{Dun88,
author = {P. Dunne},
title = {The Complexity of Boolean Networks},
publisher = {Academic Press},
address = {San Diego},
year = {1988}
}
@INPROCEEDINGS{DGPR83,
AUTHOR = {P. D{\=u}ri{\=s} and Z. Galil and W. Paul and R. Reischuk},
TITLE = {Two nonlinear lower bounds},
BOOKTITLE = proc15 # stoc,
YEAR = {1983},
PAGES = {127--132}
}
@article{DGPR84,
author = {P. D{\=u}ri{\=s} and Z. Galil and W. Paul and R. Reischuk},
title = {Two nonlinear lower bounds for on-line computations},
journal = infcon,
volume = {60},
year = {1984},
pages = {1--11}
}
@ARTICLE{DuGa84,
AUTHOR = {P. D{\=u}ris and Z. Galil},
TITLE = {A time--space tradeoff for language recognition},
JOURNAL = mathsys,
VOLUME = {17},
YEAR = {1984},
PAGES = {3--17}
}
@article{Dyer80,
author = {C. Dyer},
title = {One-way bounded cellular automata},
journal = infcon,
volume = {44},
year = {1980},
pages = {261--281},
}
@article{Dym87,
author = {P. Dymond},
title = {Input-driven languages are in {$\log n$} depth},
journal = ipl,
volume = {26},
year = {1987/88},
pages = {247--250}
}
@article{DyTo85,
author = {P. Dymond and M. Tompa},
title = {Speedups of deterministic machines by synchronous parallel
machines},
journal = jcss,
volume = {30},
year = {1985},
pages = {149--161}
}
@article{DyCo89,
author = {P. Dymond and S. Cook},
title = {Complexity theory of parallel time and hardware},
journal = infcomp,
volume = {80},
year = {1989},
pages = {205--226}
}
@article{Ebe89,
author = {W. Eberly},
title = {Very fast parallel polynomial arithmetic},
journal = sicomp,
volume = {18},
year = {1989},
pages = {955--976}
}
@techreport{EdEl81,
author = {C. Edwards and C. Elphick},
title = {Lower bounds for the clique and chromatic numbers of a graph},
institution = {Dept. of Engineering Production, Univ. of Birmingham},
year = {1981}
}
@book{Eil76,
author = {S. Eilenberg},
title = {Automata, Languages, and Machines, Vols. A-B},
publisher = {Academic Press},
address = {New York},
year = {1976}
}
@inproceedings{ElGOr84,
author = {A. {El Gamal} and A. Orlitsky},
title = {Interactive data compression},
booktitle = proc25 # focs,
year = {1984},
pages = {100--108}
}
@article{ElRo64,
author = {C. Elgot and A. Robinson},
title = {Random-access stored-program machines},
journal = jacm,
volume = {11},
year = {1964},
pages = {365--399}
}
@article{EnSk76,
author = {J. Engelfriet and S. Skyum},
title = {Copying theorems},
journal = ipl,
volume = {4},
year = {1976},
pages = {157--161}
}
@article{EnSk82,
author = {J. Engelfriet and S. Skyum},
title = {The copying power of one-state tree transducers},
journal = jcss,
volume = {25},
year = {1982},
pages = {418--435}
}
@article{Eng89,
author = {J. Engelfriet},
title = {The power of two-way deterministic checking stack
automata},
journal = infcomp,
volume = {80},
year = {1989},
pages = {114--120}
}
@article{Epp90,
author = {D. Eppstein},
title = {Reset sequences for monotonic automata},
journal = sicomp,
volume = {19},
year = {1990},
pages = {500--510}
}
@inproceedings{EvSc93,
author = {W. Evans and L. Schulman},
title = {Signal propagation, with application to a lower bound
on the depth of noisy formulas},
booktitle = proc34 # focs,
year = {1993},
pages = {594--603}
}
@article{ELY82,
author = {S. Even and T. Long and Y. Yacobi},
title = {A note on deterministic and nondeterministic time complexity},
journal = infcon,
volume = {55},
year = {1982},
pages = {117--124}
}
@article{ESY84,
author = {S. Even and A. Selman and Y. Yacobi},
title = {The complexity of promise problems, with applications
to public-key cryptography},
journal = infcon,
volume = {61},
year = {1984},
pages = {159--173}
}
@article{EvLi94,
author = {S. Even and A. Litman},
title = {On the capabilities of systolic systems},
journal = mathsys,
volume = {27},
year = {1994},
pages = {3--28}
}
@article{FSRS91,
author = {E. Fachini and A. Maggiolo Schettini and G. Resta and
D. Sangiorgio},
title = {Nonacceptability criteria and closure properties for
the class of languages accepted by binary systolic tree automata},
journal = tcs,
volume = {83},
year = {1991},
pages = {249--260}
}
@incollection{Fag74,
author = {R. Fagin},
title = {Generalized first-order spectra and polynomial-time
recognizable sets},
booktitle = {Complexity of Computation: Proceedings of a
Symposium in Applied Mathematics of the American Mathematical Society
and the Society for Industrial and Applied Mathematics, Vol.\ VII},
editor = {R. Karp},
publisher = {SIAM-AMS},
year = {1974},
pages = {43--73}
}
@techreport{FKPS83,
author = {R. Fagin and M. Klawe and N. Pippenger and L. Stockmeyer},
title = {Bounded depth, polynomial size circuits for symmetric
functions},
institution = {IBM Research Division},
number = {RJ 4040 (45198)},
address = {San Jos\'e, California},
year = {1983}
}
@article{Fag93,
author = {R. Fagin},
title = {Finite model theory---a personal perspective},
journal = tcs,
volume = {116},
year = {1993},
pages = {3--31}
}
@inproceedings{FSV93,
author = {R. Fagin and L. Stockmeyer and M. Vardi},
title = {On monadic {NP} vs. monadic co-{NP}},
booktitle = proc8 # structures,
year = {1993},
pages = {19--30}
}
@misc{Farr85,
author = {G. Farr},
title = {On problems with short certificates},
year = {1985}
}
@article{Farr93c,
author = {G. Farr},
title = {A correlation inequality involving stable set and
chromatic polynomials},
journal = {Journal of Combinatorial Theory, Ser. B},
volume = {58},
year = {1993},
pages = {14--21}
}
@article{Farr93g,
author = {G. Farr},
title = {A generalization of the {W}hitney rank generating function},
journal = {Math. Proc. Camb. Phil. Soc.},
volume = {113},
year = {1993},
pages = {267--280}
}
@article{Fed89,
author = {T. Feder},
title = {reliable computation by networks in the presence of noise},
journal = itit,
volume = {35},
year = {1989},
pages = {569--571}
}
@article{FMG91,
author = {M. Feder and N. Merhav and M. Gutman},
title = {Universal prediction of individual sequences},
journal = itit,
volume = {38},
year = {1991},
pages = {1258--1270}
}
@article{Fef60,
author = {S. Feferman},
title = {Arithmetization of metamathematics in a general setting},
journal = {Fundamenta Mathematicae},
volume = {49},
year = {1960},
pages = {35--92}
}
@article{Fei92,
author = {U. Feige},
title = {On the complexity of finite random functions},
journal = ipl,
volume = {44},
year = {1992},
pages = {295--296}
}
@article{FeFo93,
author = {J. Feigenbaum and L. Fortnow},
title = {Random-self-reducibility of complete sets},
journal = sicomp,
volume = {22},
year = {1993},
pages = {994--1005}
}
@book{Fei88,
author = {D. Feitelson},
title = {Optical Computing},
publisher = {MIT Press},
year = {1988}
}
@article{FeSh92,
author = {Y. Feldman and E. Shapiro},
title = {Spatial machines: A more-realistic approach to
parallel computation},
journal = cacm,
volume = {35},
year = {1992},
month = {October},
pages = {60--73}
}
@inproceedings{FeKo92,
author = {M. Fellows and N. Koblitz},
title = {Self-witnessing polynomial-time complexity and prime
factorization},
booktitle = proc7 # structures,
year = {1992},
pages = {107--109}
}
@article{FeLa88,
author = {M. Fellows and M. Langston},
title = {Nonconstructive tools for proving polynomial-time
decidability},
journal = jacm,
volume = {35},
year = {1988},
pages = {727--739}
}
@inproceedings{FeLa89,
author = {M. Fellows and M. Langston},
title = {On search, decision, and the efficiency of polynomial-time
algorithms},
booktitle = proc21 # stoc,
year = {1989},
pages = {501--512},
note = {Final version to appear in {\it J. Comput. Sys. Sci.}}
}
@inproceedings{FeLa89b,
author = {M. Fellows and M. Langston},
title = {An analogue of the {Myhill-Nerode} theorem and its use in
computing finite basis characterizations},
booktitle = proc30 # focs,
year = {1989},
pages = {520--525}
}
@inproceedings{FeLa92,
author = {M. Fellows and M. Langston},
title = {On well-partial-order theory and its application to
combinatorial problems of {VLSI} design},
journal = {SIAM Journal on Discrete Mathematics},
volume = {5},
year = {1992},
pages = {117--126}
}
@article{FeRa93,
author = {G.-L. Feng and T.R.N. Rao},
title = {Decoding algebraic=geometric codes up to the
designed minimum distance},
journal = itit,
volume = {39},
number = {1},
year = {1993},
month = {January},
pages = {37--45}
}
@inproceedings{FKR89,
author = {S. Fenner and S. Kurtz and J. Royer},
title = {Every polynomial-time 1-degree collapses iff
{P = PSPACE}},
booktitle = proc30 # focs,
year = {1989},
pages = {624--689}
}
@inproceedings{FFK91,
author = {S. Fenner and L. Fortnow and S. Kurtz},
title = {Gap-definable counting classes},
booktitle = proc6 # structures,
year = {1991},
pages = {30--42}
}
@inproceedings{FFK92,
author = {S. Fenner and L. Fortnow and S. Kurtz},
title = {The {I}somorphism {C}onjecture holds relative to
an oracle},
booktitle = proc33 # focs,
year = {1992},
pages = {30--39},
}
@inproceedings{FFL93,
author = {S. Fenner and L. Fortnow and L. Li},
title = {Gap-definability as a closure property},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {484--493}
}
@inproceedings{FHOS93,
author = {S. Fenner and S. Homer and M. Ogiwara and A. Selman},
title = {On using oracles that compute values},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {398--407}
}
@techreport{Fen94,
author = {S. Fenner},
title = {On inverting the {T}uring jump in complexity theory},
institution = {Department of Computer Science, University of
Southern Maine},
number = {94-3-11},
month = {March},
year = {1994}
}
@inproceedings{Fich83,
author = {F. Fich},
title = {New bounds for parallel prefix circuits},
booktitle = proc15 # stoc,
year = {1983},
pages = {100--109}
}
@inproceedings{FIKKK93,
author = {F. Fich and R. Impagliazzo and B. Kapron and V. King and M. Kutylowski},
title = {Limits on the power of parallel random access machines
with weak froms of write conflict resolution},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {386--397}
}
@incollection{Fich93,
author = {F. Fich},
title = {The complexity of computation on the parallel random access
machine},
booktitle = {Synthesis of Parallel Algorithms},
editor = {J. Reif},
publisher = {Morgan Kaufman},
year = {1993}
}
@article{Fis65,
author = {P. Fischer},
title = {Theory of provably recursive functions},
journal = trans-ams,
volume = {117},
year = {1965},
pages = {494--520}
}
@INPROCEEDINGS{FiRo68,
AUTHOR = {M. Fischer and A. Rosenberg},
TITLE = {Limited random access {Turing} machines},
BOOKTITLE = proc9 # "Annual IEEE Symposium on Switching and Automata Theory (now FOCS)",
YEAR = {1968},
PAGES = {356--367}
}
@ARTICLE{FMR72,
AUTHOR = {P. Fischer and A. Meyer and A. Rosenberg},
TITLE = {Real-time simulations of multihead tape units},
JOURNAL = jacm,
VOLUME = {19},
YEAR = {1972},
PAGES = {590--607}
}
@incollection{FiPa74,
author = {M. Fischer and M. Paterson},
title = {String matching and other products},
booktitle = {Complexity of Computation},
editor = {R. Karp},
series = {SIAM-AMS Proceedings},
publisher = {Amer. Math. Soc.},
volume = {7},
year = {1974},
pages = {113--125}
}
@article{Fis88,
author = {D. Fisher},
title = {Your favorite parallel algorithms might not be as fast
as you think},
journal = {IEEE Transactions on Computers},
volume = {37},
number = {2},
year = {1988},
pages = {211--213}
}
@article{FlKn90,
author = {R. Floyd and D. Knuth},
title = {Addition machines},
journal = sicomp,
volume = {19},
year = {1990},
pages = {329--340}
}
@book{For66,
author = {G. Forney},
title = {Concatenated Codes},
publisher = {MIT Press},
year = {1966}
}
@inproceedings{For87,
author = {L. Fortnow},
title = {The complexity of perfect zero-knowledge},
booktitle = proc19 # stoc,
year = {1987},
pages = {204--209}
}
@inproceedings{FoSi89,
author = {L. Fortnow and M. Sipser},
title = {Probabilistic computation and linear time},
booktitle = proc21 # stoc,
year = {1989},
pages = {148--156}
}
@inproceedings{FoLu91,
author = {L. Fortnow and C. Lund},
title = {Interactive proof systems and alternating time-space
complexity},
booktitle = proc8 # stacs,
series = lncs,
volume = {480},
publisher = springer,
year = {1991},
pages = {263--274}
}
@inproceedings{FoRe91,
author = {L. Fortnow and N. Reingold},
title = {{PP} is closed under truth-table reductions},
booktitle = proc6 # structures,
year = {1991},
pages = {13--15}
}
@article{FoSz92,
author = {L. Fortnow and M. Szegedy},
title = {On the power of two-local random reductions},
journal = ipl,
volume = {44},
year = {1992},
pages = {303--306}
}
@techreport{FoRo93,
author = {L. Fortnow and J. Rogers},
title = {Separability and one-way functions},
institution = {University of Chicago},
number = {CS93-14},
month = {August},
year = {1993}
}
@inproceedings{FoWh94,
author = {L. Fortnow and D. Whang},
title = {Optimality and domination in repeated games with
bounded players},
booktitle = proc26 # stoc,
year = {1994},
pages = {741--749}
}
@article{FLO83,
author = {S. Fortune and M. O{'Donnell} and D. Leivant},
title = {The expressiveness of simple and second-order
type structures},
journal = jacm,
volume = {30},
year = {1983},
pages = {151--185}
}
@article{Fra84,
author = {J. Franco},
title = {Sensitivity of probabilistic results on algorithms for
{NP}-complete problems to input distributions},
journal = sigact,
volume = {17},
number = {1},
year = {1984},
pages = {40--59}
}
@article{FVB94,
author = {G. Frandsen and M. Valence and D. Mix Barrington},
title = {Some results on uniform arithmetic circuit complexity},
journal = mst,
volume = {27},
year = {1994},
pages = {105--124}
}
@inproceedings{FrWi90,
author = {M. Fredman and D. Willard},
title = {{BLASTING} through the information theoretic barrier with
FUSION TREES},
booktitle = proc22 # stoc,
year = {1990},
pages = {1--7}
}
@article{FrWi93,
author = {M. Fredman and D. Willard},
title = {Surpassing the information theoretic bound with
fusion trees},
journal = jcss,
volume = {47},
year = {1993},
pages = {nnn--nnn}
}
@article{Fri75,
author = {H. Friedman},
title = {The disjunction property implies the numeric
existence property},
journal = {Proc. Nat. Acad. Sci.},
volume = {72},
year = {1975},
pages = {1277--1278}
}
@incollection{Fri78,
author = {H. Friedman},
title = {Classically and intuitionistically provably recursive
functions},
booktitle = {Higher Set Theory},
editor = {G. Muller and D. Scott},
series = lnm,
volume = {669},
publisher = springer,
year = {1978},
pages = {21--28}
}
@inproceedings{FKS89,
author = {J. Friedman and J. Kahn and E. Szemer{\'e}di},
title = {On the second eigenvalue in random regular graphs},
booktitle = proc21 # stoc,
year = {1989},
pages = {587--598}
}
@article{Fro91,
author = {C. Frougny},
title = {Fibonacci representations and finite automata},
journal = itit,
volume = {37},
number = {2},
month = {March},
year = {1991},
pages = {393--399}
}
@inproceedings{FrSa91,
author = {C. Frougny and J. Sakarovitch},
title = {Rational relations with bounded delay},
booktitle = proc8 # stacs,
series = lncs,
volume = {480},
publisher = springer,
year = {1991},
pages = {50--63}
}
@article{Fro92,
author = {C. Frougny},
title = {Confluent linear numeration systems},
journal = tcs,
volume = {106},
year = {1992},
pages = {183--219}
}
@INPROCEEDINGS{Fur82,
AUTHOR = {M. F{\"u}rer},
TITLE = {The tight deterministic time hierarchy},
BOOKTITLE = proc14 # stoc,
YEAR = {1982},
PAGES = {8--16}
}
@article{Fur84,
author = {M. F{\"u}rer},
title = {Data structures for distributed counting},
journal = jcss,
volume = {29},
year = {1984},
pages = {231--243}
}
@inproceedings{FSS81,
author = {M. Furst and J. Saxe and M. Sipser},
title = {Parity, circuits, and the polynomial-time hierarchy},
booktitle = proc22 # focs,
year = {1981},
pages = {260--270}
}
@article{FSS84,
author = {M. Furst and J. Saxe and M. Sipser},
title = {Parity, circuits, and the polynomial-time hierarchy},
journal = mathsys,
volume = {17},
year = {1984},
pages = {13--27}
}
@inproceedings{GaDi82,
author = {H. Gaifman and M. Dimitricopoulos},
title = {Fragments of {P}eano's {A}rithmetic and the {MRDP} theorem},
booktitle = {Logic and Algorithmic: An International Symposium
Held in Honour of Ernst Specker, L'Enseignement Mathematique, University
of Geneva},
year = {1982}
}
@ARTICLE{Gal76,
AUTHOR = {Z. Galil},
TITLE = {Two fast simulations which imply some fast string matching and
palindrome-recognition algorithms},
JOURNAL = ipl,
VOLUME = {4},
NUMBER = {4},
YEAR = {1976},
PAGES = {85--87}
}
@inproceedings{Gal91,
author = {A. G{\'a}l},
title = {Lower bounds for the complexity of reliable {B}oolean circuits
with noisy gates},
booktitle = proc32 # focs,
year = {1991},
pages = {594--601}
}
@article{Gal76b,
author = {Z. Galil},
title = {Hierarchies of complete problems},
journal = {Acta Informatica},
volume = {6},
year = {1976},
pages = {77--88}
}
@ARTICLE{Gal77,
AUTHOR = {Z. Galil},
TITLE = {Some open problems in the theory of computation as questions
about two--way deterministic pushdown automaton languages},
JOURNAL = mathsys,
VOLUME = {10},
YEAR = {1977},
PAGES = {211--228}
}
@ARTICLE{GaSe78,
AUTHOR = {Z. Galil and J. Seiferas},
TITLE = {A linear-time on--line algorithm for `Palstar'},
JOURNAL = jacm,
VOLUME = {25},
YEAR = {1978},
PAGES = {102--110}
}
@ARTICLE{GaSe83,
AUTHOR = {Z. Galil and J. Seiferas},
TITLE = {Time-space optimal string matching},
JOURNAL = jcss,
VOLUME = {26},
YEAR = {1983},
PAGES = {280--294}
}
@article{GaIt91,
author = {Z. Galil and G. Italiano},
title = {Data structures and algorithms for disjoint set
union problems},
journal = {ACM Computing Surveys},
volume = {nnn},
year = {1991},
pages = {319--344}
}
@article{GaHa69,
author = {H. Gallaire and M. Harrison},
title = {Decompositions of linear sequential machines},
journal = mst,
volume = {3},
year = {1969},
pages = {246--287}
}
@inproceedings{Gan92,
author = {K. Ganesan},
title = {One-way functions and the isomorphism conjecture},
booktitle = proc12 # fsttcs,
year = {1992},
pages = {nnn--nnn}
}
@book{GJ79,
author = {M. Garey and D.S. Johnson},
title = {Computers and Intractability: A Guide to the Theory
of NP-Completeness},
publisher = {Freeman},
year = {1979}
}
@article{GaZa91,
author = {M. Garzon and Y. Zalcstein},
title = {On isomorphism testing of a class of 2-nilpotent groups},
journal = jcss,
volume = {42},
year = {1991},
pages = {237--248}
}
@article{vzGGi90,
author = {J. von zur Gathen and M. Giesbrecht},
title = {Constructing normal bases in finite fields},
journal = {J. Symb. Comput.},
volume = {10},
year = {1990},
pages = {547--570}
}
@inproceedings{vzG91,
author = {J. von zur Gathen},
title = {Efficient exponentiation in finite fields},
booktitle = proc32 # focs,
year = {1991},
pages = {384--391}
}
@article{vzGSe91,
author = {J. von zur Gathen and G. Seroussi},
title = {Boolean circuits versus arithmetic circuits},
journal = infcomp,
volume = {91},
year = {1991},
pages = {142--154}
}
@incollection{GMT90,
author = {H. Gazit and G. Miller and S. Teng},
title = {Optimal tree contraction in the {EREW} model},
booktitle = {Concurrent Computations},
editor = {S. Tewksbury and B. Dickinson and S. Schwartz},
publisher = {Plenum},
year = {1990},
pages = {139--156}
}
@inproceedings{GeNa93,
author = {P. Gemmell and M. Naor},
title = {Codes for interactive authentication},
booktitle = {Proceedings, EUROCRYPT '93},
year = {1993},
pages = {nnn--nnn}
}
@inproceedings{Gen93,
author = {R. Gengler},
title = {Multicounter automata with sublogarithmic reversal bounds},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {408--417}
}
@article{GeKr92,
author = {M. Ger{\'e}b-Graus and D. Krizanc},
title = {The average complexity of parallel comparison merging},
journal = sicomp,
volume = {21},
year = {1992},
pages = {43--47}
}
@techreport{GeMe92,
author = {J. Gergov and C. Meinel},
title = {Efficient analysis and manipulation of {OBDDs} can be extended
to read-once-only branching programs},
institution = {Universit\"at Trier, Mathematik/Informatik},
number = {Forschungsbericht 92--10},
year = {1992}
}
@inproceedings{GeMe93,
author = {J. Gergov and C, Meinel},
title = {Frontiers of feasible and probabilistic feasible {Boolean}
manipulation with branching programs},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {576--585}
}
@article{Gill77,
author = {J. Gill},
title = {Computational complexity of probabilistic {T}uring machines},
journal = sicomp,
volume = {6},
year = {1977},
pages = {675--695}
}
@article{Gis81,
author = {J. Gischer},
title = {Shuffle languages, {P}etri nets, and context-sensitive
grammars},
journal = cacm,
volume = {24},
year = {1981},
month = {September},
pages = {597--605}
}
@article{GoSi91,
author = {A. Goldberg and M. Sipser},
title = {Compression and ranking},
journal = sicomp,
volume = {20},
year = {1991},
pages = {}
}
@techreport{GoJe92,
author = {L. Goldberg and M. Jerrum},
title = {A sub-logarithmic communication algorithm for the
completely connected optical communication parallel computer},
institution = {Laboratory for Foundations of Computer Science},
address = {Department of Computer Science, The University of
Edinburgh},
number = {ECS-LFCS-92-234},
month = {September},
year = {1992}
}
@article{GHR92,
author = {M. Goldmann and J. H{\aa}stad and A. Razborov},
title = {Majority gates vs.\ general weighted threshold gates},
journal = compcomp,
volume = {2},
year = {1992},
pages = {277--300}
}
@inproceedings{GoKa93,
author = {M. Goldmann and M. Karpinski},
title = {...},
booktitle = proc25 # stoc,
year = {1993},
pages = {nnn--nnn}
}
@article{GGH94,
author = {M. Goldmann and P. Grape and J. H{\aa}stad},
title = {On average time hierarchies},
journal = ipl,
volume = {49},
year = {1994},
pages = {15--20}
}
@article{GGM86,
author = {O. Goldreich and S. Goldwasser and S. Micali},
title = {How to construct random functions},
journal = jacm,
volume = {33},
year = {1986},
pages = {792--807}
}
@inproceedings{GMS87,
author = {O. Goldreich and Y. Mansour and M. Sipser},
title = {Interactive proof systems: provers that never
fail and random selection},
booktitle = proc28 # focs,
year = {1987},
pages = {449--461}
}
@inproceedings{GoLe89,
author = {O. Goldreich and L. Levin},
title = {A hard-core predicate for all one-way functions},
booktitle = proc21 # stoc,
year = {1989},
pages = {25--32}
}
@article{GMW91,
author = {O. Goldreich and S. Micali and A. Wigderson},
title = {Proofs that yield nothing but their validity, or
{All} languages in {NP} have zero-knowledge proof systems},
journal = jacm,
volume = {38},
year = {1991},
pages = {691--729}
}
@article{GKL93,
author = {O. Goldreich and H. Krawczyk and M. Luby},
title = {On the existence of pseudorandom generators},
journal = sicomp,
volume = {22},
year = {1993},
pages = {1163--1175}
}
@inproceedings{GOP94,
author = {O. Goldreich and R. Ostrovsky and E. Petrank},
title = {Computational complexity and knowledge complexity},
booktitle = proc26 # stoc,
year = {1994},
pages = {534--543}
}
@inproceedings{GoWi94,
author = {O. Goldreich and A. Wigderson},
title = {Tiny families of functions with random properties: a
quality-size tradeoff for hashing},
booktitle = proc26 # stoc,
year = {1994},
pages = {574--583}
}
@article{Gol82,
author = {L. Goldschlager},
title = {A universal interconnection pattern for parallel
computers},
journal = jacm,
volume = {29},
year = {1982},
pages = {1073--1086}
}
@article{GoPa86,
author = {L. Goldschlager and I. Parberry},
title = {On the construction of parallel computers from various
bases of Boolean functions},
journal = tcs,
volume = {21},
year = {1986},
pages = {43--58}
}
@inproceedings{GoJo86,
author = {J. Goldsmith and D. Joseph},
title = {Three results on polynomial-time isomorphism of {NP}-complete
sets},
booktitle = proc27 # focs,
year = {1986},
pages = {390--397}
}
@article{GHK92,
author = {J. Goldsmith and L. Hemachandra and K. Kunen},
title = {Polynomial-time compression},
journal = {Computational Complexity},
volume = {2},
year = {1992},
pages = {}
}
@article{GHJY93,
author = {J. Goldsmith and L. Hemachandra and D. Joseph and P. Young},
title = {Near-testable sets},
journal = sicomp,
volume = {20},
year = {1991},
pages = {nnn--nnn}
}
@article{GJY93,
author = {J. Goldsmith and D. Joseph and P. Young},
title = {Using self-reducibilities to characterize polynomial time},
journal = infcomp,
volume = {104},
year = {1993},
pages = {nnn--nnn}
}
@article{GJY93b,
author = {J. Goldsmith and D. Joseph and P. Young},
title = {A note on bi-immunity and p-closeness of p-cheatable sets
in {P/Poly}},
journal = jcss,
volume = {46},
year = {1993},
pages = {nnn--nnn}
}
@article{GoJo93,
author = {J. Goldsmith and D. Joseph},
title = {Relativized isomorphisms of {NP}-completeness},
journal = compcomp,
volume = {3},
year = {1993},
pages = {186--205}
}
@article{GMR89,
author = {S. Goldwasser and S. Micali and C. Rackoff},
title = {The knowledge complexity of interactive proof systems},
journal = sicomp,
volume = {18},
year = {1989},
pages = {186--208}
}
@article{Good71,
author = {I.J. Good},
title = {The relationship between tow fast {F}ourier transforms},
journal = ieeetc,
volume = {C-20},
year = {1971},
pages = {310--317}
}
@article{Gor79,
author = {D. Gordon},
title = {Complexity classes of provably recursive functions},
journal = jcss,
volume = {18},
year = {1979},
pages = {294--308}
}
@inproceedings{Got93,
author = {G. Gottlob},
title = {{NP} trees and {C}arnap's Modal Logic},
booktitle = proc34 # focs,
year = {1993},
pages = {42--51}
}
@techreport{GJM94,
author = {K. Govindarajan and B. Jayaraman and S. Mantha},
title = {Preference logic programming: Optimization as inference},
institution = {Department of Computer Science, University
at Buffalo},
number = {UB-CS TR 94-12},
month = {April},
year = {1994}
}
@techreport{GoJa94,
author = {K. Govindarajan and B. Jayaraman},
title = {Intensional algorithmic debugging (perliminary version},
institution = {Department of Computer Science, University
at Buffalo},
number = {UB-CS TR 94-13},
month = {April},
year = {1994}
}
@ARTICLE{Gra90,
AUTHOR = {E. Graedel},
TITLE = {On the notion of linear-time computability},
JOURNAL = ijfcs,
VOLUME = {1},
YEAR = {1990},
PAGES = {295--307}
}
@book{GKP89,
author = {R. Graham and D. Knuth and O. Patashnik},
title = {Concrete Mathematics},
publisher = {Addison-Wesley},
address = {Reading, Massachusetts},
year = {1989}
}
@article{Gran88,
author = {E. Grandjean},
title = {A natural {NP}-complete problem with a nontrivial
lower bound},
journal = sicomp,
volume = {17},
year = {1988},
pages = {786--809}
}
@article{Gran90,
author = {E. Grandjean},
title = {A nontrivial lower bound for an {NP} problem on automata},
journal = sicomp,
volume = {19},
year = {1990},
pages = {438--451}
}
@INPROCEEDINGS{GrRo91,
AUTHOR = {E. Grandjean and J. Robson},
TITLE = {R{AM} with compact memory: a robust and realistic model of
computation},
BOOKTITLE = {CSL '90: Proceedings of the 4th Annual Workshop in Computer
Science Logic},
PUBLISHER = springer,
SERIES = lncs,
volume = {533},
YEAR = {1991},
pages = {195--233}
}
@inproceedings{GrRo91s,
AUTHOR = {E. Grandjean and J. Robson},
TITLE = {R{AM} with compact memory: a robust and realistic model of
computation},
BOOKTITLE = {Proc. CSL '90, LNCS 533},
YEAR = {1991},
pages = {195--233}
}
@techreport{Gran92,
author = {E. Grandjean},
title = {Invariance properties of {RAMs} and linear time},
institution = {Laboratoire d'Informatique de l/Universit{\'e}
de Caen},
number = {92-3},
month = {February},
year = {1992}
}
@techreport{Gran93,
author = {E. Grandjean},
title = {Sorting linear time and the satisfiability problem},
institution = {Laboratoire d'Informatique de l/Universit{\'e}
de Caen},
number = {17},
month = {September},
year = {1993}
}
@article{Gran94,
author = {E. Grandjean},
title = {Linear time algorithms and {NP}-complete problems},
journal = sicomp,
volume = {23},
year = {1994},
pages = {573--597}
}
@article{Gran94b,
author = {E. Grandjean},
title = {Invariance properties of {RAMs} and linear time},
journal = compcomp,
volume = {4},
year = {1994},
pages = {62--106}
}
@article{Gra80,
author = {P. Grant},
title = {Some more independence results in complexity theory},
journal = tcs,
volume = {12},
year = {1980},
pages = {119--126}
}
@article{Gra92,
author = {A. Granville},
title = {Primality testing and {C}armichael numbers},
journal = {Notices of the AMS},
volume = {39},
month = {September},
year = {1992},
pages = {696--700}
}
@inproceedings{Grape90,
author = {P. Grape},
title = {Complete problems with {$\L$}-samplable distributions},
booktitle = {Proceedings, SWAT '90},
series = {Lecture Notes in Computer Science},
number = {447},
publisher = springer,
year = {1990},
pages = {360--367}
}
@article{GHI67,
author = {J. Gray and M. Harrison and O. Ibarra},
title = {Two-way pushdown automata},
journal = infcon,
volume = {1},
year = {1967},
pages = {30--70}
}
@inproceedings{GKT92,
author = {F.~Green and J.~K{\"o}bler and J.~Tor{\'a}n},
title = {The power of the middle bit},
booktitle = proc7 # structures,
year = {1992},
pages = {111--117}
}
@article{Gre93,
author = {F. Green},
title = {On the power of deterministic redutions to {C$_=$P}},
journal = mst,
volume = {26},
year = {1993},
pages = {215--223}
}
@inproceedings{Gre95,
author = {F. Green},
title = {Lower Bounds for Depth-Three Circuits With Equals
and Mod-Gates},
booktitle = proc12 # stacs,
series = lncs,
publisher = springer,
volume = {900},
year = {1995}
}
@article{GrHo69,
author = {S. Greibach and J. Hopcroft},
title = {Scattered context grammars},
journal = jcss,
volume = {3},
year = {1969},
pages = {233--247}
}
@article{Gre73,
author = {S. Greibach},
title = {The hardest context-free language},
journal = sicomp,
volume = {2},
year = {1973},
pages = {304--310}
}
@inproceedings{Gre79,
author = {S. Greibach},
title = {Formal languages: Origins and directions},
booktitle = proc20 # focs,
year = {1979},
pages = {66--90}
}
@article{Gre81,
author = {S. Greibach},
title = {Formal languages: Origins and directions},
journal = {Ann. Hist. Comp.},
volume = {3},
year = {1981},
pages = {14--41}
}
@article{GrSi95,
author = {M. Grigni and M. Sipser},
title = {Monotone separation of logarithmic space from
logarithmic depth},
journal = jcss,
volume = {50},
year = {1995},
pages = {433--437}
}
@inproceedings{GrSe84,
author = {J. Grollmann and A. Selman},
title = {Complexity measures for public-key cryptosystems
(preliminary report)},
booktitle = proc25 # focs,
year = {1984},
pages = {495--503}
}
@article{GrSe88,
author = {J. Grollmann and A. Selman},
title = {Complexity measures for public-key cryptosystems},
journal = sicomp,
volume = {17},
year = {1988},
pages = {309--335}
}
@article{Gru90,
author = {J. Gruska},
title = {Synthesis, structure, and power of systolic computations},
journal = tcs,
volume = {71},
year = {1990},
pages = {47--77}
}
@article{GuLa91,
author = {X. Guan and M. Langston},
title = {Time-space optimal parallel merging and sorting},
journal = {IEEE Transactions on Computers},
volume = {40},
number = {5},
year = {1991},
pages = {596--602}
}
@article{GuLa92,
author = {X. Guan and M. Langston},
title = {Parallel methods for solving fundamental file
rearrangement problems},
journal = jpdc,
volume = {14},
year = {1992},
pages = {436--439}
}
@inproceedings{GNW90,
author = {T. Gundermann and N. Nasser and G. Wechsung},
title = {A survey on counting classes},
booktitle = proc5 # structures},
year = {1990},
pages = {140--153}
}
@article{Gup92,
author = {S. Gupta},
title = {On the closure of certain function classes under
integer division by polynomially-bounded functions},
journal = ipl,
volume = {44},
year = {1992},
pages = {205--210}
}
@techreport{Gup92b,
author = {S. Gupta},
title = {On bounded-probability operators and {C$_{=}$P}},
number = {OSU-CISRC-11/92-TR32},
institution = {Dept. of Comp. Sci., Ohio State University},
year = {1992}
}
@techreport{Gup93,
author = {S. Gupta},
title = {On isolating an odd number of elements and its applications
to complexity theory},
number = {OSU-CISRC-6/93-TR24},
institution = {Dept. of Comp. Sci., Ohio State University},
year = {1993}
}
@inproceedings{GuSh88,
author = {Y. Gurevich and S. Shelah},
title = {Nondeterministic linear-time tasks may require
substantially nonlinear deterministic time in the case of sublinear
work space},
booktitle = proc20 # stoc,
year = {1988},
pages = {281--289}
}
@INPROCEEDINGS{GuSh89,
AUTHOR = {Y. Gurevich and S. Shelah},
TITLE = {Nearly-linear time},
BOOKTITLE = {Proceedings, Logic at Botik '89},
PUBLISHER = springer,
SERIES = lncs,
VOLUME = {363},
YEAR = {1989},
PAGES = {108--118}
}
@inproceedings{Habnn,
author = {K. Habart},
title = {Randomness and Turing reducibility restraints},
booktitle = {nnn},
year = {nnnn},
pages = {234--247}
}
@article{HaRu89,
author = {T. Hagerup and C. R{\"u}b},
title = {A guided tour of {C}hernoff bounds},
journal = ipl,
volume = {33},
year = {1989},
pages = {305--308}
}
@article{Haj79,
author = {P. H{\'a}jek},
title = {Arithmetical hierarchy and complexity of computation},
journal = tcs,
volume = {8},
year = {1979},
pages = {227--237}
}
@inproceedings{HMPST87,
author = {A. Hajnal and W. Maass and P. Pudl{\'a}k and M. Szegedy
and G. Tur{\'a}n},
title = {Threshold circuits of bounded depth},
booktitle = proc28 # focs,
year = {1987},
pages = {99--110}
}
@inproceedings{HMT88,
author = {A. Hajnal and W. Maass and G. Turan},
title = {On the communication complexity of graph properties},
booktitle = proc20 # stoc,
year = {1988},
pages = {186--191}
}
@article{Hak85,
author = {A. Haken},
title = {The intractability of resolution},
journal = tcs,
volume = {39},
year = {1985},
pages = {297--308}
}
@inproceedings{HRS93,
author = {M. Halld{\'o}rsson and J. Radhakrishnan and
K. Subrahmanyam},
title = {On some communication complexity problems related
to threshold functions},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {248--259}
}
@article{HLMW86,
author = {J. Halpern and M. Loui and A. Meyer and D. Weise},
title = {On time versus space {III}},
journal = mathsys,
volume = {19},
year = {1986},
pages = {13--28}
}
@techreport{HHT93,
author = {Y. Han and L. Hemaspaandra and T. Thierauf},
title = {Threshold computation and cryptographic security},
institution = {University of Rochester, Computer Science},
number = {TR 461},
year = {1993},
month = {June}
}
@techreport{HaTh93,
author = {Y. Han and T. Thierauf},
title = {Advice from nonadaptive queries to {NP}},
institution = {Computer Science, University of Rochester},
number = {470},
month = {October},
year = {1993}
}
@misc{HJLT94,
author = {T. Hancock and T. Jiang and M. Li and J. Tromp},
title = {Lower bounds on learning decision lists and trees (draft)},
month = {May},
year = {1994}
}
@article{HKL92,
author = {T. Harju and H.C.M. Kleijn and M. Latteux},
title = {Deterministic sequential functions},
journal = {Acta Informatics},
volume = {29},
year = {1992},
pages = {545--554}
}
@article{HaKl93,
author = {T. Harju and H.C.M. Kleijn},
title = {Morphisms and rational transducers},
journal = beatcs,
volume = {51},
year = {1993},
month = {October},
pages = {168--180},
note = {Guest column, A. Salomaa ed., Formal Language Theory Column}
}
@article{Har92,
author = {V. Harnick},
title = {Provably total functions of intuitionistic bounded
arithmetic},
journal = jsl,
volume = {57},
year = {1992},
pages = {466--477}
}
@techreport{Har81,
author = {P. Harrison},
title = {The finite state machine as a software engineering tool},
institution = {IBM Research Division},
number = {RC 8861 (\#38784) 5/19/81},
address = {San Jos{\'e}, California},
year = {1981}
}
@article{HaSt65,
author = {J. Hartmanis and R. Stearns},
title = {On the computational complexity of algorithms},
journal = {Transactions of the AMS},
year = {1965},
volume = {117},
pages = {285--306}
}
@book{HS66,
author = {J. Hartmanis and R. Stearns},
title = {Algebraic Structure Theory of Sequential Machines},
publisher = {Prentice-Hall},
address = {Englewood Cliffs, NJ},
year = {1966}
}
@article{Har71,
author = {J. Hartmanis},
title = {Computational complexity of random access stored
program machines},
journal = mathsys,
volume = {5},
year = {1971},
pages = {232--245}
}
@article{HaLe71,
author = {J. Hartmanis and F. Lewis},
title = {The use of lists in the study of undecidable problems in
automata theory},
journal = jcss,
volume = {5},
year = {1971},
pages = {54--66}
}
@inproceedings{HaSi74,
author = {J. Hartmanis and J. Simon},
title = {On the power of multiplication in random-access machines},
booktitle = proc15 # "Annual IEEE Symposium on Switching and Automata Theory (now FOCS)",
year = {1974},
pages = {13--23}
}
@article{Har75,
author = {J. Hartmanis},
title = {Independence results about context-free languages and
lower bounds},
journal = ipl,
volume = {20},
year = {1985},
pages = {241--248}
}
@article{HaHo76,
author = {J. Harmanis and J. Hopcroft},
title = {Independence results in computer science},
journal = {SIGACT News},
volume = {8},
year = {1976},
pages = {13--24}
}
@book{Har78,
author = {J. Hartmanis},
title = {Feasible Computations and Provable Complexity Properties},
publisher = {SIAM Press},
year = {1978}
}
@inproceedings{HIM78,
author = {J. Hartmanis and N. Immerman and S. Mahaney},
title = {One-way log tape reductions},
booktitle = proc19 # focs,
year = {1978},
pages = {65--72}
}
@article{Har79,
author = {J. Hartmanis},
title = {Relations between diagonalization, proof systems,
and complexity gaps},
journal = tcs,
volume = {8},
year = {1979},
pages = {224--233}
}
@article{HaMa81,
author = {J. Hartmanis and S. Mahaney},
title = {Languages simultaneously complete for one-way and two-way
log-tape automata},
journal = sicomp,
volume = {10},
year = {1981},
pages = {383--390}
}
@article{Har83,
author = {J. Hartmanis},
title = {On G{\"o}del speed-up and succinctness of language
representations},
journal = tcs,
volume = {26},
year = {1983},
pages = {335--342}
}
@article{Har85,
author = {J. Hartmanis},
title = {Independence results about context-free languages and
lower bounds},
journal = ipl,
volume = {20},
year = {1985},
pages = {241--248}
}
@inproceedings{HaHe86,
author = {J. Hartmanis and L. Hemachandra},
title = {Complexity classes without machines: On complete languages
for {UP}},
booktitle = proc13 # icalp,
series = lncs,
volume = {226},
publisher = springer,
year = {1986},
pages = {123--135}
}
@article{HaHe88,
author = {J. Hartmanis and L. Hemachandra},
title = {Complexity classes without machines: On complete languages
for {UP}},
journal = tcs,
volume = {58},
year = {1988},
pages = {129--142}
}
@article{HaHe90,
author = {J. Hartmanis and L. Hemachandra},
title = {Robust machines accept easy sets},
journal = tcs,
volume = {74},
year = {1990},
pages = {217--225}
}
@article{HaHe91,
author = {J. Hartmanis and L. Hemachandra},
title = {One-way functions and the nonisomorphism of
{NP}-complete sets},
journal = tcs,
volume = {81},
year = {1991},
pages = {155--163}
}
@inproceedings{Has86,
author = {J. H{\aa}stad},
title = {Almost optimal lower bounds for small-depth circuits},
booktitle = proc18 # stoc,
year = {1986},
pages = {6--20}
}
@article{Has87,
author = {J. H{\aa}stad},
title = {One-way permutations in {NC$^0$}},
journal = ipl,
volume = {26},
year = {1987},
pages = {153--155}
}
@book{Has88,
author = {J. H{\aa}stad},
title = {On the Computational Limitations of Small-Depth Circuits},
publisher = {MIT Press},
address = {Cambridge, MA},
year = {1988}
}
@incollection{Has89,
author = {J. H{\aa}stad},
title = {Almost optimal lower bounds for small-depth circuits},
booktitle = {Randomness and Computation},
series = {Advances in Computing Research},
volume = {5},
editor = {S. Micali},
publisher = {JAI Press},
address = {Greenwich, CT, USA},
year = {1989},
pages = {143--170}
}
@inproceedings{Has90,
author = {J. H{\aa}stad},
title = {Pseudorandom generation under uniform assumptions},
booktitle = proc22 # stoc,
year = {1990},
pages = {395--404}
}
@techreport{HILL91,
author = {J. H{\aa}stad and R. Impagliazzo and L. Levin and
M. Luby},
title = {Construction of a pseudo-random generator from any
one-way function},
institution = {International Computer Science Institute,
Berkeley},
number = {91--68},
year = {1991}
}
@article{HaGo91,
author = {J. H{\aa}stad and M. Goldmann},
title = {On the power of small-depth threshold circuits},
journal = {Computational Complexity},
volume = {1},
year = {1991},
pages = {113--129}
}
@article{Hay69,
author = {L. Hay},
title = {Index sets of finite classes of recursively enumerable sets},
journal = jsl,
volume = {34},
year = {1969},
pages = {39--44}
}
@article{Hay74,
author = {L. Hay},
title = {Index sets universal for differences of arithmetic sets}, journal = zml,
volume = {20},
year = {1974},
pages = {239--254}
}
@techreport{HePe90,
author = {L. Heath and S. Pemmaraju},
title = {New results for the minimum-weight triangulation problem},
institution = {Department of Computer Science,
Virginia Polytechnic Institute and State University},
number = {90--65},
year = {1990}
}
@article{HNW93,
author = {R. Heiman and I. Newman and A. Wigderson},
title = {On read-once threshold formulae and their randomized
decision tree complexity},
journal = tcs,
volume = {107},
year = {1993},
pages = {63--76}
}
@inproceedings{HeJh93,
author = {L. Hemachandra and S. Jha},
title = {Defying upward and downward separation},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {185--195}
}
@article{HeHo91,
author = {L. Hemachandra and A. Hoene},
title = {On sets with efficient implicit membership tests},
journal = sicomp,
volume = {20},
year = {1991},
pages = {nnn--nnn}
}
@techreport{HNOS93,
author = {E. Hemaspaandra and A. Naik and M. Ogiwara and
A. Selman},
title = {P-selective sets, and reducing search to decision
versus self-reducibility},
institution = {Computer Science Dept., SUNY at Buffalo},
number = {93--21},
address = {Buffalo, NY 14260},
year = {1993}
}
@techreport{HemaspaandraNaikOgiwaraSelman93,
author = {E. Hemaspaandra and A. Naik and M. Ogiwara and
A. Selman},
title = {P-selective sets, and reducing search to decision
versus self-reducibility},
institution = {Computer Science Dept., SUNY at Buffalo},
number = {93--21},
address = {Buffalo, NY 14260},
year = {1993}
}
@techreport{HNOS93b,
author = {L. Hemaspaandra and A. Naik and M. Ogiwara and A. Selman},
title = {Computing solutions uniquely collapses the polynomial
hierarchy},
institution = {Computer Science Dept., SUNY at Buffalo},
number = {CS-TR 93-28},
month = {August},
year = {1993}
}
@inproceedings{HNOS94,
author = {L. Hemaspaandra and A. Naik and M. Ogiwara and A. Selman},
title = {Computing solutions uniquely collapses the polynomial
hierarchy},
booktitle = {Proceedings, 5th International Symposium on Algorithms
and Computation},
series = lncs,
volume = {834},
publisher = springer,
year = {1994},
pages = {56--64}
}
@inproceedings{HHOSTW93,
author = {L. Hemachandra and A. Hoene and M. Ogiwara
and A. Selman and T. Thierauf and J. Wang},
title = {Selectivity},
booktitle = proc5 # icci,
year = {1993},
pages = {54--58}
}
@techreport{HHNOSTW93,
author = {L. Hemaspaandra and A. Hoene and A. Naik and M. Ogiwara
and A. Selman and T. Thierauf and J. Wang},
title = {Selectivity: reductions, nondeterminism, and function
classes},
institution = {Computer Science, University of Rochester},
number = {469},
month = {August},
year = {1993}
}
@techreport{HeZi93,
author = {L. Hemaspaandra and M. Zimand},
title = {Seeking stronger separations: probability one
balanced- and bi-immunity},
institution = {Computer Science, University of Rochester},
number = {480},
month = {December},
year = {1983}
}
@techreport{HeJi94,
author = {L. Hemaspaandra and Z. Jiang},
title = {P-selectivity: intersections and indices},
institution = {Computer Science, University of Rochester},
number = {482},
month = {January},
year = {1994}
}
@techreport{HeRo94,
author = {L. Hemaspaandra and J. Rothe},
title = {Unambiguous computation: Boolean hierarchies and
sparse {T}uring-complete sets},
institution = {Computer Science, University of Rochester},
number = {483},
month = {January},
year = {1994}
}
@article{Hen66,
author = {F. Hennie},
title = {On-line {Turing} machine computation},
journal = {IEEE Trans. Electr. Comp.},
volume = {EC-15},
year = {1966},
pages = {35--44}
}
@ARTICLE{HeSt66,
AUTHOR = {F. Hennie and R. Stearns},
TITLE = {Two--way simulation of multitape {Turing} machines},
JOURNAL = jacm,
VOLUME = {13},
YEAR = {1966},
PAGES = {533--546}
}
@book{Hen81,
author = {F. Hennie},
title = {Iterative arrays of logic circuits},
publisher = {MIT Press, Cambridge, Mass.},
year = {1981}
}
@inproceedings{HeSh93,
author = {M. Herlihy and N. Shavit},
title = {The asynchronous computability theorem for {$t$}-resilient
tasks},
booktitle = proc25 # stoc,
year = {1993},
pages = {111--120}
}
@inproceedings{HeSh94,
author = {M. Herlihy and N. Shavit},
title = {A simple constructive computability theorem for
wait-free computation},
booktitle = proc26 # stoc,
year = {1994},
pages = {243--252}
}
@article{Her90,
author = {U. Hertrampf},
title = {Relations among {MOD} classes},
journal = tcs,
volume = {74},
year = {1990},
pages = {325--328}
}
@inproceedings{HLSVW93,
author = {U. Hertrampf and C. Lautemann and T. Schwentick
and H. Vollmer and K. Wagner},
title = {On the power of polynomial time bit-reductions},
booktitle = proc8 # structures,
year = {1993},
pages = {200--207}
}
@article{Heu91,
author = {V. Heuring},
title = {Systems considerations in designing and implementing
a bit serial optical computer},
journal = {Optical Engineering},
volume = {30},
year = {1991},
pages = {1931--1935}
}
@article{HJP92,
author = {V. Heuring and H. Jordan and J. Pratt},
title = {Bit-serial architecture for optical computing},
journal = {Applied Optics},
volume = {31},
number = {17},
year = {1992},
pages = {3213--3224}
}
@techreport{Hey90,
author = {A. Heydon},
title = {An introduction to circuit complexity and a guide
to {H}astad's proof},
number = {CMU-CS-90-141},
institution = {Carnegie-Mellon Univ.},
year = {1990}
}
@article{HeRa92a,
author = {T. Heywood and S. Ranka},
title = {A practical hierarchical model of parallel computation
{I}: The model},
journal = jpdc,
volume = {16},
year = {1992},
pages = {212--232}
}
@article{HeRa92b,
author = {T. Heywood and S. Ranka},
title = {A practical hierarchical model of parallel computation
{II}: Binary tree and {FFT} algorithms},
journal = jpdc,
volume = {16},
year = {1992},
pages = {233--249}
}
@article{HiLa90,
author = {M. Hill and J. Larus},
title = {Cache considerations for multiprocessor programmers},
journal = cacm,
volume = {33},
year = {1990},
month = {August},
pages = {97--102}
}
@article{HiSt86,
author = {W.D. Hillis and G. Steele},
title = {Data parallel algorithms},
journal = cacm,
volume = {29},
year = {1986},
pages = {1170--1183}
}
@INPROCEEDINGS{HiZa84,
AUTHOR = {P. Hinman and S. Zachos},
TITLE = {Probabilistic machines, oracles, and quantifiers},
BOOKTITLE = {Proceedings, Oberwohlfach Recursion-Theory Week,
Lecture Notes in Mathematics No.~1141},
PUBLISHER = springer,
YEAR = {1984},
PAGES = {159--192}
}
@article{HoLo88,
author = {A. Hodel and M. Loui},
title = {Optimal dynamic embedding of {X}-trees into arrays},
journal = tcs,
volume = {59},
year = {1988},
pages = {259--276}
}
@inproceedings{HoNi93,
author = {A. Hoene and A. Nickelsen},
title = {Counting, selecting, and sorting by query-bounded machines},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {196--205}
}
@inproceedings{HHK91,
author = {T. Hofmeister and W. Hohberg and S. K{\"o}hling},
title = {Some notes on threshold circuits and multiplication in
depth 4},
booktitle = proc8 # fct,
year = {1991},
pages = {230--239}
}
@article{HoMa83,
author = {S. Homer and W. Maass},
title = {Oracle dependent properties of the lattice of {NP} sets},
journal = tcs,
volume = {24},
year = {1983},
pages = {nnn--nnn}
}
@article{HoRe86,
author = {S. Homer and J. Reif},
title = {Arithmetic theories for computational complexity problems},
journal = infcon,
volume = {69},
year = {1986},
pages = {1--11}
}
@article{Hom87,
author = {S. Homer},
title = {Minimal degrees for polynomial reducibilities},
journal = jacm,
volume = {34},
year = {1987},
pages = {480--491}
}
@article{HoLo87,
author = {S. Homer and T. Long},
title = {Honest polynomial degrees and {P =? NP}},
journal = tcs,
volume = {51},
year = {1987},
pages = {nnn--nnn}
}
@inproceedings{HoSe89,
author = {S. Homer and A. Selman},
title = {Oracles for structural properties: The {I}somorphism
{P}roblem and public-key cryptography},
booktitle = proc4 # structures,
year = {1989},
pages = {3--14}
}
@article{HoSe92,
author = {S. Homer and A. Selman},
title = {Oracles for structural properties: The {I}somorphism
{P}roblem and public-key cryptography},
journal = jcss,
volume = {44},
year = {1992},
pages = {287--301}
}
@article{HoWa89,
author = {S. Homer and J. Wang},
title = {Absolute results concerning one-way functions and their
applications},
journal = mst,
year = {1989},
volume = {22},
pages = {21--35}
}
@misc{HoMo94,
author = {S. Homer and S. Mocas},
title = {Nonuniform lower bounds for exponential time classes},
year = {1994}
}
@article{HoWa94,
author = {S. Homer and J. Wang},
title = {Immunity of complete problems},
journal = infcon,
volume = {110},
year = {1994},
pages = {119--129}
}
@techreport{HoPe93,
author = {S. Homer and M. Peinado},
title = {On the performance of polynomial-time {CLIQUE}-approximation
algorithms on very large graphs},
institution = {Dept. of Computer Science, Boston University},
number = {nnn},
month = {August},
year = {1993}
}
@phdthesis{Hon94,
author = {H. Hon},
title = {A strongly asynchronous parallel algorithm for the
write-all problem},
school = {University of Waterloo},
year = {1994}
}
@article{Hong85,
author = {J.-W. Hong},
title = {On similarity and duality of computation {I}},
journal = infcomp,
volume = {62},
year = {1985},
pages = {109--128}
}
@book{Hong86,
author = {J.-W. Hong},
title = {Computation: Similarity and Duality},
series = {Research Notes in Theoretical Computer Science},
publisher = {Wiley},
year = {1986}
}
@article{HoVe93,
author = {J. Hong and M. Vetterli},
title = {Computing {$m$} {DFT's} over {GF($q$)} with
one {DFT} over {GF($q^m$)}},
journal = itit,
volume = {39},
number = {1},
year = {1993},
month = {January},
pages = {271--273}
}
@article{HKP84,
author = {H. Hoover and M. Klawe and N. Pippenger},
title = {Bounding fan-out in logical networks},
journal = jacm,
volume = {31},
year = {1984},
pages = {13--18}
}
@inproceedings{HPV75,
AUTHOR = {J. Hopcroft and W. Paul and L. Valiant},
TITLE = {On time versus space and related problems},
booktitle = proc16 # focs,
year = {1975},
pages = {57--64}
}
@ARTICLE{HPV77,
AUTHOR = {J. Hopcroft and W. Paul and L. Valiant},
TITLE = {On time versus space},
JOURNAL = jacm,
VOLUME = {24},
YEAR = {1977},
PAGES = {332--337}
}
@BOOK{HU79,
AUTHOR = {J. Hopcroft and J. Ullman},
TITLE = {Introduction to Automata Theory, Languages, and Computation},
PUBLISHER = {Addison--Wesley},
ADDRESS = {Reading, MA},
YEAR = {1979}
}
@article{HSW89,
author = {K. Hornick and M. Stinchcombe and H. White},
title = {Multilayer feedforward networks are universal approximators},
journal = {Neural Networks},
volume = {2},
year = {1989},
pages = {359--366}
}
@article{HoPr91,
author = {S. Hornick and F. Preparata},
title = {Deterministic {P-RAM} simulation with constant redundancy},
journal = infcomp,
volume = {92},
year = {1991},
pages = {81-96}
}
@article{Hro91,
author = {J. Hromkovic},
title = {Nonlinear lower bounds on the number of processors of
circuits with sublinear separators},
journal = infcomp,
volume = {95},
year = {1991},
pages = {117--128}
}
@article{HJK91,
author = {J. Hromkovic and L. Janiga and V. Koubek},
title = {Variable multi-head machines},
journal = {J. Inform. Process. Cybernet.},
volume = {EIK 27},
year = {1991},
pages = {411--424}
}
@article{HKMW92,
author = {J. Hromkovic and M. Krause and C. Meinel and S. Waack},
title = {Branching programs provide lower bounds on the areas
of multilective deterministic and nondeterministic {VLSI} circuits},
journal = infcon,
volume = {96},
year = {1992},
pages = {168--178}
}
@article{Hua89,
author = {X. Huang},
title = {A lower bound for the edit-distance problem under an
arbitrary cost function},
journal = ipl,
volume = {27},
year = {1988},
pages = {319--321}
}
@article{Hua84,
author = {A. Huang},
title = {Architectural considerations involved in the
design of an optical digital computer},
journal = {Proceedings of the IEEE},
volume = {72},
number = {7},
month = {July},
year = {1984},
pages = {780--786}
}
@incollection{Hua90,
author = {A. Huang},
title = {Optical digital computers: devices and architecture},
booktitle = {Concurrent Computations},
editor = {S. Tewksbury and B. Dickinson and S. Schwartz},
publisher = {Plenum},
year = {1990},
pages = {23--31}
}
@article{Hua92,
author = {A. Huang},
title = {Computational origami: the folding of circuits and systems},
journal = {Applied Optics},
volume = {31},
number = {26},
year = {1992},
pages = {5419--5422}
}
@article{HuLa88,
author = {B.-C. Huang and M. Langston},
title = {Practical in-place merging},
journal = cacm,
volume = {31},
month = {March},
year = {1988},
pages = {348--352}
}
@misc{HuvEB94,
author = {Z. Huang and P. van Emde Boas},
title = {Information acquisition from multi-agent resources},
month = {February},
year = {1994}
}
@article{Huh93,
author = {M. H{\"u}hne},
title = {Linear speed-up does not hold for {T}uring machines with
tree storages},
journal = ipl,
volume = {47},
year = {1993},
pages = {313--318}
}
@article{Huh93s,
author = {M. H{\"u}hne},
title = {Linear speed-up does not hold for {T}uring machines with
tree storages},
journal = {IPL},
volume = {47},
year = {1993},
pages = {313--318}
}
@article{Hunt76,
author = {H. {Hunt III}},
title = {On the complexity of finite, pushdown, and stack automata},
journal = mathsys,
volume = {10},
year = {1976},
pages = {33--52}
}
@inproceedings{HuSt88,
author = {H. Hunt and R. Stearns},
title = {On the complexity of satisfiability problems for
algebraic structures (preliminary report},
booktitle = proc6 # "Conference on Applied Algebra, Algebraic
Algorithms, and Error-Correcting Codes",
series = lncs,
volume = {357},
publisher = springer,
year = {1988},
pages = {250--258}
}
@article{HuSt90,
author = {H. {Hunt III} and R. Stearns},
title = {The complexity of very simple {B}oolean formulas,
with applications},
journal = sicomp,
volume = {19},
year = {1990},
pages = {44--70}
}
@article{Huy92,
author = {D. Huynh},
title = {Nonuniform complexity and the randomness of certain
complete languages},
journal = tcs,
volume = {96},
year = {1992},
pages = {305--324}
}
@inproceedings{Iba86,
author = {O. Ibarra},
title = {Systolic arrays: characterizations and complexity},
booktitle = {The Proceedings of the 1986 Conference on Mathematical Foundations of Computer Science},
series = {Lecture Notes in Computer Science No.~233},
publisher = springer,
year = {1986},
pages = {140--153}
}
@article{IbKi84,
author = {O. Ibarra and S. Kim},
title = {Characterizations and computational complexity of
systolic trellis automata},
journal = tcs,
volume = {29},
year = {1984},
pages = {123--153}
}
@article{IPK85,
author = {O. Ibarra and M. Palis and S. Kim},
title = {Some results concerning linear iterative (systolic) arrays},
journal = jpdc,
volume = {2},
year = {1985},
pages = {182--218}
}
@article{IKP86,
author = {O. Ibarra and S. Kim and M. Palis},
title = {Designing systolic algorithms using sequential machines},
journal = {IEEE Transactions on Computing},
volume = {35},
year = {1986},
pages = {531--542}
}
@article{IbJi87,
author = {O. Ibarra and T. Jiang},
title = {On one-way cellular arrays},
journal = sicomp,
volume = {16},
year = {1987},
pages = {1135--1153}
}
@article{IJR88,
author = {O. Ibarra and T. Jiang and B. Ravikumar},
title = {Some subclasses of context-free languages in {$\NC^1$}},
journal = ipl,
volume = {29},
year = {1988},
pages = {111--117}
}
@article{Iba91,
author = {O. Ibarra},
title = {On resetting {DLBAs}},
journal = sigact,
volume = {22},
number = {1},
month = {Winter},
year = {1991},
pages = {62--63}
}
@article{IJW91,
author = {O. Ibarra and T. Jiang and H. Wang},
title = {Parallel parsing on a one-way linear array of
finite-state machines},
journal = tcs,
volume = {85},
year = {1991},
pages = {53--74}
}
@article{IJCR91,
author = {O. Ibarra and T. Jiang and J. Chang and B. Ravikumar},
title = {Some classes of languages in {NC$^1$}},
journal = infcomp,
volume = {90},
year = {1991},
pages = {86--106}
}
@article{IJW92,
author = {O. Ibarra and T. Jiang and H. Wang},
title = {String editing on a one-way linear array of finite-state
machines},
journal = ieeetc,
volume = {41},
month = {January},
year = {1992},
pages = {112--118}
}
@inproceedings{IJTW93,
author = {O. Ibarra and T. Jiang and N. Tran and H. Wang},
title = {On the equivalence of two-way pushdown automata and
counter machines over bounded languages},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {354--364}
}
@techreport{IbTr93,
author = {O. Ibarra and N. Tran},
title = {On the parallel complexity of solving recurrence equations},
insttitution = {Computer Science, University of California at
Santa Barbara},
number = {nnn},
month = {September},
year = {1993}
}
@article{IbTr94,
author = {O. Ibarra and N. Tran},
title = {On communication-bounded synchronized alternating
finite automata},
journal = {Acta Informatica},
volume = {31},
year = {1994},
pages = {315--327}
}
@inproceedings{Imm83,
author = {N. Immerman},
title = {Languages which capture complexity classes},
booktitle = proc15 # stoc,
year = {1983},
pages = {347--354}
}
@article{Imm87,
author = {N. Immerman},
title = {Languages which capture complexity classes},
journal = sicomp,
volume = {16},
year = {1987},
pages = {760--778}
}
@article{Imm88,
author = {N. Immerman},
title = {Nondeterministic space is closed under complementation},
journal = sicomp,
volume = {17},
year = {1987},
pages = {935--938}
}
@inproceedings{Imm91,
author = {N. Immerman},
title = {{DSPACE$[n^k]$ = VAR$[k+1]$}},
booktitle = proc6 # structures,
year = {1991},
pages = {334--340}
}
@inproceedings{ImNa89,
author = {R. Impagliazzo and M. Naor},
title = {Efficient cryptographic schemes provably as secure as
subset-sum},
booktitle = proc30 # focs,
year = {1989}
}
@inproceedings{ImZu89,
author = {R. Impagliazzo and D. Zuckerman},
title = {How to recycle random bits},
booktitle = proc30 # focs,
year = {1989},
pages = {248--253}
}
@inproceedings{ILL89,
author = {R. Impagliazzo and L. Levin and M. Luby},
title = {Pseudo-random generation from one-way functions
(extended abstract},
booktitle = proc21 # stoc,
year = {1989},
pages = {12--24}
}
@inproceedings{INW94,
author = {R. Impagliazzo and N. Nisan and A. Wigderson},
title = {Pseudorandomness for network algorithms},
booktitle = proc26 # stoc,
year = {1994},
pages = {356--364}
}
@article{INR92,
author = {S. Irani and M. Naor and R. Rubinfeld},
title = {On the time and space complexity of computation using
write-once memories, or {I}s pen really much worse than pencil?},
journal = mathsys,
volume = {25},
year = {1992},
pages = {141--159}
}
@inproceedings{IsZi93,
author = {S. Istrail and D. Zivkovic},
title = {Non-probabilistic switching lemma for the {Sipser}
function},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {566--575}
}
@article{IsZi94,
author = {S. Istrail and D. Zivkovic},
title = {Bounded-width polynomial-size {B}oolean formulas
compute exactly those functions in {AC$^0$}},
journal = ipl,
volume = {50},
year = {1994},
pages = {211--216}
}
@article{IKM93,
author = {S. Iwata and T. Kasai and E. Moriya},
title = {Relations among simultaneous complexity classes of
nondeterministic and alternating {Turing} machines},
journal = {Acta Informatica},
volume = {30},
year = {1993},
pages = {267--278}
}
@techreport{Jac77,
author = {W. Jackson},
title = {Legitimate decks},
number = {CORR 77-56},
institution = {Department of Combinatorics and Optimization},
month = {December},
year = {1977}
}
@article{JVW90,
author = {F. Jaeger and D. Vertigan and D. Welsh},
title = {On the computational complexity of the {Jones} and
{Tutte} polynomials},
journal = {Math. Proc. Camb. Phil. Soc.},
volume = {108},
year = {1990},
pages = {35--53}
}
@article{JMS90,
author = {G. Jacopini and P. Mentrasti and G. Sontacchi},
title = {Reversible {T}uring machines and polynomial time
reversibly computable functions},
journal = sjdm,
volume = {3},
year = {1990},
pages = {241--254}
}
@inproceedings{JRS93,
author = {A. Jakoby and R. Reischuk and C. Schindelhauer},
title = {Malign distributions for average case circuit complexity},
booktitle = proc4 # isaac,
publisher = springer,
series = lncs,
volume = {762},
year = {1993},
pages = {628--639}
}
@article{Jed83,
author = {J. Jedrzejowicz},
title = {On the enlargement of the class of regular languages
by the shuffle closure},
journal = ipl,
volume = {16},
year = {1983},
pages = {51--54}
}
@article{Jed87,
author = {J. Jedrzejowicz},
title = {Nesting of shuffle closure is important},
journal = ipl,
volume = {25},
year = {1987},
pages = {363--367}
}
@article{Jed88,
author = {J. Jedrzejowicz},
title = {Infinite hierarchy of expressions containing shuffle
closure operator},
journal = ipl,
volume = {28},
year = {1988},
pages = {33--37}
}
@article{Jed90,
author = {J. Jedrzejowicz},
title = {Infinite hierarchy of shuffle expressions over a finite
alphabet},
journal = ipl,
volume = {36},
year = {1990},
pages = {13--17}
}
@inproceedings{JMT94,
author = {B. Jenner and P. McKenzie and D. Theri{\'e}n},
title = {Logspace and logtime leaf languages},
booktitle = proc9 # structures,
year = {1994},
pages = {242--254}
}
@article{JVV86,
author = {M. Jerrum and L. Valiant and V. Vazirani},
title = {Random generation of combinatorial structures
from a uniform distribution},
journal = tcs,
volume = {43},
year = {1986},
pages = {169--188}
}
@inproceedings{JeSi88,
author = {M. Jerrum and A. Sinclair},
title = {Conductance and the rapid mixing property for {Markov} chains:
Approximating the permanent resolved},
booktitle = proc20 # stoc,
year = {1988},
pages = {nnn--nnn}
}
@techreport{JeSi88b,
author = {M. Jerrum and A. Sinclair},
title = {Approximating the permanent},
number = {CSR-275-88},
institution = {Department of Computer Science, University of
Edinburgh},
month = {September},
year = {1988}
}
@article{JeSi89,
author = {M. Jerrum and A. Sinclair},
title = {Approximating the permanent},
journal = sicomp,
volume = {18},
year = {1989},
pages = {1149--1178}
}
@techreport{Jer90,
author = {M. Jerrum},
title = {The elusiveness of large cliques in a random graph},
institution = {Department of Computer Science, University of
Edinburgh},
month = {August},
year = {1990}
}
@article{Jer92,
author = {M. Jerrum},
title = {Large cliques elude the {M}etropolis process},
journal = {Random Structures and Algorithms},
volume = {3},
number = {4},
year = {1992},
pages = {347--362}
}
@inproceedings{JiLi93,
author = {T. Jiang and M. Li},
title = {{$K$} one-way heads cannot do string-matching},
booktitle = proc25 # stoc,
year = {1993},
pages = {62--70}
}
@inproceedings{JSV94,
author = {T. Jiang and J. Seiferas and P. Vit{\'a}nyi},
title = {Two heads are better than two tapes},
booktitle = proc26 # stoc,
year = {1994},
pages = {668--675},
note = {U. Rochester Comp. Sci. TR 493, March 1994}
}
@article{Joh74,
author = {D.S. Johnson},
title = {Approximation algorithms for combinatorial problems},
journal = jcss,
volume = {9},
year = {1974},
pages = {256--278}
}
@article{Joh87c,
author = {D.S. Johnson},
title = {The many faces of polynomial time},
journal = jalg,
volume = {8},
year = {1987},
pages = {285--303}
}
@inproceedings{Joh87,
author = {J. Johnson},
title = {Single-valued finite transductions},
booktitle = proc14 # icalp,
series = lncs,
volume = {nnn},
publisher = springer,
year = {1987},
pages = {202--211}
}
@article{Jon69,
author = {N. Jones},
title = {Context-free languages and rudimentary attributes},
journal = mst,
volume = {2},
year = {1969},
pages = {102--109},
note = {Corrigendum {\it MST\/} {\bf 11} (1978), 379--380}
}
@article{JoSe74,
author = {N. Jones and A. Selman},
title = {Turing machines and the spectra of first-order
formulas},
journal = jacm,
volume = {39},
year = {1974},
pages = {139--150}
}
@article{Jon75,
author = {N. Jones},
title = {Space-bounded reducibility among combinatorial problems},
journal = jcss,
volume = {11},
year = {1975},
pages = {68--85},
note = {Corrigendum {\it J. Comp. Sys. Sci.\/} 15:241, 1977}
}
@inproceedings{Jon93,
author = {N. Jones},
title = {Constant factors do matter},
booktitle = proc25 # stoc,
year = {1993},
pages = {602--611}
}
@inproceedings{Jon94,
author = {N. Jones},
title = {Generalizing {C}ook's transformation to imperative
stack programs},
booktitle = {Results and Trends in Theoretical Computer Science:
Cpolloquium in Honor of Arto Salomaa, Graz, Austria, June 1994},
editor = {J. Karhumaki and H. Maurer and G. Rozenberg},
series = lncs,
volume = {812},
year = {1994},
pages = {1--18}
}
@inproceedings{JoYo81,
author = {D. Joseph and P. Young},
title = {Fast Programs for Initial Segments and Polynomial Time
Computation in Weak Models of Arithmetic},
booktitle = proc13 # stoc,
year = {1981},
pages = {55--61}
}
@article{JoYo81b,
author = {D. Joseph and P. Young},
title = {Independence results in computer science?},
journal = jcss,
volume = {23},
year = {1981},
pages = {205--222},
note = {Corrigendum, {\it JCSS\/} {\bf 24} (1982)}
}
@article{Jos83,
author = {D. Joseph},
title = {Computational complexity in models of {ET}},
journal = jcss,
volume = {25},
year = {1983},
pages = {208--223}
}
@article{JoYo85,
author = {D. Joseph and P. Young},
title = {A survey of some recent results on computational complexity
in weak theories of arithmetic},
journal = {Fundamenta Informatica},
volume = {8},
year = {1985},
pages = {104--121}
}
@article{JoYo85b,
author = {D. Joseph and P. Young},
title = {Some remarks on witness functions for nonpolynomial and
noncomplete sets in {NP}},
journal = tcs,
volume = {39},
year = {1985},
pages = {nnn--nnn}
}
@incollection{JoYo90,
author = {D. Joseph and P. Young},
title = {Self-reducibility: the effects of internal
structure on computational complexity},
booktitle = {Complexity Theory Retrospective},
editor = {A. Selman},
publisher = springer,
year = {1990},
pages = {82--107}
}
@incollection{JosephYoung90,
author = {D. Joseph and P. Young},
title = {Self-reducibility: the effects of internal
structure on computational complexity},
booktitle = {Complexity Theory Retrospective},
editor = {A. Selman},
publisher = springer,
year = {1990},
pages = {82--107}
}
@article{JuSa85,
author = {H. Juergensen and A. Salomaa},
title = {Syntactic monoids in the construction of systolic tree
automata},
journal = {Internat. J. Comput. Inform. Sci.},
volume = {14},
year = {1985},
pages = {35--49}
}
@inproceedings{JuLu93,
author = {D. Juedes and J. Lutz},
title = {The complexity and distribution of hard problems},
booktitle = proc34 # focs,
year = {1993},
pages = {177--185},
note = sicomp # ", to appear"
}
@inproceedings{JLL93,
author = {D. Juedes and J. Lathrop and J. Lutz},
title = {Computational depth and reducibility},
booktitle = proc20 # icalp,
series = lncs,
volume = {200},
publisher = springer,
year = {1993},
pages = {277--288},
note = tcs # ", to appear"
}
@misc{JuLu94,
author = {D. Juedes and J. Lutz},
title = {Weak completeness in {E} and {E$_2$}},
year = {1994}
}
@inproceedings{Jung85,
author = {H. Jung},
title = {Depth efficient transformations of arithmetic into
{B}oolean circuits},
booktitle = proc5 # fct,
series = lncs,
volume = {nnn},
publisher = springer,
year = {1985},
pages = {167--174}
}
@article{Jus72,
author = {J. Justesen},
title = {A class of constructive asymptotically good algebraic
codes},
journal = itit,
volume = {IT-18},
year = {1972},
month = {September},
pages = {652--656}
}
@article{JLJHH89,
author = {J. Justesen and K. Larsen and H.E. Jensen and
A. Havemose and T. Hoholdt},
title = {Construction and decoding of a class of algebraic
geometry codes},
journal = itit,
volume = {35},
number = {4},
year = {1989},
month = {July},
pages = {811--820}
}
@article{JLJH92,
author = {J. Justesen and K. Larsen and H.E. Jensen and T. Hoholdt},
title = {Fast decoding of codes from algebraic plane curves},
journal = itit,
volume = {38},
number = {1},
year = {1992},
month = {January},
pages = {111--119}
}
@ARTICLE{KaVo70,
AUTHOR = {T. Kameda and R. Vollmar},
TITLE = {Note on tape reversal complexity of languages},
JOURNAL = infcon,
VOLUME = {17},
YEAR = {1970},
PAGES = {203--215}
}
@article{Kam91,
author = {J. K{\"a}mper},
title = {Nonuniform proof systems: a new framework to describe
nonuniform and probabilistic complexity classes},
journal = tcs,
volume = {85},
year = {1991},
pages = {305--331}
}
@article{KVVY93,
author = {R. Kannan and H. Venkateswaran and V. Vinay and A. Yao},
title = {A circuit-based proof of {Toda's} theorem},
journal = infcomp,
volume = {104},
year = {1993},
pages = {271--276}
}
@inproceedings{KaCo91,
author = {B. Kapron and S. Cook},
title = {A new characterization of {Mehlhorn's} polynomial
time functionals},
booktitle = proc32 # focs,
year = {1991},
pages = {342--347}
}
@article{Kar86,
author = {M. Karchmer},
title = {Two time-space tradeoffs for element distinctness},
journal = tcs,
volume = {47},
year = {1986},
pages = {237--246}
}
@book{Kar89,
author = {M. Karchmer},
title = {Communication complexity: a new approach to circuit depth},
publisher = {MIT Press},
address = {Cambridge, MA},
year = {1989}
}
@article{KaWi90,
author = {M. Karchmer and A. Wigderson},
title = {Monotone circuits for connectivity require
super-logarithmic depth},
journal = sjdm,
volume = {3},
year = {1990},
pages = {255--265}
}
@inproceedings{KRW91,
author = {M. Karchmer and R. Raz and A. Wigderson},
title = {On proving super-logarithmic lower bounds via the
direct sum in communication complexity},
booktitle = proc6 # structures,
year = {1991},
pages = {299--304}
}
@inproceedings{KKN92,
author = {M. Karchmer and E. Kushilevitz and N. Nisan},
title = {Fractional covers and communication complexity},
booktitle = proc7 # structures,
year = {1992},
pages = {262--274}
}
@inproceedings{KNSW92,
author = {M. Karchmer and I. Newman and M. Saks and A. Wigderson},
title = {Non-deterministic communication complexity with few
witnesses},
booktitle = proc7 # structures,
year = {1992},
pages = {275--281}
}
@inproceedings{KaMo94,
author = {D. Karger and R. Motwani},
title = {Derandomization through approximation: An {NC} algorithm
for minimum cuts},
booktitle = proc26 # stoc,
year = {1994},
pages = {497--506}
}
@inproceedings{KaMa94,
author = {H. Karloff and Y. Mansour},
title = {On construction of {$k$}-wise independent random variables},
booktitle = proc26 # stoc,
year = {1994},
pages = {564--573}
}
@incollection{Karp72,
author = {R. Karp},
title = {Reducibility among combinatorial problems},
booktitle = {Complexity of Computer Computations},
editor = {R.E. Miller and J.W. Thatcher},
publisher = {Plenum Press},
year = {1972},
pages = {85--104}
}
@incollection{Karp76,
author = {R. Karp},
title = "The probabilistic analysis of some combinatorial search
algorithms",
pages = "1--19",
editor= "Traub, J.F.",
booktitle = "Algorithms and Complexity: New Directions and Recent Results",
publisher = "Academic Press",
address = "New York",
year = 1976
}
@inproceedings{KaLi80,
author = {R. Karp and R. Lipton},
title = {Some connections between uniform and nonuniform
complexity classes},
booktitle = proc12 # stoc,
year = {1980},
pages = {302--309}
}
@inproceedings{KarpLipton,
author = {R. Karp and R. Lipton},
title = {Some connections between uniform and nonuniform
complexity classes},
booktitle = proc12 # stoc,
year = {1980},
pages = {302--309}
}
@inproceedings{KaLu83,
author = {R. Karp and M. Luby},
title = {Monte-{C}arlo algorithms for enumeration and reliability
problems},
booktitle = proc24 # focs,
year = {1983},
pages = {56--64}
}
@article{KaLu85,
author = {R. Karp and M. Luby},
title = {Monte-{C}arlo algorithms for the planar multiterminal
network reliability problem},
journal = {J. Complexity},
volume = {1},
year = {1985},
pages = {45--64}
}
@article{KLM89,
author = {R. Karp and M. Luby and N. Madras},
title = {Monte-{C}arlo approximation algorithms for enumeration
problems},
journal = {J. Algorithms},
volume = {10},
year = {1989},
pages = {429--448}
}
@INCOLLECTION{KaRa90,
AUTHOR = {R. Karp and V. Ramachandran},
TITLE = {Parallel algorithms for shared-memory machines},
BOOKTITLE = {Handbook of Theoretical Computer Science},
VOLUME = {A},
EDITOR = {J. Van Leeuwen},
PUBLISHER = {Elsevier and MIT Press},
YEAR = {1990},
PAGES = {871--941}
}
@article{KUW88,
author = {R. Karp and E. Upfal and A. Wigderson},
title = {The complexity of parallel search},
journal = jcss,
volume = {36},
year = {1988},
pages = {225--253}
}
@article{KaLu93,
author = {M. Karpinski and M. Luby},
title = {Approximating the number of zeroes of a GF[2] polynomial},
journal = jalg,
volume = {14},
year = {1993},
pages = {280--287}
}
@inproceedings{KaVe93,
author = {M. Karpinski and R. Verbeek},
title = {On randomized versus deterministic computation},
booktitle = proc20 # icalp,
series = lncs,
volume = {700},
publisher = springer,
year = {1993},
pages = {227--240}
}
@article{KAI79,
author = {T. Kasai and A. Adachi and S. Iwata},
title = {Classes of pebble games and complete problems},
journal = sicomp,
volume = {8},
year = {1979},
pages = {576--586}
}
@ARTICLE{KvLP88,
AUTHOR = {J. Katajainen and J. van Leeuwen and M. Penttonen},
TITLE = {Fast simulation of {Turing} machines by random access machines},
JOURNAL = sicomp,
VOLUME = {17},
YEAR = {1988},
PAGES = {77--88}
}
@article{KTV84,
author = {G. Katsman and M. Tsfasman and S. Vladut},
title = {Modular curves and codes with a polynomial construction},
journal = itit,
volume = {IT-30},
year = {1984},
pages = {353--355}
}
@inproceedings{KaMi94,
author = {S. Kautz and P. Miltersen},
title = {Relative to a random oracle, {NP} is not small},
booktitle = proc9 # structures,
year = {1994},
pages = {162--174}
}
@inproceedings{Kea93,
author = {M. Kearns},
title = {Efficient noise-tolerant learning from statistical queries},
booktitle = proc25 # stoc,
year = {1993},
pages = {392--401}
}
@inproceedings{KMRRSS94,
author = {M. Kearns and Y. Mansour and D. Ron and R. Rubinfeld
and R. Schapire and L. Sellie},
title = {On the learnability of discrete distributions},
booktitle = proc26 # stoc,
year = {1994},
pages = {273--282}
}
@phdthesis{Kha93,
author = {S. Khadilkar},
title = {Mode Transitions},
school = {Department of Computer Science and Engineering,
IIT Kanpur},
month = {October},
year = {1993}
}
@article{KhVa91,
author = {S. Khuller and V. Vazirani},
title = {Planar graph colring is not self-reducible assuming
{P $\noteq$ NP}},
journal = tcs,
volume = {88},
year = {1991},
pages = {nnn--nnn}
}
@inproceedings{KiRu91,
author = {J. Kilian and R. Rubinfeld},
title = {Interactive proofs with space bounded provers},
booktitle = {Proceedings, CRYPTO '91},
series = lncs,
volume = {576},
publisher = springer,
year = {1991},
pages = {225--231}
}
@inproceedings{Kil92,
author = {J. Kilian},
title = {A note on efficient zero-knowledge proofs and arguments},
booktitle = proc24 # stoc,
year = {1992},
pages = {723--732}
}
@article{KiFi80,
author = {C. Kintala and P. Fischer},
title = {Refining nondeterminism in relativized polynomial-time
bounded computations},
journal = sicomp,
volume = {9},
year = {1980},
pages = {46--53}
}
@inproceedings{Kir88,
author = {W. Kirchherr},
title = {A hierarchy theorem for {PRAM}-based complexity classes},
booktitle = proc8 # "FSTTCS",
series = lncs,
volume = {338},
publisher = springer,
year = {1988},
pages = {240--249}
}
@article{Kir88b,
author = {W. Kirchherr},
title = {Transposition of an {$l \times l$} matrix requires
{$O(\log l)$} reversals on conservative {T}uring machines},
journal = ipl,
volume = {28},
year = {1988},
pages = {55--59}
}
@ARTICLE{Kla90,
AUTHOR = {A. Klapper},
TITLE = {Generalized lowness and highness and probabilistic
complexity classes},
JOURNAL = mathsys,
YEAR = {1990},
VOLUME = {22},
PAGES = {37--45}
}
@article{Kle43,
author = {S. Kleene},
title = {Recursive predicates and quantifiers},
journal = trans-ams,
volume = {53},
year = {1943},
pages = {41--73}
}
@article{Kle76,
author = {R. Klette},
title = {Indexmengen und {E}rkennung rekursiver {F}unktionen},
journal = zml,
volume = {22},
year = {1976},
pages = {231--238}
}
@ARTICLE{KMP77,
AUTHOR = {D. Knuth and J. Morris and V. Pratt},
TITLE = {Fast pattern matching in strings},
JOURNAL = sicomp,
VOLUME = {6},
YEAR = {1977},
PAGES = {323--350}
}
@ARTICLE{Ko82,
AUTHOR = {K. Ko},
TITLE = {Some observations on the probabilistic algorithms
and {$\NP$}-hard problems},
JOURNAL = ipl,
YEAR = {1982},
VOLUME = {14},
PAGES = {39--43}
}
@article{Ko83,
author = {K. Ko},
title = {On self-reducibility and weak {P}-selectivity},
journal = jcss,
volume = {26},
year = {1983},
pages = {209--211}
}
@article{KLD86,
author = {K. Ko and T. Long and D. Du},
title = {A note on one-way functions and polynomial-time
isomorphisms},
journal = tcs,
volume = {47},
year = {1986},
pages = {263--276}
}
@article{Ko87,
author = {K. Ko},
title = {On helping by robust oracle machines},
journal = tcs,
volume = {52},
year = {1987},
pages = {15--36}
}
@article{Ko89,
author = {K. Ko},
title = {Relativized polynomial time hierarchies having exactly
{$k$} levels},
journal = sicomp,
volume = {18},
year = {1989},
pages = {392--408}
}
@article{KSTT92,
author = {K. Ko and U. Sch{\"o}ning and J. Tor{\'a}n and S. Toda},
title = {Turing machines with few accepting computations
and low sets for {PP}},
journal = jcss,
volume = {44},
year = {1992},
pages = {272--286}
}
@article{KSW87,
author = {J. K{\"o}bler and U. Sch{\"o}ning and K. Wagner},
title = {The difference and truth-table hierarchies of {NP}},
journal = {Theoretical Informatics and Applications},
volume = {21},
year = {1987},
pages = {419--435}
}
@inproceedings{KST92,
author = {J. K{\"o}bler and U. Sch{\"o}ning and J. Tor{\'a}n},
title = {Graph isomorphism is low for {PP}},
booktitle = proc9 # stacs,
year = {1992},
pages = {nnn--nnn}
}
@book{KST93,
author = {J. K{\"o}bler and U. Sch{\"o}ning and J. Tor{\'a}n},
title = {The Graph Isomorphism Problem},
publisher = {Birkh{\"a}user},
address = {Boston},
year = {1993}
}
@inproceedings{Kob93,
author = {J. K{\"o}bler},
title = {Locating {P}/poly optimally in the extended low hierarchy},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {28--37}
}
@inproceedings{KoTo93,
author = {J. K{\"o}bler and S. Toda},
title = {On the power of generalized {MOD}-classes},
booktitle = proc8 # structures},
year = {1993},
pages = {147--155}
}
@article{Koba93,
author = {K. Kobayashi},
title = {{$\Sigma_n^0$}-complete properties of programs and
{Martin-L{\"o}f} randomness},
journal = ipl,
volume = {46},
year = {1993},
pages = {nnn--nnn}
}
@article{KoUs58,
author = {A. Kolmogorov and V. Uspenskii},
title = {On the definition of an algorithm},
journal = {Uspekhi Mat. Nauk},
volume = {13},
year = {1958},
pages = {3--28},
note = {English transl. in {\it Russian Math Surveys\/}
{\bf 30} (1963) 217--245}
}
@misc{KoPo93,
author = {S. Konyagin and C. Pomerance},
title = {On primes recognizable in deterministic polynomial time},
month = {August},
year = {1993},
note = {Moscow State Univ. and University of Georgia (Mathematics)}
}
@article{KoSi92,
author = {J. K{\"o}rner and G. Simonyi},
title = {A {S}perner-type theorem and qualitative independence},
journal = jcta,
volume = {59},
year = {1992},
pages = {90--103}
}
@INPROCEEDINGS{Kos79,
AUTHOR = {R. Kosaraju},
TITLE = {Real-time simulation of concatenable double-ended queues by
double-ended queues},
BOOKTITLE = proc11 # stoc,
YEAR = {1979},
PAGES = {346--351}
}
@inproceedings{KoDe90,
author = {S.R. Kosaraju and A. Delcher},
title = {A tree-partitioning technique with applications to
expression evaluation and term matching},
booktitle = proc31 # focs,
year = {1990},
pages = {163--172}
}
@misc{KoDe92,
author = {S.R. Kosaraju and A. Delcher},
title = {A tree-partitioning technique with applications to
expression evaluation and term matching},
month = {November},
year = {1992},
comment = {Improved, AKS-free version of [KoDe90].}
}
@article{KoPa92,
author = {E. Koutsoupias and C. Papadimitriou},
title = {On the greedy algorithm for satisfiability},
journal = ipl,
volume = {43},
year = {1993},
pages = {53--55}
}
@article{Kow82,
author = {W. Kowalczyk},
title = {A sufficient condition for the consistency of
{P = NP} with {P}eano arithmetic},
journal = {Fundamenta Informaticae},
volume = {2},
year = {1982},
pages = {233--245}
}
@inproceedings{Kow84,
author = {W. Kowalczyk},
title = {Some connections between presentability of complexity
classes and the power of formal systems of reasoning},
booktitle = proc11 # mfcs,
year = {1984},
pages = {364--368}
}
@article{Koz80,
author = {D. Kozen},
title = {Indexings of subrecursive classes},
journal = tcs,
volume = {11},
year = {1980},
pages = {277--301}
}
@article{KrPu89,
author = {J. Kraj{\'\i\v{c}}ek and P. Pudl{\'a}k},
title = {Propositional proof systems, the consistency of
first-order theories, and the complexity of computations},
journal = jsl,
volume = {54},
year = {1989},
pages = {1063--1079}
}
@article{KrPu90,
author = {J. Kraj{\'\i\v{c}}ek and P. Pudl{\'a}k},
title = {Quantified propositional logic and fragments of bounded
arithmetic},
journal = zml,
volume = {36},
year = {1990},
pages = {29--46}
}
@inproceedings{KrPu90b,
author = {J. Kraj{\'\i\v{c}}ek and P. Pudl{\'a}k},
title = {Propositional provability and models of weak arithmetic},
booktitle = proc3 # "Symposium on Computer Science Logic",
publisher = springer,
year = {1990}
}
@inproceedings{KPS90},
author = {J. Kraj{\'\i\v{c}}ek and P. Pudl{\'a}k and J. Sgall},
title = {Interactive computations of optimal solutions},
booktitle = proc15 # mfcs,
series = lncs,
volume = {452},
publisher = springer,
year = {1990},
pages = {48--60}
}
@article{KPT91,
author = {J. Kraj{\'\i\v{c}}ek and P. Pudl{\'a}k and G. Takeuti},
title = {Bounded arithmetic and the polynomial hierarchy},
journal = {Annals of Pure and Applied Logic},
volume = {52},
year = {1991},
pages = {143--153}
}
@misc{KPW91,
author = {J. Kraj{\'\i\v{c}}ek and P. Pudl{\'a}k and A. Wood},
title = {Exponential lower bound to the size of bounded depth
{F}rege proofs of the pigeonhole principle},
year = {1991},
note = {Typeset manuscript, to appear in the journal
{\it Random Structures and Algorithms\/}}
}
@misc{Kra93,
author = {J. Kraj{\'\i\v{c}}ek},
title = {On {F}rege and extended {F}rege proof systems},
year = {1993},
note = {Typeset manuscript}
}
@article{Kra94,
Author = {J. Kraj{\'\i\v{c}}ek},
Title = {Lower Bounds to the Size of Constant-Depth {F}rege Proofs},
Journal = jsl,
Volume = {59},
Year = {1994},
Pages = {587-598}
}
@article{Kar88,
author = {M. Krause},
title = {Exponential lower bounds on the complexity
of real-time and local branching programs},
journal = {J. Inform. Process. Cybernet.},
volume = {24},
number = {3},
year = {1988},
pages = {nnn--nnn}
}
@INPROCEEDINGS{KMW89,
AUTHOR = {M. Krause and C. Meinel and S. Waack},
TITLE = {Separating complexity classes related to certain input-oblivious
logarithmic space-bounded {Turing} machines},
BOOKTITLE = proc4 # structures,
YEAR = {1989},
PAGES = {240--249}
}
@inproceedings{Kra90,
author = {M. Krause},
title = {Separating {$\oplus$}L from L, NL, co-NL, and AL
for oblivious {T}uring machines of linear access time},
booktitle = proc15 # mfcs,
series = lncs,
volume = {452},
publisher = springer,
year = {1990},
pages = {}
}
@article{Kra91,
author = {M. Krause},
title = {Lower bounds for depth-restricted branching programs},
journal = infcomp,
volume = {91},
year = {1991},
pages = {1--14}
}
@article{KrWa91,
author = {M. Krause and S. Waack},
title = {On oblivious branching programs of linear length},
journal = infcomp,
volume = {94},
year = {1991},
pages = {232--249}
}
@inproceedings{Kre86,
author = {M. Krentel},
title = {The complexity of optimization problems},
booktitle = proc18 # stoc,
year = {1986},
pages = {69--76}
}
@article{Kre88,
author = {M. Krentel},
title = {The complexity of optimization problems},
journal = jcss,
volume = {36},
year = {1988},
pages = {490--509}
}
@inproceedings{Kre89,
author = {M. Krentel},
title = {Structure of locally optimal solutions},
booktitle = proc30 # focs,
year = {1989},
pages = {216--221}
}
@srticle{Kre90,
author = {M. Krentel},
title = {On finding locally optimal solutions},
journal = sicomp,
volume = {19},
year = {1990},
pages = {742--749}
}
@article{Kri94,
author = {R. Krichevsky},
title = {Occam's {R}azor, partially specified {B}oolean functions,
string matching, and independent sets},
journal = infcomp,
volume = {108},
year = {1994},
pages = {158--174}
}
@article{KrRh65,
author = {K. Krohn and J. Rhodes},
title = {Algebraic theory of machines. {I}. Prime
decomposition theorem for finite semigroups and machines},
journal = trans-ams,
volume = {116},
year = {1965},
pages = {450--464}
}
@incollection{KRT68,
author = {K. Krohn and J. Rhodes and B. Tilson},
title = {The prime decomposition theorem of the
algebraic theory of machines},
booktitle = {Algebraic Theory of Machines, Languages,
and Semigroups},
editor = {M. Arbib},
publisher = {Academic Press},
year = {1968},
note = {Ch. 5; see also chs. 4 and 6--9}
}
@article{KRS85,
author = {C. Kruskal and L. Rudolph and M. Snir},
title = {The power of parallel prefix},
journal = {IEEE Transactions on Computers},
volume = {C--34},
year = {1985},
pages = {965--968}
}
@article{KRS91,
author = {C. Kruskal and L. Rudolph and M. Snir},
title = {Efficient parallel algorithms for graph problems},
journal = {Algorithmica},
volume = {5},
year = {1990},
pages = {43--64}
}
@article{Kum89,
author = {G. Kumicakova--Jiraskova},
title = {Chomsky hierarchy and communication complexity},
journal = {J. Inf. Process. Cybern. EIK},
volume = {25},
year = {1989},
pages = {157--164}
}
@techreport{KuSt91,
author = {M. Kummer and F. Stephan},
title = {Some aspects of frequency computation},
institution = {Universit{\"a}t Karlsruhe, Fakult{\"a}t f{\"u}r
Informatik},
number = {21/91},
month = {October},
year = {1991}
}
@article{Kung88},
author = {H. Kung},
title = {Computational models for parallel computers},
journal = {Phil. Trans. R. Soc. Lond. A},
volume = {326},
year = {1988},
pages = {357--371}
}
@inproceedings{KuLe78,
author = {H. Kung and C. Leiserson},
title = {Systolic arrays (for {VLSI})},
booktitle = {Sparse Matrix Proceedings},
publisher = {SIAM},
year = {1978},
pages = {256--282}
}
@article{KOR87,
author = {S. Kurtz and M. O{'Donnell} and J. Royer},
title = {How to prove representation-independent independence
results},
journal = ipl,
volume = {24},
year = {1987},
pages = {5--10}
}
@techreport{Kur88,
author = {S. Kurtz},
title = {The isomorphism conjecture fails relative to
a generic oracle},
institution = {Department of Computer Science, University of Chicago},
number = {88-018},
year = {1988},
note = tcs # ", to appear"
}
@article{KMR88,
author = {S. Kurtz and S. Mahaney and J. Royer},
title = {Collapsing degrees},
journal = jcss,
volume = {37},
year = {1988},
pages = {247--268}
}
@inproceedings{KMR89,
author = {S. Kurtz and S. Mahaney and J. Royer},
title = {The {I}somorphism {C}onjecture fails relative
to a random oracle},
booktitle = proc21 # stoc,
year = {1989},
pages = {157--166}
}
@article{KuFr90,
author = {B. Kuszmaul and J. Fried},
title = {{NAP (No ALU Processor)}: The great communicator},
journal = jpdc,
volume = {8},
year = {1990},
pages = {169--179}
}
@ARTICLE{Kut91,
AUTHOR = {M. Kutylowski},
TITLE = {Multihead one--way finite automata},
JOURNAL = tcs,
VOLUME = {85},
YEAR = {1991},
PAGES = {135--153}
}
@article{Kut91b,
author = {M. Kutylowski},
title = {Time complexity of {Boolean} functions on {CREW} {PRAMs}},
journal = sicomp,
volume = {20},
year = {1991},
pages = {824--833}
}
@article{Kut93,
author = {M. Kutylowski},
title = {Stack versus sensitivity for one-way automata},
journal = tcs,
volume = {119},
year = {1993},
pages = {233--245}
}
@article{Kwo89a,
author = {Y.H.H. Kwong},
title = {Minimum periods of {$S(n,k)$} modulo {$m$}},
journal = {Fibonacci Quarterly},
volume = {27},
year = {1989},
pages = {217--221}
}
@article{Kwo89b,
author = {Y.H.H. Kwong},
title = {Minimum periods of binomial coefficients modulo {$m$}},
ournal = {Fibonacci Quarterly},
volume = {27},
year = {1989},
pages = {348--351}
}
@article{Kwo89c,
author = {Y.H.H. Kwong},
title = {Periodicities of a class of infinite integer sequences
modulo {$m$}},
journal = {Journal of Number Theory},
volume = {31},
year = {1989},
pages = {64--79}
}
@article{Lad75,
author = {R. Ladner},
title = {On the structure of polynomial-time reducibility},
journal = jacm,
volume = {22},
year = {1975},
pages = {155--171}
}
@article{Lad75b,
author = {R. Ladner},
title = {The circuit value problem is log-space complete for {P}},
journal = {SIGACT News},
volume = {7},
year = {1975},
pages = {18--20}
}
@article{Lad77,
author = {R. Ladner},
title = {The computational complexity of provability in systems
of modal propositional logic},
journal = sicomp,
volume = {6},
year = {1977},
pages = {467--480}
}
@article{Lad77b,
author = {R. Ladner},
title = {Application of model-theoretic games to discrete linear
orders and finite automata},
journal = infcon,
volume = {33},
year = {1977},
pages = {281--303},
}
@article{LLS75,
author = "R. Ladner and N. Lynch and A. Selman",
title = "A comparison of polynomial time reducibilities",
journal = tcs,
year = "1975",
volume = "1",
pages = "103--123"
}
@article{LaLy76,
author = {R. Ladner and N. Lynch},
title = {Relativization of questions about log-space
computability},
journal = mathsys,
volume = {10},
year = {1976},
pages = {19--32}
}
@ARTICLE{LaFi80,
AUTHOR = {R. Ladner and M. Fischer},
TITLE = {Parallel prefix computation},
JOURNAL = jacm,
VOLUME = {27},
YEAR = {1980},
PAGES = {831--838}
}
@article{LaRo72,
author = {L. Landweber and E. Robertson},
title = {Recursive properties of abstract complexity classes},
journal = jacm,
volume = {19},
year = {1972},
pages = {286--308}
}
@article{LLR81,
author = {L. Landweber and R. Lipton and E. Robertson},
title = {On the structure of sets in {NP} and other
complexity classes},
journal = tcs,
volume = {15},
year = {1981},
pages = {181--200}
}
@inproceedings{LaNi93,
author = {K. Lange and R. Niedermeier},
title = {Data-independences of parallel random access machines},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {nnn--nnn}
}
@inproceedings{LaSh91,
author = {D. Lapidot and A. Shamir},
title = {A one-round, two-prover, zero-knowledge protocol for NP},
booktitle = {Proceedings, CRYPTO '91},
series = lncs,
volume = {576},
publisher = springer,
year = {1991},
pages = {213--224}
}
@misc{Lap94,
author = {S. Laplante},
title = {A {K}olmogorov compelxity proof of {H}astad's
switching lemma: an exposition},
month = {March},
year = {1994},
note = {Computer Science, University of Chicago}
}
@ARTICLE{Lau83,
AUTHOR = {C. Lautemann},
TITLE = {{$\BPP$} and the polynomial hierarchy},
JOURNAL = ipl,
YEAR = {1983},
VOLUME = {17},
PAGES = {215--217}
}
@article{Lgh85,
author = {T. Leighton},
title = {Tight bounds on the complexity of parallel sorting},
journal = {IEEE Transactions on Computers},
volume = {C-34},
year = {1985},
pages = {344--354}
}
@article{LeMa88,
author = {C. Leiserson and B. Maggs},
title = {Communication-efficient parallel algorithms for
distributed random-access machines},
journal = {Algorithmica},
volume = {3},
year = {1988},
pages = {53--77}
}
@article{Lei82,
author = {D. Leivant},
title = {Unprovability of theorems of complexity theory in weak
number theories},
journal = tcs,
volume = {18},
year = {1982},
pages = {259--268}
}
@ARTICLE{Lei85,
AUTHOR = {D. Leivant},
TITLE = {Syntactic translations and provably recursive functions},
JOURNAL = jsl,
VOLUME = {50},
YEAR = {1985},
PAGES = {682--687}
}
@incollection{Lei85b,
author = {D. Leivant},
title = {Intuitionistic formal systems},
booktitle = {Harvey Friedman's Research on the Foundations
of Mathematics},
editor = {L. Harrington et~al.},
publisher = {Elsevier},
year = {1985},
pages = {231--255}
}
@article{Lei89,
author = {D. Leivant},
title = {Descriptive characterizations of computational complexity},
journal = jcss,
volume = {39},
year = {1989},
pages = {51--83}
}
@techreport{Lei89b,
author = {D. Leivant},
title = {Monotone use of space and computational complexity over
abstract structures},
institution = {Carnegie-Mellon University, Computer Science Department},
number = {CMU-CS-89-212},
year = {1989}
}
@incollection{Lei90,
author = {D. Leivant},
title = {Contracting proofs to programs},
booktitle = {Logic and Computer Science},
editor = {P. Odifreddi},
publisher = {Academic Press},
year = {1990},
pages = {279--327}
}
@incollection{Lei90b,
author = {D. Leivant},
title = {Subrecursion and lambda representation over free algebras
(preliminary summary)},
booktitle = {Feasible Mathematics},
editor = {S. Buss and P. Scott},
series = {Perspectives in Computer Science},
publisher = {Birkh{\"a}user},
year = {1990},
pages = {281--291}
}
@inproceedings{Lei91,
author = {D. Leivant},
title = {A foundational delineation of computational feasibility},
booktitle = proc6 # lics,
year = {1991}
}
@techreport{Lei92,
author = {D. Leivant},
title = {A foundational delineation of polynomial time},
institution = {Indiana University Logic Group},
number = {Preprint No. IULG--92--nn},
year = {1992},
note = infcon # ", to appear"
}
@techreport{Lei92b,
author = {D. Leivant},
title = {Peano theories and their computable functions},
number = {nnn},
institution = {Computer Science, Indiana University},
address = {Bloomington, IN 47405},
month = {December},
year = {1992}
}
@article{LeTa82,
author = {T. Lengauer and R. Tarjan},
title = {Asymptotically tight bounds on time-space tradeoffs
in a pebble game},
journal = jacm,
volume = {29},
year = {1982},
pages = {1087--1130}
}
@article{Len91,
author = {H.W. Lenstra},
title = {Finding isomorphisms between finite fields},
journal = {Mathematics of Computation},
volume = {56},
year = {1991},
pages = {329--347}
}
@ARTICLE{LeSe81,
AUTHOR = {B. Leong and J. Seiferas},
TITLE = {New real-time simulations of multihead tape units},
JOURNAL = jacm,
VOLUME = {28},
YEAR = {1981},
PAGES = {166--180}
}
@article{Leo91,
author = {C. Leopold},
title = {Reading data in a hierarchical memory},
journal = {J. Inf. Proc. Cybernet.},
volume = {EIK 27},
year = {1991},
pages = {207--216}
}
@article{LTWYC90,
author = {J. Leung and T. Tam and C. Wong and G. Young and F. Chin},
title = {Packing squares into a square},
journal = jpdc,
volume = {10},
year = {1990},
pages = {271--275}
}
@article{LPV81,
author = {G.F. Lev and N. Pippenger and L. Valiant},
title = {A fast parallel algorithm for routing in permutation
networks},
journal = {IEEE Transactions on Computers},
volume = {C-30},
month = {February},
year = {1981},
pages = {93--100}
}
@techreport{Lev80,
author = {L. Levin},
title = {A concept of independence with applications in various
fields of mathematics},
institution = {MIT Laboratory for Computer Science},
number = {MIT/LCS/TR-235},
year = {1980}
}
@article{Lew79,
author = {J. Lew},
title = {Polynomial enumeration of multidimensional lattices},
journal = mathsys,
volume = {12},
year = {1979},
pages = {253--270}
}
@article{LMS93,
author = {J. Lew and L. Morales and A. Sanchez-Flores},
title = {Diagonal polynomials for small dimensions},
journal = mathsys,
year = {1993},
volume = {nn},
note = {To appear}
}
@article{Lew71,
author = {F. Lewis},
title = {Classes of recursive functions and their index sets},
journal = zml,
volume = {17},
year = {1971},
pages = {291--294}
}
@article{LiYe86,
author = {M. Li and Y. Yesha},
title = {String-matching cannot be done by a {2-head} {1-way}
deterministic finite automata},
journal = ipl,
volume = {22},
year = {1986},
pages = {231--235}
}
@article{LiVi88,
author = {M. Li and P. Vit{\'a}nyi},
title = {Tape versus queue and stacks: the lower bounds},
journal = infcomp,
volume = {78},
year = {1988},
pages = {56--85}
}
@INCOLLECTION{LiVi90,
AUTHOR = {M. Li and P. Vit{\'a}nyi},
TITLE = {Applications of {Kolmogorov} complexity in the theory of
computation},
BOOKTITLE = {Complexity Theory Retrospective},
EDITOR = {A. Selman},
PUBLISHER = springer,
YEAR = {1990},
PAGES = {147--203}
}
@article{LiVi91,
author = {M. Li and P. Vitanyi},
title = {Learning simple concepts under simple distributions},
journal = sicomp,
volume = {20},
year = {1991},
pages = {911--935}
}
@article{LLV92,
author = {M. Li and L. Longpr{\'e} and P. Vit{\'a}nyi},
title = {The power of the queue},
journal = sicomp,
volume = {21},
year = {1992},
pages = {697--712}
}
@article{LiVi92,
author = {M. Li and P. Vit{\'a}nyi},
title = {Average case complexity under the universal distribution equals
worst-case complexity},
journal = ipl,
volume = {42},
year = {1992},
pages = {145--149}
}
@book{LV93,
author = {M. Li and P. Vit{\'a}nyi},
title = {An Introduction to Kolmogorov Complexity and its
Applications},
publisher = springer,
year = {1993}
}
@book{LN86,
author = {R. Lidl and H. Niederreiter},
title = {Introduction to Finite Fields and Their Applications},
publisher = {Cambridge University Press},
year = {1986}
}
@article{LiPi94,
author = {G. Lin and N. Pippenger},
title = {Parallel algorithms for routing in nonblocking networks},
journal = mathsys,
volume = {27},
year = {1994},
pages = {29--40}
}
@inproceedings{LLSZ93,
author = {N. Linial and M. Luby and M. Saks and D. Zuckerman},
title = {Efficient construction of a small hitting set for
combinatorial rectangles in high dimension},
booktitle = proc25 # stoc,
year = {1993},
pages = {258--267}
}
@article{Lin92,
author = {S. Lindell},
title = {The invariant problem for binary string structures and the
parallel complexity theory of queries},
journal = jcss,
volume = {44},
year = {1992},
pages = {385--410}
}
@inproceedings{Lin92b,
author = {S. Lindell},
title = {A purely logical characterization of circuit uniformity},
booktitle = proc7 # structures,
year = {1992},
pages = {185--192}
}
@article{LiZa77,
author = {R. Lipton and Y. Zalcstein},
title = {Word problems solvable in logspace},
journal = jacm,
volume = {24},
year = {1977},
pages = {522--526}
}
@inproceedings{Lip78,
author = {R. Lipton},
title = {Model-theoretic aspects of computational complexity},
booktitle = proc19 # focs,
year = {1978},
pages = {191--200}
}
@inproceedings{Lip94,
author = {R. Lipton},
title = {A new approach to information theory},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {699--708}
}
@inproceedings{LiYo94,
author = {R. Lipton and N. Young},
title = {Simple strategies for large zero-sum games, with
applications to complexity theory},
booktitle = proc26 # stoc,
year = {1994},
pages = {734--740}
}
@inproceedings{Lip94b,
author = {R. Lipton},
title = {Some consequences of our failure to prove non-linear
lower bounds on explicit functions},
booktitle = proc9 # structures,
year = {1994},
pages = {79--87}
}
@article{Lis93,
author = {M. Li{\'s}kiewicz},
title = {On the relationship between deterministic time and
deterministic reversal},
journal = ipl,
volume = {45},
year = {1993},
pages = {143--146}
}
@inproceedings{LiRe93,
author = {M. Li{\'s}kiewicz and R. Reischuk},
title = {Separating the lower levels of the sublogarithmic space
hierarchy},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {16--27}
}
@article{LWZ90,
author = {H.-N. Liu and C. Wrathall and K. Zeger},
title = {Efficient solution of some problems in free partially
commutative monoids},
journal = infcomp,
volume = {1989},
year = {1990},
pages = {180--198}
}
@article{Long81,
author = {T. Long},
title = {On {$\gamma$}-reducibility versus polynomial time
many-one reducibility},
journal = tcs,
volume = {14},
year = {1981},
pages = {nnn--nnn}
}
@ARTICLE{Long82,
AUTHOR = {T. Long},
TITLE = {Strong nondeterministic polynomial reducibilities},
JOURNAL = tcs,
YEAR = {1982},
VOLUME = {21},
PAGES = {1--25}
}
@article{Long82b,
AUTHOR = {T. Long},
TITLE = {A note on sparse oracles for {NP}},
journal = jcss,
volume = {24},
year = {1982},
pages = {380--389}
}
@article{Long85,
author = {T. Long},
title = {On restricting the size of oracles compared with
restricting access to oracles},
journal = sicomp,
volume = {14},
year = {1985},
pages = {585--597}
}
@article{LoSe93,
author = {L. Longpr{\'e} and A. Selman},
title = {Hard promise problems and nonuniform complexity},
journal = tcs,
volume = {115},
year = {1993},
pages = {277--290}
}
@article{Loui80,
author = {M. Loui},
title = {A note on the pebble game},
journal = ipl,
volume = {11},
year = {1980},
pages = {24--26}
}
@ARTICLE{Loui82,
AUTHOR = {M. Loui},
TITLE = {Simulations among multidimensional {Turing} machines},
JOURNAL = tcs,
VOLUME = {21},
YEAR = {1981},
PAGES = {145--161}
}
@ARTICLE{Loui83,
AUTHOR = {M. Loui},
TITLE = {Optimal dynamic embedding of trees into arrays},
JOURNAL = sicomp,
VOLUME = {12},
YEAR = {1983},
PAGES = {463--472}
}
@ARTICLE{Loui84,
AUTHOR = {M. Loui},
TITLE = {Minimizing access pointers into trees and arrays},
JOURNAL = jcss,
VOLUME = {28},
YEAR = {1984},
PAGES = {359--378}
}
@article{LMW86,
author = {M. Loui and T. Matsushita and D. West},
title = {Election in a complete network with a sense of direction},
journal = ipl,
volume = {22},
year = {1986},
pages = {185--187},
note = {Corrigendum: {\it IPL\/} {\bf 28} (1988), p327}
}
@ARTICLE{LoLu91,
AUTHOR = {M. Loui and D. Luginbuhl},
TITLE = {The complexity of on-line simulation between multidimensional
{Turing} machines and random-access machines},
JOURNAL = mathsys,
VOLUME = {25},
YEAR = {1992},
PAGES = {293--308}
}
@ARTICLE{LoLu92,
AUTHOR = {M. Loui and D. Luginbuhl},
TITLE = {Optimal on-line simulations of tree machines by random access
machines},
JOURNAL = sicomp,
VOLUME = {21},
YEAR = {1992},
PAGES = {959--971}
}
@article{LoPo92,
author = {A. Louri and A. Post},
title = {Complexity analysis of optical-computing paradigms},
journal = {Applied Optics},
volume = {31},
number = {26},
year = {1992},
pages = {5568--5583}
}
@article{LSZ93,
author = {M. Luby and A. Sinclair and D. Zuckerman},
title = {Optimal speedup of {L}as {V}egas algorithms},
journal = ipl,
volume = {47},
year = {1993},
pages = {173--180}
}
@inproceedings{LuPa89,
author = {F. Luccio and L. Pagli},
title = {A model of sequential computation based on a pipelined
access to memory},
booktitle = proc27 # "Annual Allerton Conference on Communication, Control, and Computing",
year = {1989},
pages = {}
}
@article{LuPa93,
author = {F. Luccio and L. Pagli},
title = {A model of sequential computation with pipelined access
to memory},
journal = mst,
volume = {26},
year = {1993},
pages = {343--356}
}
@article{Luc91,
author = {H. Luckhardt},
title = {New formally undecidable propositions: non-trivial lower
bounds on proof complexity and related theorems},
journal = tcs,
volume = {83},
year = {1991},
pages = {169--188}
}
@article{LuLo93,
author = {D. Luginbuhl and M. Loui},
title = {Hierarchies and space measures for pointer machines},
journal = infcomp,
volume = {104},
year = {1993},
pages = {253--270}
}
@inproceedings{Lun85,
author = {H. L{\"u}neberg},
title = {On a little but useful algorithm},
booktitle = {Proceedings, Third International Conference on
Algebraic Algorithms and Error-Correcting Codes, Grenoble, France,
July 1985},
series = lncs,
volume = {229},
publisher = springer,
year = {1985},
pages = {296--301}
}
@article{Lutz90,
author = {J. Lutz},
title = {Category and measure in complexity classes},
journal = sicomp,
volume = {19},
year = {1990},
pages = {220--258}
}
@inproceedings{Lutz91,
author = {J. Lutz},
title = {A pseudorandom oracle characterization of {BPP}},
booktitle = proc6 # structures,
year = {1991},
pages = {190--195}
}
@article{Lutz92,
author = {J. Lutz},
title = {Almost everywhere high nonuniform complexity},
journal = jcss,
volume = {44},
year = {1992},
pages = {220--258}
}
@misc{Lutz92b,
author = {J. Lutz},
title = {One-way functions and balanced {NP}},
year = {1992},
note = {Unpublished manuscript}
}
@inproceedings{Lutz93,
author = {J. Lutz},
title = {The quantitative structure of exponential time},
booktitle = proc8 # structures,
year = {1993},
pages = {158--175}
}
@article{Lutz93b,
author = {J. Lutz},
title = {A pseudorandom oracle characterization of {BPP}},
journal = sicomp,
volume = {22},
year = {1993},
pages = {nnn--nnn}
}
@inproceedings{LuMa93,
author = {J. Lutz and E. Mayordomo},
title = {Measure, stochasticity, and the density of hard languages},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {38--47}
}
@article{LuSc93,
author = {J. Lutz and W. Schmidt},
title = {Circuit size relative to pseudorandom oracles},
journal = tcs,
volume = {107},
year = {1993},
pages = {95--120}
}
@inproceedings{LuMa94,
author = {J. Lutz and E. Mayordomo},
title = {Cook versus {Karp}-{Levin}: Separating completeness
notions if {NP} is not small},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {415--426}
}
@article{LuMa94b,
author = {J. Lutz and E. Mayordomo},
title = {Measure, stochasticity, and the density of hard languages},
journal = sicomp,
volume = {23},
year = {1994},
pages = {762--779}
}
@inproceedings{Lutz94,
author = {J. Lutz},
title = {Weakly hard problems},
bookittle = proc9 # structures,
year = {1994},
pages = {to appear},
note = sicomp # ", to appear"
}
@article{Lyn75,
author = {N. Lynch},
title = {On reducibility to complex or sparse sets},
journal = jacm,
volume = {22},
year = {1975},
pages = {341--345}
}
@article{Lyn77,
author = {N. Lynch},
title = {Log space recognition and translation of parenthesis
languages},
journal = jacm,
volume = {24},
year = {1977},
pages = {583--590}
}
@INPROCEEDINGS{MaSc86,
AUTHOR = {W. Maass and G. Schnitger},
TITLE = {An optimal lower bound for {Turing} machines with one work tape
and a two--way input tape},
BOOKTITLE = proc1 # "Annual Conference on Structure in Complexity Theory",
PUBLISHER = springer,
SERIES = lncs,
VOLUME = {223},
YEAR = {1986},
PAGES = {249--264}
}
@article{MaSl92,
AUTHOR = {W. Maass and T. Slaman},
title = {The complexity types of computable sets},
journal = jcss,
volume = {44},
year = {1992},
pages = {168--192}
}
@misc{Mac93,
author = {I. Macarie},
title = {Connections among probabilistic automata (preliminary
version)},
year = {1993}
}
@techreport{Mac93,
author = {I. Macarie},
title = {Space-efficient deterministic simulation of probabilistic
automata},
institution = {Computer Science, University of Rochester},
number = {463},
year = {1993},
month = {July}
}
@inproceedings{Mac94,
author = {I. Macarie},
title = {Space-efficient simulation of deterministic automata},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {109--122}
}
@techreport{Mac94b,
author = {I. Macarie},
title = {Properties of multihead two-way probabilistic
finite automata},
institution = {Computer Science, University of Rochester},
number = {477},
month = {January},
year = {1994}
}
@techreport{Mac94c,
author = {I. Macarie},
title = {Connections among space-bounded and multihead
probabilistic automata},
institution = {Computer Science, University of Rochester},
number = {476},
month = {January},
year = {1994}
}
@misc{Mac94d,
author = {I. Macarie},
title = {Decreasing the bandwidth of a transition matrix},
year = {1994}
}
@inproceedings{Mac73,
author = {M. Machtey},
title = {A notion of helping and pseudo-complementation in
lattices of honest subrecursive classes},
booktitle = proc14 # focs,
year = {1973},
pages = {nnn--nnn}
}
@article{Mac75,
author = {M. Machtey},
title = {On the density of honest subrecursive classes},
journal = jcss,
volume = {10},
year = {1975},
pages = {nnn--nnn}
}
@article{Mac76,
author = {M. Machtey},
title = {Minimal pairs of polynomial degrees with subexponential
complexity},
journal = tcs,
volume = {2},
year = {1976},
pages = {nnn--nnn}
}
@book{MY78,
author = {M. Machtey and P. Young},
title = {An Introduction to the General Theory of Algorithms},
publisher = {North-Holland},
address = {New York},
year = {1978}
}
@inproceedings{MaTh93,
author = {A. Maciel and D. Th{\'e}rien},
title = {Threshold circuits for iterated mutliplication: using
{AC$^0$} for free},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {545--554}
}
@phdthesis{Maciel95,
author = {A. Maciel},
title = {Threshold Circuits of Small Majority-Depth},
school = {McGill University, School of Computer Science},
year = {1995}
}
@book{MS77,
author = {F. MacWilliams and N. Sloane},
title = {The Theory of Error-Correcting Codes},
publisher = {North-Holland},
address = {Amsterdam},
year = {1977}
}
@inproceedings{MaVi94,
author = {M. Mahajan and V. Vinay},
title = {Non-commutative computation, depth reduction, and skew
circuits},
booktitle = proc14 # fsttcs,
series = lncs,
volume = {880},
publisher = springer,
year = {1994}
}
@article{Mah82,
author = {S. Mahaney},
title = {Sparse complete sets for {NP}: solution of a conjecture
of {B}erman and {H}artmanis},
journal = jcss,
volume = {25},
year = {1982},
pages = {130--143}
}
@article{MaYo85,
author = {S. Mahaney and P. Young},
title = {Reductions among polynomial isomorphism types},
journal = tcs,
volume = {39},
year = {1985},
pages = {207--224}
}
@techreport{Mak92,
author = {L. Mak},
title = {Speedup of deterministic multidimensional {T}uring machines
by alternating multidimensional {T}uring machines},
institution = {Coordinated Science Laboratory, Univ. of Illinois at
Urbana-Champaign},
number = {UILU-ENG-92-2223, ACT-122},
month = {August},
year = {1992}
}
@techreport{Mak93,
author = {L. Mak},
title = {Are parallel machines always faster than sequential machines?},
institution = {Coordinated Science Laboratory, Univ. of Illinois at
Urbana-Champaign},
number = {UILU-ENG-93-2236, ACT-128},
month = {September},
year = {1993}
}
@techreport{Mak93b,
author = {L. Mak},
title = {Parallelism always helps},
institution = {Coordinated Science Laboratory, Univ. of Illinois at
Urbana-Champaign},
number = {UILU-ENG-93-2239, ACT-129},
month = {September},
year = {1993}
}
@inproceedings{Mak94,
author = {L. Mak},
title = {Are parallel machines always faster than sequential
machines?},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {137--148}
}
@techreport{MaPn92,
author = {J. Makowsky and Y. Pnueli},
title = {Computable quantifiers and logics capturing complexity
classes},
institution = {Computer Science, Technion, Haifa},
year = {1992},
month = {November}
}
@article{Man82,
author = {G. Manacher},
title = {Steady-paced-output and fractional-on-line algorithms
on a {RAM}},
journal = ipl,
volume = {15},
number = {2},
year = {1982},
pages = {47--52}
}
@article{MNT93,
author = {Y. Mansour and N. Nisan and P. Tiwari},
title = {The computational complexity of universal hashing},
journal = tcs,
volume = {107},
year = {1993},
pages = {121--133}
}
@misc{MHRad93,
author = {M. Marathe and H. {Hunt III} and V. Radhakrishnan},
title = {Hierarchical specifications and polynomial time
approximation schemes for {PSPACE}-complete problems},
year = {1993}
}
@inproceedings{MHRav93,
author = {M. Marathe and H. {Hunt III} and S. Ravi},
title = {The complexity of approximating {PSPACE}-complete
problems for hierarchical specifications},
booktitle = proc20 # icalp,
series = lncs,
volume = {700},
publisher = springer,
year = {1993},
pages = {nnn--nnn}
}
@article{MaRi94,
author = {D. Marinescu and J. Rice},
title = {On high level characterization of parallelism},
journal = jpdc,
volume = {20},
year = {1993},
pages = {107--113}
}
@inproceedings{MCW78,
author = {G. Markowsky and J. Carter and M. Wegman},
title = {Analysis of a universal class of hash functions},
booktitle = {Proceedings of the 1978 International Symposium on Mathemat
ical Foundations of Computer Science},
YEAR = {1978},
PUBLISHER = springer,
SERIES = lncs,
VOLUME = {64},
pages = {345--354}
}
@article{Mar94,
author = {B. Martin},
title = {A universal cellular automaton in quasi-linear time
and its {S-m-n} form},
journal = tcs,
volume = {123},
year = {1994},
pages = {199--237}
}
@article{MaPa80,
author = {W. Masek and M. Paterson},
title = {A faster algorithm for computing string distances},
journal = jcss,
volume = {20},
year = {1980},
pages = {18--31}
}
@incollection{Mat73,
author = {Y. Matijasevic},
title = {On recursive unsolvability of {H}ilbert's tenth problem},
booktitle = {Logic, Methodology, and Philosophy of Science IV},
editor = {L. Henkin and A. Joja and G. Moisil and P. Suppes},
publisher = {North-Holland},
year = {1973}
}
@article{MaRo75,
author = {Y. Matijasevic and J. Robinson},
title = {Reduction of an arbitrary {D}iophantine equation
to one in 13 unknowns},
journal = {Acta Arithmetica},
volume = {27},
year = {1975},
pages = {521--553}
}
@incollection{Mat70,
author = {D. Matula},
title = {On the complete subgraph of a random graph},
booktitle = {Combinatory Mathematics and its Applications},
address = {Chapel Hill, NC},
year = {1970},
pages = {356--369}
}
@inproceedings{Mau91,
author = {U. Maurer},
title = {Perfect cryptographic security from partially independent
channels},
booktitle = proc23 # stoc,
year = {1991},
pages = {561--572}
}
@article{Mau93,
author = {U. Maurer},
title = {Secret key agreement by public discussion from
common information},
journal = itit,
volume = {39},
year = {1993},
pages = {733--742}
}
@inproceedings{May92,
author = {E. Mayordomo},
title = {Almost every set in exponential time is {P}-bi-immune},
booktitle = proc7 # mfcs,
series = lncs,
volume = {nnn},
publisher = springer,
year = {1992},
pages = {392--400},
note = tcs # ", to appear"
}
@phdthesis{May94t,
author = {E. Mayordomo},
title = {Contributions to the Study of Resource-Bounded Measure},
school = {Universidad Polyt{\'e}cnica de Catalunya},
address = {Barcelona},
month = {April},
year = {1994}
}
@inproceedings{MaWe93,
author = {E. Mayr and R. Werchner},
title = {Divide-and-conquer algorithms on the hypercube},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {153--162}
}
@inproceedings{McA86,
author = {K. McAloon},
title = {Separation results for bounded alternation},
booktitle = proc1 # structures,
volume = {223},
series = lncs,
publisher = springer,
year = {1986},
pages = {265--271}
}
@book{McA91,
author = {A. McAulay},
title = {Optical Computer Architectures},
publisher = {Wiley},
address = {New York, NY},
year = {1991}
}
@inproceedings{MWB94,
author = {R. McCloskey and J. Wang and J. Belanger},
title = {Parallel parsing of languages generated by ambiguous
bounded context grammars},
booktitle = proc6 # icci,
year = {1994}
}
@incollection{McD90,
author = {C. {McDiamard}},
title = {Colourings of random graphs},
booktitle = {Graph Colourings},
editor = {R. Nelson and R. Wilson},
series = {Research Notes in Mathematics},
volume = {218},
publisher = {Pitman},
year = {1990},
pages = {79--86}
}
@article{McKCo87,
author = {P. McKenzie and S. Cook},
title = {The parallel complexity of abelian permutation group
problems},
journal = sicomp,
volume = {16},
year = {1987},
pages = {880--908}
}
@inproceedings{McKTh89,
author = {P. McKenzie and D. Th{\'e}rien},
title = {Automata theory meets circuit complexity},
booktitle = proc16 # icalp,
year = {1989},
pages = {589--602}
}
@article{MPT91,
author = {P. McKenzie and P. P{\'e}ladeau and D. Th{\'e}rien},
title = {{NC$^1$}: The automata-theoretic viewpoint},
journal = {Computational Complexity},
volume = {1},
year = {1991},
pages = {330--359}
}
@book{MP71,
author = {R. McNaughton and S. Papert},
title = {Counter-Free Automata},
publisher = {MIT Press},
address = {Cambridge, MA},
year = {1971}
}
@book{MC80,
editor = {C. Mead and L. Conway},
title = {Introduction to VLSI Systems},
publisher = {Addison-Wesley},
address = {Reading, Mass.},
year = {1980}
}
@techreport{MeKo93,
author = {B. Medawar and W. Korfhage},
title = {Hierarchical load balancing with dynamic hierarchies},
number = {CATT 93-16},
institution = {Center for Advanced Technology in Telecommunications,
Polytechnic University},
address = {Brooklyn, NY 11201},
month = {March},
year = {1993}
}
@article{Meh76,
author = {K. Mehlhorn},
title = {Polynomial and abstract subrecursive classes},
journal = jcss,
volume = {12},
year = {1976},
pages = {147--178}
}
@article{MeVi84,
author = {K. Mehlhorn and U. Vishkin},
title = {Randomized and deterministic simulation of {PRAMs}
by parallel machines with restricted granualrity of parallel memories},
journal = {Acta Informatica},
volume = {21},
year = {1984},
pages = {339--374}
}
@book{Mei89,
author = {C. Meinel},
title = {Modified Branching Programs and Their Computational
Power},
series = lncs,
volume = {370},
publisher = springer,
address = {Berlin},
year = {1989}
}
@article{Mei90,
author = {C. Meinel},
title = {Polynomial-size {$\Omega$}-branching programs
and their computational power},
journal = infcon,
volume = {85},
year = {1990},
pages = {163--182}
}
@inproceedings{Mei90b,
author = {C. Meinel},
title = {Restricted branching programs and their computational
power},
booktitle = proc15 # mfcs,
series = lncs,
volume = {452},
publisher = springer,
year = {1990},
pages = {61--75}
}
@inproceedings{MeWa93,
author = {C. Meinel and S. Waack},
title = {Separating complexity classes related to bounded
alternating {$\omega$}-branching programs},
booktitle = proc4 # isaac,
publisher = springer,
series = lncs,
volume = {762},
year = {1993},
pages = {379--390}
}
@article{Mei92,
author = {Yu. Meitus},
title = {The equivalence problem for real-time strict
deterministic pushdown automata},
journal = {Kibernetika},
volume = {25},
year = {1992},
pages = {581--594}
}
@article{Mei93,
author = {Yu. Meitus},
title = {Decidability of the equivalence problem for deterministic
pushdown automata},
journal = {Cybernetics and Systems Analysis},
volume = {28},
number = {5},
year = {1993},
pages = {672--690},
note = {Transl. of {\it Kibernetika i Sistemnyi Analiz\/}}
}
@article{MRRT53,
author = {N. Metropolis and A. Rosenbluth and M. Rosenbluth
and A. Teller},
title = {Equation of state calculations by fast computing
machines},
journal = {J. Chem. Phys.},
volume = {21},
year = {1953},
pages = {1087--1092}
}
@article{Mey69,
author = {A. Meyer},
title = {A note on star-free events},
journal = jacm,
volume = {16},
year = {1969},
pages = {220--225}
}
@article{Mic81,
author = {S. Micali},
title = {Two-way deterministic finite automata are exponentially
more succinct than sweeping automata},
journal = ipl,
volume = {12},
year = {1981},
pages = {103--105}
}
@article{Mic91,
author = {P. Michel},
title = {An {$\NP$}-complete language accepted in linear time by
a one-tape {Turing} machine},
journal = tcs,
volume = {85},
year = {1991},
pages = {205--212}
}
@article{MNSW88,
author = {D. Mikl{\'o}s and M. Newman and A. Seress and D. West},
title = {The addition game: An abstraction of a communication problem},
journal = {Discrete Mathematics},
volume = {68},
year = {1988},
pages = {265--272}
}
@inproceedings{MiRe85,
author = {G. Miller and J. Reif},
title = {Parallel tree contraction and its applications},
booktitle = proc26 # focs,
year = {1985},
pages = {478--489}
}
@incollection{MiRe89,
author = {G. Miller and J. Reif},
title = {Parallel tree contraction, {Part 1: Fundamentals}},
booktitle = {Advances in Computing Research},
publisher = {JAI Press, Inc.},
volume = {5},
year = {1989},
pages = {47--72}
}
@article{MPRS93,
author = {R. Miller and V. P{rasanna-Kumar} and D. Reisis and
Q. Stout},
title = {Parallel computations on reconfigurable meshes},
journal = ieeetc,
volume = {42},
year = {1993},
pages = {678--692}
}
@INPROCEEDINGS{Mil91,
AUTHOR = {P. Miltersen},
TITLE = {The complexity of malign ensembles},
BOOKTITLE = proc6 # structures,
YEAR = {1991},
PAGES = {164--171}
}
@article{Mil93,
AUTHOR = {P. Miltersen},
TITLE = {The complexity of malign measures},
journal = sicomp,
volume = {22},
year = {1993},
pages = {147--156}
}
@inproceedings{Mil93b,
author = {P. Miltersen},
title = {The bit probe complexity measure revisited},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {662--671}
}
@book{MP68,
author = {M. Minsky and S. Papert},
title = {Perceptrons},
publisher = {MIT Press},
year = {1968},
note = {Revised and expanded in 1988}
}
@article{Mol90,
author = {B. Molzan},
title = {Expressibility and nonuniform complexity classes},
journal = sicomp,
volume = {19},
year = {1990},
pages = {411--423}
}
@article{Mon76,
author = {B. Monien},
title = {Transformational methods and their applications to
complexity problems},
journal = {Acta Informatica},
volume = {6},
year = {1976},
pages = {95--108}
}
@article{MoLe93,
author = {L. Morales and J. Lew},
title = {An enlarged family of packing polynomials on
multidimensional lattices},
journal = mathsys,
year = {1993},
volume = {nn},
note = {To appear}
}
@ARTICLE{MuPr75,
AUTHOR = {D. Muller and F. Preparata},
TITLE = {Bounds to complexities of networks for sorting and switching},
JOURNAL = jacm,
VOLUME = {22},
YEAR = {1975},
PAGES = {195--201}
}
@article{MuPr92,
author = {D. Muller and F. Preparata},
title = {Parallel restructuring and evaluation of expressions},
journal = jcss,
volume = {44},
year = {1992},
pages = {43--62}
}
@article{MVV87,
author = {K. Mulmuley and U. Vazirani and V. Vazirani},
title = {Matching is as easy as matrix inversion},
journal = {Combinatorica},
volume = {7},
year = {1987},
pages = {105--113}
}
@inproceedings{Mul93,
author = {K. Mulmuley},
title = {A lower bound for solvability of polynomial equations},
booktitle = proc13 # fsttcs,
series = lncs,
volume = {761},
publisher = springer,
year = {1993},
pages = {268--283}
}
@inproceedings{Mul94,
author = {K. Mulmuley},
title = {Lower bounds for parallel linear programming and other
problems},
booktitle = proc26 # stoc,
year = {1994},
pages = {608--618}
}
@techreport{Mur90,
author = {C. Murthy},
title = {Extracting Constructive Content from Classical Proofs},
institution = {Department of Computer Science, Cornell University},
year = {1990}
}
@inproceedings{Mye83,
author = {D. Myers},
title = {The random-access hierarchy (preliminary report)},
booktitle = proc15 # stoc,
year = {1983},
pages = {355--364}
}
@inproceedings{NOS93,
author = {A. Naik and M. Ogiwara and A. Selman},
title = {{P}-selective sets, and reducing search to decision
vs.\ self-reducibility},
booktitle = proc8 # structures,
year = {1993},
pages = {52--64}
}
@inproceedings{NaikOgiwaraSelman93,
author = {A. Naik and M. Ogiwara and A. Selman},
title = {{P}-selective sets, and reducing search to decision
vs.\ self-reducibility},
booktitle = proc8 # structures,
year = {1993},
pages = {52--64}
}
@inproceedings{NRS93,
author = {A. Naik and K. Regan and D. Sivakumar},
title = {Quasilinear time complexity theory},
booktitle = proc11 # stacs,
volume = {778},
series = lncs,
publisher = springer,
year = {1994},
pages = {97--108}
}
@techreport{NRS94,
author = {A. Naik and K. Regan and D. Sivakumar},
title = {Quasilinear time complexity theory},
institution = {Department of Computer Science, University at Buffalo},
number = {UB-CS TR 94-21},
year = {1994},
note = {An earlier version appeared in the proceedings of STACS'94,
LNCS 778, pp~97--108}
}
@article{NRS95,
author = {A. Naik and K. Regan and D. Sivakumar},
title = {On quasilinear time complexity theory},
journal = tcs,
volume = {148},
year = {1995},
pages = {325--349}
}
@inproceedings{NaNa90,
author = {J. Naor and M. Naor},
title = {Small-bias probability spaces: efficient constructions
and applications},
booktitle = proc22 # stoc,
year = {1990},
pages = {213--223}
}
@article{NaNa93,
author = {J. Naor and M. Naor},
title = {Small-bias probability spaces: efficient constructions
and applications},
journal = sicomp,
volume = {22},
year = {1993},
pages = {838--856}
}
@Article{NOS93b,
author = {M. Naor and A. Orlitsky and P. Shor},
title = {Three results on interactive communication},
journal = itit,
volume = {39},
year = {1993},
pages = {1608--1615}
}
@article{NaSa81,
author = {D. Nassimi and S. Sahni},
title = {Data broadcasting in {SIMD} computers},
journal = {IEEE Transactions on Computers},
volume = {C-30},
month = {February},
year = {1981},
pages = {101--106}
}
@article{NaSa81,
author = {D. Nassimi and S. Sahni},
title = {Parallel permutation and sorting algorithms and a new
generalized connection network},
journal = jacm,
volume = {29},
year = {1982},
pages = {642--667}
}
@inproceedings{Ner89,
author = {A. Nerode},
title = {Polynomial-graded logic},
booktitle = proc3 # lics,
year = {1989},
pages = {nnn--nnn}
}
@article{NePo85,
author = {J. Nesetril and S. Poljak},
title = {On the complexity of the subgraph problem},
journal = {Commen. Math. Univ. Carol.},
volume = {26},
year = {1985},
pages = {415--419}
}
@article{New64,
author = {D. Newman},
title = {Rational approximation to {\mbox{$|x|$}}},
journal = {Michigan Math.\ Journal},
volume = {11},
year = {1964},
pages = {11--14}
}
@inproceedings{NiRo93,
author = {R. Niedermeyer and P. Rossmanith},
title = {Extended locally definable acceptance types},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {473--483}
}
@INPROCEEDINGS{NiWi88,
AUTHOR = {N. Nisan and A. Wigderson},
TITLE = {Hardness vs. randomness},
BOOKTITLE = proc29 # focs,
YEAR = {1988},
PAGES = {2--11}
}
@inproceedings{Nis90,
author = {N. Nisan},
title = {Pseudorandom generators for space-bounded computation},
booktitle = proc22 # stoc,
year = {1990},
pages = {204--212}
}
@article{Nis91,
author = {N. Nisan},
title = {{CREW} {PRAMs} and decision trees},
journal = sicomp,
volume = {20},
year = {1991},
pages = {999--1007}
}
@article{Nis91b,
author = {N. Nisan},
title = {Pseudorandom bits for constant-depth circuits},
journal = {Combinatorica},
volume = {11},
year = {1991},
pages = {63--70}
}
@inproceedings{Nis91c,
author = {N. Nisan},
title = {Lower bounds for non-commutative computation: extended
abstract},
booktitle = proc23 # stoc,
year = {1991},
pages = {410--418}
}
@inproceedings{Nis92,
author = {N. Nisan},
title = {{RL} {$\subseteq$} {SC}},
booktitle = proc24 # stoc,
year = {1992},
pages = {619--623}
}
@article{Nis92p,
author = {N. Nisan},
title = {Pseudorandom generators for space-bounded computation},
journal = {Combinatorica},
volume = {12},
year = {1992},
pages = {449--461}
}
@book{Nis92t,
author = {N. Nisan},
title = {Using hard problems to create pseudorandom generators},
publisher = {MIT Press},
year = {1992},
note = {Revision of author's 1988 U.C. Berkeley thesis for the
ACM Distinguished Dissertation series}
}
@inproceedings{NiSz92,
author = {N. Nisan and M. Szegedy},
title = {On the degree of {B}oolean functions as real polynomials},
booktitle = proc24 # stoc,
year = {1992},
pages = {462--467}
}
@inproceedings{NSW92,
author = {N. Nisan and E. Szemer{\'e}di and A. Wigderson},
title = {Undirected connectivity in {$O(\log^{1.5}n)$} space},
booktitle = proc33 # focs,
year = {1992},
pages = {24--29}
}
@article{Nis93,
author = {N. Nisan},
title = {On read-once vs. multiple access to randomness
in logspace},
journal = tcs,
volume = {107},
year = {1993},
pages = {135--144}
}
@incollection{Nis93b,
author = {N. Nisan},
title = {The communication complexity of threshold gates},
booktitle = {Combinatorics, Paul Erd{\H{o}}s is Eighty},
series = {Bolyai Society Mathematical Studies},
publisher = {North-Holland},
address = {Amsterdam},
year = {1993},
pages = {301--315}
}
@article{NiWi93,
author = {N. Nisan and A. Wigderson},
title = {Rounds in communication complexity revisited},
journal = sicomp,
volume = {22},
year = {1993},
pages = {211--219}
}
@inproceedings{NiZu93,
author = {N. Nisan and D. Zuckerman},
title = {More deterministic simulation in {Logspace}},
booktitle = proc25 # stoc,
year = {1993},
pages = {235--244}
}
@article{NiSz94,
author = {N. Nisan and M. Szegedy},
title = {On the degree of {B}oolean functions as real polynomials},
journal = compcomp,
volume = {4},
year = {1994},
pages = {301--313}
}
@article{NiWi94,
author = {N. Nisan and A. Wigderson},
title = {Hardness versus randomness},
journal = jcss,
volume = {49},
year = {1994},
pages = {149--167}
}
@inproceedings{NiTaS95,
author = {N. Nisan and A. {Ta-Shma}},
title = {Symmetric logspace is closed under complement},
booktitle = proc27 # stoc,
year = {1995},
pages = {140--146}
}
@inproceedings{OD79,
author = {M. O'Donnell},
title = {A programming language theorem which is independent
of {P}eano arithmetic},
booktitle = proc11 # stoc,
year = {1979},
pages = {176--188}
}
@article{Ofm63,
author = {Y. Ofman},
title = {On the algorithmic complexity of discrete functions},
journal = {Soviet Physics---Doklady},
volume = {7},
number = {7},
year = {1963},
pages = {589--591},
note = {English translation}
}
@inproceedings{OgHe91,
author = {M. Ogiwara and L. Hemachandra},
title = {A complexity theory for feasible closure properties},
booktitle = proc6 # structures,
year = {1991},
pages = {16--29}
}
@techreport{Ogi93,
author = {M. Ogiwara},
title = {{NC$^k$(NP) = AC$^{k-1}$(NP)}},
number = {CSIM 93-06},
institution = {Dept. of Comp. Sci. and Information Maths.,
University of Electrocommunications},
address = {Chofu, Tokyo 182, Japan},
year = {1993},
note = {To appear in the proceedings of STACS'94}
}
@inproceedings{Ogi94,
author = {M. Ogihara},
title = {{NC$^k$(NP) = AC$^{k-1}$(NP)}},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {313--324}
}
@techreport{Ogi95,
author = {M. Ogihara},
title = {The {PL} hierarchy collapses},
institution = {Department of Computer Science, University of
Rochester},
number = {UR CS TR 587},
month = {June},
year = {1995}
}
@inproceedings{Oka93,
author = {T. Okamoto},
title = {On the relationship among cryptographic physical assumptions},
booktitle = proc4 # isaac,
publisher = springer,
series = lncs,
volume = {762},
year = {1993},
pages = {369--378}
}
@inproceedings{OrGa84,
author = {A. Orlitsky and A. El Gamal},
title = {Communication with secrecy constraints},
booktitle = proc16 # stoc,
year = {1984},
pages = {217--224}
}
@incollection{OrGa88,
author = {A. Orlitsky and A. El Gamal},
title = {Communication complexity},
booktitle = {Complexity in Information Theory},
editor = {Y. Abu-Mostafa},
publisher = springer,
year = {1988}
}
@article{OrGa90,
author = {A. Orlitsky and A. El Gamal},
title = {Average and randomized communication complexity},
journal = itit,
year = {1990},
volume = {36},
pages = {3--16}
}
@article{Orl90,
author = {A. Orlitsky},
title = {Worst-case interactive communication {I}: Two messages
are almost optimal},
journal = itit,
volume = {36},
year = {1990},
pages = {1111--1126}
}
@article{Orl91,
author = {A. Orlitsky},
title = {Worst-case interactive communication {II}: Two messages
are not optimal},
journal = itit,
volume = {37},
year = {1991},
pages = {995--1005}
}
@inproceedings{Orl91b,
author = {A. Orlitsky},
title = {Interactive communication: balanced distributions,
correlated files, and average-case complexity},
booktitle = proc32 # focs,
year = {1991},
pages = {228--238}
}
@article{Orl92,
author = {A. Orlitsky},
title = {Average-case interactive communication},
journal = itit,
volume = {38},
year = {1992},
pages = {1534--1547}
}
@article{Orl93,
author = {A. Orlitsky},
title = {Interactive communication of balanced distributions
and of correlated files},
journal = sjdm,
volume = {6},
year = {1993},
pages = {548--564}
}
@article{Orp86,
author = {P. Orponen},
title = {A classification of complexity core lattices},
journal = tcs,
volume = {47},
year = {1986},
pages = {121--130}
}
@article{ORS86,
author = {P. Orponen and D. Russo and U. Sch{\"o}ning},
title = {Optimal approximations and polynomially levelable sets},
journal = sicomp,
volume = {15},
year = {1986},
pages = {399--408}
}
@article{OrSc86,
author = {P. Orponen and U. Sch{\"o}ning},
title = {On the density and complexity of polynomial cores for
intractable sets},
journal = infcon,
volume = {70},
year = {1986},
pages = {54--68}
}
@inproceedings{Orp93,
author = {P. Orponen},
title = {On the computational power of discrete {H}opfield nets},
booktitle = proc20 # icalp,
series = lncs,
volume = {700},
publisher = springer,
year = {1993},
pages = {215--225}
}
@article{OKSW94,
author = {P. Orponen and K. Ko and U. Sch{\"o}ning and O. Watanabe},
title = {Instance complexity},
journal = jacm,
year = {1994},
volume = {41},
pages = {96--121}
}
@misc{OsElA94,
author = {M. Osman and A. El-Amawy},
title = {A distributed fault-tolerant routing algorithm for
generalized de {B}ruijn networks},
year = {1994},
note = {Dept. of Electrical and Computer Engineering,
Louisiana State University}
}
@inproceedings{Ost90,
author = {R. Ostrovsky},
title = {Efficient computation on oblivious {RAMs}},
booktitle = proc22 # stoc,
year = {1990},
pages = {514--523}
}
@inproceedings{Ost91,
author = {R. Ostrovsky},
title = {One-way functions, hard on average problems, and statistical
zero-knowledge proofs},
booktitle = proc6 # structures,
year = {1991},
pages = {133--138}
}
@article{Owi86,
author = {J. Owings},
title = {Effective choice functions and index sets},
journal = jcss,
volume = {32},
year = {1986},
pages = {370--373}
}
@book{Oxt80,
author = {J. Oxtoby},
title = {Measure and Category},
publisher = springer,
edition = {2nd},
address = {New York},
year = {1980}
}
@book{Oxtoby,
author = {J. Oxtoby},
title = {Measure and Category},
publisher = springer,
edition = {2nd},
address = {New York},
year = {1980}
}
@article{OzGo92,
author = {H. Ozaktas and J. Goodman},
title = {Implications of interconnection theory for optical
digital computing},
journal = {Applied Optics},
volume = {31},
number = {26},
year = {1992},
pages = {5559--5567}
}
@book{Pal85,
author = {E. Palmer},
title = {Graphical Evolution},
publisher = {Wiley},
address = {New York},
year = {1985}
}
@article{Pal77,
author = {E. Palmer},
title = {Unsolved problems in the theory of random graphs},
journal = {Ann. Disc. Math.},
volume = {33},
year = {1987},
pages = {227--239}
}
@INCOLLECTION{PaZa83,
AUTHOR = {C. H. Papadimitriou and S. Zachos},
TITLE = {Two remarks on the power of counting},
BOOKTITLE = {The 6th GI Conference on Theoretical Computer Science},
YEAR = {1983},
PAGES = {269--276},
PUBLISHER = springer,
SERIES = {Lecture Notes in Computer Science No.~145}
}
@INCOLLECTION{PZ83,
AUTHOR = {C. H. Papadimitriou and S. Zachos},
TITLE = {Two remarks on the power of counting},
BOOKTITLE = {The 6th GI Conference on Theoretical Computer Science},
YEAR = {1983},
PAGES = {269--276},
PUBLISHER = springer,
SERIES = {Lecture Notes in Computer Science No.~145}
}
@article{PaSi84,
author = {C. Papadimitriou and M. Sipser},
title = {Communication complexity},
journal = jcss,
volume = {28},
year = {1984},
pages = {260--269}
}
@article{PaUl87,
author = {C. Papadimitriou and J. Ullman},
title = {A communication-time tradeoff},
journal = sicomp,
volume = {16},
year = {1987},
pages = {639--646}
}
@article{PaYa90,
author = {C. Papadimitriou and M. Yannakakis},
title = {Towards an architecture-independent analysis of
parallel algorithms},
journal = sicomp,
volume = {19},
year = {1990},
pages = {322--328}
}
@book{Pap94,
author = {C. Papadimitriou},
title = {Computational Complexity},
publisher = {Addison-Wesley},
address = {Reading, Mass.},
year = {1994}
}
@inproceedings{Pap94a,
author = {C. Papadimitriou},
title = {On complexity as bounded rationality},
booktitle = proc26 # stoc,
year = {1994},
pages = {726--733}
}
@article{Pap94b,
author = {C. Papadimitriou},
title = {On the complexity of the parity argument, and other
inefficient proofs of existence},
journal = jcss,
volume = {48},
year = {1994},
pages = {498--532}
}
@article{Par87a,
author = {I. Parberry},
title = {An improved simulation of space and reversal bounded
deterministic {Turing} machines by width and depth bounded uniform circuits},
journal = ipl,
volume = {24},
year = {1987},
pages = {363--367}
}
@article{Par87b,
author = {I. Parberry},
title = {Some practical simulations of impractical parallel
computers},
journal = {Parallel Computing},
volume = {4},
year = {1987},
pages = {93--101}
}
@incollection{PaHa77,
author = {J. Paris and L. Harrington},
title = {A mathematical incompleteness in {P}eano {A}rithmetic},
booktitle = {Handbook of Mathematical Logic},
editor = {K.J. Barwise},
publisher = {North-Holland},
address = {Amsterdam},
year = {1977},
pages = {1133--1142}
}
@incollection{PHW85,
author = {J. Paris and M. Handley and A. Wilkie},
title = {Characterizing some low arithmetic classes},
booktitle = {Colloquium on the Theory of Algorithms},
editor = {L. Lovasz and E. Szemeredi},
publisher = {North-Holland},
year = {1985}
}
@incollection{PaWi85,
author = {J. Paris and A. Wilkie},
title = {Counting problems in bounded arithmetic},
booktitle = {Methods in Mathematical Logic},
editor = {A. Dold and B. Eckman},
series = lnm,
volume = {1130},
publisher = springer,
year = {1985},
pages = {317--340}
}
@article{PaWi86,
author = {J. Paris and A. Wilkie},
title = {Counting {$\Delta_0$} sets},
journal = {Fundamenta Mathematicae},
volume = {127},
year = {1986},
pages = {67--76}
}
@article{PWW88,
author = {J. Paris and A. Wilkie and A. Woods},
title = {Provability of the pigeonhole principle and the
existence of infinitely many primes},
journal = jsl,
volume = {53},
year = {1988},
pages = {1235--1244}
}
@article{Par90,
author = {T. Parish},
title = {Crystal clear storage},
journal = {Byte},
volume = {15},
year = {1990},
month = {November},
pages = {283--288}
}
@book{Par77,
author = {K.R. Parthasarathy},
title = {Introduction to Probability and Measure},
publisher = {The Macmillan Company of India, Ltd.},
address = {Madras},
year = {1977}
}
@book{Parthasarathy,
author = {K.R. Parthasarathy},
title = {Introduction to Probability and Measure},
publisher = {The Macmillan Company of India, Ltd.},
address = {Madras},
year = {1977}
}
@article{Pat90,
author = {M. Paterson},
title = {Improved sorting networks with {$O(\log n)$} depth},
journal = {Algorithmica},
volume = {5},
year = {1990},
pages = {75--92}
}
@inproceedings{PaSa90,
author = {R. Paturi and M. Saks},
title = {On threshold circuits for parity},
booktitle = proc31 # focs,
year = {1990},
pages = {397--404}
}
@article{PSSN90,
author = {R. Paturi and J. Seiferas and J. Simon and R. Newman-Wolfe},
title = {Milking the {Anderaa} argument},
journal = infcomp,
volume = {88},
year = {1990},
pages = {88--104}
}
@inproceedings{Pat92,
author = {R. Paturi},
title = {On the degree of polynomials that approximate symmetric
{B}oolean functions},
booktitle = proc24 # stoc,
year = {1992},
pages = {468--474}
}
@article{PaTa78,
author = {W. Paul and R. Tarjan},
title = {Time-space trade-offs in a pebble game},
journal = {Acta Informatica},
volume = {10},
year = {1978},
pages = {111--115}
}
@ARTICLE{Paul79,
AUTHOR = {W. Paul},
TITLE = {On time hierarchies},
JOURNAL = jcss,
VOLUME = {19},
YEAR = {1979},
PAGES = {197--202}
}
@article{PPR80,
author = {W. Paul and E. Prauss and R. Reischuk},
title = {On alternation},
journal = {Acta Informatica},
volume = {14},
year = {1980},
pages = {243--255}
}
@article{PaRe80b,
author = {W. Paul and R. Reischuk},
title = {On alternation},
journal = {Acta Informatica},
volume = {14},
year = {1980},
pages = {nnn--nnn}
}
@ARTICLE{PaRe81,
AUTHOR = {W. Paul and R. Reischuk},
TITLE = {On time versus space {II}},
JOURNAL = jcss,
VOLUME = {22},
YEAR = {1981},
PAGES = {312--327}
}
@article{PSS81,
author = {W. Paul and J. Seiferas and J. Simon},
title = {An information-theoretic approach to time bounds
for on-line computation},
journal = jcss,
volume = {23},
year = {1981},
pages = {108--126}
}
@INPROCEEDINGS{PPST83,
AUTHOR = {W. Paul and N. Pippenger and E. Szemer{\'e}di and W. Trotter},
TITLE = {On determinism versus nondeterminism and related problems},
BOOKTITLE = proc24 # focs,
YEAR = {1983},
PAGES = {429--438}
}
@incollection{PaSiM84,
author = {W. Paul and J. Simon},
title = {Decision trees and random-access machines},
booktitle = {Sorting and Searching},
editor = {K.~Mehlhorn},
publisher = springer,
year = {1984},
pages = {85--97}
}
@misc{Pei94,
author = {M. Peinado},
title = {Hard graphs for randomized subgraph exclusion problems},
year = {1994},
note = {To appear in the proceedings of ???}
}
@inproceedings{Pel91,
author = {R. Pelikaan},
title = {On the gonality of curves, abundant codes and decoding},
booktitle = {nnn},
series = lnm,
volume = {1518},
publisher = springer,
year = {1991}}
}
@article{PSW91,
author = {R. Pellikaan and B.-Z. Shen and {G. van} Wee},
title = {Which linear codes are algebraic-geometric?},
journal = itit,
volume = {37},
year = {1991},
pages = {583--602}
}
@article{PePi86,
author = {D. Perrin and J. Pin},
title = {First-order logic and star-free sets},
journal = jcss,
volume = {32},
year = {1986},
pages = {393--406}
}
@article{PeWe89,
author = {D.~Petford and D.J.A. Welsh},
title = {A randomised 3-colouring algorithm},
journal = {Discrete Mathematics},
volume = {74},
year = {1989},
pages = {253--261}
}
@article{Phi79,
author = {N. Phillips},
title = {The {P = NP} question and recent independence results},
journal = {Quaestiones Informaticae},
volume = {1},
year = {1979},
pages = {26--29}
}
@inproceedings{Pin87,
author = {J.E. Pin},
title = {On the languages acceptable by finite reversible automata},
booktitle = proc14 # icalp,
series = lncs,
volume = {nnn},
publisher = springer,
year = {1987},
pages = {237--249}
}
@article{PST92,
author = {J. Pin and H. Straubing and D. Th{\'e}rien},
title = {Some results on the generalized star-height problem},
journal = infcon,
volume = {101},
year = {1992},
pages = {219--250}
}
@inproceedings{Pip77,
author = {N. Pippenger},
title = {Fast simulation of combinatorial logic networks by machines
without random-access storage},
booktitle = proc15 # "Allerton Conf. on Comm., Contr., and Comp.",
year = {1977},
pages = {25--33}
}
@article{PiFi79,
author = {N. Pippenger and M. Fischer},
title = {Relations among complexity measures},
journal = jacm,
volume = {26},
year = {1979},
pages = {361--381}
}
@INPROCEEDINGS{Pip79,
AUTHOR = {N. Pippenger},
TITLE = {On simultaneous resource bounds},
BOOKTITLE = proc20 # focs,
YEAR = {1979},
PAGES = {307--311}
}
@inproceedings{Pip85,
author = {N. Pippenger},
title = {On networks of noisy gates},
booktitle = proc26 # focs,
year = {1985},
pages = {30--38}
}
@article{Pip88,
author = {N. Pippenger},
title = {Reliable computation by formulas in the presence of noise},
journal = itit,
volume = {34},
year = {1988},
pages = {194--197}
}
@article{Pip89},
author = {N. Pippenger},
title = {Invariance of complexity measures for networks with
unreliable gates},
journal = jacm,
volume = {36},
year = {1989},
pages = {531--539}
}
@article{PST91,
author = {N. Pippenger and G. Stamoulis and J. Tsitsiklis},
title = {On a lower bound for the redundancy of reliable
networks with noisy gates},
journal = itit,
volume = {37},
year = {1991},
pages = {639--643}
}
@phdthesis{Pit92,
author = {T. Pitassi},
title = {The Power of Weak Formal Systems},
school = {University of Toronto},
year = {1992}
}
@article{PBI93,
author = {T. Pitassi and P. Beame and R. Impagliazzo},
title = {Exponential lower bounds for the pigeonhole principle},
journal = {Computational Complexity},
volume = {3},
year = {1993},
pages = {97--140}
}
@inproceedings{PoSa94,
author = {D. Polemi and T. Sakkalis},
title = {Singular algebraic curves over finite fields},
booktitle = {Information Theory and Applications---Proceedings,
Third Canadian Workshop, May/June 1993},
series = lncs,
volume = {793},
year = {1994},
pages = {24--37}
}
@inproceedings{PoSp94,
author = {A. Polischuk and D. Spielman},
title = {Nearly-linear size holographic proofs},
booktitle = proc26 # stoc,
year = {1994},
pages = {194--203}
}
@article{PrSt76,
author = {V. Pratt and L. Stockmeyer},
title = {A characterization of the power of vector machines},
journal = jcss,
volume = {12},
year = {1976},
pages = {198--221}
}
@article{PrSa77,
author = {F. Preparata and D. Sarwate},
title = {Computational complexity of {F}ourier transforms over
finite fields},
journal = {Mathematics of Computation},
volume = {31},
number = {139},
year = {1977},
pages = {740--751}
}
@article{PrVu81,
author = {F. Preparata and J. Vuillemin},
title = {The cube-connected cycles: A versatile network for
parallel computation},
journal = cacm,
volume = {24},
number = {5},
year = {1981},
pages = {300--309}
}
@article{PuRo92,
author = {P. Pudl{\'a}k and V. R{\"o}dl},
title = {A combinatorial approach to complexity},
journal = {Combinatorica},
volume = {12},
year = {1992},
pages = {221--226}
}
@inproceedings{Pud93,
author = {P. Pudl{\'a}k},
title = {{AC$^0$} circuit complexity},
booktitle = proc9 # fct,
series = lncs,
volume = {710},
publisher = springer,
year = {1993},
pages = {106--120}
}
@article{QuRi89,
author = {J. Ross Quinlan and R. Rivest},
title = {Inferring decision trees using the minimum description
length principle},
journal = infcomp,
volume = {80},
year = {1989},
pages = {277--248}
}
@article{Rab63,
author = {M. Rabin},
title = {Real-time computation},
journal = {Israeli Journal of Mathematics},
volume = {1},
year = {1963},
pages = {203--211}
}
@article{Rab80,
author = {M. Rabin},
title = {Probabilistic algorithms in finite fields},
journal = sicomp,
volume = {9},
year = {1980},
pages = {273--280}
}
@article{RaSe81,
author = {C. Rackoff and J. Seiferas},
title = {Limitations on seperating nondeterministic
complexity classes},
journal = sicomp,
volume = {10},
year = {1981},
pages = {742--745}
}
@article{RaSu94,
author = {J. Radhakrishnan and K. Subrahmanyam},
title = {Directed monotone contact networks for threshold
functions},
journal = ipl,
volume = {50},
year = {1994},
pages = {199--203}
}
@techreport{Rad93,
author = {S. Radziszowski},
title = {Small {R}amsey numbers},
number = {RIT-TR-93-009},
institution = {Dept.\ of Comp.\ Sci.\, Rochester Inst.\ of
Technology},
month = {February},
year = {1993}
}
@article{RSSW88,
author = {P. Ragde and W. Steiger and E. Szemer{\'e}di
and A. Wigderson},
title = {The parallel complexity of element distinctness is
{$\Omega(\sqrt{{\log n}}) $}},
journal = {SIAM Journal on Discrete Mathematics},
volume = {1},
year = {1988},
pages = {399--410}
}
@inproceedings{Ram92,
author = {J. Ramachandran},
title = {Set-bit enumeration is hard},
booktitle = proc7 # structures,
year = {1992},
pages = {58--70}
}
@misc{RaSc93,
author = {J. Ramachandran and T. Schwentick},
title = {A note on set-bit enumeration},
note = {Technical Report, University of Mainz, 11/26/93},
year = {1993}
}
@inproceedings{RaRo92,
author = {D. Ranjan and P. Rohatgi},
title = {On randomized reductions to sparse sets},
booktitle = proc7 # structures,
year = {1992},
pages = {239--242}
}
@techreport{RRW94,
author = {R. Rao and J. Rothe and O. Watanabe},
title = {Upward separation for {FewP} and related classes},
institution = {Computer Science, University of Rochester},
number = {488},
month = {February},
year = {1994}
}
@article{Raz87,
author = {A. Razborov},
title = {Lower bounds for the size of circuits of bounded depth
with basis {$\{\wedge,\oplus\}$}},
journal = {Math. Notes Acad. Sci. USSR},
volume = {41},
year = {1987},
pages = {333--338}
}
@inproceedings{Raznn,
author = {A. Razborov},
title = {Lower bounds for deterministic and nondeterministic
branching programs},
booktitle = {nnn},
year = {nnn},
pages = {47--60}
}
@article{Raz92,
author = {A. Razborov},
title = {On the distributional complexity of disjointness},
journal = tcs,
volume = {106},
year = {1992},
pages = {385--390}
}
@techreport{Raz93,
author = {A. Razborov},
title = {Bounded arithmetic and lower bounds in {B}oolean
complexity},
institution = {Stekhlov Mathematical Institute},
address = {Vavilova-42, 117966, GSP-1, Moscow},
year = {1993}
}
@article{RaWi93,
author = {A. Razborov and A. Wigderson},
title = {{$n^{\Omega(\log n)}$} lower bounds on the size of depth-3
threshold circuits with {AND} gates at the bottom},
journal = ipl,
volume = {45},
year = {1993},
pages = {303--307}
}
@inproceedings{RaRu94,
author = {A. Razborov and S. Rudich},
title = {Natural proofs},
booktitle = proc26 # stoc,
year = {1994},
pages = {204--213}
}
@misc{RaRu94j,
author = {A. Razborov and S. Rudich},
title = {Natural proofs},
year = {1994},
note = {Update of STOC paper, November 1994}
}
@article{Raz94,
author = {A. Razborov},
title = {Unprovability of lower bounds on circuit size in
certain fragments of bounded arithmetic},
journal = {Izvestiya of the RAN},
year = {1994},
note = {To appear}
}
@phdthesis{Rec76,
author = {R. Reckhow},
title = {On the lengths of proofs in the propositional calculus},
school = {University of Toronto},
year = {1976},
note = {Computer Science TR \#87}
}
@inproceedings{Reg83a,
author = {K. Regan},
title = {On diagonalization methods and the structure of
language classes},
booktitle = {Proceedings, International Conference
on Foundations of Computation Theory (FCT'83), Borgholm, Sweden,
August 1983},
series = lncs,
volume = {158},
publisher = springer,
year = {1983},
pages = {368--380}
}
@inproceedings{Reg83b,
author = {K. Regan},
title = {Arithmetical degrees of index sets for
complexity classes},
booktitle = {Proceedings, Logic and Machines, M{\"u}nster,
Germany, May 1983},
series = lncs,
volume = {171},
publisher = springer,
year = {1984},
pages = {118--130}
}
@inproceedings{Reg86a,
author = {K. Regan},
title = {A topology of provability in complexity theory},
booktitle = proc1 # structures,
series = lncs,
volume = {223},
publisher = springer,
year = {1986},
pages = {291--310}
}
@inproceedings{Reg86b,
author = {K. Regan},
title = {A uniform reduction theorem, extending a result of
{J. Grollmann} and {A. Selman}},
booktitle = proc13 # icalp,
series = lncs,
volume = {226},
publisher = springer,
year = {1986},
pages = {324--333}
}
@misc{Reg86t,
author = {K. Regan},
title = {On the {S}eparation of {C}omplexity {C}lasses},
note = {Dissertation, Oxford University},
year = {1986}
}
@inproceedings{Reg87,
author = {K. Regan},
title = {Unprovably intractable languages},
booktitle = proc2 # structures,
year = {1987},
pages = {69--80}
}
@article{Reg88,
author = {K. Regan},
title = {The topology of provability in complexity theory},
journal = jcss,
volume = {3},
year = {1988},
pages = {384--432}
}
@inproceedings{Reg89,
author = {K. Regan},
title = {Finitary substructure languages},
booktitle = proc4 # structures,
year = {1989},
pages = {87--96}
}
@misc{Reg89p,
author = {K. Regan},
title = {Provable complexity properties and constructive reasoning},
year = {1989},
note = {Draft, in revision}
}
@article{Reg92d,
author = {K. Regan},
title = {Diagonalization, uniformity, and fixed-point theorems},
journal = infcomp,
volume = {98},
year = {1992},
pages = {1--40}
}
@article{Reg92m,
author = {K. Regan},
title = {Minimum-complexity pairing functions},
journal = jcss,
volume = {45},
year = {1992},
pages = {285--295}
}
@techreport{Reg92l,
author = {K. Regan},
title = {Linear time and memory efficient computation},
institution = {Computer Science Department, State University of
NY at Buffalo, TR 92-28},
year = {1992},
}
@misc{Reg92i,
author = {K. Regan},
title = {The complexity of instance contraction},
month = {November},
year = {1992}
}
@misc{ReRo92,
author = {K. Regan and J. Royer},
title = {On closure properties of bounded {2-sided} error
complexity classes},
institution = {Dept. of Computer Science, University at Buffalo},
year = {1992},
note = mst # ", to appear"
}
@techreport{GKRST92,
author = {F. Green and J. K{\"o}bler and K. Regan and
T. Schwentick and J. Tor{\'a}n},
title = {The power of the middle bit of a {\#}{P} function},
institution = {Computer Science Dept., University at Buffalo},
number = {UBCS--TR 92--27},
year = {1992}
}
@techreport{JaRe92,
author = {A. Jagota and K. Regan},
title = {Performance of {MAX-CLIQUE} approximation heuristics under
description-length weighted distributions},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 92--24},
year = {1992}
}
@inproceedings{ReSc92,
author = {K. Regan and T. Schwentick},
title = {On the power of one bit of a {\#P} function},
booktitle = proc4 # "Annual Italian Conference on Theoretical Computer Science",
publisher = {World Scientific, Singapore},
year = {1992},
pages = {317--329}
}
@misc{Reg93r,
author = {K. Regan},
title = {Linear time and memory efficient computation},
note = {Revision of UB CS TR 92--28, submitted to
{\em SIAM J. Comput\/}},
year = {1993},
}
@article{Reg93s,
author = {K. Regan},
title = {Machine Models and Linear Time Complexity},
journal = sigact,
volume = {24},
month = {October},
year = {1993},
note = {Guest column, L. Hemachandra ed., ``Compelxity Theory Column''},
pages = {5--15}
}
@inproceedings{Reg93i,
author = {K. Regan},
title = {On the difference between {Turing} machine time and
random-access machine time},
booktitle = proc5 # icci,
year = {1993},
pages = {36--40}
}
@inproceedings{Reg93p,
author = {K. Regan},
title = {A new parallel vector model, with exact characterizations
of {$\NC^k$}},
booktitle = proc11 # stacs,
volume = {778},
series = lncs,
publisher = springer,
year = {1994},
pages = {289--300}
}
@techreport{Reg93c,
author = {K. Regan},
title = {Constructive formal systems and complexity theory},
institution = {Computer Science Dept., University at Buffalo},
number = {UBCS--TR 93--nn!!},
year = {1993}
}
@inproceedings{Reg93t,
author = {K. Regan},
title = {On the difference between {Turing} machine time and
random-access machine time},
booktitle = proc5 # icci,
year = {1993},
pages = {36--40}
}
@techreport{Reg94,
author = {K. Regan},
title = {Linear time and memory efficient computation},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 94-18},
note = {Revision of UB-CS-TR 92-28, accepted to
{\it SIAM J.~Comput.}},
year = {1994}
}
@techreport{GKRST94,
author = {F. Green and J. K{\"o}bler and K. Regan and
T. Schwentick and J. Tor{\'a}n},
title = {The power of the middle bit of a {\#}{P} function},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 94-19},
month = {May},
year = {1994},
note = jcss # ", to appear"
}
@inproceedings{LOR94,
author = {L. Li and M. Ogihara and K. Regan},
title = {On information from {\#P} functions},
booktitle = proc6 # icci,
year = {1994},
pages = {280--295},
note = {The proceedings constitute the first issue of the
electronic journal, {\it Journal of Computing and Information\/}.
Also UB-CS-TR 94-20, May 1994}}
}
@techreport{CLLORS94,
author = {J.-Y. Cai and R. Lipton and L. Longpr{\'e} and
M. Ogihara and K. Regan and D. Sivakumar},
title = {Communication complexity of key agreement on limited ranges},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 94-22},
month = {May},
year = {1994}
}
@techreport{Reg94a,
author = {K. Regan},
title = {Linear time algorithms in memory hierarchies},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 94-23},
month = {May},
year = {1994},
note = {To appear in the proceedings of the IFIP World Computer
Congress, Hamburg, August 1994}
}
@techreport{Reg94b,
author = {K. Regan},
title = {Linear speed-up, information vicinity, and finite-state
machines},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 94-24},
month = {May},
year = {1994},
note = {To appear in the proceedings of the IFIP World Computer
Congress, Hamburg, August 1994}
}
@inproceedings{Reg94l,
author = {K. Regan},
title = {Linear time algorithms in memory hierarchies},
booktitle = {Proceedings, 13th IFIP World Computer Congress '94,
Volume~1: Technology and Foundations},
editor = {B. Pehrson and I. Simon},
series = {IFIP Transactions},
volume = {A-51},
publisher = {North-Holland},
year = {1994},
pages = {288--293}
}
@inproceedings{Reg94iv,
author = {K. Regan},
title = {Linear speed-up, information vicinity, and finite-state
machines},
booktitle = {Proceedings, 13th IFIP World Computer Congress '94,
Volume~1: Technology and Foundations},
editor = {B. Pehrson and I. Simon},
series = {IFIP Transactions},
volume = {A-51},
publisher = {North-Holland},
year = {1994},
pages = {609--614}
}
@misc{ReSi94,
author = {K. Regan and D. Sivakumar},
title = {On resource-bounded measure and pseudorandom generators
(preliminary version)},
year = {1994}
}
@misc{DFR94,
author = {R. Downey and M. Fellows and K. Regan},
title = {Parameterized circuit complexity and the {$W$} hierarchy},
year = {1994}
}
@misc{Reg94h,
author = {K. Regan},
title = {Linear-time algorithms in memory hierarchies},
year = {1994},
note = {This proceedings.}
}
@article{ReWa94,
author = {K. Regan and J. Wang},
title = {The quasilinear isomorphism challenge},
journal = {SIGACT News},
volume = {25},
year = {1994},
month = {September},
pages = {106--113}
}
@techreport{Reg94i,
author = {K. Regan},
title = {Index sets and presentations of compelxity classes
(revised version)},
institution = {Department of Computer Science, University at
Buffalo},
number = {UB-CS TR 94-29},
month = {July},
year = {1994}
}
@techreport{RSC95,
author = {K. Regan and D. Sivakumar and J.-Y. Cai},
title = {Pseudorandom generators, measure theory, and natural proofs},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 95-02},
month = {January},
year = {1995}
}
@inproceedings{RSC95,
author = {K. Regan and D. Sivakumar and J.-Y. Cai},
title = {Pseudorandom generators, measure theory, and natural proofs},
booktitle = proc36 # focs,
year = {1995},
pages = {26--35}
}
@techreport{JNR95,
author = {A. Jagota and G. Narasimhan and K. Regan},
title = {Information capacity of binary weights associative memories},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 95-03},
month = {January},
year = {1995}
}
@inproceedings{CLLORS95,
author = {J.-Y. Cai and R. Lipton and L. Longpr{\'e} and
M. Ogihara and K. Regan and D. Sivakumar},
title = {Communication complexity of key agreement on limited ranges},
booktitle = proc12 # stacs,
series = lncs,
volume = {900},
publisher = springer,
year = {1995},
pages = {38--49}
}
@article{ReRo95,
author = {K. Regan and J. Royer},
title = {On closure properties of bounded two-sided error
complexity classes},
journal = mathsys,
volume = {28},
year = {1995},
pages = {229--243}
}
@techreport{ReSi95,
author = {K. Regan and D. Sivakumar},
title = {Improved resource-bounded {B}orel-{C}antelli and
stochasticity theorems},
institution = {Computer Science Dept., University at Buffalo},
number = {UB-CS-TR 95-08},
month = {February},
year = {1995}
}
@article{GKRST95,
author = {F. Green and J. K{\"o}bler and K. Regan and
T. Schwentick and J. Tor{\'a}n},
title = {The power of the middle bit of a {\#}{P} function},
journal = jcss,
volume = {50},
year = {1995},
pages = {456--467}
}
@inproceedings{Reg95s,
author = {K. Regan},
title = {On superlinear lower bounds in complexity theory},
booktitle = proc10 # structures,
year = {1995},
pages = {50--64}
}
@ARTICLE{Rei82,
AUTHOR = {R. Reischuk},
TITLE = {A fast implementation of multidimensional storage into a tree
storage},
JOURNAL = tcs,
VOLUME = {19},
YEAR = {1982},
PAGES = {253--266}
}
@inproceedings{ReiSc89,
author = {R. Reischuk and B. Schmeltz},
title = {Area efficient methods to increase the reliability of
combinatorial circuits},
booktitle = proc6 # stacs,
series = lncs,
volume = {nnn},
publisher = springer,
year = {1989},
pages = {314--326}
}
@book{Rei90,
author = {R. Reischuk},
title = {Einf{\"u}hurung in die Komplexit{\"a}tstheorie},
series = {Leitf{\"a}den und Monographien der Informatik},
publisher = {Teubner},
address = {Stuttgart},
year = {1990}
}
@inproceedings{ReiSc91,
author = {R. Reischuk and B. Schmeltz},
title = {Reliable computation with noisy circuits and decision
trees: A general {$n\log n$} lower bound},
booktitle = proc32 # focs,
year = {1991},
pages = {602--611}
}
@inproceedings{ReSc93,
author = {R. Reischuk and C. Schindelhauer},
title = {Precise average case complexity},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
year = {1993},
pages = {650--661}
}
@inproceedings{ReVa83,
author = {J. Reif and L. Valiant},
title = {A logarithmic time sort for linear size networks},
booktitle = proc15 # stoc,
year = {1983},
pages = {10--16}
}
@ARTICLE{ReSc91,
AUTHOR = {C. Reutenauer and M. Sch\"utzenberger},
TITLE = {Minimization of rational word functions},
JOURNAL = sicomp,
VOLUME = {20},
YEAR = {1991},
PAGES = {669--685}
}
@article{Ris82,
author = {J. Rissanen},
title = {A universal prior for integers and estimation by minimum
description length},
journal = {Ann. Statist.},
volume = {11},
year = {1982},
pages = {416--431}
}
@article{Rob91,
author = {J. Robson},
title = {An {$O(T\log T)$} reduction from {RAM} computations
to satisfiability},
journal = tcs,
volume = {82},
year = {1991},
pages = {141--149}
}
@article{Rob92,
author = {J. Robson},
title = {Deterministic simulation of a single-tape {Turing} machine
by a random-access machine in sub-linear time},
journal = infcomp,
volume = {99},
year = {1990},
pages = {109--121}
}
@article{Rob92b,
author = {J. Robson},
title = {More languages of generalised star height 1},
journal = tcs,
volume = {106},
year = {1992},
pages = {327--335}
}
@article{RoSeII,
author = {N. Robertson and P. Seymour},
title = {Graph minors {II}. {A}lgorithmic aspects of tree-width},
journal = {Journal of Algorithms},
volume = {7},
year = {1986},
pages = {309--322}
}
@misc{RoSeXIII,
author = {N. Robertson and P. Seymour},
title = {Graph minors {XIII}. {T}he disjoint paths problem},
note = {to appear}
}
@misc{RoSeXV,
author = {N. Robertson and P. Seymour},
title = {Graph minors {XV}. {W}agner's conjecture},
note = {to appear}
}
@article{RoSe86,
author = {N. Robertson and P. Seymour},
title = {Graph minors {II}. {A}lgorithmic aspects of tree-width},
journal = {Journal of Algorithms},
volume = {7},
year = {1986},
pages = {309--322}
}
@article{Rog58,
author = {H. Rogers},
title = {G{\"o}del-numberings of the partial recursive functions},
journal = jsl,
volume = {23},
year = {1958},
pages = {331--341}
}
@article{Rog59,
author = {H. Rogers},
title = {Computing degrees of unsolvability},
journal = {Math. Annalen},
volume = {138},
year = {1959},
pages = {125--140}
}
@book{Rog67,
author = {H. Rogers},
year = {1967},
publisher = {McGraw-Hill},
title = {Theory of Recursive Functions and Effective
Computability},
note = {Reprinted, MIT Press, 1987.}
}
@book{Rogers:book,
author = {Rogers, H.},
year = {1967},
publisher = {McGraw-Hill},
title = {Theory of Recursive Functions and Effective
Computability},
note = {Reprinted. MIT Press. 1987.}
}
@inproceedings{Rog95,
author = {J. Rogers},
title = {The isomorphism conjecture holds and one-way functions exist
relative to an oracle},
booktitle = proc10 # structures,
year = {1995},
pages = {90--101}
}
@inproceedings{Roh92,
author = {P. Rohatgi},
title = {Saving queries with randomness},
booktitle = proc7 # structures,
year = {1992},
pages = {71--83},
note = jcss # ", to appear"
}
@phdthesis{Roh93,
author = {P. Rohatgi},
title = {On properties of random reductions},
school = {Cornell University},
number = {TR 93-1386},
year = {1993}
}
@book{Rom92,
author = {S. Roman},
title = {Coding and Information Theory},
publisher = springer,
year = {1992}
}
@book{Rose84,
author = {H. Rose},
title = {Subrecursion: Functions and Hierarchies},
series = {Oxford Logic Guides},
publisher = {Oxford University Press},
year = {1984}
}
@article{RoRy92,
author = {P. Rossmanith and W. Rytter},
title = {Observations on log($n$) time parallel recognition
of unambiguous cfl's},
journal = ipl,
volume = {44},
year = {1992},
pages = {267--272}
}
@techreport{Rot94,
author = {J. Rothe},
title = {A promise class at least as hard as the polynomial
hierarchy},
institution = {Computer Science, University of Rochester},
number = {484},
month = {January},
year = {1994}
}
@BOOK{RC94,
AUTHOR = {James S. Royer and John Case},
TITLE = {Subrecursive Programming Systems:
{C}omplexity \& Succinctness},
PUBLISHER = {Birh\"{a}user},
YEAR = {1994},
SERIES = {Progress in Theoretical Computer Science},
NOTE = {ISBN 0-8176-3767-2},
PRICE = {\$49.50}
}
@inproceedings{Roy95,
author = {J. Royer},
title = {Semantics versus syntax versus computations},
booktitle = proc10 # structures,
year = {1995},
pages = {37--48}
}
@misc{RuWa94,
author = {P. Ruzicka and J. Waczulik},
title = {On time-space trade-offs in dynamic graph pebbling},
year = {1994}
}
@article{Ruz80,
author = {W. Ruzzo},
title = {Tree-size bounded alternation},
journal = jcss,
volume = {21},
year = {1980},
pages = {218--235}
}
@ARTICLE{Ruz81,
AUTHOR = {W. Ruzzo},
TITLE = {On uniform circuit complexity},
JOURNAL = jcss,
VOLUME = {22},
YEAR = {1981},
PAGES = {365--383}
}
@article{Ryt83,
author = {W. Rytter},
title = {A simulation result for two-way pushdown automata},
journal = ipl,
volume = {16},
year = {1983},
pages = {199--202}
}
@article{Ryt86,
author = {W. Rytter},
title = {The space complexity of the unique decipherability problem},
journal = ipl,
volume = {23},
year = {1986},
pages = {1--3}
}
@book{Sac63,
author = {G. Sacks},
title = {Degrees of Unsolvability},
series = {Ann. of Math. Stud.},
volume = {55},
publisher = {Princeton Univ. Pr.},
year = {1963},
note = {Rev. ed. 1966}
}
@article{Sak91,
author = {S. Sakata},
title = {Decoding binary {2-D} cyclic codes by the {2-D}
{Berlekamp-Massey} algorithm},
journal = itit,
volume = {37},
year = {1991},
month = {July},
pages = {1200--1203}
}
@inproceedings{SaZa93,
author = {M. Saks and F. Zaharoglou},
title = {Wait-free {$k$}-set agreement is impossible: The
topology of public knowledge},
booktitle = proc25 # stoc,
year = {1993},
pages = {101--110}
}
@inproceedings{SSZ95,
author = {M. Saks and A. Srinivasan and S. Zhou},
title = {Explicit dispersers with polylog degree},
booktitle = proc27 # stoc,
year = {1995},
pages = {479--488}
}
@inproceedings{SaYu90,
author = {K. Salomaa and S. Yu},
title = {Degrees of nondeterminism for pushdown automata},
booktitle = {nnn},
year = {1990},
pages = {380--389}
}
@article{SaFu90,
author = {L. Sanchis and M. Fulk},
title = {On the efficient generation of language instances},
journal = sicomp,
volume = {19},
year = {1990},
pages = {281--296}
}
@article{San93,
author = {L. Sanchis},
title = {On the effective generation of set elements within
specified ranges},
journal = mst,
volume = {26},
year = {1993},
pages = {327--341}
}
@INCOLLECTION{San87,
AUTHOR = {M. Santha},
TITLE = {Relativized {A}rthur-{M}erlin vs. {M}erlin-{A}rthur games},
BOOKTITLE = {Foundations of Software Theory and Theoretical Computer Science},
YEAR = {1987},
PAGES = {437--442},
PUBLISHER = springer,
SERIES = {Lecture Notes in Computer Science No.~287}
}
@article{Sar77,
author = {D. Sarwate},
title = {On the complexity of decoding {Goppa} codes},
journal = itit,
volume = {nnn},
year = {1977},
pages = {515--516}
}
@article{Sar80,
author = {D. Sarwate},
title = {A note on universal classes of hash functions},
journal = ipl,
volume = {10},
year = {1980},
pages = {41--45}
}
@article{Sav70,
author = {W. Savitch},
title = {Relationship between nondeterministic and deterministic
tape complexities},
journal = jcss,
volume = {4},
year = {1970},
pages = {177--192}
}
@inproceedings{SaVi77,
author = {W. Savitch and P. Vit\'{a}nyi},
title = {Linear time simulation of multihead {T}uring machines with
head-to-head jumps},
booktitle = proc4 # icalp,
series = lncs,
volume = {52},
publisher = springer,
year = {1977},
pages = {453--464}
}
@article{Sax94,
author = {S. Saxena},
title = {Two-coloring linked lists is {NC$^1$}-complete for
lograithmic space},
journal = ipl,
volume = {49},
year = {1994},
pages = {73--76}
}
@inproceedings{Scha78,
author = {T. Schaefer},
title = {The complexity of satisfiability problems},
booktitle = proc10 # stoc,
year = {1978},
pages = {216--226}
}
@inproceedings{Schi93,
author = {I. Schiermeyer},
title = {Solving 3-satisfiability in less than {$1,579^b$} steps},
booktitle = proc6 # csl,
series = lncs,
volume = {702},
publisher = springer,
year = {1993},
pages = {379--394}
}
@article{Schm85,
author = {D. Schmidt},
title = {The recursion-theoretic structure of complexity classes},
journal = tcs,
volume = {38},
year = {1985},
pages = {143--156}
}
@inproceedings{Schm90,
author = {M. Schmidt},
title = {On the power of several queues},
booktitle = {nnn},
year = {1990},
pages = {64--75}
}
@article{ScSt89,
author = {W. Schnitzlein and H.-J. Stoss},
title = {Linear-time simulation of multihead {Turing} machines},
journal = infcomp,
volume = {81},
year = {1989},
pages = {353--363}
}
@article{Schn71,
author = {C.P. Schnorr},
title = {A unified approach to the definition of random sequences},
journal = mst,
volume = {5},
year = {1971},
pages = {246--258}
}
@book{Schn71b,
author = {C.P. Schnorr},
title = {Zuf{\"a}lligkeit und Wahrscheinlichkeit},
series = lnm,
volume = {218},
publisher = springer,
year = {1971}
}
@article{Schn73,
author = {C.P. Schnorr},
title = {Process complexity and effective random tests},
journal = jcss,
volume = {7},
year = {1973},
pages = {376--388}
}
@article{Schn76,
author = {C. Schnorr},
title = {The network complexity and the {Turing} machine complexity
of finite functions},
journal = {Acta Informatica},
volume = {7},
year = {1976},
pages = {95--107}
}
@ARTICLE{Schn78,
AUTHOR = {C. Schnorr},
TITLE = {Satisfiability is quasilinear complete in {NQL}},
JOURNAL = jacm,
VOLUME = {25},
YEAR = {1978},
PAGES = {136--145}
}
@inproceedings{Schn88,
author = {C. Schnorr},
title = {The multiplicative complexity of {B}oolean functions},
booktitle = proc6 # "Symposium on Applied Algebra, Algebraic
Algorithms, and Error-Correcting Codes",
series = lncs,
volume = {357},
publisher = springer,
year = {1988},
pages = {45--58}
}
@inproceedings{ScvL89,
author = {B. Scholten and J. van Leeuwen},
title = {Structured {$\NC$}},
booktitle = {The Proceedings of the 1989 Workshop on Algorithms and Data Structures},
publisher = springer,
year = {1989},
pages = {487--498}
}
@article{ScSt71,
author = {A. Sch{\"o}nhage and V. Strassen},
title = {Schnelle Multiplikation grosser Zahlen},
journal = {Computing {\rm Arch. Elektron. Rechnen}},
volume = {7},
year = {1971},
pages = {281--292}
}
@ARTICLE{Sch80,
AUTHOR = {A. Sch{\"o}nhage},
TITLE = {Storage modification machines},
JOURNAL = sicomp,
VOLUME = {9},
YEAR = {1980},
PAGES = {490--508}
}
@article{Sch88,
author = {A. Sch{\"o}nhage},
title = {A nonlinear lower bound for random-access machines
under logarithmic cost},
journal = jacm,
volume = {35},
year = {1988},
pages = {748--754}
}
@article{Schoning82,
author = {U. Sch{\"o}ning},
title = {A uniform approach to obtain diagonal sets in complexity
classes},
journal = tcs,
volume = {18},
year = {1982},
pages = {95--103}
}
@article{Schoning83,
author = {U. Sch{\"o}ning},
title = {A low and a high hierarchy within {NP}},
journal = jcss,
volume = {27},
year = {1983},
pages = {14--28}
}
@BOOK{Schoning85,
AUTHOR = {U. Sch{\"o}ning},
TITLE = {Complexity and Structure},
PUBLISHER = {Springer-Verlag},
YEAR = {1985},
VOLUME = {211},
SERIES = lncs
}
@article{Schoning85a,
author = {U. Sch{\"o}ning},
title = {Robust algorithms: a different approach to oracles},
journal = tcs,
volume = {40},
year = {1985},
pages = {57--66}
}
@ARTICLE{Schoning88,
AUTHOR = {U. Sch{\"o}ning},
TITLE = {Graph isomorphism is in the low hierarchy},
JOURNAL = jcss,
YEAR = {1988},
VOLUME = {37},
PAGES = {312-323}
}
@ARTICLE{Schoning89,
AUTHOR = {U. Sch{\"o}ning},
TITLE = {Probabilistic complexity classes and lowness},
JOURNAL = jcss,
YEAR = {1989},
VOLUME = {39},
PAGES = {84--100}
}
@INCOLLECTION{Schoning90,
AUTHOR = {U. Sch{\"o}ning},
TITLE = {The power of counting},
BOOKTITLE = {Complexity Theory Retrospective},
EDITOR = {A. Selman},
YEAR = {1990},
PAGES = {204--223},
PUBLISHER = {Springer-Verlag}
}
@article{Sch83,
author = {A. Schorr},
title = {Physical parallel devices are not much faster than
sequential ones},
journal = ipl,
volume = {17},
year = {1983},
pages = {103--106}
}
@article{Schu92,
author = {L. Schulman},
title = {Sample spaces uniform on neighborhoods},
booktitle = proc24 # stoc,
year = {1992},
pages = {17--25}
}
@article{Schu65,
author = {M.P. Sch{\"u}tzenberger},
title = {On finite monoids having only trivial subgroups},
journal = infcon,
volume = {8},
year = {1965},
pages = {190--194}
}
@incollection{Schu66,
author = {M.P. Sch{\"u}tzenberger},
title = {On a family of sets related to McNaughton's {$L$}-language},
booktitle = {Automata Theory},
editor = {E.R. Caianello},
publisher = {Academic Press},
address = {New York, NY},
year = {1966},
pages = {320--324}
}
@article{Schw80,
author = {J.T. Schwartz},
title = {Ultracomputers},
journal = {ACM Transactions on Programming Languages and Systems},
volume = {2},
year = {1980},
pages = {484--521}
}
@article{Schw80b,
author = {J.T. Schwartz},
title = {Fast probabilistic algorithms for polynomial identities},
journal = jacm,
volume = {27},
year = {1980},
pages = {701--717}
}
@article{ScLo87,
author = {A.M. Schwartz and M. Loui},
title = {Dictionary machines on cube-class networks},
journal = ieeetc,
volume = {C-36},
year = {1987},
pages = {100--105}
}
@misc{Schw91,
author = {T. Schwentick},
title = {The complexity of computing the middle bit of a \#P function},
institution = {Informatik, University of Mainz},
month = {September},
year = {1991}
}
@inproceedings{Schw94,
author = {T. Schwentick},
title = {Graph connectivity and monadic {NP}},
booktitle = proc35 # focs,
year = {1994},
pages = {614--622}
}
@article{SeMc76,
author = {J. Seiferas and R. McNaughton},
title = {Regularity-preserving relations},
journal = tcs,
volume = {2},
year = {1976},
pages = {147--154}
}
@article{Sei77,
author = {J. Seiferas},
title = {Iterative arrays with direct central control},
journal = {Acta Informatica},
volume = {8},
year = {1977},
pages = {177--192}
}
@INCOLLECTION{Sei90,
AUTHOR = {J. Seiferas},
TITLE = {Machine-independent complexity theory},
BOOKTITLE = {Handbook of Theoretical Computer Science},
volume = {A},
EDITOR = {J. Van Leeuwen},
PUBLISHER = {Elsevier and MIT Press},
YEAR = {1990}
}
@article{Sel79,
author = {A. Selman},
title = {{P}-selective sets, tally languages, and the behavior of
polynomial time reducibilities on {NP}},
journal = mathsys,
volume = {13},
year = {1979},
pages = {55--65}
}
@ARTICLE{Sel82,
AUTHOR = {A. Selman},
TITLE = {Reductions on {$\NP$} and p-selective sets},
JOURNAL = tcs,
YEAR = {1982},
VOLUME = {19},
PAGES = {287--304}
}
@article{SMB83,
author = {A. Selman and X. Mei-Rui and R. Book},
title = {Positive relativizations of complexity classes},
journal = sicomp,
volume = {12},
year = {1983},
pages = {565--579}
}
@article{Sel88,
author = {A. Selman},
title = {Natural self-reducible sets},
journal = sicomp,
volume = {17},
year = {1988},
pages = {989--996}
}
@article{Selman88,
author = {A. Selman},
title = {Natural self-reducible sets},
journal = sicomp,
volume = {17},
year = {1988},
pages = {989--996}
}
@techreport{Sel91,
author = {A. Selman},
title = {A taxonomy of complexity classes of functions},
institution = {Dept. of Comp. Sci., SUNY / Buffalo},
number = {91--12},
year = {1991},
note = {Revised June 1992, to appear in {\em J. Comp. Sys. Sci.}}
}
@article{Sel94,
author = {A. Selman},
title = {A taxonomy of complexity classes of functions},
journal = jcss,
volume = {48},
year = {1994},
pages = {357--381}
}
@inproceedings{Sen94,
author = {N. Sendrier},
title = {Product codes and the {S}ingleton bound},
booktitle = {Algebraic Coding---First French-Israeli Workshop,
Paris, July 1993},
series = lncs,
volume = {781},
publisher = springer,
year = {1994},
pages = {304--315}
}
@inproceedings{ShBr94,
author = {J. Shallit and Y. Breitbart},
title = {Automaticity: properties of a measure of descriptional
complexity},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {619--630}
}
@article{Sha94,
author = {J. Shallit},
title = {Numeration systems, linear recurrences, and regular sets},
journal = infcomp,
volume = {113},
year = {1994},
pages = {331--347}
}
@techreport{Shen91,
author = {A. Shen},
title = {A strange application of {K}olmogorov complexity},
institute = {Centrum voor Wiskunde en Informatik, Amsterdam},
number = {CS-R9328},
year = {1991}
}
@article{Shen93,
author = {B.-Z. Shen},
title = {A {J}ustesen construction of binary concatenated codes
than asymptotically meet the {Z}yablov bound for low rate},
journal = itit,
volume = {39},
number = {1},
year = {1993},
month = {January},
pages = {239--242}
}
@article{ShLo94,
author = {M.-J. Sheu and T. Long},
title = {The extended low hierarchy is an infinite hierarchy},
journal = sicomp,
volume = {23},
year = {1994},
pages = {488--509}
}
@article{Shok92,
author = {M.A. Shokrollah},
title = {Optimal algorithms for multiplication in certain finite
fields using elliptic curves},
journal = sicomp,
volume = {21},
year = {1992},
pages = {1993--1998}
}
@inproceedings{Sho88,
author = {V. Shoup},
title = {New algorithms for finding irreducible polynomials over
finite fields},
booktitle = proc29 # focs,
year = {1988},
pages = {283--290}
}
@inproceedings{Sho90,
author = {V. Shoup},
title = {Searching for primitive roots in finite fields},
booktitle = proc22 # stoc,
year = {1990},
pages = {546--554}
}
@article{Sho92,
author = {V. Shoup},
title = {Searching for primitive roots in finite fields},
journal = {Mathematics of Computation},
volume = {58},
year = {1992},
pages = {369--380}
}
@misc{Shor94,
author = {P. Shor},
title = {Algorithms for quantum computation: discrete log
and factoring},
year = {1994}
}
@article{SAetal92,
author = {H. Siegel and S. Abraham and W. Bain and K. Batcher
and T. Casavant and D. DeGroot and J. Dennis and D. Douglas and T.-Y. Feng
and J. Goodman and A. Huang and H. Jordan and J.R. Jump and Y. Patt
and A.J. Smith and J. Smith and L. Snyder and H. Stone and R. Tuck and B. Wah},
title = {{Report of the Purdue Workshop on Grand Challenges
in Computer Architecture for the Support of High Performance Computing}},
journal = jpdc,
volume = {16},
year = {1992},
pages = {199--211}
}
@article{SiWe93,
author = {D. Sieling and I. Wegener},
title = {Reduction of {OBDD}s in linear time},
journal = ipl,
volume = {48},
year = {1993},
pages = {139--144}
}
@article{SiWe93s,
author = {D. Sieling and I. Wegener},
title = {Reduction of {OBDD}s in linear time},
journal = {IPL},
volume = {48},
year = {1993},
pages = {139--144}
}
@article{Sil90,
author = {R. Silverman},
title = {Parallel polynomial arithmetic over finite rings},
journal = jpdc,
volume = {10},
year = {1990},
pages = {265--270}
}
@phdthesis{Sim75,
author = {J. Simon},
title = {On some central problems in computational complexity},
school = {Cornell University},
year = {1975}
}
@inproceedings{Sip82,
author = {M. Sipser},
title = {On relativization and the existence of complete sets},
booktitle = proc9 # icalp,
series = lncs,
volume = {140},
publisher = springer,
year = {1982},
pages = {523--531}
}
@inproceedings{Sip83,
author = {M. Sipser},
title = {Borel sets and circuit complexity},
booktitle = proc15 # stoc,
year = {1983},
pages = {61--69}
}
@inproceedings{Sit94,
author = {M. Sitharam},
title = {Pseudorandom generators and learning algorithms
for {AC$^0$}},
booktitle = proc26 # stoc,
year = {1994},
pages = {478--486}
}
@article{Sky83,
author = {S. Skyum},
title = {A measure in which {B}oolean negation is exponentially
powerful},
journal = ipl,
volume = {17},
year = {1983},
pages = {125--128}
}
@article{SkVa85,
author = {S. Skyum and L. Valiant},
title = {A complexity theory based on {B}oolean algebra},
journal = jacm,
volume = {32},
year = {1985},
pages = {484--502}
}
@ARTICLE{SvEB88,
AUTHOR = {C. Slot and P. van Emde Boas},
TITLE = {The problem of space invariance for sequential machines},
JOURNAL = infcomp,
VOLUME = {77},
YEAR = {1988},
PAGES = {93--122}
}
@inproceedings{Smo87,
author = {R. Smolensky},
title = {Algebraic methods in the theory of lower bounds for
{B}oolean circuit complexity},
booktitle = proc19 # stoc,
year = {1987},
pages = {77--82}
}
@inproceedings{Smo93,
author = {R. Smolensky},
title = {On representations by low-degree polynomials},
booktitle = proc34 # focs,
year = {1993},
pages = {130--138}
}
@article{Smo82,
author = {C. Smory{\'n}ski},
title = {The varieties of arboreal experience},
journal = {Mathematical Intelligencer},
volume = {nnn},
year = {1982},
pages = {182--189}
}
@book{Smo91,
author = {C. Smory{\'n}ski},
title = {Logical Number Theory {I}: An Introduction},
publisher = {Springer Verlag},
year = {1991}
}
@book{Smu61,
author = {R. Smullyan},
title = {Theory of Formal Systems},
series = {Annals of Mathematics Studies},
volume = {47},
publisher = {Princeton University Press},
address = {Princeton, NJ},
year ={1961}
}
@article{Snir85,
author = {M. Snir},
title = {On parallel searching},
journal = sicomp,
volume = {14},
year = {1985},
pages = {688--708}
}
@book{Soa87,
author = {R. Soare},
title = {Recursively Enumerable Sets and Degrees},
publisher = springer,
address = {New York},
year = {1987}
}
@incollection{Spe93,
author = {J. Spencer},
title = {The {J}anson inequality},
booktitle = {Combinatorics, Paul Erd{\H{o}}s is Eighty},
series = {Bolyai Society Mathematical Studies},
publisher = {North-Holland},
address = {Amsterdam},
year = {1993},
pages = {421--432}
}
@inproceedings{Spi95,
author = {D. Spielman},
title = {Linear-time encodable and decodable error-correcting codes},
booktitle = proc27 # stoc,
year = {1995},
pages = {388--397}
}
@inproceedings{Spi71,
author = {M. Spira},
title = {On time-hardware complexity tradeoffs for {Boolean}
functions},
booktitle = {Proceedings of the Fourth International Symposium
on Systems Sciences},
year = {1971},
pages = {525--527}
}
@inproceedings{Spi71f,
author = {M. Spira},
title = {On complete linear proofs of systems of linear inequalities},
booktitle = proc12 # focs,
year = {1971},
pages = {nnn--nnn},
note = {Correct reference?}
}
@article{Spr76,
author = {F. Springsteel},
title = {On the pre-{AFL} of {$[\log n]$} space and related
families of languages},
journal = tcs,
volume = {2},
year = {1976},
pages = {295--304}
}
@inproceedings{Sta77,
author = {R. Statman},
title = {Complexity of derivations from quantifier-free {Horn}
formulae, mechanical introduction of explicit definitions, and refinement
of completeness theorems},
booktitle = {Proc. Logic Colloquium '76},
publisher = {North-Holland},
year = {1977},
pages = {505--517}
}
@inproceedings{SHL65,
author = {R. Stearns and J. Hartmanis and P. L{ewis II}},
title = {Hierarchies of memory-limited computations},
booktitle = {Proceedings, 6th Ann. IEEE Symposium on
Switching Circuit Theory and Logical Design (now FOCS)},
year = {1965},
pages = {179--190}
}
@techreport{StHu86,
author = {R. Stearns and H. {Hunt III}},
title = {On the complexity of the satisfiability problem and the
structure of {NP}},
institution = {Dept. of Comp. Sci., SUNY at Albany},
number = {86--21},
year = {1986}
}
@article{StHu90,
author = {R. Stearns and H. {Hunt III}},
title = {Power indices and easier hard problems},
journal = mathsys,
volume = {23},
year = {1990},
pages = {209--225}
}
@techreport{STvEB85,
author = {R. Stegwee and L. Torenvliet and P. van Emde Boas},
title = {The power of your editor},
institution = {IBM Research Lab, San Jose, CA},
number = {RJ 4711},
year = {1985}
}
@inproceedings{StSh87,
author = {S. Stepanov and I. Shparlinskiy},
title = {On structure complexity of normal basis of finite field},
booktitle = proc6 # fct,
publisher = springer,
series = lncs,
volume = {nnn},
year = {1987},
pages = {414--416}
}
@inproceedings{Ste91,
author = {I. Stewart},
title = {Complete problems involving {Boolean} labelled
structures and projection translations},
booktitle = proc11 # fsttcs,
year = {1991},
pages = {nnn--nnn}
}
@article{Ste92,
author = {I. Stewart},
title = {Using the {H}amiltonian path operator to capture {NP}},
journal = jcss,
volume = {45},
year = {1992},
pages = {nnn--nnn}
}
@article{Ste94,
author = {I. Stewart},
title = {On completeness for {NP} using projection translations},
journal = mst,
volume = {27},
year = {1994},
pages = {125--157}
}
@article{Sti88,
author = {H. Stichtenoth},
title = {A note on {H}ermitian codes over {GF($Q^2$)}},
journal = itit,
volume = {34},
year = {1988},
pages = {1345--1348}
}
@article{Sti90,
author = {D. Stinson},
title = {Some observations on parallel algorithms for fast
exponentiation in {GF($2^n$)}},
journal = sicomp,
volume = {19},
year = {1990},
pages = {711--717}
}
@article{Sti94,
author = {D. Stinson},
title = {Combinatorial techniques for universal hashing},
journal = jcss,
volume = {48},
year = {1994},
pages = {337--346}
}
@inproceedings{StMe73,
author = {L. Stockmeyer and A. Meyer},
title = {Word problems requiring exponential time},
booktitle = proc5 # stoc,
year = {1973},
pages = {1--9}
}
@article{Sto77,
author = {L. Stockmeyer},
title = {The polynomial time hierarchy},
journal = tcs,
volume = {3},
year = {1977},
pages = {1--22}
}
@article{StVi84,
author = {L. Stockmeyer and U. Vishkin},
title = {Simulations of parallel random access machines
by circuits},
journal = sicomp,
volume = {13},
year = {1984},
pages = {409--422}
}
@inproceedings{Sto91,
author = {P. Stokes},
title = {The domain of covering codes},
booktitle = {nnn},
series = lnm,
volume = {1518},
publisher = springer,
year = {1991},
pages = {170--177}
}
@article{Sto71,
author = {H. Stone},
title = {Parallel processing with the perfect shuffle},
journal = ieeetc,
volume = {C-20},
year = {1971},
pages = {153--161}
}
@article{Str88,
author = {H. Straubing},
title = {Semigroups and languages of dot-depth two},
journal = tcs,
volume = {58},
year = {1988},
pages = {361--378}
}
@inproceedings{Str92,
author = {H. Straubing},
title = {Circuit complexity and the expressive power of
generalized first-order formulas},
booktitle = proc19 # icalp,
year = {1992},
pages = {16--27}
}
@article{StWe92,
author = {H. Straubing and P. Weil},
title = {On a conjecture concerning dot-depth two languages},
journal = tcs,
volume = {104},
year = {1992},
pages = {161--183}
}
@book{Str94,
author = {H. Straubing},
title = {Finite Automata, Formal Logic, and Circuit Complexity},
series = {Progress in Theoretical Computer Science},
publisher = {Birkh{\"a}user},
year = {1994}
}
@misc{Str94b,
author = {M. Strauss},
title = {Normal numbers and sources for {BPP}},
year = {1994},
note = {DIMACS TR 94-17, 1994; appeared in the proceedings
of STACS'95}
}
@article{SBetal89,
author = {N. Striebl and K.-H. Brenner and A. Huang and J. Jahns
and J. Jewell and A. Lohmann and D. Miller and M. Murdocca and M. Prise
and T. Sizer},
title = {Digital optics},
journal = {Proceedings of the IEEE},
volume = {77},
year = {1989},
pages = {1954--1969}
}
@phdthesis{Sud92,
author = {M. Sudan},
title = {Efficient checking of polynomials and proofs
and the hardness of approximation problems},
school = {University of California, Berkeley},
year = {1992}
}
@article{Sud76,
author = {I.H. Sudborough},
title = {On tape-bounded complexity clases and multihead
finite automata},
journal = jcss,
volume = {10},
year = {1975},
pages = {62--76}
}
@article{SuZa76,
author = {I.H. Sudborough and A. Zalcberg},
title = {On families of languages defined by time-bounded
random-access machines},
journal = sicomp,
volume = {5},
year = {1976},
pages = {217--230}
}
@article{SKHN80,
author = {Y. Sugiyama and M. Kasahara and S. Hirasawa and T. Namekawa},
title = {Superimposed concatenated codes},
journal = itit,
volume = {IT-26},
year = {1980},
pages = {735--736}
}
@article{SuGu91,
author = {X.-H. Sun and J. Gustafson},
title = {Toward a better parallel performance metric},
journal = {Parallel Computing},
volume = {17},
year = {1991},
pages = {1093--1109}
}
@inproceedings{Szeg90,
author = {M. Szegedy},
title = {Functions with bounded symmetric communication complexity
and circuits with mod m gates},
booktitle = proc22 # stoc,
year = {1990},
pages = {278--286}
}
@article{Szeg93,
author = {M. Szegedy},
title = {Functions with bounded symmetric communication complexity,
programs over commutative monoids, and {ACC}},
journal = jcss,
volume = {47},
year = {1993},
pages = {405--423}
}
@article{Sze87,
author = {R. Szelepcs{\'e}nyi},
title = {The method of forcing for nondeterministic automata},
journal = beatcs,
volume = {33},
year = {1987},
pages = {96--100}
}
@techreport{Sze93,
author = {R. Szelepcs{\'e}nyi},
title = {{$\beta_k$}-complete problems and greediness},
institution = {Computer Science, University of Rochester},
number = {455},
month = {May},
year = {1993}
}
@misc{Tak93,
author = {G. Takeuti},
title = {Separation of theories in weak bounded arithmetic},
year = {1993},
note = {Department of Mathematics, Univ. of Illinois at
Urbana-Champaign}
}
@inproceedings{TaBa95,
author = {G. Tardos and D. Mix Barrington},
title = {A lower bound on the mod 6 degree of the {OR} function},
booktitle = {Proceedings of the Third Israel Symposium
on the Theory of Computing and Systems (ISTCS'95)},
year = {1995},
pages = {52--56}
}
@article{TaTr77,
author = {R. Tarjan and A. Trojanowski},
title = {Finding a maximum independent set},
journal = sicomp,
volume = {6},
year = {1977},
pages = {537--546}
}
@article{Tar79,
author = {J. Tarjan},
title = {A class of algorithms which require nonlinear time
to maintain disjoint sets},
journal = jcss,
volume = {18},
year = {1979},
pages = {110--127}
}
@article{TaVi85,
author = {R. Tarjan and U. Vishkin},
title = {An efficient parallel biconnectivity algorithm},
journal = sicomp,
volume = {14},
year = {1985},
pages = {862--874}
}
@misc{Tar91m,
author = {J. Tarui},
title = {M{\"o}bius inversion, few-accepting {T}uring machines,
and query classes with sparse oracles},
year = {1991}
}
@INPROCEEDINGS{Tar91,
AUTHOR = {J.~Tarui},
TITLE = {Randomized Polynomials, Threshold Circuits, and the Polynomial
Hierarchy},
BOOKTITLE = proc8 # stacs,
YEAR = {1991},
PUBLISHER = springer,
SERIES = lncs,
VOLUME = {480},
pages = {238--250}
}
@inproceedings{Tar91b,
author = {J. Tarui},
title = {Degree complexity of {B}oolean functions, and its applications
to relativized separations},
booktitle = proc6 # structures,
year = {1991},
pages = {382--390}
}
@unpublished{Tar92,
author = {J. Tarui},
title = {On singleton selectors and probabilistic polynomials},
year = {1992},
note = {Manuscript}
}
@article{Tar93,
author = {J. Tarui},
title = {Probabilistic polynomials, {$\AC^0$} functions, and the
polynomial-time hierarchy},
journal = tcs,
volume = {113},
year = {1993},
pages = {167--183}
}
@incollection{THF90,
author = {S. Tewksbury and L. Hornak and P Franzon},
title = {Future physical environments and concurrent computation},
booktitle = {Concurrent Computations},
editor = {S. Tewksbury and B. Dickinson and S. Schwartz},
publisher = {Plenum},
year = {1990},
pages = {65--86}
}
@inproceedings{TTW94,
author = {T. Thierauf and S. Toda and O. Watanabe},
title = {On sets bounded truth-table reducible to sparse sets},
booktitle = proc11 # stacs,
series = lncs,
volume = {775},
publisher = springer,
year = {1994},
pages = {427--438}
}
@article{Tho82,
author = {W. Thomas},
title = {Classifying regular events in symbolic logic},
journal = jcss,
volume = {25},
year = {1982},
pages = {360--376}
}
@ARTICLE{Tho72,
AUTHOR = {D. Thompson},
TITLE = {Subrecursiveness: machine-independent notions of computability
in restricted time and storage},
JOURNAL = mathsys,
VOLUME = {6},
YEAR = {1972},
PAGES = {3--15}
}
@article{Tie87,
author = {H. Tiersma},
title = {Remarks on codes from {H}ermitian curves},
journal = titi,
volume = {IT-33},
year = {1987},
pages = {605--609}
}
@article{TiYa94,
author = {H. Ting and A. Yao},
title = {A randomized algorithm for finding maximum with
{$O((\log n)^2)$} polynomial tests},
journal = ipl,
volume = {49},
year = {1994},
pages = {39--43}
}
@INPROCEEDINGS{Toda89,
AUTHOR = {S. Toda},
TITLE = {On the computational power of {$\PP$} and {$\parityP$}},
BOOKTITLE = proc30 # focs,
YEAR = {1989},
PAGES = {514--519}
}
@ARTICLE{Toda91,
AUTHOR = {S. Toda},
TITLE = {{$\PP$} is as hard as the polynomial-time hierarchy},
YEAR = 1991,
JOURNAL = sicomp,
VOLUME = {20},
PAGES = {865--877}
}
@INPROCEEDINGS{ToOg91,
AUTHOR = {S. Toda and M. Ogiwara},
TITLE = {Counting classes are at least as hard as the
polynomial-time hierarchy},
BOOKTITLE = proc6 # structures,
YEAR = {1991},
PAGES = {to appear}
}
@article{Toda92,
author = {S. Toda},
title = {Restricted relativizations of probabilistic polynomial time},
journal = tcs,
volume = {93},
year = {1992},
pages = {265--277}
}
@article{ToOg92,
author = {S. Toda and M. Ogiwara},
title = {Counting classes are at least as hard as the
polynomial-time hierarchy},
journal = sicomp,
volume = {21},
year = {1992},
pages = {316--328}
}
@article{ToWa92,
author = {S. Toda and O. Watanabe},
title = {Polynomial time 1-{T}uring reducibility
from {\#PH} to {\#P}},
journal = tcs,
volume = {100},
year = {1992},
pages = {205--221}
}
@article{Tom80,
author = {M. Tompa},
title = {Time-space tradeoffs for computing functions, using
connectivity properties of their circuits},
journal = jcss,
volume = {20},
year = {1980},
pages = {118--132}
}
@inproceedings{Tor88,
author = {J. Tor{\'a}n},
title = {An oracle characterization of the counting hierarchy},
booktitle = proc3 # structures,
year = {1988},
pages = {213--223}
}
@inproceedings{Tor88b,
author = {J. Tor{\'a}n},
title = {Succinct representations of counting problems},
booktitle = proc6 # "Conference on Applied Algebra, Algebraic
Algorithms, and Error-Correcting Codes",
series = lncs,
volume = {357},
publisher = springer,
year = {1988},
pages = {415--426}
}
@phdthesis{Tor88t,
author = {J. Tor{\'a}n},
title = {Structural Properties of the Counting Hierarchies},
institution = {Universitat Polit{\'e}cnica de Barcelona,
Facultat de Inform{\'a}tica},
year = {1988}
}
@phdthesis{Tra86,
author = {J, Trahan},
title = {Simulations among multi-dimensional iterative arrays,
iterative tree automata, and alternating {T}uring machines},
school = {University of Illinois at Urbana Champaign},
year = {1986},
note = {Tech. Report UILU-ENG-86-2202, ACT-66}
}
@article{TLR92,
author = {J. Trahan and M. Loui and V. Ramachandran},
title = {Multiplication, division, and shift instructions
in parallel random access machines},
journal = tcs,
volume = {100},
year = {1992},
pages = {1--44}
}
@inproceedings{Tre86,
author = {C. Tretkoff},
title = {Bounded oracles and complexity classes inside linear
space},
booktitle = proc1 # structures,
series = lncs,
volume = {223},
publisher = springer,
year = {1986},
pages = {347--361}
}
@book{Tro73,
author = {A. Troelstra},
title = {Mathematical Investigations of Intuitionistic Arithmetic
and Analysis},
series = lnm,
volume = {344},
publisher = {springer},
year = {1973}
}
@inproceedings{Tsai93,
author = {S.-C. Tsai},
title = {Lower bounds on representing {B}oolean functions
as polynomials in {$Z_m$}},
booktitle = proc8 # structures,
year = {1993},
pages = {96--101}
}
@incollection{Tse68,
author = {G. Tseitin},
title = {On the complexity of derivations in propositional
calculus},
booktitle = {Studies in Mathematics and Mathematical Logic,
Part {II}},
editor = {A. Slisenko},
year = {1968},
pages = {115--125},
note = {English translation}
}
@article{TVZ82,
author = {M. Tsfasman and S. Vladut and T. Zink},
title = {Modular curves, {S}himura curves and {G}oppa codes,
better than {V}arshamov-{G}ilbert bound},
journal = {Mathematische Nachrichten},
volume = {109},
year = {1982},
pages = {21--28}
}
@book{TV91,
author = {M. Tsfasman and S. Vladut},
title = {Algebraic-Geometric Codes},
publisher = {Kluwer Academic},
address = {Dordrecht},
series = {Mathematics and Its Applications (Soviet Series)},
volume = {58},
year = {1991}
}
@article{TIAS77,
author = {S. Tsukiyama and M. Ide and H. Ariyoshi and I. Shirakawa},
title = {A new algorithm for generating all the maximal independent
sets},
journal = sicomp,
volume = {6},
year = {1977},
pages = {505--517}
}
@article{Tur83,
author = {P. Turakainen},
title = {A machine-oriented approach to composition of morphisms
and inverse morphisms},
journal = beatcs,
volume = {20},
month = {June},
year = {1983},
pages = {162--166}
}
@inproceedings{Uhl87,
author = {D. Uhlig},
title = {On reliable networks from unreliable gates},
booktitle = {Proceedings, Parallel Algorithms and Architectures},
series = lncs,
volume = {269},
publisher = springer,
year = {1987},
pages = {155--162}
}
@inproceedings{Uhl87b,
author = {D. Uhlig},
title = {Reliable networks from unreliable gates with almost minimal
complexity},
booktitle = proc6 # fct,
series = lncs,
volume = {nnn},
publisher = springer,
year = {1987},
pages = {462--469}
}
@inproceedings{Uhl88,
author = {D. Uhlig},
title = {Reliable networks for {B}oolean functions with small
complexity},
booktitle = proc4 # "PARCELLA",
series = lncs,
volume = {nnn},
publisher = springer,
year = {1988},
pages = {366--371}
}
@article{UMS82,
author = {H. Umeo and K. Morita and K. Sugata},
title = {Deterministic one-way simulation of two-way real-time
cellular automata and its related problems},
journal = ipl,
volume = {14},
number = {4},
year = {1982},
pages = {158--161}
}
@article{Urq87,
author = {A. Urquhart},
title = {Hard examples for resolution},
journal = jacm,
volume = {34},
year = {1987},
pages = {209--219}
}
@article{Val75,
author = {L. Valiant},
title = {Parallelism in comparison problems},
journal = sicomp,
volume = {4},
year = {1975},
pages = {348--355}
}
@article{Val76,
author = {L. Valiant},
title = {Relative complexity of checking and evaluating},
journal = ipl,
volume = {5},
year = {1976},
pages = {20--23}
}
@article{Val79,
author = {L. Valiant},
title = {The complexity of computing the permanent},
journal = tcs,
volume = {8},
year = {1979},
pages = {189--201}
}
@misc{Val79b,
author = {L. Valiant},
title = {Universality considerations in {VLSI} circuits},
month = {December},
year = {1979}
}
@techreport{Val79c,
author = {L. Valiant},
title = {Completeness classes in algebra},
institution = {Dept. of Computer Science, University of Edinburgh},
number = {CSR-40-79},
month = {April},
year = {1979}
}
@inproceedings{Val79p,
author = {L. Valiant},
title = {Completeness classes in algebra},
booktitle = proc11 # stoc,
year = {1979},
pages = {nnn--nnn}
}
@article{Val82,
author = {L. Valiant},
title = {Reducibility by algebraic projections},
journal = {L'Enseignement math{\'e}matique},
volume = {28},
year = {1982},
pages = {253--268}
}
@article{VSBR83,
author = {L. Valiant and S. Skyum and S. Berkowitz and C. Rackoff},
title = {Fast parallel computation of polynomials using few
processors},
journal = sicomp,
volume = {12},
year = {1983},
pages = {641--644}
}
@article{Val84,
author = {L. Valiant},
title = {A theory of the learnable},
journal = cacm,
volume = {27},
year = {1984},
month = {November},
pages = {1134--1142}
}
@inproceedings{Val85,
author = {L. Valiant},
title = {Learning disjunctions of conjunctions},
booktitle = {Proceedings of the 9th International
Joint Conference on Artificial Intelligence, Los Angeles, CA},
year = {1985},
pages = {565--569}
}
@ARTICLE{VV86,
AUTHOR = {L. Valiant and V. Vazirani},
TITLE = {{$\NP$} is as easy as detecting unique solutions},
JOURNAL = tcs,
YEAR = {1986},
VOLUME = {47},
PAGES = {85--93}
}
@article{Val88,
author = {L. Valiant},
title = {Optimally universal parallel computers},
journal = {Phil. Trans. R. Soc. Lond. A},
volume = {326},
year = {1988},
pages = {373--376}
}
@article{Val90,
author = {L. Valiant},
title = {A bridging model for parallel computation},
journal = cacm,
volume = {33},
month = {August},
year = {1990},
pages = {103--111}
}
@incollection{Val90b,
author = {L. Valiant},
title = {General-purpose parallel architectures},
BOOKTITLE = {Handbook of Theoretical Computer Science},
volume = {A},
EDITOR = {J. Van Leeuwen},
PUBLISHER = {Elsevier and MIT Press},
YEAR = {1990}
}
@incollection{Val92,
author = {L. Valiant},
title = {Why is {B}oolean complexity theory so difficult?},
booktitle = {Boolean Function Complexity},
editor = {M. Paterson},
series = {LMS Lecture Notes},
volume = {169},
publisher = {Cambridge University Press},
year = {1992},
pages = {84--94},
note = {Meeting held July 1990}
}
@inproceedings{VGT88,
author = {B. Vall{\'e}e and M. Girault and P. Toffin},
title = {How to guess {$l$}-th roots modulo {$n$} by reducing
lattice bases},
booktitle = proc6 # "Conference on Applied Algebra, Algebraic
Algorithms, and Error-Correcting Codes",
series = lncs,
volume = {357},
publisher = springer,
year = {1988},
pages = {427--442}
}
@inproceedings{vEB72,
author = {P. van Emde Boas},
title = {A comparison of the properties of complexity classes
and honesty classes},
booktitle = proc2 # icalp,
year = {1972},
pages = {nnn--nnn}
}
@article{vEB78,
author = {P. van Emde Boas},
title = {Some applications of the {McCreight}-{Meyer} algorithm
in abstract complexity theory},
journal = tcs,
volume = {7},
year = {1978},
pages = {nnn--nnn}
}
@INCOLLECTION{vEB90,
AUTHOR = {P. van Emde Boas},
TITLE = {Machine models and simulations},
BOOKTITLE = {Handbook of Theoretical Computer Science},
volume = {A},
EDITOR = {J. Van Leeuwen},
PUBLISHER = {Elsevier and MIT Press},
YEAR = {1990},
PAGES = {1--66}
}
@inproceedings{VaVa85,
author = {U. Vazirani and V. Vazirani},
title = {Random polynomial time is equal to semi-random polynomial
time},
booktitle = proc26 # focs,
year = {1985},
pages = {nnn--nnn}
}
@techreport{VaVa88,
author = {U. Vazirani and V. Vazirani},
title = {Random polynomial time is equal to semi-random polynomial
time},
institution = {Dept. of Computer Science, Cornell University},
number = {88-959},
month = {December},
year = {1988}
}
@article{VeTo89,
author = {H. Venkateswaran and M. Tompa},
title = {A new pebble game that characterizes parallel
complexity classes},
journal = sicomp,
volume = {18},
year = {1989},
pages = {533--549}
}
@article{Ven91,
author = {H. Venkateswaran},
title = {Properties that characterize {LOGCFL}},
journal = jcss,
volume = {43},
year = {1991},
pages = {380--404}
}
@inproceedings{Ver93,
author = {N. Vereshchagin},
title = {Relationships among {NP}-dets, {Co-NP}-sets, and {P}-sets
relative to random oracles},
booktitle = proc8 # structures,
year = {1993},
pages = {132--138}
}
@inproceedings{VVM90,
author = {V. Vinay and H. Venkateswaran and C.E. Veni Madhavan},
title = {Circuits, pebbling, and expressibility},
booktitle = proc5 # structures,
year = {1990},
pages = {223--230}
}
@article{Vis85,
author = {U. Vishkin},
title = {On efficient parallel strong orientation},
journal = ipl,
volume = {20},
year = {1985},
pages = {235--240}
}
@inproceedings{Vit86,
author = {P. Vit{\'a}nyi},
title = {Nonsequential computation and laws of nature},
booktitle = {{VLSI} Algorithms and Architectures},
series = {Lecture Notes in Computer Science No.~227},
publisher = springer,
year = {1986},
pages = {108--120}
}
@article{Vit88,
author = {P. Vit{\'a}nyi},
title = {Locality, communication, and interconnect length
in multicomputers},
journal = sicomp,
volume = {17},
year = {1988},
pages = {659--672}
}
@INPROCEEDINGS{Vit91,
AUTHOR = {J. Vitter},
TITLE = {Efficient memory access in large-scale computation},
BOOKTITLE = proc8 # stacs,
PUBLISHER = springer,
SERIES = lncs,
VOLUME = {480},
YEAR = {1991},
PAGES = {26--41}
}
@techreport{ViSh92I,
author = {J. Vitter and E. Shriver\/},
title = {Algorithms for parallel memory {I}: {Two-level} memories},
institution = {Department of Computer Science, Brown University},
number = {Technical Report CS--92--04},
month = {August},
year = {1992}
}
@techreport{ViSh92II,
author = {J. Vitter and E. Shriver\/},
title = {Algorithms for parallel memory {II}: hierarchical
multilevel memories\/},
institution = {Department of Computer Science, Brown University},
number = {Technical Report CS--92--05},
month = {August},
year = {1992}
}
@techreport{ViNo92,
author = {J. Vitter and M. Nodine},
title = {Large-scale sorting in uniform memory hierarchies},
institution = {Department of Computer Science, Brown University},
number = {Technical Report CS--92--02},
month = {August},
year = {1992}
}
@techreport{NoVi92,
author = {M. Nodine and J. Vitter},
title = {Optimal deterministic sorting in parallel memory hierarchies},
institution = {Department of Computer Science, Brown University},
number = {Technical Report CS--92--38},
month = {August},
year = {1992}
}
@inproceedings{Vol90,
author = {H. Vollmer},
title = {The gap-language technique revisited},
booktitle = proc3 # csl,
year = {1990},
pages = {389--399}
}
@inproceedings{Voss91,
author = {C. Voss},
title = {On the weights of trace codes},
booktitle = {nnn},
series = lnm,
volume = {1518},
publisher = springer,
year = {1991},
pages = {193--198}
}
@article{WaFi74,
author = {R. Wagner and M. Fischer},
title = {The string-to-string correction problem},
journal = jacm,
volume = {21},
year = {1974},
pages = {168--173}
}
@article{Wag86,
author = {K. Wagner},
title = {The complexity of combinatorial problems with succinct input
representation},
journal = {Acta Informatica},
volume = {23},
year = {1986},
pages = {325--356}
}
@BOOK{WW86,
AUTHOR = {K. Wagner and G. Wechsung},
TITLE = {Computational Complexity},
PUBLISHER = {D. Reidel},
YEAR = {1986}
}
@inproceedings{Wag92,
author = {K. Wagner},
title = {The alternation hierarchy for sublogarithmic space: An
exciting race to {STACS} '93},
booktitle = proc10 # stacs,
series = lncs,
volume = {665},
publisher = springer,
note = {Editorial note},
year = {1993},
pages = {2--4}
}
@misc{Wal64,
author = {C. Wallace},
title = {A suggestion for a fast multiplier},
journal = ieeetc,
volume = {EC-13},
year = {1964},
pages = {14--17}
}
@article{WCS92,
author = {J. Wang and L. Cheng and A. Sawchuk},
title = {Optical two-dimensional perfect shuffles based on a
one-copy algorithm},
journal = {Applied Optics},
volume = {31},
number = {26},
year = {1992},
pages = {5464--5467}
}
% Not Jie Wang
@inproceedings{Wang90,
author = {J. Wang},
title = {Some remarks on polynomial time isomorphisms},
booktitle = proc2 # icci,
series = lncs,
volume = {468},
publisher = springer,
year = {1990},
pages = {144--153}
}
@article{Wang91,
author = {J. Wang},
title = {On p-creative and p-completely creative sets},
journal = tcs,
volume = {85},
year = {1991},
pages = {1--31}
}
@inproceedings{WaBe92,
author = {J. Wang and J. Belanger},
title = {On average {P} vs. average {NP}},
booktitle = proc7 # structures,
year = {1992},
pages = {318--326}
}
@article{Wang92,
author = {J. Wang},
title = {Polynomial time productivity, approximations,
and levelability},
journal = sicomp,
volume = {21},
year = {1992},
pages = {1100--1111}
}
@article{Wang92b,
author = {J. Wang},
title = {A note on two-way probabilistic automata},
journal = ipl,
volume = {43},
year = {1992},
pages = {321--326}
}
@incollection{Wang93,
author = {J. Wang},
title = {On the {E}-isomorphism problem},
booktitle = {Advances in Computational Complexity Theory},
editor = {J.-Y. Cai},
publisher = {American Mathematical Society},
year = {1993},
pages = {195--209}
}
@article{WaBe93,
author = {J. Wang and J. Belanger},
title = {Honest iteration schemes of randomizing algorithms},
journal = ipl,
volume = {45},
year = {1993},
pages = {275--278}
}
@inproceedings{WaBe93b,
author = {J. Wang and J. Belanger},
title = {Isomorphisms of {NP} complete problems on
random instances},
booktitle = proc8 # structures,
year = {1993},
pages = {65--74}
}
@misc{WaBe94,
author = {J. Wang and J. Belanger},
title = {On the {NP}-isomorphism problem with respect to
random instances},
year = {1994},
note = jcss # ", to appear"
}
@misc{Wang94,
author = {J. Wang},
title = {String-rewriting systems have hardest problems in {NP}},
year = {1994}
}
@inproceedings{Wang94i,
author = {J. Wang},
title = {Selectivity and self-reducibility: new characterizations
of complexity classes},
booktitle = proc6 # icci,
year = {1994}
}
@misc{Wang94b,
author = {J. Wang},
title = {Productive functions and isomorphisms},
year = {1994},
note = {{\em Math Sys. Thy.\/}, in press}
}
@article{WaBl90,
author = {M. Wang and I. Blake},
title = {Bit serial multiplication in finite fields},
journal = sjdm,
volume = {3},
year = {1990},
pages = {140--148}
}
@article{WaHa84,
author = {M. Warmuth and D. Haussler},
title = {On the complexity of iterated shuffle},
journal = jcss,
volume = {28},
year = {1984},
pages = {345--358}
}
@techreport{Wat93,
author = {O. Watanabe},
title = {An {NP} set with no {co-DP} sparse subset},
institution = {Computer Science, University of Rochester},
number = {475},
month = {October},
year = {1993}
}
@article{Wat94,
author = {O. Watanabe},
title = {A framework for polynomial-time query learnability},
journal = mst,
volume = {27},
year = {1994},
pages = {211--230}
}
@article{WaGa94,
author = {O. Watanabe and R. Gavald{\`a}},
title = {Structural analysis of polynomial-time query learnability},
journal = mst,
volume = {27},
year = {1994},
pages = {231--256}
}
@book{Weg87,
author = {I. Wegener},
title = {The Complexity of Boolean Functions},
publisher = {Wiley},
address = {New York},
year = {1987}
}
@article{Weg92,
author = {I. Wegener},
title = {How far can we count in constant depth with a
polylogarithmic number of gates?},
journal = {J. Inform. Process. Cybernet.},
volume = {EIK 28},
year = {1992},
pages = {79--82}
}
@INPROCEEDINGS{Wei74,
AUTHOR = {R. Weicker},
TITLE = {Turing machines with associative memory access},
BOOKTITLE = proc2 # icalp,
PUBLISHER = springer,
SERIES = lncs,
VOLUME = {14},
YEAR = {1974},
PAGES = {458--472}
}
@inproceeding{Wei91,
author = {K. Weihrauch},
title = {A simple and powerful approach for studying constructivity,
computability, and complexity},
booktitle = {Constructivity in Computer Science, Proceedings,
San Antonio, Texas, June 1991},
series = lncs,
volume = {613},
publisher = springer,
year = {1991},
pages = {228--246}
}
@article{Wel75,
author = {E. Weldon},
title = {Some results on the problem of constructing asymptotically
good error-correcting codes},
journal = itit,
volume = {IT-21},
number = {4},
year = {1975},
month = {July},
pages = {412--417}
}
@article{Wel83,
author = {D. Welsh},
title = {Randomised algorithms},
journal = {Discrete and Applied Mathematics},
volume = {5},
year = {1983},
pages = {nnn--nnn}
}
@incollection{Wel83,
title = {Problems in computational complexity},
booktitle = {nnn},
year = {1983},
pages = {75--85}
}
@article{WeBa85,
author = {D. West and P. Banerjee},
title = {Partial matching in degree-restricted bipartite graphs},
journal = {Congressus Numerantium},
volume = {49},
month = {December},
year = {1985},
pages = {259--266}
}
@article{WeBa88,
author = {D. West and P. Banerjee},
title = {On the construction of communication networks satisfying
bounded fan-in of service ports},
journal = ieeetc,
volume = {37},
year = {1988},
pages = {1148--1151}
}
@inproceedings{Wie83,
author = {J. Wiedermann},
title = {Deterministic and nondeterministic simulations of the
{RAM} by the {T}uring machine},
booktitle = {Information Processing '83: Proc. 9th World
Computer Congress},
editor = {R.E.A. Mason},
publisher = {North-Holland},
year = {1983},
pages = {163--168}
}
@inproceedings{Wie92,
author = {J. Wiedermann},
title = {Weak parallel machines: a new class of physically
feasible parallel machine models},
booktitle = proc16 # mfcs,
series = lncs,
volume = {629},
publisher = springer,
year = {1992},
pages = {95--111}
}
@incollection{Wig93,
author = {A. Wigderson},
title = {The fusion method for lower bounds in circuit complexity},
booktitle = {Combinatorics, Paul Erd{\H{o}}s is Eighty},
series = {Bolyai Society Mathematical Studies},
publisher = {North-Holland},
address = {Amsterdam},
year = {1993},
pages = {453--467}
}
@inproceedings{WiZu93,
author = {A. Wigderson and D. Zuckerman},
title = {Expanders that beat the eigenvalue bound: explicit
construction and applications},
booktitle = proc25 # stoc,
year = {1993},
pages = {245--251}
}
@inproceedings{Wig94,
author = {A. Wigderson},
title = {{$\NL/\poly \subseteq \parityL/\poly$}},
booktitle = proc9 # structures,
year = {1994},
pages = {59--62}
}
@article{Wil92,
author = {D. Willard},
title = {A density control algorithm for doing insertions
and deletions in a sequentially ordered file in a good
worst-case time},
journal = infcomp,
volume = {97},
year = {1992},
pages = {150--204}
}
@article{Wil85,
author = {C. Wilson},
title = {Relativized circuit complexity},
journal = jcss,
volume = {31},
year = {1985},
pages = {169--181}
}
@article{Wil87,
author = {C. Wilson},
title = {Relativized {NC}},
journal = mst,
volume = {20},
year = {1987},
pages = {13--29}
}
@article{Wil88,
author = {C. Wilson},
title = {A measure of relativized space which is faithful
with respect to depth},
journal = jcss,
volume = {36},
year = {1988},
pages = {303--312}
}
@article{Wil90,
author = {C. Wilson},
title = {On the decomposability of {AC} and {NC}},
journal = sicomp,
volume = {19},
year = {1990},
pages = {384--396}
}
@article{Wis92,
author = {J. Wiseman},
title = {New binary codes from a generalization of {Zinoviev's}
technique},
journal = infcomp,
voluem = {98},
year = {1992},
pages = {132--139}
}
@article{WoCh76,
author = {C. Wong and A. Chandra},
title = {Bounds for the string editing problem},
journal = jacm,
volume = {23},
year = {1976},
pages = {13--16}
}
@phdthesis{Wra75,
author = {C. Wrathall},
title = {Subrecursive predicates and automata},
school = {Harvard University},
year = {1975},
note = {Reprinted and available via the Department of
Mathematics, Univ. of CA at Santa Barbara}
}
@article{Wra77,
author = {C. Wrathall},
title = {Complete sets and the polynomial-time hierarchy},
journal = tcs,
volume = {3},
year = {1977},
pages = {23--33}
}
@article{Wra78,
author = {C. Wrathall},
title = {Rudimentary predicates and relative computation},
journal = sicomp,
volume = {7},
year = {1978},
pages = {194--209}
}
@inproceedings{WuKu91,
author = {I.-C. Wu and H.T. Kung},
title = {Communication complexity for parallel divide-and-conquer},
booktitle = proc32 # focs,
year = {1991},
pages = {151--162}
}
@article{WuTa92,
author = {L. Wu and C. Tang},
title = {Solving the satisfiability problem by using randomized
approach},
journal = ipl,
volume = {41},
year = {1992},
pages = {187--190}
}
@inproceedings{Yan88,
author = {T. Yamakami},
title = {Computational complexity of languages counting random
oracles},
booktitle = {nnn},
year = {1988},
pages = {189--202}
}
@inproceedings{Yao77,
author = {A. Yao},
title = {Probabilistic computations: Toward a unified measure
of complexity},
booktitle = proc18 # focs,
year = {1977},
pages = {222--227}
}
@inproceedings{Yao79,
author = {A.~Yao},
title = {Some complexity questions related to distributive computing},
booktitle = proc11 # stoc,
year = {1979},
pages = {209--213}
}
@inproceedings{Yao81,
author = {A. Yao},
title = {The entropic limits of {VLSI} computations},
booktitle = proc13 # stoc,
year = {1981},
pages = {308--311}
}
@inproceedings{Yao82,
author = {A. Yao},
title = {Theory and applications of trapdoor functions},
booktitle = proc23 # focs,
year = {1982},
pages = {80--91}
}
@inproceedings{Yao85,
author = {A.~Yao},
title = {Separating the polynomial-time hierarchy by oracles},
booktitle = proc26 # focs,
year = {1985},
pages = {1--10}
}
@inproceedings{Yao88,
author = {A. Yao},
title = {Near-optimal time-space tradeoff for element distinctness},
booktitle = proc29 # focs,
year = {1988},
pages = {91--97}
}
@inproceedings{Yao89,
author = {A. Yao},
title = {Circuits and local computation},
booktile = proc21 # stoc,
year = {1989},
pages = {186--196}
}
@inproceedings{Yao90,
author = {A. Yao},
title = {On {ACC} and threshold circuits},
booktitle = proc31 # focs,
year = {1990},
pages = {619--627}
}
@article{Yao92,
author = {X. Yao},
title = {Finding approximate solutions to {NP}-hard problems by
neural networks is hard},
journal = ipl,
volume = {41},
year = {1992},
pages = {93--98}
}
@inproceedings{Yao94,
author = {A. Yao},
title = {Decision tree complexity and {B}etti numbers},
booktitle = proc26 # stoc,
year = {1994},
pages = {615--624}
}
@article{Yat66,
author = {C. Yates},
title = {On the degrees of index sets},
journal = trans-ams,
volume = {121},
year = {1966},
pages = {309--328}
}
@article{Yat69,
author = {C. Yates},
title = {On the degrees of index sets {II}},
journal = trans-ams,
volume = {135},
year = {1969},
pages = {249--266}
}
@article{Yes84,
author = {Y. Yesha},
title = {Time-space tradeoffs for matrix multiplication
and the discrete Fourier transform on any general sequential
random-access computer},
journal = jcss,
volume = {29},
year = {1984},
pages = {183--197}
}
@article{You77,
author = {P. Young},
title = {Optimization among provably equivalent programs},
journal = jacm,
volume = {24},
year = {1977},
pages = {693--700}
}
@ARTICLE{Zac82,
AUTHOR = {S. Zachos},
TITLE = {Robustness of probabilistic computational complexity
classes under definitional perturbations},
JOURNAL = infcomp,
YEAR = {1982},
VOLUME = {54},
PAGES = {143--154}
}
@ARTICLE{ZaHe86,
AUTHOR = {S. Zachos and H. Heller},
TITLE = {A decisive characterization of {$\BPP$}},
JOURNAL = infcomp,
YEAR = {1986},
VOLUME = {69},
PAGES = {125--135}
}
@ARTICLE{Zac88,
AUTHOR = {S. Zachos},
TITLE = {Probabilistic quantifiers and games},
JOURNAL = jcss,
YEAR = {1988},
VOLUME = {36},
PAGES = {433--451}
}
@inproceedings{Zar94,
author = {C. Zarowski},
title = {A divisionless form of the {S}chur-{B}erlekamp-{M}assey
algorithm},
booktitle = {Information Theory and Applications---Proceedings,
Third Canadian Workshop, May/June 1993},
series = lncs,
volume = {793},
year = {1994},
pages = {38--44}
}
@inproceedings{Zem94,
author = {G. Z{\'e}mor},
title = {Threshold effects in codes},
booktitle = {Algebraic Coding---First French-Israeli Workshop,
Paris, July 1993},
series = lncs,
volume = {781},
publisher = springer,
year = {1994},
pages = {278--286}
}
@article{Zha91,
author = {W. Zhang},
title = {Cut elimination and automatic proof procedures},
journal = tcs,
volume = {91},
year = {1991},
pages = {265--284}
}
@inproceedings{ZBT93,
author = {Z.-L. Zhang and D. Mix Barrington and J. Tarui},
title = {Computing symmetric functions with {\it AND/OR\/}
circuits and a single {\it MAJORITY\/} gate},
booktitle = proc10 # stacs,
publisher = springer,
series = lncs,
volume = {665},
year = {1993},
pages = {535--544}
}
@article{Zim92,
author = {M. Zimand},
title = {Pr{\'e}cisions sur la m{\'e}thode topologique en
complexit{\'e} algorithmique},
journal = {Singularit{\'e}},
volume = {3},
number = {7},
year = {1992},
pages = {25--27}
}
@techreport{Zim93,
author = {M. Zimand},
title = {On the topological size of p-m-complete degrees},
institution = {Computer Science, University of Rochester},
number = {459},
month = {May},
year = {1993}
}
@inproceedings{Zip79,
author = {R. Zippel},
title = {Probabilistic algorithms for sparse polynomials},
booktitle = {Proc. EUROSAM '79},
series = lncs,
volume = {72},
publisher = springer,
year = {1979},
pages = {216--226}
}
@inproceedings{Zuc91,
author = {D. Zuckerman},
title = {Simulating {BPP} using a general weak random source},
booktitle = proc32 # focs,
year = {1991},
pages = {79--89}
}