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/tcs188.bht:"
download as .bib file
@article{DBLP:journals/tcs/AlloucheHPPS97,
author = {Jean{-}Paul Allouche and
Fritz von Haeseler and
Heinz{-}Otto Peitgen and
A. Petersen and
Guentcho Skordev},
title = {Automaticity of Double Sequences Generated by One-Dimensional Linear
Cellular Automata},
journal = {Theor. Comput. Sci.},
volume = {188},
number = {1-2},
pages = {195--209},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00298-8},
doi = {10.1016/S0304-3975(96)00298-8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AlloucheHPPS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Cerny97,
author = {Anton Cern{\'{y}}},
title = {On Sequences Resulting from Iteration of Modified Quadratic and Palindromic
Mappings},
journal = {Theor. Comput. Sci.},
volume = {188},
number = {1-2},
pages = {161--174},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00294-0},
doi = {10.1016/S0304-3975(96)00294-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Cerny97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChR97,
author = {Eric Goles Ch. and
Ivan Rapaport},
title = {Complexity of Tile Rotation Problems},
journal = {Theor. Comput. Sci.},
volume = {188},
number = {1-2},
pages = {129--159},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00291-5},
doi = {10.1016/S0304-3975(96)00291-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FreivaldsJ97,
author = {Rusins Freivalds and
Sanjay Jain},
title = {Kolmogorov Numberings and Minimal Identification},
journal = {Theor. Comput. Sci.},
volume = {188},
number = {1-2},
pages = {175--194},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00295-2},
doi = {10.1016/S0304-3975(96)00295-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FreivaldsJ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Grolmusz97,
author = {Vince Grolmusz},
title = {On the Power of Circuits with Gates of Low L\({}_{\mbox{1}}\) Norms},
journal = {Theor. Comput. Sci.},
volume = {188},
number = {1-2},
pages = {117--128},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00290-3},
doi = {10.1016/S0304-3975(96)00290-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Grolmusz97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Gyuris97,
author = {Viktor Gyuris},
title = {A Short Proof of Representability of Fork Algebras},
journal = {Theor. Comput. Sci.},
volume = {188},
number = {1-2},
pages = {211--220},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00299-X},
doi = {10.1016/S0304-3975(96)00299-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Gyuris97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Heen97,
author = {Olivier Heen},
title = {Linear Speed-Up for Cellular Automata Synchronizers and Applications},
journal = {Theor. Comput. Sci.},
volume = {188},
number = {1-2},
pages = {45--57},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00211-3},
doi = {10.1016/S0304-3975(96)00211-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Heen97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Liu97,
author = {Renren Liu},
title = {An Improved Shellsort Algorithm},
journal = {Theor. Comput. Sci.},
volume = {188},
number = {1-2},
pages = {241--247},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(97)00100-X},
doi = {10.1016/S0304-3975(97)00100-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Liu97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LongMZ97,
author = {Dongyang Long and
Jian Ma and
Duanning Zhou},
title = {Structure of 3-Infix-Outfix Maximal Codes},
journal = {Theor. Comput. Sci.},
volume = {188},
number = {1-2},
pages = {231--240},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(97)00097-2},
doi = {10.1016/S0304-3975(97)00097-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LongMZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Nagaraj97,
author = {S. V. Nagaraj},
title = {Optimal Binary Search Trees},
journal = {Theor. Comput. Sci.},
volume = {188},
number = {1-2},
pages = {1--44},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00320-9},
doi = {10.1016/S0304-3975(96)00320-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Nagaraj97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ReganV97,
author = {Kenneth W. Regan and
Heribert Vollmer},
title = {Gap-Languages and Log-Time Complexity Classes},
journal = {Theor. Comput. Sci.},
volume = {188},
number = {1-2},
pages = {101--116},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00288-5},
doi = {10.1016/S0304-3975(96)00288-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ReganV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Romanik97,
author = {Kathleen Romanik},
title = {Approximate Testing and Its Relationship to Learning},
journal = {Theor. Comput. Sci.},
volume = {188},
number = {1-2},
pages = {79--99},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00241-1},
doi = {10.1016/S0304-3975(96)00241-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Romanik97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sen97,
author = {Sandeep Sen},
title = {Lower Bounds for Parallel Algebraic Decision Trees, Parallel Complexity
of Convex Hulls and Related Problems},
journal = {Theor. Comput. Sci.},
volume = {188},
number = {1-2},
pages = {59--78},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00212-5},
doi = {10.1016/S0304-3975(96)00212-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Sen97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Shen97,
author = {Hong Shen},
title = {Optimal Algorithms for Generalized Searching in Sorted Matrices},
journal = {Theor. Comput. Sci.},
volume = {188},
number = {1-2},
pages = {221--230},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(97)00027-3},
doi = {10.1016/S0304-3975(97)00027-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Shen97.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 20:34 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:
