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/tcs304.bht:"
download as .bib file
@article{DBLP:journals/tcs/BertetGM03,
author = {Karell Bertet and
Jens Gustedt and
Michel Morvan},
title = {Weak-order extensions of an order},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {249--268},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00132-4},
doi = {10.1016/S0304-3975(03)00132-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BertetGM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrunettiD03,
author = {Sara Brunetti and
Alain Daurat},
title = {An algorithm reconstructing convex lattice sets},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {35--57},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00050-1},
doi = {10.1016/S0304-3975(03)00050-1},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BrunettiD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaoW03,
author = {Wei{-}Ting Cao and
Zhi{-}Ying Wen},
title = {Some properties of the factors of Sturmian sequences},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {365--385},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00213-5},
doi = {10.1016/S0304-3975(03)00213-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaoW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Carpentieri03,
author = {Marco Carpentieri},
title = {On the simulation of quantum turing machines},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {103--128},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00054-9},
doi = {10.1016/S0304-3975(03)00054-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Carpentieri03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenX03,
author = {Guangting Chen and
Guoliang Xue},
title = {A {PTAS} for weight constrained Steiner trees in series-parallel graphs},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {237--247},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00088-4},
doi = {10.1016/S0304-3975(03)00088-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenX03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChengDMNRSW03,
author = {Maggie Xiaoyan Cheng and
Xiufeng Du and
Manki Min and
Hung Q. Ngo and
Lu Ruan and
Jianhua Sun and
Weili Wu},
title = {Super link-connectivity of iterated line digraphs},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {461--469},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00282-2},
doi = {10.1016/S0304-3975(03)00282-2},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChengDMNRSW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrescenziLGLPR03,
author = {Pierluigi Crescenzi and
Alberto Del Lungo and
Roberto Grossi and
Elena Lodi and
Linda Pagli and
Gianluca Rossi},
title = {Text sparsification via local maxima},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {341--364},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00142-7},
doi = {10.1016/S0304-3975(03)00142-7},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CrescenziLGLPR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DartnellMS03,
author = {Pablo Dartnell and
Alejandro Maass and
Fernando Schwartz},
title = {Combinatorial constructions associated to the dynamics of one-sided
cellular automata},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {485--497},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00290-1},
doi = {10.1016/S0304-3975(03)00290-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DartnellMS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DemaineLM03,
author = {Erik D. Demaine and
Alejandro L{\'{o}}pez{-}Ortiz and
J. Ian Munro},
title = {On universally easy classes for NP-complete problems},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {471--476},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00286-X},
doi = {10.1016/S0304-3975(03)00286-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DemaineLM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FeigenbaumKSS03,
author = {Joan Feigenbaum and
Arvind Krishnamurthy and
Rahul Sami and
Scott Shenker},
title = {Hardness results for multicast cost sharing},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {215--236},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00085-9},
doi = {10.1016/S0304-3975(03)00085-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FeigenbaumKSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FormentiG03,
author = {Enrico Formenti and
Aristide Grange},
title = {Number conserving cellular automata {II:} dynamics},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {269--290},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00134-8},
doi = {10.1016/S0304-3975(03)00134-8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FormentiG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Fukuyama03,
author = {Masahiko Fukuyama},
title = {A Nim game played on graphs},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {387--399},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00292-5},
doi = {10.1016/S0304-3975(03)00292-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Fukuyama03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Fukuyama03a,
author = {Masahiko Fukuyama},
title = {A Nim game played on graphs {II}},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {401--419},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00293-7},
doi = {10.1016/S0304-3975(03)00293-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Fukuyama03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FulopG03,
author = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Zsolt Gazdag},
title = {Shape preserving top-down tree transducers},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {315--339},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00140-3},
doi = {10.1016/S0304-3975(03)00140-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FulopG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GasarchGS03,
author = {William I. Gasarch and
Evan Golub and
Aravind Srinivasan},
title = {When does a random Robin Hood win?},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {477--484},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00289-5},
doi = {10.1016/S0304-3975(03)00289-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GasarchGS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Hachaichi03,
author = {Yassine Hacha{\"{\i}}chi},
title = {A descriptive complexity approach to the linear hierarchy},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {421--429},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00133-6},
doi = {10.1016/S0304-3975(03)00133-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Hachaichi03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HashiguchiWJ03,
author = {Kosaburo Hashiguchi and
Yoshito Wada and
Shuji Jimbo},
title = {Regular binoid expressions and regular binoid languages},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {291--313},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00137-3},
doi = {10.1016/S0304-3975(03)00137-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HashiguchiWJ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Hitchcock03,
author = {John M. Hitchcock},
title = {Fractal dimension and logarithmic loss unpredictability},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {431--441},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00138-5},
doi = {10.1016/S0304-3975(03)00138-5},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Hitchcock03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kucera03,
author = {Anton{\'{\i}}n Kucera},
title = {The complexity of bisimilarity-checking for one-counter processes},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {157--183},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00081-1},
doi = {10.1016/S0304-3975(03)00081-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Kucera03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeeIM03,
author = {Jia Lee and
Katsunobu Imai and
Kenichi Morita},
title = {Simulation of one-dimensional cellular automata by uniquely parallel
parsable grammars},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {185--200},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00083-5},
doi = {10.1016/S0304-3975(03)00083-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeeIM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiskiewiczOT03,
author = {Maciej Liskiewicz and
Mitsunori Ogihara and
Seinosuke Toda},
title = {The complexity of counting self-avoiding walks in subgraphs of two-dimensional
grids and hypercubes},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {129--156},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00080-X},
doi = {10.1016/S0304-3975(03)00080-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiskiewiczOT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LouchardP03,
author = {Guy Louchard and
Helmut Prodinger},
title = {Ascending runs of sequences of geometrically distributed random variables:
a probabilistic analysis},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {59--86},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00051-3},
doi = {10.1016/S0304-3975(03)00051-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LouchardP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MuchnikSU03,
author = {Andrei A. Muchnik and
Alexei L. Semenov and
Maxim Ushakov},
title = {Almost periodic sequences},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {1--33},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00847-2},
doi = {10.1016/S0304-3975(02)00847-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MuchnikSU03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NaAIP03,
author = {Joong Chae Na and
Alberto Apostolico and
Costas S. Iliopoulos and
Kunsoo Park},
title = {Truncated suffix trees and their application to data compression},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {87--101},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00053-7},
doi = {10.1016/S0304-3975(03)00053-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NaAIP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Popov03,
author = {V. Y. Popov},
title = {The approximate period problem for {DNA} alphabet},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {443--447},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00211-1},
doi = {10.1016/S0304-3975(03)00211-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Popov03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sheng03,
author = {Li Sheng},
title = {2-Role assignments on triangulated graphs},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {201--214},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00084-7},
doi = {10.1016/S0304-3975(03)00084-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Sheng03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Vagvolgyi03,
author = {S{\'{a}}ndor V{\'{a}}gv{\"{o}}lgyi},
title = {On ground tree transformations and congruences induced by tree automata},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {449--459},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00279-2},
doi = {10.1016/S0304-3975(03)00279-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Vagvolgyi03.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-01 03:21 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:
