Search dblp for Publications

export results for "toc:db/journals/tcs/tcs84.bht:"

 download as .bib file

@article{DBLP:journals/tcs/BaldwinS91,
  author       = {William A. Baldwin and
                  George O. Strawn},
  title        = {Multidimensional Trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {84},
  number       = {2},
  pages        = {293--311},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90165-X},
  doi          = {10.1016/0304-3975(91)90165-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BaldwinS91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BeauquierP91,
  author       = {Dani{\`{e}}le Beauquier and
                  Jean{-}Eric Pin},
  title        = {Languages and Scanners},
  journal      = {Theor. Comput. Sci.},
  volume       = {84},
  number       = {1},
  pages        = {3--21},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90258-4},
  doi          = {10.1016/0304-3975(91)90258-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BeauquierP91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BeckerS91,
  author       = {Bernd Becker and
                  Uwe Sparmann},
  title        = {Computations over Finite Monoids and their Test Complexity},
  journal      = {Theor. Comput. Sci.},
  volume       = {84},
  number       = {2},
  pages        = {225--250},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90161-T},
  doi          = {10.1016/0304-3975(91)90161-T},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BeckerS91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Beigel91,
  author       = {Richard Beigel},
  title        = {Bounded Queries to {SAT} and the Boolean Hierarchy},
  journal      = {Theor. Comput. Sci.},
  volume       = {84},
  number       = {2},
  pages        = {199--223},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90160-4},
  doi          = {10.1016/0304-3975(91)90160-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Beigel91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BrassardCY91,
  author       = {Gilles Brassard and
                  Claude Cr{\'{e}}peau and
                  Moti Yung},
  title        = {Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols},
  journal      = {Theor. Comput. Sci.},
  volume       = {84},
  number       = {1},
  pages        = {23--52},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90259-5},
  doi          = {10.1016/0304-3975(91)90259-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BrassardCY91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Bruyere91,
  author       = {V{\'{e}}ronique Bruy{\`{e}}re},
  title        = {Maximal Codes With Bounded Deciphering Delay},
  journal      = {Theor. Comput. Sci.},
  volume       = {84},
  number       = {1},
  pages        = {53--76},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90260-9},
  doi          = {10.1016/0304-3975(91)90260-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Bruyere91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChazelleEGS91,
  author       = {Bernard Chazelle and
                  Herbert Edelsbrunner and
                  Leonidas J. Guibas and
                  Micha Sharir},
  title        = {A Singly Exponential Stratification Scheme for Real Semi-Algebraic
                  Varieties and its Applications},
  journal      = {Theor. Comput. Sci.},
  volume       = {84},
  number       = {1},
  pages        = {77--105},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90261-Y},
  doi          = {10.1016/0304-3975(91)90261-Y},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChazelleEGS91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ClausenDGK91,
  author       = {Michael Clausen and
                  Andreas W. M. Dress and
                  Johannes Grabmeier and
                  Marek Karpinski},
  title        = {On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials
                  Over Finite Fields},
  journal      = {Theor. Comput. Sci.},
  volume       = {84},
  number       = {2},
  pages        = {151--164},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90157-W},
  doi          = {10.1016/0304-3975(91)90157-W},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ClausenDGK91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DassowJ91,
  author       = {J{\"{u}}rgen Dassow and
                  Helmut J{\"{u}}rgensen},
  title        = {Deterministic Soliton Automata with a Single Exterior Node},
  journal      = {Theor. Comput. Sci.},
  volume       = {84},
  number       = {2},
  pages        = {281--292},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90164-W},
  doi          = {10.1016/0304-3975(91)90164-W},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DassowJ91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GambosiNT91,
  author       = {Giorgio Gambosi and
                  Enrico Nardelli and
                  Maurizio Talamo},
  title        = {A Pointer-Free Data Structure for Merging Heaps and Min-Max Heaps},
  journal      = {Theor. Comput. Sci.},
  volume       = {84},
  number       = {1},
  pages        = {107--126},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90262-Z},
  doi          = {10.1016/0304-3975(91)90262-Z},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GambosiNT91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MaurerSW91,
  author       = {Hermann A. Maurer and
                  Arto Salomaa and
                  Derick Wood},
  title        = {Bounded Delay {L} Codes},
  journal      = {Theor. Comput. Sci.},
  volume       = {84},
  number       = {2},
  pages        = {265--279},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90163-V},
  doi          = {10.1016/0304-3975(91)90163-V},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MaurerSW91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MoranW91,
  author       = {Shlomo Moran and
                  Yaron Wolfsthal},
  title        = {Optimal Covering of Cacti by Vertex-Disjoint Paths},
  journal      = {Theor. Comput. Sci.},
  volume       = {84},
  number       = {2},
  pages        = {179--197},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90159-Y},
  doi          = {10.1016/0304-3975(91)90159-Y},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MoranW91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/PapadimitriouY91,
  author       = {Christos H. Papadimitriou and
                  Mihalis Yannakakis},
  title        = {Shortest Paths Without a Map},
  journal      = {Theor. Comput. Sci.},
  volume       = {84},
  number       = {1},
  pages        = {127--150},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90263-2},
  doi          = {10.1016/0304-3975(91)90263-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/PapadimitriouY91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Rupert91,
  author       = {C. P. Rupert},
  title        = {Which Kleene Semigroups are Finite?},
  journal      = {Theor. Comput. Sci.},
  volume       = {84},
  number       = {2},
  pages        = {251--264},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90162-U},
  doi          = {10.1016/0304-3975(91)90162-U},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Rupert91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Saoudi91,
  author       = {Ahmed Saoudi},
  title        = {Generalized Automata on Infinite Trees and Muller-McNaughton's Theorem},
  journal      = {Theor. Comput. Sci.},
  volume       = {84},
  number       = {2},
  pages        = {165--177},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90158-X},
  doi          = {10.1016/0304-3975(91)90158-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Saoudi91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.