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/tcs143.bht:"
download as .bib file
@article{DBLP:journals/tcs/AntimirovM95,
author = {Valentin M. Antimirov and
Peter D. Mosses},
title = {Rewriting Extended Regular Expressions},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {1},
pages = {51--72},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)80024-4},
doi = {10.1016/0304-3975(95)80024-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AntimirovM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BenderGM95,
author = {Michael A. Bender and
Michel Gastaldo and
Michel Morvan},
title = {Parallel Interval Order Recognition and Construction of Interval Representations},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {1},
pages = {73--91},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)80025-5},
doi = {10.1016/0304-3975(95)80025-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BenderGM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Chen95,
author = {Zhi{-}Zhong Chen},
title = {The Maximal f-Dependent Set Problem for Planar Graphs is in {NC}},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {2},
pages = {309--318},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00112-V},
doi = {10.1016/0304-3975(94)00112-V},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Chen95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrescenziP95,
author = {Pierluigi Crescenzi and
Christos H. Papadimitriou},
title = {Reversible Simulation of Space-Bounded Computations},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {1},
pages = {159--165},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)80031-4},
doi = {10.1016/0304-3975(95)80031-4},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CrescenziP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FraenkelJKS95,
author = {Aviezri S. Fraenkel and
Alan Jaffray and
Anton Kotzig and
Gert Sabidussi},
title = {Modular Nim},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {2},
pages = {319--333},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00260-P},
doi = {10.1016/0304-3975(94)00260-P},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FraenkelJKS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GoldsteinR95,
author = {Arthur S. Goldstein and
Edward M. Reingold},
title = {The Complexity of Pursuit on a Graph},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {1},
pages = {93--112},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)80026-6},
doi = {10.1016/0304-3975(95)80026-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GoldsteinR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GubasHW95,
author = {Xaver Gub{\'{a}}s and
Juraj Hromkovic and
Juraj Waczul{\'{\i}}k},
title = {A Nonlinear Lower Bound on the Practical Combinational Complexity},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {2},
pages = {335--342},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00269-O},
doi = {10.1016/0304-3975(94)00269-O},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GubasHW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Harrison95,
author = {John Harrison},
title = {Dynamical Properties of {PWD0L} Systems},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {2},
pages = {269--284},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00109-V},
doi = {10.1016/0304-3975(94)00109-V},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Harrison95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ItoITW95,
author = {Akira Ito and
Katsushi Inoue and
Itsuo Takanami and
Yue Wang},
title = {Optimal Simulation of Two-Dimensional Alternating Finite Automata
by Three-Way Nondeterministic Turing Machines},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {1},
pages = {123--135},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)80028-8},
doi = {10.1016/0304-3975(95)80028-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ItoITW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JiangT95,
author = {Tao Jiang and
Vadim G. Timkovsky},
title = {Shortest Consistent Superstrings Computable in Polynomial Time},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {1},
pages = {113--122},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)80027-7},
doi = {10.1016/0304-3975(95)80027-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JiangT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JiangWZ95,
author = {Tao Jiang and
Lusheng Wang and
Kaizhong Zhang},
title = {Alignment of Trees - An Alternative to Tree Edit},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {1},
pages = {137--148},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)80029-9},
doi = {10.1016/0304-3975(95)80029-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JiangWZ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JuedesL95,
author = {David W. Juedes and
Jack H. Lutz},
title = {Weak Completeness in {E} and E{\_}2},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {1},
pages = {149--158},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)80030-D},
doi = {10.1016/0304-3975(95)80030-D},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/JuedesL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KrithivasanM95,
author = {Kamala Krithivasan and
Meena Mahajan},
title = {Nondeterministic, Probabilistic and Alternating Computations on Cellular
Array Models},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {1},
pages = {23--49},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)80023-3},
doi = {10.1016/0304-3975(95)80023-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KrithivasanM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Malgouyres95,
author = {R{\'{e}}my Malgouyres},
title = {Graphs Generalizing Closed Curves with Linear Construction of the
Hamiltonian Cycle - Parametrization of Discretized Curves},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {2},
pages = {189--249},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00134-5},
doi = {10.1016/0304-3975(94)00134-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Malgouyres95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Matamala95,
author = {Mart{\'{\i}}n Matamala},
title = {Recursive Construction of Periodic Steady State for Neural Networks},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {2},
pages = {251--267},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00114-X},
doi = {10.1016/0304-3975(94)00114-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Matamala95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Miltersen95,
author = {Peter Bro Miltersen},
title = {On the Cell Probe Complexity of Polynomial Evaluation},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {1},
pages = {167--174},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)80032-5},
doi = {10.1016/0304-3975(95)80032-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Miltersen95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PriscoPP95,
author = {Roberto De Prisco and
Giuseppe Parlati and
Giuseppe Persiano},
title = {Minimal Path Length of Trees with Known Fringe},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {1},
pages = {175--188},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)80033-6},
doi = {10.1016/0304-3975(95)80033-6},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/PriscoPP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rytter95,
author = {Wojciech Rytter},
title = {Context-Free Recognition via Shortest Paths Computation: {A} Version
of Valiant's Algorithm},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {2},
pages = {343--352},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00265-K},
doi = {10.1016/0304-3975(94)00265-K},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rytter95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SlutzkiV95,
author = {Giora Slutzki and
S{\'{a}}ndor V{\'{a}}gv{\"{o}}lgyi},
title = {Deterministic Top-Down Tree Transducers with Iterated Lookahead},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {2},
pages = {285--308},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00111-U},
doi = {10.1016/0304-3975(94)00111-U},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SlutzkiV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/VanSL95,
author = {Do Long Van and
Bertrand Le Sa{\"{e}}c and
Igor Litovsky},
title = {Characterizations of Rational omega-Languages by Means of Right Congruences},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {1},
pages = {1--21},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)80022-2},
doi = {10.1016/0304-3975(95)80022-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/VanSL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Zhang95,
author = {Louxin Zhang},
title = {On the Approximation of Longest Common Nonsupersequences and Shortest
Common Nonsubsequences},
journal = {Theor. Comput. Sci.},
volume = {143},
number = {2},
pages = {353--362},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00257-J},
doi = {10.1016/0304-3975(94)00257-J},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Zhang95.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-04-27 06:11 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:
