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/tcs145.bht:"
download as .bib file
@article{DBLP:journals/tcs/Benson95,
author = {Gary Benson},
title = {A Space Efficient Algorithm for Finding the Best Nonoverlapping Alignment
Score},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {357--369},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)92848-R},
doi = {10.1016/0304-3975(95)92848-R},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Benson95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiranMZ95,
author = {Ofer Biran and
Shlomo Moran and
Shmuel Zaks},
title = {Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {271--290},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00157-E},
doi = {10.1016/0304-3975(94)00157-E},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BiranMZ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BragaCFV95,
author = {G. Braga and
Gianpiero Cattaneo and
Paola Flocchini and
C. Quaranta Vogliotti},
title = {Pattern Growth in Elementary Cellular Automata},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {1--26},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00155-C},
doi = {10.1016/0304-3975(94)00155-C},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BragaCFV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BreitbartHR95,
author = {Yuri Breitbart and
Harry B. Hunt III and
Daniel J. Rosenkrantz},
title = {On the Size of Binary Decision Diagrams Representing Boolean Functions},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {45--69},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00181-H},
doi = {10.1016/0304-3975(94)00181-H},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BreitbartHR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaiP95,
author = {Jiazhen Cai and
Robert Paige},
title = {Using Multiset Discrimination to Solve Language Processing Problems
Without Hashing},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {189--228},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00183-J},
doi = {10.1016/0304-3975(94)00183-J},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaiP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Creignou95,
author = {Nadia Creignou},
title = {The Class of Problems That are Linearly Equivalent to Satisfiability
or a Uniform Method for Proving NP-Completeness},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {111--145},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00182-I},
doi = {10.1016/0304-3975(94)00182-I},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Creignou95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DiksKMP95,
author = {Krzysztof Diks and
Evangelos Kranakis and
Adam Malinowski and
Andrzej Pelc},
title = {Anonymous Wireless Rings},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {95--109},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00178-L},
doi = {10.1016/0304-3975(94)00178-L},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DiksKMP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DrewesHKT95,
author = {Frank Drewes and
Annegret Habel and
Hans{-}J{\"{o}}rg Kreowski and
Stefan Taubenberger},
title = {Generating Self-Affine Fractals by Collage Grammars},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {159--187},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00118-3},
doi = {10.1016/0304-3975(94)00118-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DrewesHKT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GinsburgT95,
author = {Seymour Ginsburg and
Katsumi Tanaka},
title = {Interval Queries on Object Histories},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {291--316},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00133-4},
doi = {10.1016/0304-3975(94)00133-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GinsburgT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HemaspaandraJ95,
author = {Lane A. Hemaspaandra and
Zhigen Jiang},
title = {P-Selectivity: Intersections and Indices},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {371--380},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00290-Y},
doi = {10.1016/0304-3975(94)00290-Y},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HemaspaandraJ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JamisonO95,
author = {Beverly Jamison and
Stephan Olariu},
title = {A Linear-Time Recognition Algorithm for P4-Reducible Graphs},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {329--344},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)00016-P},
doi = {10.1016/0304-3975(95)00016-P},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JamisonO95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ko95,
author = {Ker{-}I Ko},
title = {A Polynomial-Time Computable Curve whose Interior has a Nonrecursive
Measure},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {241--270},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00154-B},
doi = {10.1016/0304-3975(94)00154-B},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ko95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Leiss95,
author = {Ernst L. Leiss},
title = {Implicit Language Equations: Existence and Uniqueness of Solutions},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {71--93},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00176-J},
doi = {10.1016/0304-3975(94)00176-J},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Leiss95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Maler95,
author = {Oded Maler},
title = {A Decomposition Theorem for Probabilistic Transition Systems},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {391--396},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)00004-G},
doi = {10.1016/0304-3975(95)00004-G},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Maler95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Middendorf95,
author = {Martin Middendorf},
title = {On Finding Minimal, Maximal, and Consistent Sequences over a Binary
Alphabet},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {317--327},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)00014-N},
doi = {10.1016/0304-3975(95)00014-N},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Middendorf95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ReutenauerS95,
author = {Christophe Reutenauer and
Marcel Paul Sch{\"{u}}tzenberger},
title = {Vari{\'{e}}t{\'{e}}s et fonctions rationnelles},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {229--240},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00180-Q},
doi = {10.1016/0304-3975(94)00180-Q},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ReutenauerS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SrikrishnaR95,
author = {G. Srikrishna and
C. Pandu Rangan},
title = {Optimal Parallel Algorithms for Path Problems on Planar Graphs},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {27--43},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00189-P},
doi = {10.1016/0304-3975(94)00189-P},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SrikrishnaR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Stewart95,
author = {Iain A. Stewart},
title = {Complete Problems for Monotone {NP}},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {147--157},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00175-I},
doi = {10.1016/0304-3975(94)00175-I},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Stewart95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Teng95,
author = {Shang{-}Hua Teng},
title = {Independent Sets Versus Perfect Matchings},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {381--390},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00289-U},
doi = {10.1016/0304-3975(94)00289-U},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Teng95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangS95,
author = {Liang Zhang and
Zhonghui Shen},
title = {Completion of Recognizable Bifix Codes},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
pages = {345--355},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00300-8},
doi = {10.1016/0304-3975(94)00300-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZhangS95.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-06-04 22:38 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:
