Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/tcs/tcs88.bht:"
download as .bib file
@article{DBLP:journals/tcs/AizawaN91,
author = {Kunio Aizawa and
Akira Nakamura},
title = {Graph Grammars with Path-Controlled Embedding},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {1},
pages = {151--170},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90079-H},
doi = {10.1016/0304-3975(91)90079-H},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AizawaN91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Baur91,
author = {Walter Baur},
title = {On the Algebraic Complexity of Rational Iteration Procedures},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {2},
pages = {313--324},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90380-K},
doi = {10.1016/0304-3975(91)90380-K},
timestamp = {Wed, 20 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Baur91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BebjakS91,
author = {Andrej Bebj{\'{a}}k and
Ivana Stef{\'{a}}nekov{\'{a}}},
title = {Separation of Deterministic, Nondeterministic and Alternating Complexity
Classes},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {2},
pages = {297--311},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90379-G},
doi = {10.1016/0304-3975(91)90379-G},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BebjakS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoH91,
author = {Sang Cho and
Dung T. Huynh},
title = {Finite-Automaton Aperiodicity is PSPACE-Complete},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {1},
pages = {99--116},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90075-D},
doi = {10.1016/0304-3975(91)90075-D},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoH91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrochemoreR91,
author = {Maxime Crochemore and
Wojciech Rytter},
title = {Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations
on Strings and Arrays},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {1},
pages = {59--82},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90073-B},
doi = {10.1016/0304-3975(91)90073-B},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CrochemoreR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Engelfriet91,
author = {Joost Engelfriet},
title = {A Regular Characterization of Graph Languages Definable in Monadic
Second-Order Logic},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {1},
pages = {139--150},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90078-G},
doi = {10.1016/0304-3975(91)90078-G},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Engelfriet91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Fulop91,
author = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p},
title = {A Complete Description for a Monoid of Deterministic Bottom-Up Tree
Transformation Classes},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {2},
pages = {253--268},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90376-D},
doi = {10.1016/0304-3975(91)90376-D},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Fulop91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GarzonZ91,
author = {Max H. Garzon and
Yechezkel Zalcstein},
title = {The Complexity of Grigorchuk Groups with Application to Cryptography},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {1},
pages = {83--98},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90074-C},
doi = {10.1016/0304-3975(91)90074-C},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GarzonZ91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GavaldaB91,
author = {Ricard Gavald{\`{a}} and
Jos{\'{e}} L. Balc{\'{a}}zar},
title = {Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse
Sets},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {1},
pages = {1--14},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90070-I},
doi = {10.1016/0304-3975(91)90070-I},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GavaldaB91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Huckenbeck91,
author = {Ulrich Huckenbeck},
title = {A Result about the Power of Geometric Oracle Machines},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {2},
pages = {231--251},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90375-C},
doi = {10.1016/0304-3975(91)90375-C},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Huckenbeck91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/InoueIT91,
author = {Katsushi Inoue and
Akira Ito and
Itsuo Takanami},
title = {A Note on Real-Time One-Way Alternating Multicounter Machines},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {2},
pages = {287--296},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90378-F},
doi = {10.1016/0304-3975(91)90378-F},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/InoueIT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KhullerV91,
author = {Samir Khuller and
Vijay V. Vazirani},
title = {Planar Graph Coloring is not Self-Reducible, Assuming {P} != {NP}},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {1},
pages = {183--189},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90081-C},
doi = {10.1016/0304-3975(91)90081-C},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KhullerV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LabhallaL91,
author = {Salah Labhalla and
Henri Lombardi},
title = {Repr{\'{e}}sentations des nombres r{\'{e}}els par d{\'{e}}veloppements
en base enti{\`{e}}re et complexit{\'{e}}},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {1},
pages = {171--182},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90080-L},
doi = {10.1016/0304-3975(91)90080-L},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LabhallaL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LarsenT91,
author = {Kim Guldstrand Larsen and
Bent Thomsen},
title = {Partial Specifications and Compositional Verification},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {1},
pages = {15--32},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90071-9},
doi = {10.1016/0304-3975(91)90071-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LarsenT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Miyano91,
author = {Satoru Miyano},
title = {Delta{\_}2P-Complete Lexicographically First Maximal Subgraph Problems},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {1},
pages = {33--57},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90072-A},
doi = {10.1016/0304-3975(91)90072-A},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Miyano91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Peeva91,
author = {L. Peeva},
title = {Equivalence, Reduction and Minimization of Finite Automata over Semirings},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {2},
pages = {269--285},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90377-E},
doi = {10.1016/0304-3975(91)90377-E},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Peeva91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Salomaa91,
author = {Arto Salomaa},
title = {A Deterministic Algorithm for Modular Knapsack Problems},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {1},
pages = {127--138},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90077-F},
doi = {10.1016/0304-3975(91)90077-F},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Salomaa91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Seebold91,
author = {Patrice S{\'{e}}{\'{e}}bold},
title = {Fibonacci Morphisms and Sturmian Words},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {2},
pages = {365--384},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90383-D},
doi = {10.1016/0304-3975(91)90383-D},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Seebold91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SekiMFK91,
author = {Hiroyuki Seki and
Takashi Matsumura and
Mamoru Fujii and
Tadao Kasami},
title = {On Multiple Context-Free Grammars},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {2},
pages = {191--229},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90374-B},
doi = {10.1016/0304-3975(91)90374-B},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SekiMFK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShankarA91,
author = {Priti Shankar and
B. S. Adiga},
title = {A Graph-Based Regularity Test for Deterministic Context-free Languages},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {1},
pages = {117--125},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90076-E},
doi = {10.1016/0304-3975(91)90076-E},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ShankarA91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WeberS91,
author = {Andreas Weber and
Helmut Seidl},
title = {On the Degree of Ambiguity of Finite Automata},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {2},
pages = {325--349},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90381-B},
doi = {10.1016/0304-3975(91)90381-B},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WeberS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YooH91,
author = {H. Yoo and
Kosaburo Hashiguchi},
title = {Extended Automata-Like Regular Expressions of Star Degree At Most
(2, 1)},
journal = {Theor. Comput. Sci.},
volume = {88},
number = {2},
pages = {351--363},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90382-C},
doi = {10.1016/0304-3975(91)90382-C},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YooH91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-05-30 10:45 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
