Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/AndreevCR96,
  author       = {Alexander E. Andreev and
                  Andrea E. F. Clementi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Constructing the Highest Degree Subgraph for Dense Graphs is in {NCAS}},
  journal      = {Theor. Comput. Sci.},
  volume       = {161},
  number       = {1{\&}2},
  pages        = {307--314},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(96)00014-X},
  doi          = {10.1016/0304-3975(96)00014-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AndreevCR96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Carrere96,
  author       = {F. Carrere},
  title        = {On the Kleijn-Rozenberg k-Adjacent Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {161},
  number       = {1{\&}2},
  pages        = {23--68},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(95)00084-4},
  doi          = {10.1016/0304-3975(95)00084-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Carrere96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Carton96,
  author       = {Olivier Carton},
  title        = {Chain Automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {161},
  number       = {1{\&}2},
  pages        = {191--203},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(95)00103-4},
  doi          = {10.1016/0304-3975(95)00103-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Carton96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Chen96,
  author       = {Zhi{-}Zhong Chen},
  title        = {Parallel Constructions of Maximal Path Sets and Applications to Short
                  Superstrings},
  journal      = {Theor. Comput. Sci.},
  volume       = {161},
  number       = {1{\&}2},
  pages        = {1--21},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(95)00110-7},
  doi          = {10.1016/0304-3975(95)00110-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Chen96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CuckerS96,
  author       = {Felipe Cucker and
                  Mike Shub},
  title        = {Generalized Knapsack Problems and Fixed Degree Separations},
  journal      = {Theor. Comput. Sci.},
  volume       = {161},
  number       = {1{\&}2},
  pages        = {301--306},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(96)00002-3},
  doi          = {10.1016/0304-3975(96)00002-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CuckerS96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FortnowK96,
  author       = {Lance Fortnow and
                  Martin Kummer},
  title        = {On Resource-Bounded Instance Complexity},
  journal      = {Theor. Comput. Sci.},
  volume       = {161},
  number       = {1{\&}2},
  pages        = {123--140},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(95)00097-6},
  doi          = {10.1016/0304-3975(95)00097-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FortnowK96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FulkJ96,
  author       = {Mark A. Fulk and
                  Sanjay Jain},
  title        = {Learning in the Presence of Inaccurate Information},
  journal      = {Theor. Comput. Sci.},
  volume       = {161},
  number       = {1{\&}2},
  pages        = {235--261},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(95)00135-2},
  doi          = {10.1016/0304-3975(95)00135-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FulkJ96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HarjuLM96,
  author       = {Tero Harju and
                  Marjo Lipponen and
                  Alexandru Mateescu},
  title        = {Flatwords and Post Correspondence Problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {161},
  number       = {1{\&}2},
  pages        = {93--108},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(95)00092-5},
  doi          = {10.1016/0304-3975(95)00092-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HarjuLM96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HotzP96,
  author       = {G{\"{u}}nter Hotz and
                  Gisela Pitsch},
  title        = {On Parsing Coupled-Context-Free Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {161},
  number       = {1{\&}2},
  pages        = {205--233},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(95)00114-X},
  doi          = {10.1016/0304-3975(95)00114-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HotzP96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LabhallaLM96,
  author       = {Salah Labhalla and
                  Henri Lombardi and
                  Roger Marlin},
  title        = {Algorithmes de calcul de la r{\'{e}}duction de Hermite d'une
                  matrice {\`{a}} coefficients polynomiaux},
  journal      = {Theor. Comput. Sci.},
  volume       = {161},
  number       = {1{\&}2},
  pages        = {69--92},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(95)00090-9},
  doi          = {10.1016/0304-3975(95)00090-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LabhallaLM96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MaruyamaM96,
  author       = {Osamu Maruyama and
                  Satoru Miyano},
  title        = {Inferring a Tree from Walks},
  journal      = {Theor. Comput. Sci.},
  volume       = {161},
  number       = {1{\&}2},
  pages        = {289--300},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(95)00156-5},
  doi          = {10.1016/0304-3975(95)00156-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MaruyamaM96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MayerS96,
  author       = {Alain J. Mayer and
                  Larry J. Stockmeyer},
  title        = {The Complexity of {PDL} with Interleaving},
  journal      = {Theor. Comput. Sci.},
  volume       = {161},
  number       = {1{\&}2},
  pages        = {109--122},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(95)00095-X},
  doi          = {10.1016/0304-3975(95)00095-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MayerS96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Petersen96,
  author       = {Holger Petersen},
  title        = {On the Language of Primitive Words},
  journal      = {Theor. Comput. Sci.},
  volume       = {161},
  number       = {1{\&}2},
  pages        = {141--156},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(95)00098-4},
  doi          = {10.1016/0304-3975(95)00098-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Petersen96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Regan96,
  author       = {Kenneth W. Regan},
  title        = {Index Sets and Presentations of Complexity Classes},
  journal      = {Theor. Comput. Sci.},
  volume       = {161},
  number       = {1{\&}2},
  pages        = {263--287},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(95)00146-8},
  doi          = {10.1016/0304-3975(95)00146-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Regan96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Selmi96,
  author       = {Carla Selmi},
  title        = {Over Testable Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {161},
  number       = {1{\&}2},
  pages        = {157--190},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(95)00100-X},
  doi          = {10.1016/0304-3975(95)00100-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Selmi96.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.