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/tcs410.bht:"
download as .bib file
@article{DBLP:journals/tcs/AcerbiDF09,
author = {Luigi Acerbi and
Alberto Dennunzio and
Enrico Formenti},
title = {Conservation of some dynamical properties for operations on cellular
automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3685--3693},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.004},
doi = {10.1016/J.TCS.2009.05.004},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AcerbiDF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AckermanS09,
author = {Margareta Ackerman and
Jeffrey O. Shallit},
title = {Efficient enumeration of words in regular languages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {37},
pages = {3461--3470},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.018},
doi = {10.1016/J.TCS.2009.03.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AckermanS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AckermannRV09,
author = {Heiner Ackermann and
Heiko R{\"{o}}glin and
Berthold V{\"{o}}cking},
title = {Pure Nash equilibria in player-specific and weighted congestion games},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {17},
pages = {1552--1563},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.035},
doi = {10.1016/J.TCS.2008.12.035},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AckermannRV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlconFFG09,
author = {Liliana Alc{\'{o}}n and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Marisa Gutierrez},
title = {The complexity of clique graph recognition},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2072--2083},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.018},
doi = {10.1016/J.TCS.2009.01.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlconFFG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlhazovCMR09,
author = {Artiom Alhazov and
Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Carlos Mart{\'{\i}}n{-}Vide and
Yurii Rogozhin},
title = {On the size of computationally complete hybrid networks of evolutionary
processors},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {35},
pages = {3188--3197},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.003},
doi = {10.1016/J.TCS.2009.05.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlhazovCMR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlhazovPR09,
author = {Artiom Alhazov and
Ion Petre and
Vladimir Rogojin},
title = {The parallel complexity of signed graphs: Decidability results and
an improved algorithm},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {24-25},
pages = {2308--2315},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.028},
doi = {10.1016/J.TCS.2009.02.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlhazovPR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlloucheRS09,
author = {Jean{-}Paul Allouche and
Narad Rampersad and
Jeffrey O. Shallit},
title = {Periodicity, repetitions, and orbits of an automatic sequence},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2795--2803},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.006},
doi = {10.1016/J.TCS.2009.02.006},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AlloucheRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlonS09,
author = {Noga Alon and
Uri Stav},
title = {Hardness of edge-modification problems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4920--4927},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.002},
doi = {10.1016/J.TCS.2009.07.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlonS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlpuenteEI09,
author = {Mar{\'{\i}}a Alpuente and
Santiago Escobar and
Jos{\'{e}} Iborra},
title = {Termination of narrowing revisited},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {46},
pages = {4608--4625},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.037},
doi = {10.1016/J.TCS.2009.07.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlpuenteEI09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AmatoLM09,
author = {Gianluca Amato and
James Lipton and
Robert McGrail},
title = {On the algebraic structure of declarative programming languages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {46},
pages = {4626--4671},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.038},
doi = {10.1016/J.TCS.2009.07.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AmatoLM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AmbainisN09,
author = {Andris Ambainis and
Nikolajs Nahimovs},
title = {Improved constructions of quantum automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {20},
pages = {1916--1922},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.027},
doi = {10.1016/J.TCS.2009.01.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AmbainisN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AminiPS09,
author = {Omid Amini and
St{\'{e}}phane P{\'{e}}rennes and
Ignasi Sau},
title = {Hardness and approximation of traffic grooming},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3751--3760},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.028},
doi = {10.1016/J.TCS.2009.04.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AminiPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AmirAILP09,
author = {Amihood Amir and
Yonatan Aumann and
Piotr Indyk and
Avivit Levy and
Ely Porat},
title = {Efficient computations of \emph{l}\({}_{\mbox{1}}\) and \emph{l}\({}_{\mbox{{\(\infty\)}}}\)
rearrangement distances},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4382--4390},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.019},
doi = {10.1016/J.TCS.2009.07.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AmirAILP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AmirAKLP09,
author = {Amihood Amir and
Yonatan Aumann and
Oren Kapah and
Avivit Levy and
Ely Porat},
title = {Approximate string matching with address bit errors},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {51},
pages = {5334--5346},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.09.010},
doi = {10.1016/J.TCS.2009.09.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AmirAKLP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AngelBG09,
author = {Eric Angel and
Evripidis Bampis and
Laurent Gourv{\`{e}}s},
title = {On the minimum hitting set of bundles problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {45},
pages = {4534--4542},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.017},
doi = {10.1016/J.TCS.2009.08.017},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AngelBG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AnselmoGM09,
author = {Marcella Anselmo and
Dora Giammarresi and
Maria Madonia},
title = {A computational model for tiling recognizable two-dimensional languages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {37},
pages = {3520--3529},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.016},
doi = {10.1016/J.TCS.2009.03.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AnselmoGM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AnselmoM09,
author = {Marcella Anselmo and
Maria Madonia},
title = {Deterministic and unambiguous two-dimensional languages over one-letter
alphabet},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {16},
pages = {1477--1485},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.009},
doi = {10.1016/J.TCS.2008.12.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AnselmoM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ApostolicoC09,
author = {Alberto Apostolico and
Fabio Cunial},
title = {The subsequence composition of a string},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4360--4371},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.017},
doi = {10.1016/J.TCS.2009.07.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ApostolicoC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ArgeCT09,
author = {Lars Arge and
Christian Cachin and
Andrzej Tarlecki},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {18},
pages = {1617},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.044},
doi = {10.1016/J.TCS.2008.12.044},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ArgeCT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ArvindKL09,
author = {Vikraman Arvind and
Johannes K{\"{o}}bler and
Wolfgang Lindner},
title = {Parameterized learnability of juntas},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4928--4936},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.003},
doi = {10.1016/J.TCS.2009.07.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ArvindKL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AsodiU09,
author = {Vera Asodi and
Christopher Umans},
title = {The complexity of the matroid-greedoid partition problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {859--866},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.019},
doi = {10.1016/J.TCS.2008.11.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AsodiU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AtseriasBD09,
author = {Albert Atserias and
Andrei A. Bulatov and
Anuj Dawar},
title = {Affine systems of equations and counting infinitary logic},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {18},
pages = {1666--1683},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.049},
doi = {10.1016/J.TCS.2008.12.049},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AtseriasBD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AudibertMS09,
author = {Jean{-}Yves Audibert and
R{\'{e}}mi Munos and
Csaba Szepesv{\'{a}}ri},
title = {Exploration-exploitation tradeoff using variance estimates in multi-armed
bandits},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {19},
pages = {1876--1902},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.016},
doi = {10.1016/J.TCS.2009.01.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AudibertMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AugustineBI09,
author = {John Augustine and
Sudarshan Banerjee and
Sandy Irani},
title = {Strip packing with precedence constraints and strip packing with release
times},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3792--3803},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.024},
doi = {10.1016/J.TCS.2009.05.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AugustineBI09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AulettaPPP09,
author = {Vincenzo Auletta and
Roberto De Prisco and
Paolo Penna and
Giuseppe Persiano},
title = {On designing truthful mechanisms for online scheduling},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {36},
pages = {3348--3356},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.057},
doi = {10.1016/J.TCS.2008.12.057},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AulettaPPP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AusielloFI09,
author = {Giorgio Ausiello and
Paolo Giulio Franciosa and
Giuseppe F. Italiano},
title = {Small stretch (alpha, beta)-spanners in the streaming model},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {36},
pages = {3406--3413},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.04.022},
doi = {10.1016/J.TCS.2008.04.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AusielloFI09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AwerbuchS09,
author = {Baruch Awerbuch and
Christian Scheideler},
title = {Robust random number generation for peer-to-peer systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {6-7},
pages = {453--466},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.003},
doi = {10.1016/J.TCS.2008.10.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AwerbuchS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Baeza-YatesBDS09,
author = {Ricardo Baeza{-}Yates and
V{\'{e}}ronique Bruy{\`{e}}re and
Olivier Delgrange and
Rodrigo Scheihing},
title = {On the size of Boyer-Moore automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4432--4443},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.024},
doi = {10.1016/J.TCS.2009.07.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Baeza-YatesBDS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BagnaraHZ09,
author = {Roberto Bagnara and
Patricia M. Hill and
Enea Zaffanella},
title = {Applications of polyhedral computations to the analysis and verification
of hardware and software systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {46},
pages = {4672--4691},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.033},
doi = {10.1016/J.TCS.2009.07.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BagnaraHZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BaldoniBQP09,
author = {Roberto Baldoni and
Silvia Bonomi and
Leonardo Querzoni and
Sara {Tucci Piergiovanni}},
title = {Investigating the existence and the regularity of Logarithmic Harary
Graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2110--2121},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.041},
doi = {10.1016/J.TCS.2009.01.041},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BaldoniBQP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BalkovaP09,
author = {L'ubom{\'{\i}}ra Balkov{\'{a}} and
Edita Pelantov{\'{a}}},
title = {A note on symmetries in the Rauzy graph and factor frequencies},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2779--2783},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.002},
doi = {10.1016/J.TCS.2009.04.002},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BalkovaP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bang-JensenK09,
author = {J{\o}rgen Bang{-}Jensen and
Matthias Kriesell},
title = {Disjoint directed and undirected paths and cycles in digraphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5138--5144},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.034},
doi = {10.1016/J.TCS.2009.08.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bang-JensenK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BansalCP09,
author = {Nikhil Bansal and
Ho{-}Leung Chan and
Kirk Pruhs},
title = {Speed scaling with a solar cell},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {45},
pages = {4580--4587},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.004},
doi = {10.1016/J.TCS.2009.07.004},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BansalCP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Barbuti09,
author = {Roberto Barbuti},
title = {Giorgio Levi in Pisa},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {46},
pages = {4603--4604},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.035},
doi = {10.1016/J.TCS.2009.07.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Barbuti09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BarbutiCMM09,
author = {Roberto Barbuti and
Giulio Caravagna and
Andrea Maggiolo{-}Schettini and
Paolo Milazzo},
title = {An intermediate language for the stochastic simulation of biological
systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {33-34},
pages = {3085--3109},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.032},
doi = {10.1016/J.TCS.2008.09.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BarbutiCMM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BarnatBCDFS09,
author = {Jiri Barnat and
Lubos Brim and
Ivana Cern{\'{a}} and
Sven Drazan and
Jana Fabrikov{\'{a}} and
David Safr{\'{a}}nek},
title = {On algorithmic analysis of transcriptional regulation by {LTL} model
checking},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {33-34},
pages = {3128--3148},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.017},
doi = {10.1016/J.TCS.2009.02.017},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BarnatBCDFS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BartocciCBESG09,
author = {Ezio Bartocci and
Flavio Corradini and
Maria Rita Di Berardini and
Emilia Entcheva and
Scott A. Smolka and
Radu Grosu},
title = {Modeling and simulation of cardiac tissue using hybrid {I/O} automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {33-34},
pages = {3149--3165},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.042},
doi = {10.1016/J.TCS.2009.02.042},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BartocciCBESG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BaswanaGS09,
author = {Surender Baswana and
Vishrut Goyal and
Sandeep Sen},
title = {All-pairs nearly 2-approximate shortest paths in \emph{I} time},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {84--93},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.018},
doi = {10.1016/J.TCS.2008.10.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BaswanaGS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BattagliaCGP09,
author = {Giovanni Battaglia and
Davide Cangelosi and
Roberto Grossi and
Nadia Pisanti},
title = {Masking patterns in sequences: {A} new class of motif discovery with
don't cares},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4327--4340},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.014},
doi = {10.1016/J.TCS.2009.07.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BattagliaCGP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BatuBS09,
author = {Tugkan Batu and
Petra Berenbrink and
Christian Sohler},
title = {A sublinear-time approximation scheme for bin packing},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5082--5092},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.006},
doi = {10.1016/J.TCS.2009.08.006},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BatuBS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BaturoR09,
author = {Pawel Baturo and
Wojciech Rytter},
title = {Compressed string-matching in standard Sturmian words},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2804--2810},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.007},
doi = {10.1016/J.TCS.2009.03.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BaturoR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BayerLR09,
author = {Daniel Bayer and
Van Bang Le and
H. N. de Ridder},
title = {Probe threshold and probe trivially perfect graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4812--4822},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.029},
doi = {10.1016/J.TCS.2009.06.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BayerLR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BazziCG09,
author = {Rida A. Bazzi and
Young{-}ri Choi and
Mohamed G. Gouda},
title = {Hop chains: Secure routing and the establishment of distinct identities},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {6-7},
pages = {467--480},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.004},
doi = {10.1016/J.TCS.2008.10.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BazziCG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BealP09,
author = {Marie{-}Pierre B{\'{e}}al and
Dominique Perrin},
title = {Completing codes in a sofic shift},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4423--4431},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.023},
doi = {10.1016/J.TCS.2009.07.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BealP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeauxisP09,
author = {Romain Beauxis and
Catuscia Palamidessi},
title = {Probabilistic and nondeterministic aspects of anonymity},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {41},
pages = {4006--4025},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.008},
doi = {10.1016/J.TCS.2009.06.008},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BeauxisP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Becker09,
author = {Florent Becker},
title = {Pictures worth a thousand tiles, a geometrical programming language
for self-assembly},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {16},
pages = {1495--1515},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.011},
doi = {10.1016/J.TCS.2008.12.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Becker09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeimelBBCCKO09,
author = {Amos Beimel and
Boaz Ben{-}Moshe and
Yehuda Ben{-}Shimol and
Paz Carmi and
Eldad Chai and
Itzik Kitroser and
Eran Omri},
title = {Matrix columns allocation problems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2174--2183},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.015},
doi = {10.1016/J.TCS.2009.02.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeimelBBCCKO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeinELN09,
author = {Wolfgang W. Bein and
Leah Epstein and
Lawrence L. Larmore and
John Noga},
title = {Optimally competitive list batching},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3631--3639},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.011},
doi = {10.1016/J.TCS.2009.04.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeinELN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeinLMS09,
author = {Wolfgang W. Bein and
Lawrence L. Larmore and
Linda Morales and
Ivan Hal Sudborough},
title = {A quadratic time 2-approximation algorithm for block sorting},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {711--717},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.022},
doi = {10.1016/J.TCS.2008.10.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeinLMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BenesKLS09,
author = {Nikola Benes and
Jan Kret{\'{\i}}nsk{\'{y}} and
Kim Guldstrand Larsen and
Jir{\'{\i}} Srba},
title = {On determinism in modal transition systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {41},
pages = {4026--4043},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.009},
doi = {10.1016/J.TCS.2009.06.009},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BenesKLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BerenbrinkCH09,
author = {Petra Berenbrink and
Colin Cooper and
Zengjian Hu},
title = {Energy efficient randomised communication in unknown AdHoc networks},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2549--2561},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.002},
doi = {10.1016/J.TCS.2009.02.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BerenbrinkCH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BergeronMS09,
author = {Anne Bergeron and
Julia Mixtacki and
Jens Stoye},
title = {A new linear time algorithm to compute the genomic distance via the
double cut and join distance},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {51},
pages = {5300--5316},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.09.008},
doi = {10.1016/J.TCS.2009.09.008},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BergeronMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BergstraHT09,
author = {Jan A. Bergstra and
Yoram Hirshfeld and
John V. Tucker},
title = {Meadows and the equational specification of division},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {12-13},
pages = {1261--1271},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.015},
doi = {10.1016/J.TCS.2008.12.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BergstraHT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BerstelBC09,
author = {Jean Berstel and
Luc Boasson and
Olivier Carton},
title = {Continuant polynomials and worst-case behavior of Hopcroft's minimization
algorithm},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2811--2822},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.039},
doi = {10.1016/J.TCS.2009.01.039},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BerstelBC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BetzlerFGNR09,
author = {Nadja Betzler and
Michael R. Fellows and
Jiong Guo and
Rolf Niedermeier and
Frances A. Rosamond},
title = {Fixed-parameter algorithms for Kemeny rankings},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {45},
pages = {4554--4570},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.033},
doi = {10.1016/J.TCS.2009.08.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BetzlerFGNR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BetzlerU09,
author = {Nadja Betzler and
Johannes Uhlmann},
title = {Parameterized complexity of candidate control in elections and related
digraph problems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5425--5442},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.029},
doi = {10.1016/J.TCS.2009.05.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BetzlerU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeyersdorffKM09,
author = {Olaf Beyersdorff and
Johannes K{\"{o}}bler and
Jochen Messner},
title = {Nondeterministic functions and the existence of optimal proof systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3839--3855},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.021},
doi = {10.1016/J.TCS.2009.05.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeyersdorffKM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BhattacharyaBHKSW09,
author = {Binay K. Bhattacharya and
Mike Burmester and
Yuzhuang Hu and
Evangelos Kranakis and
Qiaosheng Shi and
Andreas Wiese},
title = {Optimal movement of mobile sensors for barrier coverage of a planar
region},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5515--5528},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.007},
doi = {10.1016/J.TCS.2009.07.007},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BhattacharyaBHKSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BidingerC09,
author = {Philippe Bidinger and
Adriana B. Compagnoni},
title = {Pict correctness revisited},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {2-3},
pages = {114--127},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.014},
doi = {10.1016/J.TCS.2008.09.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BidingerC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BieglerDHM09,
author = {Franziska Biegler and
Mark Daley and
Markus Holzer and
Ian McQuillan},
title = {On the uniqueness of shuffle on words and finite languages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3711--3724},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.016},
doi = {10.1016/J.TCS.2009.04.016},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BieglerDHM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BieglerS09,
author = {Franziska Biegler and
Kai Salomaa},
title = {On the synchronized derivation depth of context-free grammars},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {35},
pages = {3198--3208},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.031},
doi = {10.1016/J.TCS.2009.03.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BieglerS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiloGP09,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
title = {Dynamic mechanism design},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {17},
pages = {1564--1572},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.029},
doi = {10.1016/J.TCS.2008.12.029},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BiloGP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiskupP09,
author = {Marek Tomasz Biskup and
Wojciech Plandowski},
title = {Shortest synchronizing strings for Huffman codes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3925--3941},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.005},
doi = {10.1016/J.TCS.2009.06.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BiskupP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Blanchet-SadriJP09,
author = {Francine Blanchet{-}Sadri and
Rapha{\"{e}}l M. Jungers and
Justin Palumbo},
title = {Testing avoidability on sets of partial words is hard},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {968--972},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.011},
doi = {10.1016/J.TCS.2008.11.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Blanchet-SadriJP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Blanchet-SadriMS09,
author = {Francine Blanchet{-}Sadri and
Robert Mercas and
Geoffrey Scott},
title = {A generalization of Thue freeness for partial words},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {793--800},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.006},
doi = {10.1016/J.TCS.2008.11.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Blanchet-SadriMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BlaserV09,
author = {Markus Bl{\"{a}}ser and
Andreas Meyer de Voltaire},
title = {Semisimple algebras of almost minimal rank over the reals},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {50},
pages = {5202--5214},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.022},
doi = {10.1016/J.TCS.2009.08.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BlaserV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BlomerN09,
author = {Johannes Bl{\"{o}}mer and
Stefanie Naewe},
title = {Sampling methods for shortest vectors, closest vectors and successive
minima},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {18},
pages = {1648--1665},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.045},
doi = {10.1016/J.TCS.2008.12.045},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BlomerN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BlondelCJ09,
author = {Vincent D. Blondel and
Julien Cassaigne and
Rapha{\"{e}}l M. Jungers},
title = {On the number of alpha-power-free binary words for 2alpha{\textless}=7/3},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2823--2833},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.031},
doi = {10.1016/J.TCS.2009.01.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BlondelCJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BockenhauerHKMR09,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Juraj Hromkovic and
Richard Kr{\'{a}}lovic and
Tobias M{\"{o}}mke and
Peter Rossmanith},
title = {Reoptimization of Steiner trees: Changing the terminal set},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {36},
pages = {3428--3435},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.04.039},
doi = {10.1016/J.TCS.2008.04.039},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BockenhauerHKMR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BockenhauerKK09,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Joachim Kneis and
Joachim Kupke},
title = {Approximation hardness of deadline-TSP reoptimization},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2241--2249},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.016},
doi = {10.1016/J.TCS.2009.02.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BockenhauerKK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BockerBBT09,
author = {Sebastian B{\"{o}}cker and
Sebastian Briesemeister and
Quang Bao Anh Bui and
Anke Tru{\ss}},
title = {Going weighted: Parameterized algorithms for cluster editing},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5467--5480},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.006},
doi = {10.1016/J.TCS.2009.05.006},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BockerBBT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bodei09,
author = {Chiara Bodei},
title = {A Control Flow Analysis for Beta-binders with and without static compartments},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {33-34},
pages = {3110--3127},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.036},
doi = {10.1016/J.TCS.2008.09.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bodei09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodirskyCKO09,
author = {Manuel Bodirsky and
Hubie Chen and
Jan K{\'{a}}ra and
Timo von Oertzen},
title = {Maximal infinite-valued constraint languages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {18},
pages = {1684--1693},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.050},
doi = {10.1016/J.TCS.2008.12.050},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BodirskyCKO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Boer09,
author = {Frank S. de Boer},
title = {A shared-variable concurrency analysis of multi-threaded object-oriented
programs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {2-3},
pages = {128--141},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.024},
doi = {10.1016/J.TCS.2008.09.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Boer09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoigelotB09,
author = {Bernard Boigelot and
Julien Brusten},
title = {A generalization of Cobham's theorem to automata over real numbers},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {18},
pages = {1694--1703},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.051},
doi = {10.1016/J.TCS.2008.12.051},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoigelotB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BonchiM09,
author = {Filippo Bonchi and
Ugo Montanari},
title = {Reactive systems, (semi-)saturated semantics and coalgebras on presheaves},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {41},
pages = {4044--4066},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.010},
doi = {10.1016/J.TCS.2009.06.010},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BonchiM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BonizzoniCLS09,
author = {Paola Bonizzoni and
S. Barry Cooper and
Benedikt L{\"{o}}we and
Andrea Sorbi},
title = {Foreword},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {283--284},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.040},
doi = {10.1016/J.TCS.2008.09.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BonizzoniCLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BonsangueJMV09,
author = {Marcello M. Bonsangue and
Einar Broch Johnsen and
Amy L. Murphy and
Jan Vitek},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {2-3},
pages = {113},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.039},
doi = {10.1016/J.TCS.2008.09.039},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BonsangueJMV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BonsmaC09,
author = {Paul S. Bonsma and
Luis Cereceda},
title = {Finding Paths between graph colourings: PSPACE-completeness and superpolynomial
distances},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {50},
pages = {5215--5226},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.023},
doi = {10.1016/J.TCS.2009.08.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BonsmaC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BordihnHK09,
author = {Henning Bordihn and
Markus Holzer and
Martin Kutrib},
title = {Determination of finite automata accepting subregular languages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {35},
pages = {3209--3222},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.019},
doi = {10.1016/J.TCS.2009.05.019},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BordihnHK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bossi09,
author = {Annalisa Bossi},
title = {S-semantics for logic programming: {A} retrospective look},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {46},
pages = {4692--4703},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.039},
doi = {10.1016/J.TCS.2009.07.039},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bossi09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BourgeoisEP09,
author = {Nicolas Bourgeois and
Bruno Escoffier and
Vangelis Th. Paschos},
title = {Efficient approximation of min set cover by moderately exponential
algorithms},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2184--2195},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.007},
doi = {10.1016/J.TCS.2009.02.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BourgeoisEP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BouvelR09,
author = {Mathilde Bouvel and
Dominique Rossin},
title = {A variant of the tandem duplication - random loss model of genome
rearrangement},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {847--858},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.017},
doi = {10.1016/J.TCS.2008.11.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BouvelR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BovaM09,
author = {Simone Bova and
Franco Montagna},
title = {The consequence relation in the logic of commutative GBL-algebras
is PSPACE-complete},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {12-13},
pages = {1143--1158},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.024},
doi = {10.1016/J.TCS.2008.10.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BovaM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtL09,
author = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Simplicial powers of graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5443--5454},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.010},
doi = {10.1016/J.TCS.2009.04.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrijderH09,
author = {Robert Brijder and
Hendrik Jan Hoogeboom},
title = {Perfectly quilted rectangular snake tilings},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {16},
pages = {1486--1494},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.010},
doi = {10.1016/J.TCS.2008.12.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrijderH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BroadbentK09,
author = {Anne Broadbent and
Elham Kashefi},
title = {Parallelizing quantum circuits},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {26},
pages = {2489--2510},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.046},
doi = {10.1016/J.TCS.2008.12.046},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BroadbentK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BroersmaJP09,
author = {Hajo Broersma and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Upper bounds and algorithms for parallel knock-out numbers},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {14},
pages = {1319--1327},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.03.024},
doi = {10.1016/J.TCS.2008.03.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BroersmaJP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrunR09,
author = {Yuriy Brun and
Dustin Reishus},
title = {Path finding in the tile assembly model},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {15},
pages = {1461--1472},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.008},
doi = {10.1016/J.TCS.2008.12.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrunR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrzozowskiK09,
author = {Janusz A. Brzozowski and
Stavros Konstantinidis},
title = {State-complexity hierarchies of uniform languages of alphabet-size
length},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {35},
pages = {3223--3235},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.043},
doi = {10.1016/J.TCS.2009.02.043},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrzozowskiK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrzozowskiS09,
author = {Janusz A. Brzozowski and
Nicolae Santean},
title = {Predictable semiautomata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {35},
pages = {3236--3249},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.010},
doi = {10.1016/J.TCS.2009.05.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrzozowskiS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BuLLQX09,
author = {Dongbo Bu and
Ming Li and
Shuai Cheng Li and
Jianbo Qian and
Jinbo Xu},
title = {Finding compact structural motifs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2834--2839},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.023},
doi = {10.1016/J.TCS.2009.03.023},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BuLLQX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BucciLGZ09,
author = {Michelangelo Bucci and
Alessandro De Luca and
Amy Glen and
Luca Q. Zamboni},
title = {A new characteristic property of rich words},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2860--2863},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.001},
doi = {10.1016/J.TCS.2008.11.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BucciLGZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BucciLL09,
author = {Michelangelo Bucci and
Aldo de Luca and
Alessandro De Luca},
title = {Characteristic morphisms of generalized episturmian words},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2840--2859},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.001},
doi = {10.1016/J.TCS.2008.12.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BucciLL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BugeaudRS09,
author = {Yann Bugeaud and
Christophe Reutenauer and
Samir Siksek},
title = {A Sturmian sequence related to the uniqueness conjecture for Markoff
numbers},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2864--2869},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.005},
doi = {10.1016/J.TCS.2009.02.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BugeaudRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BulatovDGJR09,
author = {Andrei A. Bulatov and
Martin E. Dyer and
Leslie Ann Goldberg and
Markus Jalsenius and
David Richerby},
title = {The complexity of weighted Boolean {\#}CSP with mixed signs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3949--3961},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.003},
doi = {10.1016/J.TCS.2009.06.003},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BulatovDGJR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BuschM09,
author = {Costas Busch and
Malik Magdon{-}Ismail},
title = {Atomic routing games on maximum congestion},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {36},
pages = {3337--3347},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.015},
doi = {10.1016/J.TCS.2009.04.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BuschM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BusiZ09,
author = {Nadia Busi and
Claudio Zandron},
title = {Computational expressiveness of Genetic Systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {286--293},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.041},
doi = {10.1016/J.TCS.2008.09.041},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BusiZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaiCL09,
author = {Zhipeng Cai and
Zhi{-}Zhong Chen and
Guohui Lin},
title = {A 3.4713-approximation algorithm for the capacitated multicast tree
routing problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5415--5424},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.013},
doi = {10.1016/J.TCS.2009.05.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaiCL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaiD09,
author = {Ying Cai and
Cunsheng Ding},
title = {Binary sequences with optimal autocorrelation},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {24-25},
pages = {2316--2322},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.021},
doi = {10.1016/J.TCS.2009.02.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaiD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaiL09,
author = {Jin{-}yi Cai and
Pinyan Lu},
title = {Holographic algorithms: The power of dimensionality resolved},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {18},
pages = {1618--1628},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.047},
doi = {10.1016/J.TCS.2008.12.047},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CaiL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Cain09,
author = {Alan J. Cain},
title = {Automaton semigroups},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5022--5038},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.054},
doi = {10.1016/J.TCS.2009.07.054},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Cain09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaludeJS09,
author = {Cristian S. Calude and
Helmut J{\"{u}}rgensen and
Ludwig Staiger},
title = {Topology on words},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {24-25},
pages = {2323--2335},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.029},
doi = {10.1016/J.TCS.2009.02.029},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CaludeJS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CampeanuP09,
author = {Cezar C{\^{a}}mpeanu and
Giovanni Pighizzini},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {35},
pages = {3187},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.015},
doi = {10.1016/J.TCS.2009.05.015},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CampeanuP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CampeanuS09,
author = {Cezar C{\^{a}}mpeanu and
Nicolae Santean},
title = {On the intersection of regex languages with regular languages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {24-25},
pages = {2336--2344},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.022},
doi = {10.1016/J.TCS.2009.02.022},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CampeanuS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CannataM09,
author = {Nicola Cannata and
Emanuela Merelli},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {33-34},
pages = {3037--3038},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.001},
doi = {10.1016/J.TCS.2009.04.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CannataM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaoY09,
author = {Zhigang Cao and
Xiaoguang Yang},
title = {A {PTAS} for parallel batch scheduling with rejection and dynamic
job arrivals},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2732--2745},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.006},
doi = {10.1016/J.TCS.2009.04.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaoY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CapecchiCDDG09,
author = {Sara Capecchi and
Mario Coppo and
Mariangiola Dezani{-}Ciancaglini and
Sophia Drossopoulou and
Elena Giachino},
title = {Amalgamating sessions and methods in object-oriented languages with
generics},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {2-3},
pages = {142--167},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.016},
doi = {10.1016/J.TCS.2008.09.016},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CapecchiCDDG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CarboneSV09,
author = {Marco Carbone and
Pawel Sobocinski and
Frank D. Valencia},
title = {Foreword: Festschrift for Mogens Nielsen's 60th birthday},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {41},
pages = {4001--4005},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.007},
doi = {10.1016/J.TCS.2009.06.007},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CarboneSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CardelliCGKP09,
author = {Luca Cardelli and
Emmanuelle Caron and
Philippa Gardner and
Ozan Kahramanogullari and
Andrew Phillips},
title = {A process model of Rho GTP-binding proteins},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {33-34},
pages = {3166--3185},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.029},
doi = {10.1016/J.TCS.2009.04.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CardelliCGKP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CardinalLL09,
author = {Jean Cardinal and
Stefan Langerman and
Eythan Levy},
title = {Improved approximation bounds for edge dominating set in dense graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {949--957},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.036},
doi = {10.1016/J.TCS.2008.12.036},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CardinalLL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CarliFRS09,
author = {F. De Carli and
Andrea Frosini and
Simone Rinaldi and
Andrea Sorbi},
title = {Lattices of local two-dimensional languages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2701--2713},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.025},
doi = {10.1016/J.TCS.2009.03.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CarliFRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaseM09,
author = {John Case and
Samuel E. Moelius},
title = {Parallelism increases iterative learning power},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {19},
pages = {1863--1875},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.015},
doi = {10.1016/J.TCS.2009.01.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaseM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CassaigneKS09,
author = {Julien Cassaigne and
Juhani Karhum{\"{a}}ki and
Petri Salmela},
title = {Conjugacy of finite biprefix codes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {24-25},
pages = {2345--2351},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.030},
doi = {10.1016/J.TCS.2009.02.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CassaigneKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CastiglioneRS09,
author = {Giusi Castiglione and
Antonio Restivo and
Marinella Sciortino},
title = {Circular sturmian words and Hopcroft's algorithm},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4372--4381},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.018},
doi = {10.1016/J.TCS.2009.07.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CastiglioneRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CavaliereIPEIW09,
author = {Matteo Cavaliere and
Oscar H. Ibarra and
Gheorghe Paun and
{\"{O}}mer Egecioglu and
Mihai Ionescu and
Sara Woodworth},
title = {Asynchronous spiking neural {P} systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {24-25},
pages = {2352--2364},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.031},
doi = {10.1016/J.TCS.2009.02.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CavaliereIPEIW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChadhaV09,
author = {Rohit Chadha and
Mahesh Viswanathan},
title = {Deciding branching time properties for asynchronous programs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {42},
pages = {4169--4179},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.021},
doi = {10.1016/J.TCS.2009.01.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChadhaV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChanKLW09,
author = {Chi{-}Yuan Chan and
Shan{-}Chyun Ku and
Chi{-}Jen Lu and
Biing{-}Feng Wang},
title = {Efficient algorithms for two generalized 2-median problems and the
group median problem on trees},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {867--876},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.021},
doi = {10.1016/J.TCS.2008.11.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChanKLW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Chang09,
author = {Kevin L. Chang},
title = {Multiple pass streaming algorithms for learning mixtures of distributions
in R\({}^{\mbox{d}}\)},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {19},
pages = {1765--1780},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.043},
doi = {10.1016/J.TCS.2009.01.043},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Chang09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChangL09,
author = {Ching{-}Lueh Chang and
Yuh{-}Dauh Lyuu},
title = {Spreading messages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2714--2724},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.032},
doi = {10.1016/J.TCS.2009.03.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChangL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChaudhuriRRT09,
author = {Kamalika Chaudhuri and
Satish Rao and
Samantha J. Riesenfeld and
Kunal Talwar},
title = {A push-relabel approximation algorithm for approximating the minimum-degree
{MST} problem and its generalization to matroids},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {44},
pages = {4489--4503},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.029},
doi = {10.1016/J.TCS.2009.07.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChaudhuriRRT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CheKL09,
author = {Ada Che and
Vladimir Kats and
Eugene Levner},
title = {A note on a quadratic algorithm for the 2-cyclic robotic scheduling
problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5188--5190},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.002},
doi = {10.1016/J.TCS.2009.08.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CheKL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenD09,
author = {Xi Chen and
Xiaotie Deng},
title = {On the complexity of 2D discrete fixed point problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {44},
pages = {4448--4456},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.052},
doi = {10.1016/J.TCS.2009.07.052},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenET09,
author = {Xingyu Chen and
Leah Epstein and
Zhiyi Tan},
title = {Semi-online machine covering for two uniform machines},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5047--5062},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.001},
doi = {10.1016/J.TCS.2009.08.001},
timestamp = {Mon, 16 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenET09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenHT09,
author = {Xi Chen and
Li{-}Sha Huang and
Shang{-}Hua Teng},
title = {Market equilibria with hybrid linear-Leontief utilities},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {17},
pages = {1573--1580},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.030},
doi = {10.1016/J.TCS.2008.12.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenHT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenKMXZ09,
author = {Jianer Chen and
Iyad A. Kanj and
Jie Meng and
Ge Xia and
Fenghui Zhang},
title = {On the pseudo-achromatic number problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {818--829},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.010},
doi = {10.1016/J.TCS.2008.11.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenKMXZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenKX09,
author = {Jianer Chen and
Iyad A. Kanj and
Ge Xia},
title = {On parameterized exponential time complexity},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2641--2648},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.006},
doi = {10.1016/J.TCS.2009.03.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenKX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenLZ09,
author = {Lei Chen and
Changhong Lu and
Zhenbing Zeng},
title = {Hardness results and approximation algorithms for (weighted) paired-domination
in graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5063--5071},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.004},
doi = {10.1016/J.TCS.2009.08.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenLZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenLZ09a,
author = {Lei Chen and
Changhong Lu and
Zhenbing Zeng},
title = {Distance paired-domination problems on subclasses of chordal graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5072--5081},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.005},
doi = {10.1016/J.TCS.2009.08.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenLZ09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenMZ09,
author = {Shihyen Chen and
Bin Ma and
Kaizhong Zhang},
title = {On the similarity metric and the distance metric},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {24-25},
pages = {2365--2376},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.023},
doi = {10.1016/J.TCS.2009.02.023},
timestamp = {Mon, 13 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenMZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenSS09,
author = {Wenbin Chen and
Matthew C. Schmidt and
Nagiza F. Samatova},
title = {On parameterized complexity of the Multi-MCS problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2024--2032},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.060},
doi = {10.1016/J.TCS.2008.12.060},
timestamp = {Fri, 03 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenT09,
author = {Zhi{-}Zhong Chen and
Ruka Tanahashi},
title = {Approximating maximum edge 2-coloring in simple graphs via local improvement},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {45},
pages = {4543--4553},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.008},
doi = {10.1016/J.TCS.2009.07.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CherubiniK09,
author = {Alessandra Cherubini and
Andrzej Kisielewicz},
title = {Collapsing words, permutation conditions and coherent colorings of
trees},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2135--2147},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.038},
doi = {10.1016/J.TCS.2009.01.038},
timestamp = {Fri, 16 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CherubiniK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChitturiFMMSSV09,
author = {Bhadrachalam Chitturi and
William Fahle and
Z. Meng and
Linda Morales and
Charles O. Shields Jr. and
Ivan Hal Sudborough and
Walter Voit},
title = {An (18/11)n upper bound for sorting by prefix reversals},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {36},
pages = {3372--3390},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.04.045},
doi = {10.1016/J.TCS.2008.04.045},
timestamp = {Wed, 02 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChitturiFMMSSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoffrutG09,
author = {Christian Choffrut and
Serge Grigorieff},
title = {Finite n-tape automata over possibly infinite alphabets: Extending
a theorem of Eilenberg et al},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {16--34},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.07.018},
doi = {10.1016/J.TCS.2008.07.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoffrutG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoffrutG09a,
author = {Christian Choffrut and
Serge Grigorieff},
title = {The "equal last letter" predicate for words on infinite alphabets
and classes of multitape automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2870--2884},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.034},
doi = {10.1016/J.TCS.2009.01.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoffrutG09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChristodoulouKN09,
author = {George Christodoulou and
Elias Koutsoupias and
Akash Nanavati},
title = {Coordination mechanisms},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {36},
pages = {3327--3336},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.005},
doi = {10.1016/J.TCS.2009.01.005},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ChristodoulouKN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CiocchettaH09,
author = {Federica Ciocchetta and
Jane Hillston},
title = {Bio-PEPA: {A} framework for the modelling and analysis of biological
systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {33-34},
pages = {3065--3084},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.037},
doi = {10.1016/J.TCS.2009.02.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CiocchettaH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CivrilM09,
author = {Ali {\c{C}}ivril and
Malik Magdon{-}Ismail},
title = {On selecting a maximum volume sub-matrix of a matrix and related problems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4801--4811},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.018},
doi = {10.1016/J.TCS.2009.06.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CivrilM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ColT09,
author = {Marie{-}Andr{\'{e}}e Jacob{-}Da Col and
Pierre Tellier},
title = {Quasi-linear transformations and discrete tilings},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2126--2134},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.032},
doi = {10.1016/J.TCS.2009.01.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ColT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ColsonM09,
author = {Lo{\"{\i}}c Colson and
David Michel},
title = {Pedagogical second-order lambda-calculus},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {42},
pages = {4190--4203},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.020},
doi = {10.1016/J.TCS.2009.04.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ColsonM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CondonJ09,
author = {Anne Condon and
Hosna Jabbari},
title = {Computational prediction of nucleic acid secondary structure: Methods,
applications, and challenges},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {294--301},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.042},
doi = {10.1016/J.TCS.2008.09.042},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CondonJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CooperZ09,
author = {S. Barry Cooper and
Hong Zhu},
title = {Preface: Algorithms, complexity and models of computation},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {11},
pages = {1001--1002},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.026},
doi = {10.1016/J.TCS.2008.10.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CooperZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CordascoG09,
author = {Gennaro Cordasco and
Luisa Gargano},
title = {Navigable Small-World networks with few random bits},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4975--4988},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.050},
doi = {10.1016/J.TCS.2009.07.050},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CordascoG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CousotCG09,
author = {Patrick Cousot and
Radhia Cousot and
Roberto Giacobazzi},
title = {Abstract interpretation of resolution-based semantics},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {46},
pages = {4724--4746},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.040},
doi = {10.1016/J.TCS.2009.07.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CousotCG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrochemoreEGM09,
author = {Maxime Crochemore and
Chiara Epifanio and
Alessandra Gabriele and
Filippo Mignosi},
title = {From Nerode's congruence to suffix automata with mismatches},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {37},
pages = {3471--3480},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.011},
doi = {10.1016/J.TCS.2009.03.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CrochemoreEGM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrochemoreIR09,
author = {Maxime Crochemore and
Lucian Ilie and
Wojciech Rytter},
title = {Repetitions in strings: Algorithms and combinatorics},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {50},
pages = {5227--5235},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.024},
doi = {10.1016/J.TCS.2009.08.024},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CrochemoreIR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CurrieA09,
author = {James D. Currie and
Ali Aberkane},
title = {A cyclic binary morphism avoiding Abelian fourth powers},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {44--52},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.027},
doi = {10.1016/J.TCS.2008.09.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CurrieA09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CurrieR09,
author = {James D. Currie and
Narad Rampersad},
title = {Dejean's conjecture holds for n{\textgreater}=30},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2885--2888},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.026},
doi = {10.1016/J.TCS.2009.01.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CurrieR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CzeizlerCKS09,
author = {Elena Czeizler and
Eugen Czeizler and
Lila Kari and
Kai Salomaa},
title = {On the descriptional complexity of Watson-Crick automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {35},
pages = {3250--3260},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.001},
doi = {10.1016/J.TCS.2009.05.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CzeizlerCKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CzeizlerP09,
author = {Elena Czeizler and
Wojciech Plandowski},
title = {On systems of word equations over three unknowns with at most six
occurrences of one of the unknowns},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2889--2909},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.023},
doi = {10.1016/J.TCS.2009.01.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CzeizlerP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CzyzowiczDKOU09,
author = {Jurek Czyzowicz and
Stefan Dobrev and
Evangelos Kranakis and
Jaroslav Opatrny and
Jorge Urrutia},
title = {Local edge colouring of Yao-like subgraphs of Unit Disk Graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {14},
pages = {1388--1400},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.008},
doi = {10.1016/J.TCS.2008.11.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CzyzowiczDKOU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CzyzowiczGP09,
author = {Jurek Czyzowicz and
Leszek Gasieniec and
Andrzej Pelc},
title = {Gathering few fat mobile robots in the plane},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {6-7},
pages = {481--499},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.005},
doi = {10.1016/J.TCS.2008.10.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CzyzowiczGP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DAlessandroIV09,
author = {Flavio D'Alessandro and
Benedetto Intrigila and
Stefano Varricchio},
title = {The Parikh counting functions of sparse context-free languages are
quasi-polynomials},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5158--5181},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.09.006},
doi = {10.1016/J.TCS.2009.09.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DAlessandroIV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DHondt09,
author = {Ellie D'Hondt},
title = {Quantum approaches to graph colouring},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {302--309},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.055},
doi = {10.1016/J.TCS.2008.09.055},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DHondt09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DaiY09,
author = {Decheng Dai and
Changyuan Yu},
title = {A 5+epsilon-approximation algorithm for minimum weighted dominating
set in unit disk graph},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {756--765},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.015},
doi = {10.1016/J.TCS.2008.11.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DaiY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DanosS09,
author = {Vincent Danos and
Linus J. Schumacher},
title = {How liquid is biological signalling?},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {11},
pages = {1003--1012},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.037},
doi = {10.1016/J.TCS.2008.10.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DanosS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DantchevMR09,
author = {Stefan S. Dantchev and
Barnaby Martin and
Mark Nicholas Charles Rhodes},
title = {Tight rank lower bounds for the Sherali-Adams proof system},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2054--2063},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.002},
doi = {10.1016/J.TCS.2009.01.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DantchevMR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DanzigerMMS09,
author = {Peter Danziger and
Eric Mendelsohn and
Lucia Moura and
Brett Stevens},
title = {Covering arrays avoiding forbidden edges},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5403--5414},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.057},
doi = {10.1016/J.TCS.2009.07.057},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DanzigerMMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DaskalakisMP09,
author = {Constantinos Daskalakis and
Aranyak Mehta and
Christos H. Papadimitriou},
title = {A note on approximate Nash equilibria},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {17},
pages = {1581--1588},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.031},
doi = {10.1016/J.TCS.2008.12.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DaskalakisMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DassowMV09,
author = {J{\"{u}}rgen Dassow and
Gema M. Mart{\'{\i}}n and
Francisco J. Vico},
title = {Some operations preserving primitivity of words},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2910--2919},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.024},
doi = {10.1016/J.TCS.2009.01.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DassowMV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DassowST09,
author = {J{\"{u}}rgen Dassow and
Ralf Stiebe and
Bianca Truthe},
title = {Two collapsing hierarchies of subregularly tree controlled languages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {35},
pages = {3261--3271},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.005},
doi = {10.1016/J.TCS.2009.03.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DassowST09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/David09,
author = {Ren{\'{e}} David},
title = {A direct proof of the confluence of combinatory strong reduction},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {42},
pages = {4204--4215},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.017},
doi = {10.1016/J.TCS.2009.04.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/David09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DemirbasAK09,
author = {Murat Demirbas and
Anish Arora and
Vinodkrishnan Kulathumani},
title = {Glance: {A} lightweight querying service for wireless sensor networks},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {6-7},
pages = {500--513},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.013},
doi = {10.1016/J.TCS.2008.10.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DemirbasAK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DennunzioGM09,
author = {Alberto Dennunzio and
Pierre Guillon and
Beno{\^{\i}}t Masson},
title = {Sand automata as cellular automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3962--3974},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.016},
doi = {10.1016/J.TCS.2009.06.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DennunzioGM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DennunzioLFM09,
author = {Alberto Dennunzio and
Pietro di Lena and
Enrico Formenti and
Luciano Margara},
title = {On the directional dynamics of additive cellular automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4823--4833},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.023},
doi = {10.1016/J.TCS.2009.06.023},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DennunzioLFM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DiazGM09,
author = {Josep D{\'{\i}}az and
Fabrizio Grandoni and
Alberto Marchetti{-}Spaccamela},
title = {Balanced cut approximation in random geometric graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2725--2731},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.037},
doi = {10.1016/J.TCS.2009.03.037},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DiazGM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DiazKMP09,
author = {Josep D{\'{\i}}az and
Lefteris M. Kirousis and
Dieter Mitsche and
Xavier P{\'{e}}rez{-}Gim{\'{e}}nez},
title = {On the satisfiability threshold of formulas with three literals per
clause},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2920--2934},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.020},
doi = {10.1016/J.TCS.2009.02.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DiazKMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DiekertK09,
author = {Volker Diekert and
Dalia Krieger},
title = {Some remarks about stabilizers},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2935--2946},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.022},
doi = {10.1016/J.TCS.2009.01.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DiekertK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Dietzfelbinger09,
author = {Martin Dietzfelbinger},
title = {In memoriam Prof. Dr. math. Ingo Wegener, 1950-2008},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {44},
pages = {4446--4447},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.048},
doi = {10.1016/J.TCS.2009.07.048},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Dietzfelbinger09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Djelloul09,
author = {Selma Djelloul},
title = {Treewidth and logical definability of graph products},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {696--710},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.019},
doi = {10.1016/J.TCS.2008.10.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Djelloul09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DolevT09,
author = {Shlomi Dolev and
Nir Tzachar},
title = {Empire of colonies: Self-stabilizing and self-organizing distributed
algorithm},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {6-7},
pages = {514--532},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.006},
doi = {10.1016/J.TCS.2008.10.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DolevT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DomaratzkiO09,
author = {Michael Domaratzki and
Alexander Okhotin},
title = {State complexity of power},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {24-25},
pages = {2377--2392},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.025},
doi = {10.1016/J.TCS.2009.02.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DomaratzkiO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DomosiHV09,
author = {P{\'{a}}l D{\"{o}}m{\"{o}}si and
G{\'{e}}za Horv{\'{a}}th and
Laurent Vuillon},
title = {On the Shyr-Yu theorem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4874--4877},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.039},
doi = {10.1016/J.TCS.2009.06.039},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DomosiHV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DorrigivLM09,
author = {Reza Dorrigiv and
Alejandro L{\'{o}}pez{-}Ortiz and
J. Ian Munro},
title = {On the relative dominance of paging algorithms},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3694--3701},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.023},
doi = {10.1016/J.TCS.2009.04.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DorrigivLM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DrosteR09,
author = {Manfred Droste and
George Rahonis},
title = {Weighted automata and weighted logics with discounting},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {37},
pages = {3481--3494},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.029},
doi = {10.1016/J.TCS.2009.03.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DrosteR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Dubickas09,
author = {Arturas Dubickas},
title = {Binary words with a given Diophantine exponent},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5191--5195},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.013},
doi = {10.1016/J.TCS.2009.08.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Dubickas09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DuckworthZ09,
author = {William Duckworth and
Michele Zito},
title = {Large independent sets in random regular graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {50},
pages = {5236--5243},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.025},
doi = {10.1016/J.TCS.2009.08.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DuckworthZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Dzelme-Berzina09,
author = {Ilze Dzelme{-}Berzina},
title = {Mathematical logic and quantum finite state automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {20},
pages = {1952--1959},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.030},
doi = {10.1016/J.TCS.2009.01.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Dzelme-Berzina09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EfrimaP09,
author = {Asaf Efrima and
David Peleg},
title = {Distributed algorithms for partitioning a swarm of autonomous mobile
robots},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {14},
pages = {1355--1368},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.04.042},
doi = {10.1016/J.TCS.2008.04.042},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EfrimaP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EhrenfeuchtR09,
author = {Andrzej Ehrenfeucht and
Grzegorz Rozenberg},
title = {Introducing time in reaction systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {310--322},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.043},
doi = {10.1016/J.TCS.2008.09.043},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EhrenfeuchtR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ElSalamounyKS09,
author = {Ehab ElSalamouny and
Karl Tikj{\o}b Krukow and
Vladimiro Sassone},
title = {An analysis of the exponential decay principle in probabilistic trust
models},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {41},
pages = {4067--4084},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.011},
doi = {10.1016/J.TCS.2009.06.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ElSalamounyKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EliasL09,
author = {Isaac Elias and
Jens Lagergren},
title = {Fast neighbor joining},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {1993--2000},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.040},
doi = {10.1016/J.TCS.2008.12.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EliasL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ElsasserS09,
author = {Robert Els{\"{a}}sser and
Thomas Sauerwald},
title = {On the runtime and robustness of randomized broadcasting},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {36},
pages = {3414--3427},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.04.017},
doi = {10.1016/J.TCS.2008.04.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ElsasserS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Englert09,
author = {Burkhard Englert},
title = {On the cost of uniform protocols whose memory consumption is adaptive
to interval contention},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {6-7},
pages = {533--545},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.007},
doi = {10.1016/J.TCS.2008.10.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Englert09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ErdelyiHRS09,
author = {G{\'{a}}bor Erd{\'{e}}lyi and
Lane A. Hemaspaandra and
J{\"{o}}rg Rothe and
Holger Spakowski},
title = {Generalized juntas and NP-hard sets},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3995--4000},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.026},
doi = {10.1016/J.TCS.2009.06.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ErdelyiHRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EsikGLY09,
author = {Zolt{\'{a}}n {\'{E}}sik and
Yuan Gao and
Guangwu Liu and
Sheng Yu},
title = {Estimation of state complexity of combined operations},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {35},
pages = {3272--3280},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.026},
doi = {10.1016/J.TCS.2009.03.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EsikGLY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EvenLL09,
author = {Guy Even and
Tamir Levi and
Ami Litman},
title = {Optimal conclusive sets for comparator networks},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {14},
pages = {1369--1376},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.021},
doi = {10.1016/J.TCS.2008.12.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EvenLL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FainekosP09,
author = {Georgios E. Fainekos and
George J. Pappas},
title = {Robustness of temporal logic specifications for continuous-time signals},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {42},
pages = {4262--4291},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.021},
doi = {10.1016/J.TCS.2009.06.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FainekosP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FalaschiGP09,
author = {Moreno Falaschi and
Maurizio Gabbrielli and
Catuscia Palamidessi},
title = {Foreword},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {46},
pages = {4601--4602},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.034},
doi = {10.1016/J.TCS.2009.07.034},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FalaschiGP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FaliszewskiH09,
author = {Piotr Faliszewski and
Lane A. Hemaspaandra},
title = {The complexity of power-index comparison},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {101--107},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.034},
doi = {10.1016/J.TCS.2008.09.034},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FaliszewskiH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FedericoP09,
author = {Maria Federico and
Nadia Pisanti},
title = {Suffix tree characterization of maximal motifs in biological sequences},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4391--4401},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.020},
doi = {10.1016/J.TCS.2009.07.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FedericoP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FeldmanS09,
author = {Vitaly Feldman and
Shrenik Shah},
title = {Separating models of learning with faulty teachers},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {19},
pages = {1903--1912},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.017},
doi = {10.1016/J.TCS.2009.01.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FeldmanS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FeliceFZ09,
author = {Clelia de Felice and
Gabriele Fici and
Rosalba Zizza},
title = {A characterization of regular circular languages generated by marked
splicing systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4937--4960},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.005},
doi = {10.1016/J.TCS.2009.07.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FeliceFZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FellowsHRV09,
author = {Michael R. Fellows and
Danny Hermelin and
Frances A. Rosamond and
St{\'{e}}phane Vialette},
title = {On the parameterized complexity of multiple-interval graph problems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {53--61},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.065},
doi = {10.1016/J.TCS.2008.09.065},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FellowsHRV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FengZW09,
author = {Wangsen Feng and
Li'ang Zhang and
Hanpin Wang},
title = {Approximation algorithm for maximum edge coloring},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {11},
pages = {1022--1029},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.035},
doi = {10.1016/J.TCS.2008.10.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FengZW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FerraginaL09,
author = {Paolo Ferragina and
Gad M. Landau},
title = {Foreword},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {51},
pages = {5299},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.09.007},
doi = {10.1016/J.TCS.2009.09.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FerraginaL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FerrantePSV09,
author = {Alessandro Ferrante and
Gennaro Parlato and
Francesco Sorrentino and
Carmine Ventre},
title = {Fast payment schemes for truthful mechanisms with verification},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {886--899},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.024},
doi = {10.1016/J.TCS.2008.12.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FerrantePSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FieldMS09,
author = {John Field and
Maria{-}Cristina V. Marinescu and
Christian Stefansen},
title = {Reactors: {A} data-oriented synchronous/asynchronous programming model
for distributed applications},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {2-3},
pages = {168--201},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.052},
doi = {10.1016/J.TCS.2008.09.052},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FieldMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FinocchiGI09,
author = {Irene Finocchi and
Fabrizio Grandoni and
Giuseppe F. Italiano},
title = {Optimal resilient sorting and searching in the presence of memory
faults},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {44},
pages = {4457--4470},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.026},
doi = {10.1016/J.TCS.2009.07.026},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FinocchiGI09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FioreH09,
author = {Marcelo P. Fiore and
Chung{-}Kil Hur},
title = {On the construction of free algebras for equational systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {18},
pages = {1704--1729},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.052},
doi = {10.1016/J.TCS.2008.12.052},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FioreH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FischerMN09,
author = {Johannes Fischer and
Veli M{\"{a}}kinen and
Gonzalo Navarro},
title = {Faster entropy-bounded compressed suffix trees},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {51},
pages = {5354--5364},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.09.012},
doi = {10.1016/J.TCS.2009.09.012},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FischerMN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FischerV09,
author = {Simon Fischer and
Berthold V{\"{o}}cking},
title = {Adaptive routing with stale information},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {36},
pages = {3357--3371},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.01.055},
doi = {10.1016/J.TCS.2008.01.055},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FischerV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FleischerX09,
author = {Rudolf Fleischer and
Jinhui Xu},
title = {Foreword},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {45},
pages = {4533},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.016},
doi = {10.1016/J.TCS.2009.08.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FleischerX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FleischnerMPS09,
author = {Herbert Fleischner and
Egbert Mujuni and
Dani{\"{e}}l Paulusma and
Stefan Szeider},
title = {Covering graphs with few complete bipartite subgraphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2045--2053},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.059},
doi = {10.1016/J.TCS.2008.12.059},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FleischnerMPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FoataH09,
author = {Dominique Foata and
Guo{-}Niu Han},
title = {New permutation coding and equidistribution of set-valued statistics},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3743--3750},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.027},
doi = {10.1016/J.TCS.2009.04.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FoataH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FotakisKKMS09,
author = {Dimitris Fotakis and
Spyros C. Kontogiannis and
Elias Koutsoupias and
Marios Mavronicolas and
Paul G. Spirakis},
title = {The structure and complexity of Nash equilibria for a selfish routing
game},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {36},
pages = {3305--3326},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.01.004},
doi = {10.1016/J.TCS.2008.01.004},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FotakisKKMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FraigniaudGKLL09,
author = {Pierre Fraigniaud and
Cyril Gavoille and
Adrian Kosowski and
Emmanuelle Lebhar and
Zvi Lotker},
title = {Universal augmentation schemes for network navigability},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {1970--1981},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.061},
doi = {10.1016/J.TCS.2008.12.061},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FraigniaudGKLL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FrandsenF09,
author = {Gudmund Skovbjerg Frandsen and
Peter Frands Frandsen},
title = {Dynamic matrix rank},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {41},
pages = {4085--4093},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.012},
doi = {10.1016/J.TCS.2009.06.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FrandsenF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FreivaldsOM09,
author = {Rusins Freivalds and
Maris Ozols and
Laura Mancinska},
title = {Improved constructions of mixed state quantum automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {20},
pages = {1923--1931},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.028},
doi = {10.1016/J.TCS.2009.01.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FreivaldsOM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Frid09,
author = {Anna E. Frid},
title = {Simple equations on binary factorial languages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2947--2956},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.001},
doi = {10.1016/J.TCS.2009.03.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Frid09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FriedrichHN09,
author = {Tobias Friedrich and
Nils Hebbinghaus and
Frank Neumann},
title = {Comparison of simple diversity mechanisms on plateau functions},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {26},
pages = {2455--2462},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.08.021},
doi = {10.1016/J.TCS.2008.08.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FriedrichHN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FuHZ09,
author = {Bin Fu and
Yumei Huo and
Hairong Zhao},
title = {Exponential inapproximability and {FPTAS} for scheduling with availability
constraints},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2663--2674},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.012},
doi = {10.1016/J.TCS.2009.03.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FuHZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Gabbay09,
author = {Murdoch James Gabbay},
title = {A study of substitution, using nominal techniques and Fraenkel-Mostowksi
sets},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {12-13},
pages = {1159--1189},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.013},
doi = {10.1016/J.TCS.2008.11.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Gabbay09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GafniMRT09,
author = {Eli Gafni and
Achour Most{\'{e}}faoui and
Michel Raynal and
Corentin Travers},
title = {From adaptive renaming to set agreement},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {14},
pages = {1328--1335},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.05.016},
doi = {10.1016/J.TCS.2008.05.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GafniMRT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Gagie09,
author = {Travis Gagie},
title = {Compressed depth sequences},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {958--962},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.003},
doi = {10.1016/J.TCS.2008.11.003},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Gagie09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Gal09,
author = {Anna G{\'{a}}l},
title = {Preface: Special Issue of {ICALP} 2006 - dedicated to the memory of
Ingo Wegener},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {44},
pages = {4445},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.025},
doi = {10.1016/J.TCS.2009.07.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Gal09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GalatoloHR09,
author = {Stefano Galatolo and
Mathieu Hoyrup and
Cristobal Rojas},
title = {A constructive Borel-Cantelli lemma. Constructing orbits with required
statistical properties},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2207--2222},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.010},
doi = {10.1016/J.TCS.2009.02.010},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GalatoloHR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Gao09,
author = {Yong Gao},
title = {The degree distribution of random k-trees},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {688--695},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.015},
doi = {10.1016/J.TCS.2008.10.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Gao09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GarciaPCL09,
author = {Pedro Garc{\'{\i}}a and
Manuel {V{\'a}zquez de Parga} and
Antonio Cano and
Dami{\'{a}}n L{\'{o}}pez},
title = {On locally reversible languages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4961--4974},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.009},
doi = {10.1016/J.TCS.2009.07.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GarciaPCL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GargS09,
author = {Sanchit Garg and
{\'{E}}ric Schost},
title = {Interpolation of polynomials given by straight-line programs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2659--2662},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.030},
doi = {10.1016/J.TCS.2009.03.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GargS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GarzilloT09,
author = {Carmine Garzillo and
Giuseppe Trautteur},
title = {Computational virtuality in biological systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {323--331},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.044},
doi = {10.1016/J.TCS.2008.09.044},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GarzilloT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GassnerHKSW09,
author = {Elisabeth Gassner and
Johannes Hatzl and
Sven Oliver Krumke and
Heike Sperber and
Gerhard J. Woeginger},
title = {How hard is it to find extreme Nash equilibria in network congestion
games?},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4989--4999},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.046},
doi = {10.1016/J.TCS.2009.07.046},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GassnerHKSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GazagnaireGHTY09,
author = {Thomas Gazagnaire and
Blaise Genest and
Lo{\"{\i}}c H{\'{e}}lou{\"{e}}t and
P. S. Thiagarajan and
Shaofa Yang},
title = {Causal Message Sequence Charts},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {41},
pages = {4094--4110},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.013},
doi = {10.1016/J.TCS.2009.06.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GazagnaireGHTY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GilbertGN09,
author = {Seth Gilbert and
Rachid Guerraoui and
Calvin C. Newport},
title = {Of malicious motes and suspicious sensors: On the efficiency of malicious
interference in wireless networks},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {6-7},
pages = {546--569},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.008},
doi = {10.1016/J.TCS.2008.10.008},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GilbertGN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GlabbeekP09,
author = {Rob J. van Glabbeek and
Gordon D. Plotkin},
title = {Configuration structures, event structures and Petri nets},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {41},
pages = {4111--4159},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.014},
doi = {10.1016/J.TCS.2009.06.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GlabbeekP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GlasserSTZ09,
author = {Christian Gla{\ss}er and
Alan L. Selman and
Stephen D. Travers and
Liyu Zhang},
title = {Non-mitotic sets},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2011--2023},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.043},
doi = {10.1016/J.TCS.2008.12.043},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GlasserSTZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Goldstein09,
author = {Ilya Goldstein},
title = {Asymptotic subword complexity of fixed points of group substitutions},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2084--2098},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.025},
doi = {10.1016/J.TCS.2009.01.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Goldstein09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolovkinsKK09,
author = {Marats Golovkins and
Maksim Kravtsev and
Vasilijs Kravcevs},
title = {On a class of languages recognizable by probabilistic reversible decide-and-halt
automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {20},
pages = {1942--1951},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.042},
doi = {10.1016/J.TCS.2009.01.042},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GolovkinsKK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GonzalezN09,
author = {Rodrigo Gonz{\'{a}}lez and
Gonzalo Navarro},
title = {Rank/select on dynamic compressed sequences and applications},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4414--4422},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.022},
doi = {10.1016/J.TCS.2009.07.022},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GonzalezN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Goodman-Strauss09,
author = {Chaim Goodman{-}Strauss},
title = {Regular production systems and triangle tilings},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {16},
pages = {1534--1549},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.012},
doi = {10.1016/J.TCS.2008.12.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Goodman-Strauss09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GrasH09,
author = {Daniel Cabeza Gras and
Manuel V. Hermenegildo},
title = {Non-strict independence-based program parallelization using sharing
and freeness information},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {46},
pages = {4704--4723},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.044},
doi = {10.1016/J.TCS.2009.07.044},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GrasH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GraysonTT09,
author = {N. E. Grayson and
Anne Taormina and
Reidun Twarock},
title = {{DNA} duplex cage structures with icosahedral symmetry},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {15},
pages = {1440--1447},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.005},
doi = {10.1016/J.TCS.2008.12.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GraysonTT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GrecoS09,
author = {Gianluigi Greco and
Francesco Scarcello},
title = {On the complexity of constrained Nash equilibria in graphical games},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3901--3924},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.030},
doi = {10.1016/J.TCS.2009.05.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GrecoS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GreenbergR09,
author = {Sam Greenberg and
Dana Randall},
title = {Convergence rates of Markov chains for some self-assembly and non-saturated
Ising models},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {15},
pages = {1417--1427},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.007},
doi = {10.1016/J.TCS.2008.12.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GreenbergR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GruberH09,
author = {Hermann Gruber and
Markus Holzer},
title = {Language operations with regular expressions of polynomial size},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {35},
pages = {3281--3289},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.009},
doi = {10.1016/J.TCS.2009.04.009},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GruberH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GuerraouiHP09,
author = {Rachid Guerraoui and
Maurice Herlihy and
Bastian Pochon},
title = {A topological treatment of early-deciding set-agreement},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {6-7},
pages = {570--580},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.002},
doi = {10.1016/J.TCS.2008.10.002},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GuerraouiHP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Guglielmi09,
author = {Alessio Guglielmi},
title = {Personal portrait of Giorgio Levi},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {46},
pages = {4605--4607},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.036},
doi = {10.1016/J.TCS.2009.07.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Guglielmi09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GuignardS09,
author = {Adrien Guignard and
{\'{E}}ric Sopena},
title = {Compound Node-Kayles on paths},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2033--2044},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.053},
doi = {10.1016/J.TCS.2008.12.053},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GuignardS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Gumm09,
author = {H. Peter Gumm},
title = {Copower functors},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {12-13},
pages = {1129--1142},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.057},
doi = {10.1016/J.TCS.2008.09.057},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Gumm09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Guo09,
author = {Jiong Guo},
title = {A more effective linear kernelization for cluster editing},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {718--726},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.021},
doi = {10.1016/J.TCS.2008.10.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Guo09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GutinRK09,
author = {Gregory Z. Gutin and
Igor Razgon and
Eun Jung Kim},
title = {Minimum leaf out-branching and related problems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {45},
pages = {4571--4579},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.036},
doi = {10.1016/J.TCS.2009.03.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GutinRK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HadjidjB09,
author = {Rachid Hadjidj and
Hanifa Boucheneb},
title = {On-the-fly {TCTL} model checking for time Petri nets},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {42},
pages = {4241--4261},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.019},
doi = {10.1016/J.TCS.2009.06.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HadjidjB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HalavaHKS09,
author = {Vesa Halava and
Tero Harju and
Tomi K{\"{a}}rki and
Patrice S{\'{e}}{\'{e}}bold},
title = {Overlap-freeness in infinite partial words},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {943--948},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.041},
doi = {10.1016/J.TCS.2008.12.041},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HalavaHKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HalavaKM09,
author = {Vesa Halava and
Jarkko Kari and
Yuri V. Matiyasevich},
title = {On post correspondence problem for letter monotonic languages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2957--2960},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.040},
doi = {10.1016/J.TCS.2009.01.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HalavaKM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HallerO09,
author = {Philipp Haller and
Martin Odersky},
title = {Scala Actors: Unifying thread-based and event-based programming},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {2-3},
pages = {202--220},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.019},
doi = {10.1016/J.TCS.2008.09.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HallerO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HanS09,
author = {Yo{-}Sub Han and
Kai Salomaa},
title = {State complexity of basic operations on suffix-free regular languages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2537--2548},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.054},
doi = {10.1016/J.TCS.2008.12.054},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HanS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HanS09a,
author = {Yo{-}Sub Han and
Kai Salomaa},
title = {Nondeterministic state complexity of nested word automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2961--2971},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.004},
doi = {10.1016/J.TCS.2009.01.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HanS09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Harren09,
author = {Rolf Harren},
title = {Approximation algorithms for orthogonal packing problems for hypercubes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {44},
pages = {4504--4532},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.030},
doi = {10.1016/J.TCS.2009.07.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Harren09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Harvey09,
author = {David Harvey},
title = {A cache-friendly truncated {FFT}},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2649--2658},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.014},
doi = {10.1016/J.TCS.2009.03.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Harvey09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HasunumaIOU09,
author = {Toru Hasunuma and
Toshimasa Ishii and
Hirotaka Ono and
Yushi Uno},
title = {An O(n\({}^{\mbox{1.75}}\)) algorithm for L(2, 1)-labeling of trees},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3702--3710},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.025},
doi = {10.1016/J.TCS.2009.04.025},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HasunumaIOU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HeggernesP09,
author = {Pinar Heggernes and
Charis Papadopoulos},
title = {Single-edge monotonic sequences of graphs and linear-time algorithms
for minimal completions and deletions},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {1--15},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.07.020},
doi = {10.1016/J.TCS.2008.07.020},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HeggernesP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HermannP09,
author = {Miki Hermann and
Reinhard Pichler},
title = {Complexity of counting the optimal solutions},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3814--3825},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.025},
doi = {10.1016/J.TCS.2009.05.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HermannP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Hirvensalo09,
author = {Mika Hirvensalo},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {20},
pages = {1915},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.019},
doi = {10.1016/J.TCS.2009.01.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Hirvensalo09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HofPW09,
author = {Pim van 't Hof and
Dani{\"{e}}l Paulusma and
Gerhard J. Woeginger},
title = {Partitioning graphs into connected parts},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4834--4843},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.028},
doi = {10.1016/J.TCS.2009.06.028},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HofPW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Hoffmann09,
author = {Jan Hoffmann},
title = {Finding a tree structure in a resolution proof is NP-complete},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2295--2300},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.018},
doi = {10.1016/J.TCS.2009.02.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Hoffmann09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HogbergMM09,
author = {Johanna H{\"{o}}gberg and
Andreas Maletti and
Jonathan May},
title = {Backward and forward bisimulation minimization of tree automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {37},
pages = {3539--3552},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.022},
doi = {10.1016/J.TCS.2009.03.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HogbergMM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Holub09,
author = {Jan Holub},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {37},
pages = {3437},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.006},
doi = {10.1016/J.TCS.2009.06.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Holub09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HongPC09,
author = {Sung{-}Pil Hong and
Myoung{-}Ju Park and
Soo Y. Chang},
title = {Approximation of the k-batch consolidation problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {963--967},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.007},
doi = {10.1016/J.TCS.2008.11.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HongPC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HongS09,
author = {Soonjo Hong and
Sujin Shin},
title = {Cyclic renewal systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2675--2684},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.033},
doi = {10.1016/J.TCS.2009.03.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HongS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Honkala09,
author = {Juha Honkala},
title = {On the simplification of infinite morphic words},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {997--1000},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.037},
doi = {10.1016/J.TCS.2008.12.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Honkala09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HromkovicPS09,
author = {Juraj Hromkovic and
Holger Petersen and
Georg Schnitger},
title = {On the limits of the communication complexity technique for proving
lower bounds on the size of minimal NFA's},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2972--2981},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.020},
doi = {10.1016/J.TCS.2009.03.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HromkovicPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HsiehT09,
author = {Sun{-}Yuan Hsieh and
Chang{-}Jen Tu},
title = {Constructing edge-disjoint spanning trees in locally twisted cubes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {926--932},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.025},
doi = {10.1016/J.TCS.2008.12.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HsiehT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HuaWYL09,
author = {Qiang{-}Sheng Hua and
Yuexuan Wang and
Dongxiao Yu and
Francis C. M. Lau},
title = {Set multi-covering via inclusion-exclusion},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3882--3892},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.020},
doi = {10.1016/J.TCS.2009.05.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HuaWYL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Huang09,
author = {Yunbao Huang},
title = {The complexity of C\({}^{\mbox{bomega}}\)-words of the form w{\texttimes}w},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4892--4904},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.034},
doi = {10.1016/J.TCS.2009.06.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Huang09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HuffnerKMN09,
author = {Falk H{\"{u}}ffner and
Christian Komusiewicz and
Hannes Moser and
Rolf Niedermeier},
title = {Isolation concepts for clique enumeration: Comparison and computational
experiments},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5384--5397},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.008},
doi = {10.1016/J.TCS.2009.05.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HuffnerKMN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HundtLN09,
author = {Christian Hundt and
Maciej Liskiewicz and
Ragnar Nevries},
title = {A combinatorial geometrical approach to two-dimensional robust pattern
matching with scaling and rotation},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {51},
pages = {5317--5333},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.09.009},
doi = {10.1016/J.TCS.2009.09.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HundtLN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HutterS09,
author = {Marcus Hutter and
Rocco A. Servedio},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {19},
pages = {1747--1748},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.008},
doi = {10.1016/J.TCS.2009.01.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HutterS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/IbarraPR09,
author = {Oscar H. Ibarra and
Andrei Paun and
Alfonso Rodr{\'{\i}}guez{-}Pat{\'{o}}n},
title = {Sequential {SNP} systems based on min/max spike number},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2982--2991},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.004},
doi = {10.1016/J.TCS.2009.03.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/IbarraPR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/IkedaKY09,
author = {Satoshi Ikeda and
Izumi Kubo and
Masafumi Yamashita},
title = {The hitting and cover times of random walks on finite graphs using
local degree information},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {94--100},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.020},
doi = {10.1016/J.TCS.2008.10.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/IkedaKY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/IliopoulosR09,
author = {Costas S. Iliopoulos and
Wojciech Rytter},
title = {Foreword: Special issue in honor of the 60th birthday of Prof. Maxime
Crochemore},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4293--4294},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.012},
doi = {10.1016/J.TCS.2009.07.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/IliopoulosR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ImmorlicaLMS09,
author = {Nicole Immorlica and
Li (Erran) Li and
Vahab S. Mirrokni and
Andreas S. Schulz},
title = {Coordination mechanisms for selfish scheduling},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {17},
pages = {1589--1598},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.032},
doi = {10.1016/J.TCS.2008.12.032},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ImmorlicaLMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/IshaiMSW09,
author = {Yuval Ishai and
Tal Malkin and
Martin J. Strauss and
Rebecca N. Wright},
title = {Private multiparty sampling and approximation of vector combinations},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {18},
pages = {1730--1745},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.062},
doi = {10.1016/J.TCS.2008.12.062},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/IshaiMSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JacquetL09,
author = {Jean{-}Marie Jacquet and
Isabelle Linden},
title = {Fully abstract models and refinements as tools to compare agents in
timed coordination languages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {2-3},
pages = {221--253},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.020},
doi = {10.1016/J.TCS.2008.09.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JacquetL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JainK09,
author = {Sanjay Jain and
Efim B. Kinber},
title = {One-shot learners using negative counterexamples and nearest positive
examples},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2562--2580},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.013},
doi = {10.1016/J.TCS.2009.02.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JainK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JainSN09,
author = {Sanjay Jain and
Frank Stephan and
Nan Ye},
title = {Prescribed learning of r.e. classes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {19},
pages = {1796--1806},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.011},
doi = {10.1016/J.TCS.2009.01.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JainSN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JainZ09,
author = {Rahul Jain and
Shengyu Zhang},
title = {New bounds on classical and quantum one-way communication complexity},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {26},
pages = {2463--2477},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.014},
doi = {10.1016/J.TCS.2008.10.014},
timestamp = {Thu, 01 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JainZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JakobyLRS09,
author = {Andreas Jakoby and
Maciej Liskiewicz and
R{\"{u}}diger Reischuk and
Christian Schindelhauer},
title = {Improving the average delay of sorting},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {11},
pages = {1030--1041},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.028},
doi = {10.1016/J.TCS.2008.10.028},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/JakobyLRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JanssenP09,
author = {Jeannette C. M. Janssen and
Pawel Pralat},
title = {Protean graphs with a variety of ranking schemes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5491--5504},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.009},
doi = {10.1016/J.TCS.2009.05.009},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/JanssenP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JiC09,
author = {Min Ji and
T. C. Edwin Cheng},
title = {Parallel-machine scheduling of simple linear deteriorating jobs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3761--3768},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.018},
doi = {10.1016/J.TCS.2009.04.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JiC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JiangMP09,
author = {Tao Jiang and
Zevi Miller and
Dan Pritikin},
title = {Separation numbers of trees},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3769--3781},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.011},
doi = {10.1016/J.TCS.2009.05.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JiangMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JohnenN09,
author = {Colette Johnen and
Le Huy Nguyen},
title = {Robust self-stabilizing weight-based clustering algorithm},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {6-7},
pages = {581--594},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.009},
doi = {10.1016/J.TCS.2008.10.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JohnenN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JonoskaK09,
author = {Natasa Jonoska and
Jarkko Kari},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {15},
pages = {1415--1416},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.028},
doi = {10.1016/J.TCS.2008.12.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JonoskaK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JonoskaK09a,
author = {Natasa Jonoska and
Jarkko Kari},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {16},
pages = {1475--1476},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.002},
doi = {10.1016/J.TCS.2008.12.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JonoskaK09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JonoskaM09,
author = {Natasa Jonoska and
Gregory L. McColm},
title = {Complexity classes for self-assembling flexible tiles},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {332--346},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.054},
doi = {10.1016/J.TCS.2008.09.054},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JonoskaM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JonoskaP09,
author = {Natasa Jonoska and
Joni Burnette Pirnot},
title = {Finite state automata representing two-dimensional subshifts},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {37},
pages = {3504--3512},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.015},
doi = {10.1016/J.TCS.2009.03.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JonoskaP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JonoskaSW09,
author = {Natasa Jonoska and
Nadrian C. Seeman and
Gang Wu},
title = {On existence of reporter strands in DNA-based graph structures},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {15},
pages = {1448--1460},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.004},
doi = {10.1016/J.TCS.2008.12.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JonoskaSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JonssonKK09,
author = {Peter Jonsson and
Andrei A. Krokhin and
Fredrik Kuivinen},
title = {Hard constraint satisfaction problems have hard gaps at location 1},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3856--3874},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.022},
doi = {10.1016/J.TCS.2009.05.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JonssonKK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JungersPB09,
author = {Rapha{\"{e}}l M. Jungers and
Vladimir Protasov and
Vincent D. Blondel},
title = {Overlap-free words and spectra of matrices},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3670--3684},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.022},
doi = {10.1016/J.TCS.2009.04.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JungersPB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KaoRS09,
author = {Jui{-}Yi Kao and
Narad Rampersad and
Jeffrey O. Shallit},
title = {On NFAs where all states are final, initial, or both},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5010--5021},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.049},
doi = {10.1016/J.TCS.2009.07.049},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KaoRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KapahLLO09,
author = {Oren Kapah and
Gad M. Landau and
Avivit Levy and
Nitsan Oz},
title = {Interchange rearrangement: The element-cost model},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4315--4326},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.013},
doi = {10.1016/J.TCS.2009.07.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KapahLLO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KaporisS09,
author = {Alexis C. Kaporis and
Paul G. Spirakis},
title = {The price of optimum in Stackelberg games on arbitrary single commodity
networks and latency functions},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {745--755},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.002},
doi = {10.1016/J.TCS.2008.11.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KaporisS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KariMS09,
author = {Lila Kari and
Kalpana Mahalingam and
Shinnosuke Seki},
title = {Twin-roots of words and their properties},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {24-25},
pages = {2393--2400},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.032},
doi = {10.1016/J.TCS.2009.02.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KariMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KashanKG09,
author = {Ali Husseinzadeh Kashan and
Behrooz Karimi and
S. M. T. Fatemi Ghomi},
title = {A note on minimizing makespan on a single batch processing machine
with nonidentical job sizes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2754--2758},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.014},
doi = {10.1016/J.TCS.2009.02.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KashanKG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KawaguchiN09,
author = {Akifumi Kawaguchi and
Hiroshi Nagamochi},
title = {Drawing slicing graphs with face areas},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {11},
pages = {1061--1072},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.038},
doi = {10.1016/J.TCS.2008.10.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KawaguchiN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KellerKL09,
author = {Orgad Keller and
Tsvi Kopelowitz and
Moshe Lewenstein},
title = {On the longest common parameterized subsequence},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {51},
pages = {5347--5353},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.09.011},
doi = {10.1016/J.TCS.2009.09.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KellerKL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Keranen09,
author = {Veikko Ker{\"{a}}nen},
title = {A powerful abelian square-free substitution over 4 letters},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3893--3900},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.027},
doi = {10.1016/J.TCS.2009.05.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Keranen09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KhamisDE09,
author = {Soheir Mohamed Khamis and
Sameh S. Daoud and
Hanaa A. E. Essa},
title = {A randomized algorithm for determining dominating sets in graphs of
maximum degree five},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5122--5127},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.011},
doi = {10.1016/J.TCS.2009.08.011},
timestamp = {Thu, 03 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KhamisDE09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KiltzG09,
author = {Eike Kiltz and
David Galindo},
title = {Direct chosen-ciphertext secure identity-based key encapsulation without
random oracles},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5093--5111},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.007},
doi = {10.1016/J.TCS.2009.08.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KiltzG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kis09,
author = {Tam{\'{a}}s Kis},
title = {Scheduling multiprocessor {UET} tasks of two sizes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4864--4873},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.027},
doi = {10.1016/J.TCS.2009.06.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Kis09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KiwiST09,
author = {Marcos A. Kiwi and
Mauricio Soto and
Christopher Thraves},
title = {Adversarial queuing theory with setups},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {670--687},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.064},
doi = {10.1016/J.TCS.2008.09.064},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KiwiST09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kjos-HanssenN09,
author = {Bj{\o}rn Kjos{-}Hanssen and
Anil Nerode},
title = {Effective dimension of points visited by Brownian motion},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {347--354},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.045},
doi = {10.1016/J.TCS.2008.09.045},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Kjos-HanssenN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KleinB09,
author = {Shmuel T. Klein and
Miri Kopel Ben{-}Nissan},
title = {Accelerating Boyer-Moore searches on binary texts},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {37},
pages = {3563--3571},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.019},
doi = {10.1016/J.TCS.2009.03.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KleinB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Koga09,
author = {Hisashi Koga},
title = {Dynamic {TCP} acknowledgment with sliding window},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {914--925},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.017},
doi = {10.1016/J.TCS.2008.12.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Koga09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KoiranP09,
author = {Pascal Koiran and
Sylvain Perifel},
title = {{VPSPACE} and a transfer theorem over the complex field},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {50},
pages = {5244--5251},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.026},
doi = {10.1016/J.TCS.2009.08.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KoiranP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KolpakovK09,
author = {Roman Kolpakov and
Gregory Kucherov},
title = {Searching for gapped palindromes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {51},
pages = {5365--5373},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.09.013},
doi = {10.1016/J.TCS.2009.09.013},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KolpakovK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KomusiewiczHMN09,
author = {Christian Komusiewicz and
Falk H{\"{u}}ffner and
Hannes Moser and
Rolf Niedermeier},
title = {Isolation concepts for efficiently enumerating dense subgraphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3640--3654},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.021},
doi = {10.1016/J.TCS.2009.04.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KomusiewiczHMN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KontogiannisPS09,
author = {Spyros C. Kontogiannis and
Panagiota N. Panagopoulou and
Paul G. Spirakis},
title = {Polynomial algorithms for approximating Nash equilibria of bimatrix
games},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {17},
pages = {1599--1606},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.033},
doi = {10.1016/J.TCS.2008.12.033},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KontogiannisPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KontogiannisS09,
author = {Spyros C. Kontogiannis and
Paul G. Spirakis},
title = {On the support size of stable strategies in random games},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {933--942},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.056},
doi = {10.1016/J.TCS.2008.12.056},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KontogiannisS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KormanK09,
author = {Amos Korman and
Shay Kutten},
title = {A note on models for graph representations},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {14},
pages = {1401--1412},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.036},
doi = {10.1016/J.TCS.2008.10.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KormanK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KortewegMSV09,
author = {Peter Korteweg and
Alberto Marchetti{-}Spaccamela and
Leen Stougie and
Andrea Vitaletti},
title = {Data aggregation in sensor networks: Balancing communication and delay
costs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {14},
pages = {1346--1354},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.08.043},
doi = {10.1016/J.TCS.2008.08.043},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KortewegMSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kowalik09,
author = {Lukasz Kowalik},
title = {Improved edge-coloring with three colors},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3733--3742},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.005},
doi = {10.1016/J.TCS.2009.05.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Kowalik09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KowalikM09,
author = {Lukasz Kowalik and
Marcin Mucha},
title = {Deterministic 7/8-approximation for the metric maximum {TSP}},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5000--5009},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.051},
doi = {10.1016/J.TCS.2009.07.051},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KowalikM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KralovicK09,
author = {Rastislav Kralovic and
Richard Kr{\'{a}}lovic},
title = {Rapid almost-complete broadcasting in faulty networks},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {14},
pages = {1377--1387},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.023},
doi = {10.1016/J.TCS.2008.12.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KralovicK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KriegerMRRS09,
author = {Dalia Krieger and
Avery Miller and
Narad Rampersad and
Bala Ravikumar and
Jeffrey O. Shallit},
title = {Decimations of languages and state complexity},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {24-25},
pages = {2401--2409},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.024},
doi = {10.1016/J.TCS.2009.02.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KriegerMRRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Krishna09,
author = {Shankara Narayanan Krishna},
title = {Membrane computing with transport and embedded proteins},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {355--375},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.046},
doi = {10.1016/J.TCS.2008.09.046},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Krishna09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kucera09,
author = {Ludek Kucera},
title = {Foreword},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {50},
pages = {5201},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.021},
doi = {10.1016/J.TCS.2009.08.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Kucera09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KungLLHT09,
author = {Tzu{-}Liang Kung and
Cheng{-}Kuan Lin and
Tyne Liang and
Lih{-}Hsing Hsu and
Jimmy J. M. Tan},
title = {On the bipanpositionable bipanconnectedness of hypercubes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {801--811},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.004},
doi = {10.1016/J.TCS.2008.11.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KungLLHT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KutribMW09,
author = {Martin Kutrib and
Andreas Malcher and
Larissa Werlein},
title = {Regulated nondeterminism in pushdown automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {37},
pages = {3447--3460},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.002},
doi = {10.1016/J.TCS.2009.06.002},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KutribMW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KutylowskiH09,
author = {Jaroslaw Kutylowski and
Friedhelm Meyer auf der Heide},
title = {Optimal strategies for maintaining a chain of relays between an explorer
and a base camp},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {36},
pages = {3391--3405},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.04.010},
doi = {10.1016/J.TCS.2008.04.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KutylowskiH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KwiatkowskaNPV09,
author = {Marta Z. Kwiatkowska and
Gethin Norman and
David Parker and
Maria Grazia Vigliotti},
title = {Probabilistic Mobile Ambients},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {12-13},
pages = {1272--1303},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.058},
doi = {10.1016/J.TCS.2008.12.058},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KwiatkowskaNPV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ladyman09,
author = {James Ladyman},
title = {What does it mean to say that a physical system implements a computation?},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {376--383},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.047},
doi = {10.1016/J.TCS.2008.09.047},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ladyman09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LandoN09,
author = {Yuval Lando and
Zeev Nutov},
title = {Inapproximability of survivable networks},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2122--2125},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.036},
doi = {10.1016/J.TCS.2009.01.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LandoN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LaroseT09,
author = {Beno{\^{\i}}t Larose and
Pascal Tesson},
title = {Universal algebra and hardness results for constraint satisfaction
problems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {18},
pages = {1629--1647},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.048},
doi = {10.1016/J.TCS.2008.12.048},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LaroseT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LasserreLR09,
author = {Jean B. Lasserre and
Monique Laurent and
Philipp Rostalski},
title = {A prolongation-projection algorithm for computing the finite real
variety of an ideal},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2685--2700},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.024},
doi = {10.1016/J.TCS.2009.03.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LasserreLR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LathropLS09,
author = {James I. Lathrop and
Jack H. Lutz and
Scott M. Summers},
title = {Strict self-assembly of discrete Sierpinski triangles},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {384--405},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.062},
doi = {10.1016/J.TCS.2008.09.062},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LathropLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LavalleeS09,
author = {Ivan Lavall{\'{e}}e and
Alexander A. Shvartsman},
title = {Editors' preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {6-7},
pages = {451--452},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.001},
doi = {10.1016/J.TCS.2008.10.001},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LavalleeS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeeLP09,
author = {Kangbok Lee and
Joseph Y.{-}T. Leung and
Michael L. Pinedo},
title = {Online scheduling on two uniform machines subject to eligibility constraints},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3975--3981},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.032},
doi = {10.1016/J.TCS.2009.06.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeeLP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeeP09,
author = {Sunho Lee and
Kunsoo Park},
title = {Dynamic rank/select structures with applications to run-length encoded
texts},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4402--4413},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.021},
doi = {10.1016/J.TCS.2009.07.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeeP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LevequeMRT09,
author = {Benjamin L{\'{e}}v{\^{e}}que and
Fr{\'{e}}d{\'{e}}ric Maffray and
Bruce A. Reed and
Nicolas Trotignon},
title = {Coloring Artemis graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2234--2240},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.012},
doi = {10.1016/J.TCS.2009.02.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LevequeMRT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeviL09,
author = {Tamir Levi and
Ami Litman},
title = {Accelerating certain outputs of merging and sorting networks},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3725--3732},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.024},
doi = {10.1016/J.TCS.2009.04.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeviL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Li09,
author = {Angsheng Li},
title = {Elementary differences among jump classes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {11},
pages = {1042--1053},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.029},
doi = {10.1016/J.TCS.2008.10.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Li09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiDWGZW09,
author = {Deying Li and
Hongwei Du and
Peng{-}Jun Wan and
Xiaofeng Gao and
Zhao Zhang and
Weili Wu},
title = {Construction of strongly connected dominating sets in asymmetric multihop
wireless networks},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {661--669},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.058},
doi = {10.1016/J.TCS.2008.09.058},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LiDWGZW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiFZGY09,
author = {Minming Li and
Ze Feng and
Nan Zang and
Ronald L. Graham and
Frances F. Yao},
title = {Approximately optimal trees for group key management with batch updates},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {11},
pages = {1013--1021},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.034},
doi = {10.1016/J.TCS.2008.10.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiFZGY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiL09,
author = {Shuai Cheng Li and
Ming Li},
title = {On two open problems of 2-interval patterns},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {24-25},
pages = {2410--2423},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.033},
doi = {10.1016/J.TCS.2009.02.033},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiLZZ09,
author = {Jianping Li and
Weidong Li and
Tongquan Zhang and
Zhongxu Zhang},
title = {The subdivision-constrained minimum spanning tree problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {877--885},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.038},
doi = {10.1016/J.TCS.2008.12.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiLZZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiQ09,
author = {Lvzhou Li and
Daowen Qiu},
title = {A note on quantum sequential machines},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {26},
pages = {2529--2535},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.08.026},
doi = {10.1016/J.TCS.2008.08.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiQ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiY09,
author = {Shisheng Li and
Jinjiang Yuan},
title = {Scheduling with families of jobs and delivery coordination under job
availability},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4856--4863},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.025},
doi = {10.1016/J.TCS.2009.06.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiYCB09,
author = {Wenjie Li and
Jinjiang Yuan and
Jianfa Cao and
Hailin Bu},
title = {Online scheduling of unit length jobs on a batching machine to maximize
the number of early jobs with lookahead},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5182--5187},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.056},
doi = {10.1016/J.TCS.2009.07.056},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiYCB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiangM09,
author = {Chuck C. Liang and
Dale Miller},
title = {Focusing and polarization in linear, intuitionistic, and classical
logics},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {46},
pages = {4747--4768},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.041},
doi = {10.1016/J.TCS.2009.07.041},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LiangM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuCXZ09,
author = {Ming Liu and
Chengbin Chu and
Yinfeng Xu and
Feifeng Zheng},
title = {Online scheduling on m uniform machines to minimize total (weighted)
completion time},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3875--3881},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.023},
doi = {10.1016/J.TCS.2009.05.023},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LiuCXZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuFZL09,
author = {Hong Liu and
Haodi Feng and
Daming Zhu and
Junfeng Luan},
title = {Parameterized computational complexity of control problems in voting
systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2746--2753},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.004},
doi = {10.1016/J.TCS.2009.04.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiuFZL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuHW09,
author = {J. J. Liu and
G. S. Huang and
Y. L. Wang},
title = {A fast algorithm for finding the positions of all squares in a run-length
encoded string},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3942--3948},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.032},
doi = {10.1016/J.TCS.2009.05.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiuHW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuLS09,
author = {Ruifang Liu and
Zhonghua Lu and
Jinlong Shu},
title = {The minimal Laplacian spectral radius of trees with a given diameter},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {78--83},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.060},
doi = {10.1016/J.TCS.2008.09.060},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiuLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuTX09,
author = {Zi{-}Long Liu and
Fang Tian and
Jun{-}Ming Xu},
title = {Probabilistic analysis of upper bounds for 2-connected distance k-dominating
sets in graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3804--3813},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.028},
doi = {10.1016/J.TCS.2009.05.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiuTX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuXCZ09,
author = {Ming Liu and
Yinfeng Xu and
Chengbin Chu and
Feifeng Zheng},
title = {Online scheduling on two uniform machines to minimize the makespan},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2099--2109},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.007},
doi = {10.1016/J.TCS.2009.01.007},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LiuXCZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuXCZ09a,
author = {Ming Liu and
Yinfeng Xu and
Chengbin Chu and
Feifeng Zheng},
title = {Online scheduling to minimize modified total tardiness with an availability
constraint},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5039--5046},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.055},
doi = {10.1016/J.TCS.2009.07.055},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LiuXCZ09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuXP09,
author = {Xingwu Liu and
Zhiwei Xu and
Jianzhong Pan},
title = {Classifying rendezvous tasks of arbitrary dimension},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2162--2173},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.033},
doi = {10.1016/J.TCS.2009.01.033},
timestamp = {Sun, 26 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiuXP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LongpreM09,
author = {Luc Longpr{\'{e}} and
Pierre McKenzie},
title = {The complexity of Solitaire},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {50},
pages = {5252--5260},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.027},
doi = {10.1016/J.TCS.2009.08.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LongpreM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LoosMM09,
author = {Remco Loos and
Florin Manea and
Victor Mitrana},
title = {On small, reduced, and fast universal accepting networks of splicing
processors},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {406--416},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.048},
doi = {10.1016/J.TCS.2008.09.048},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LoosMM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LorenzJBDM09,
author = {Robert Lorenz and
Gabriel Juh{\'{a}}s and
Robin Bergenthum and
J{\"{o}}rg Desel and
Sebastian Mauser},
title = {Executability of scenarios in Petri nets},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {12-13},
pages = {1190--1216},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.014},
doi = {10.1016/J.TCS.2008.11.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LorenzJBDM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Lukkarila09,
author = {Ville Lukkarila},
title = {The 4-way deterministic tiling problem is undecidable},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {16},
pages = {1516--1533},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.006},
doi = {10.1016/J.TCS.2008.12.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Lukkarila09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ma09,
author = {Bin Ma},
title = {Why greed works for shortest common superstring problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {51},
pages = {5374--5381},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.09.014},
doi = {10.1016/J.TCS.2009.09.014},
timestamp = {Mon, 13 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ma09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Maher09,
author = {Michael J. Maher},
title = {Local consistency for extended CSPs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {46},
pages = {4769--4783},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.042},
doi = {10.1016/J.TCS.2009.07.042},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Maher09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Mahmud09,
author = {M. M. Hassan Mahmud},
title = {On universal transfer learning},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {19},
pages = {1826--1846},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.013},
doi = {10.1016/J.TCS.2009.01.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Mahmud09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MaierHL09,
author = {Markus Maier and
Matthias Hein and
Ulrike von Luxburg},
title = {Optimal construction of k-nearest-neighbor graphs for identifying
noisy clusters},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {19},
pages = {1749--1764},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.009},
doi = {10.1016/J.TCS.2009.01.009},
timestamp = {Mon, 30 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MaierHL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ManeaMY09,
author = {Florin Manea and
Victor Mitrana and
Takashi Yokomori},
title = {Two complementary operations inspired by the {DNA} hairpin formation:
Completion and reduction},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {417--425},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.049},
doi = {10.1016/J.TCS.2008.09.049},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ManeaMY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ManneMPT09,
author = {Fredrik Manne and
Morten Mjelde and
Laurence Pilard and
S{\'{e}}bastien Tixeuil},
title = {A new self-stabilizing maximal matching algorithm},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {14},
pages = {1336--1345},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.022},
doi = {10.1016/J.TCS.2008.12.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ManneMPT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MaoX09,
author = {Xuxin Mao and
Luoshan Xu},
title = {Meet continuity properties of posets},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {42},
pages = {4234--4240},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.017},
doi = {10.1016/J.TCS.2009.06.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MaoX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MartinezP09,
author = {Conrado Mart{\'{\i}}nez and
Helmut Prodinger},
title = {Moves and displacements of particular elements in Quicksort},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2279--2284},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.006},
doi = {10.1016/J.TCS.2009.01.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MartinezP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Marx09,
author = {D{\'{a}}niel Marx},
title = {A parameterized view on matroid optimization problems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {44},
pages = {4471--4479},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.027},
doi = {10.1016/J.TCS.2009.07.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Marx09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MarzbanGJ09,
author = {Marjan Marzban and
Qian{-}Ping Gu and
Xiaohua Jia},
title = {Computational study on planar dominating set problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5455--5466},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.012},
doi = {10.1016/J.TCS.2009.04.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MarzbanGJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MasakovaP09,
author = {Zuzana Mas{\'{a}}kov{\'{a}} and
Edita Pelantov{\'{a}}},
title = {Relation between powers of factors and the recurrence function characterizing
Sturmian words},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3589--3596},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.003},
doi = {10.1016/J.TCS.2009.04.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MasakovaP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Masopust09,
author = {Tom{\'{a}}s Masopust},
title = {On the descriptional complexity of scattered context grammars},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {108--112},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.017},
doi = {10.1016/J.TCS.2008.10.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Masopust09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Mathissen09,
author = {Christian Mathissen},
title = {Existential {MSO} over two successors is strictly weaker than over
linear orders},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3982--3987},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.019},
doi = {10.1016/J.TCS.2009.04.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Mathissen09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MatsubaraIISNH09,
author = {Wataru Matsubara and
Shunsuke Inenaga and
Akira Ishino and
Ayumi Shinohara and
Tomoyuki Nakamura and
Kazuo Hashimoto},
title = {Efficient algorithms to compute compressed longest common substrings
and compressed palindromes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {900--913},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.016},
doi = {10.1016/J.TCS.2008.12.016},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/MatsubaraIISNH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Mavronicolas09,
author = {Marios Mavronicolas},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {36},
pages = {3303--3304},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.001},
doi = {10.1016/J.TCS.2009.06.001},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Mavronicolas09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MavronicolasMS09,
author = {Marios Mavronicolas and
Loizos Michael and
Paul G. Spirakis},
title = {Computing on a partially eponymous ring},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {6-7},
pages = {595--613},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.010},
doi = {10.1016/J.TCS.2008.10.010},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/MavronicolasMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MedunaT09,
author = {Alexander Meduna and
Jir{\'{\i}} Techet},
title = {An infinite hierarchy of language families generated by scattered
context grammars with n-limited derivations},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {1961--1969},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.013},
doi = {10.1016/J.TCS.2008.12.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MedunaT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MikhailovaV09,
author = {I. A. Mikhailova and
Mikhail V. Volkov},
title = {Pattern avoidance by palindromes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2992--2998},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.037},
doi = {10.1016/J.TCS.2009.01.037},
timestamp = {Thu, 09 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MikhailovaV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MishnaR09,
author = {Marni Mishna and
Andrew Rechnitzer},
title = {Two non-holonomic lattice walks in the quarter plane},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3616--3630},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.008},
doi = {10.1016/J.TCS.2009.04.008},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/MishnaR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MittalPF09,
author = {Neeraj Mittal and
Kuppahalli L. Phaneesh and
Felix C. Freiling},
title = {Safe termination detection in an asynchronous distributed system when
processes may crash and recover},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {6-7},
pages = {614--628},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.011},
doi = {10.1016/J.TCS.2008.10.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MittalPF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MiyoshiSUW09,
author = {Naoto Miyoshi and
Takeya Shigezumi and
Ryuhei Uehara and
Osamu Watanabe},
title = {Scale free interval graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {45},
pages = {4588--4600},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.012},
doi = {10.1016/J.TCS.2009.08.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MiyoshiSUW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MohriMW09,
author = {Mehryar Mohri and
Pedro J. Moreno and
Eugene Weinstein},
title = {General suffix automaton construction algorithm and space bounds},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {37},
pages = {3553--3562},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.034},
doi = {10.1016/J.TCS.2009.03.034},
timestamp = {Wed, 26 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/MohriMW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Morizumi09,
author = {Hiroki Morizumi},
title = {Limiting negations in non-deterministic circuits},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3988--3994},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.018},
doi = {10.1016/J.TCS.2009.05.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Morizumi09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MorizumiT09,
author = {Hiroki Morizumi and
Jun Tarui},
title = {Linear-size log-depth negation-limited inverter for k-tonic binary
sequences},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {11},
pages = {1054--1060},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.030},
doi = {10.1016/J.TCS.2008.10.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MorizumiT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Moser09,
author = {Heinrich Moser},
title = {Towards a real-time distributed computing model},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {6-7},
pages = {629--659},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.012},
doi = {10.1016/J.TCS.2008.10.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Moser09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Moshe09,
author = {Yossi Moshe},
title = {On the joint subword complexity of automatic sequences},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3573--3588},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.041},
doi = {10.1016/J.TCS.2009.03.041},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Moshe09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MozesTWZ09,
author = {Shay Mozes and
Dekel Tsur and
Oren Weimann and
Michal Ziv{-}Ukelson},
title = {Fast algorithms for computing tree {LCS}},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4303--4314},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.011},
doi = {10.1016/J.TCS.2009.07.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MozesTWZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MrazOP09,
author = {Frantisek Mr{\'{a}}z and
Friedrich Otto and
Martin Pl{\'{a}}tek},
title = {The degree of word-expansion of lexicalized RRWW-automata - {A} new
measure for the degree of nondeterminism of (context-free) languages},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {37},
pages = {3530--3538},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.017},
doi = {10.1016/J.TCS.2009.03.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MrazOP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MullerS09,
author = {Johannes M{\"{u}}ller and
Christoph Spandl},
title = {A Curtis-Hedlund-Lyndon theorem for Besicovitch and Weyl spaces},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3606--3615},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.005},
doi = {10.1016/J.TCS.2009.04.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MullerS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NagoyaT09,
author = {Takayuki Nagoya and
Seinosuke Toda},
title = {Computational complexity of computing a partial solution for the Graph
Automorphism problems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2064--2071},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.001},
doi = {10.1016/J.TCS.2009.01.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NagoyaT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NgTHC09,
author = {C. T. Ng and
Zhiyi Tan and
Yong He and
T. C. Edwin Cheng},
title = {Two semi-online scheduling problems on two uniform machines},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {776--792},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.018},
doi = {10.1016/J.TCS.2008.11.018},
timestamp = {Thu, 28 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/NgTHC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NicolasMU09,
author = {Fran{\c{c}}ois Nicolas and
Veli M{\"{a}}kinen and
Esko Ukkonen},
title = {Efficient construction of maximal and minimal representations of motifs
of a string},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {2999--3005},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.013},
doi = {10.1016/J.TCS.2009.03.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NicolasMU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NiebertP09,
author = {Peter Niebert and
Doron A. Peled},
title = {Efficient model checking for {LTL} with partial order snapshots},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {42},
pages = {4180--4189},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.002},
doi = {10.1016/J.TCS.2009.03.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NiebertP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NikoletseasRS09,
author = {Sotiris E. Nikoletseas and
Christoforos L. Raptopoulos and
Paul G. Spirakis},
title = {Expander properties and the cover time of random intersection graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {50},
pages = {5261--5272},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.028},
doi = {10.1016/J.TCS.2009.08.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NikoletseasRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NisseS09,
author = {Nicolas Nisse and
David Soguet},
title = {Graph searching with advice},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {14},
pages = {1307--1318},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.08.020},
doi = {10.1016/J.TCS.2008.08.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NisseS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OllingerR09,
author = {Nicolas Ollinger and
Ga{\'{e}}tan Richard},
title = {Automata on the plane vs particles and collisions},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2767--2773},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.039},
doi = {10.1016/J.TCS.2009.03.039},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/OllingerR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OlveczkyT09,
author = {Peter Csaba {\"{O}}lveczky and
Stian Thorvaldsen},
title = {Formal modeling, performance estimation, and model checking of wireless
sensor network algorithms in Real-Time Maude},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {2-3},
pages = {254--280},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.022},
doi = {10.1016/J.TCS.2008.09.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/OlveczkyT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OrlovichGW09,
author = {Yury L. Orlovich and
Valery S. Gordon and
Dominique de Werra},
title = {On the inapproximability of independent domination in 2P\({}_{\mbox{3}}\)-free
perfect graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {977--982},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.023},
doi = {10.1016/J.TCS.2008.11.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/OrlovichGW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OswaldR09,
author = {Marcus Oswald and
Gerhard Reinelt},
title = {The simultaneous consecutive ones problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {1986--1992},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.039},
doi = {10.1016/J.TCS.2008.12.039},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/OswaldR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OuangraouaF09,
author = {A{\"{\i}}da Ouangraoua and
Pascal Ferraro},
title = {A constrained edit distance algorithm between semi-ordered trees},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {837--846},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.022},
doi = {10.1016/J.TCS.2008.11.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/OuangraouaF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Paquin09,
author = {Genevi{\`{e}}ve Paquin},
title = {On a generalization of Christoffel words: epichristoffel words},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3782--3791},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.014},
doi = {10.1016/J.TCS.2009.05.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Paquin09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ParkS09,
author = {Jung{-}Heum Park and
Sang Hyuk Son},
title = {Conditional matching preclusion for hypercube-like interconnection
networks},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2632--2640},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.041},
doi = {10.1016/J.TCS.2009.02.041},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ParkS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PaunPR09,
author = {Andrei Paun and
Mihaela Paun and
Alfonso Rodr{\'{\i}}guez{-}Pat{\'{o}}n},
title = {On the Hopcroft's minimization technique for {DFA} and {DFCA}},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {24-25},
pages = {2424--2430},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.034},
doi = {10.1016/J.TCS.2009.02.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PaunPR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PennaPW09,
author = {Paolo Penna and
Guido Proietti and
Peter Widmayer},
title = {Strongly polynomial-time truthful mechanisms in one shot},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {17},
pages = {1607--1615},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.034},
doi = {10.1016/J.TCS.2008.12.034},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/PennaPW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PiaoS09,
author = {Xiaoxue Piao and
Kai Salomaa},
title = {Operational state complexity of nested word automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {35},
pages = {3290--3302},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.002},
doi = {10.1016/J.TCS.2009.05.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PiaoS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Pizzi09,
author = {Cinzia Pizzi},
title = {k-difference matching in amortized linear time for all the words in
a text},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {983--987},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.018},
doi = {10.1016/J.TCS.2008.12.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Pizzi09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PopescuSR09,
author = {Andrei Popescu and
Traian{-}Florin Serbanuta and
Grigore Rosu},
title = {A semantic approach to interpolation},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {12-13},
pages = {1109--1128},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.038},
doi = {10.1016/J.TCS.2008.09.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PopescuSR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PrencipeZ09,
author = {Giuseppe Prencipe and
Shmuel Zaks},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {14},
pages = {1305--1306},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.027},
doi = {10.1016/J.TCS.2008.12.027},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/PrencipeZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Preoteasa09,
author = {Viorel Preoteasa},
title = {Frame rule for mutually recursive procedures manipulating pointers},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {42},
pages = {4216--4233},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.016},
doi = {10.1016/J.TCS.2009.05.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Preoteasa09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/QiZY09,
author = {Xianglai Qi and
Shiguo Zhou and
Jinjiang Yuan},
title = {Single machine parallel-batch scheduling with deteriorating jobs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {830--836},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.009},
doi = {10.1016/J.TCS.2008.11.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/QiZY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/QiuY09,
author = {Daowen Qiu and
Sheng Yu},
title = {Hierarchy and equivalence of multi-letter quantum finite automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {3006--3017},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.040},
doi = {10.1016/J.TCS.2009.03.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/QiuY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RampersadSSR09,
author = {Narad Rampersad and
Nicolae Santean and
Jeffrey O. Shallit and
Bala Ravikumar},
title = {State complexity of unique rational operations},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {24-25},
pages = {2431--2441},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.035},
doi = {10.1016/J.TCS.2009.02.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RampersadSSR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RegnaultST09,
author = {Damien Regnault and
Nicolas Schabanel and
Eric Thierry},
title = {Progresses in the analysis of stochastic 2D cellular automata: {A}
study of asynchronous 2D minority},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4844--4855},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.024},
doi = {10.1016/J.TCS.2009.06.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RegnaultST09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ReidenbachS09,
author = {Daniel Reidenbach and
Johannes C. Schneider},
title = {Morphically primitive words},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2148--2161},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.020},
doi = {10.1016/J.TCS.2009.01.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ReidenbachS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ReifS09,
author = {John H. Reif and
Sudheer Sahu},
title = {Autonomous programmable {DNA} nanorobotic devices using DNAzymes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {15},
pages = {1428--1439},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.003},
doi = {10.1016/J.TCS.2008.12.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ReifS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RestivoR09,
author = {Antonio Restivo and
Giovanna Rosone},
title = {Burrows-Wheeler transform and palindromic richness},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {3018--3026},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.008},
doi = {10.1016/J.TCS.2009.03.008},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RestivoR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rhodes09,
author = {Mark Nicholas Charles Rhodes},
title = {On the Chv{\'{a}}tal rank of the Pigeonhole Principle},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2774--2778},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.035},
doi = {10.1016/J.TCS.2009.03.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rhodes09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rozenberg09,
author = {Grzegorz Rozenberg},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {281--282},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.003},
doi = {10.1016/J.TCS.2009.01.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rozenberg09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rozenberg09a,
author = {Grzegorz Rozenberg},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {15},
pages = {1413--1414},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.008},
doi = {10.1016/J.TCS.2009.02.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rozenberg09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rozenberg09b,
author = {Grzegorz Rozenberg},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {16},
pages = {1473--1474},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.009},
doi = {10.1016/J.TCS.2009.02.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rozenberg09b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rozenberg09c,
author = {Grzegorz Rozenberg},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {20},
pages = {1913--1914},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.028},
doi = {10.1016/J.TCS.2009.03.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rozenberg09c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rozenberg09d,
author = {Grzegorz Rozenberg},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {26},
pages = {2453--2454},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.013},
doi = {10.1016/J.TCS.2009.04.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rozenberg09d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rozenberg09e,
author = {Grzegorz Rozenberg},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {33-34},
pages = {3035--3036},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.001},
doi = {10.1016/J.TCS.2009.07.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rozenberg09e.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Saez09,
author = {Pablo S{\'{a}}ez},
title = {A quadratic algorithm for the 2-cyclic robotic scheduling problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {973--976},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.016},
doi = {10.1016/J.TCS.2008.11.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Saez09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sakai09,
author = {Yoshifumi Sakai},
title = {Computing the longest topological common subsequence of a symbol-wise
totally ordered directed acyclic graph and a sequence},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2759--2766},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.027},
doi = {10.1016/J.TCS.2009.03.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Sakai09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Salamon09,
author = {G{\'{a}}bor Salamon},
title = {Approximating the Maximum Internal Spanning Tree problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {50},
pages = {5273--5284},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.029},
doi = {10.1016/J.TCS.2009.08.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Salamon09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SalomaaYZ09,
author = {Kai Salomaa and
Sheng Yu and
Jinfeng Zan},
title = {Deciding determinism of caterpillar expressions},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {37},
pages = {3438--3446},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.010},
doi = {10.1016/J.TCS.2009.03.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SalomaaYZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SalsonLLM09,
author = {Mika{\"{e}}l Salson and
Thierry Lecroq and
Martine L{\'{e}}onard and
Laurent Mouchard},
title = {A four-stage algorithm for updating a Burrows-Wheeler transform},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4350--4359},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.016},
doi = {10.1016/J.TCS.2009.07.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SalsonLLM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sankowski09,
author = {Piotr Sankowski},
title = {Maximum weight bipartite matching in matrix multiplication time},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {44},
pages = {4480--4488},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.028},
doi = {10.1016/J.TCS.2009.07.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Sankowski09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SchroderM09,
author = {Lutz Schr{\"{o}}der and
Till Mossakowski},
title = {HasCasl: Integrated higher-order specification and program development},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {12-13},
pages = {1217--1260},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.020},
doi = {10.1016/J.TCS.2008.11.020},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/SchroderM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SgallST09,
author = {Jir{\'{\i}} Sgall and
Hadas Shachnai and
Tami Tamir},
title = {Periodic scheduling with obligatory vacations},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5112--5121},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.008},
doi = {10.1016/J.TCS.2009.08.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SgallST09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShenQC09,
author = {Zhizhang Shen and
Ke Qiu and
Eddie Cheng},
title = {On the surface area of the (n, k)-star graph},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5481--5490},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.007},
doi = {10.1016/J.TCS.2009.05.007},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ShenQC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShinK09,
author = {Kilho Shin and
Tetsuji Kuboyama},
title = {Polynomial summaries of positive semidefinite kernels},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {19},
pages = {1847--1862},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.014},
doi = {10.1016/J.TCS.2009.01.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ShinK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShoaranT09,
author = {Maryam Shoaran and
Alex Thomo},
title = {Fault-tolerant computation of distributed regular path queries},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {62--77},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.061},
doi = {10.1016/J.TCS.2008.09.061},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ShoaranT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Simonsen09,
author = {Jakob Grue Simonsen},
title = {On the computational complexity of the languages of general symbolic
dynamical systems and beta-shifts},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4878--4891},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.037},
doi = {10.1016/J.TCS.2009.06.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Simonsen09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SmythW09,
author = {William F. Smyth and
Shu Wang},
title = {A new approach to the periodicity lemma on strings with holes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4295--4302},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.010},
doi = {10.1016/J.TCS.2009.07.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SmythW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SpirakisMK09,
author = {Paul G. Spirakis and
Marios Mavronicolas and
Spyros C. Kontogiannis},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {17},
pages = {1551},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.026},
doi = {10.1016/J.TCS.2008.12.026},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/SpirakisMK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SpoerhaseW09,
author = {Joachim Spoerhase and
Hans{-}Christoph Wirth},
title = {(r, p)-centroid problems on paths and trees},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5128--5137},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.020},
doi = {10.1016/J.TCS.2009.08.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SpoerhaseW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SteinbyT09,
author = {Magnus Steinby and
Catalin Ionut Tirn\u{a}uc\u{a}},
title = {Defining syntax-directed translations by tree bimorphisms},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {37},
pages = {3495--3503},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.009},
doi = {10.1016/J.TCS.2009.03.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SteinbyT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SuPH09,
author = {Chi{-}Shiang Su and
Jason Chao{-}Hsien Pan and
Tsung{-}Shin Hsu},
title = {A new heuristic algorithm for the machine scheduling problem with
job delivery coordination},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2581--2591},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.019},
doi = {10.1016/J.TCS.2009.02.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SuPH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SuchanT09,
author = {Karol Suchan and
Ioan Todinca},
title = {Minimal interval completion through graph exploration},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {35--43},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.053},
doi = {10.1016/J.TCS.2008.09.053},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SuchanT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sudholt09,
author = {Dirk Sudholt},
title = {The impact of parametrization in memetic evolutionary algorithms},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {26},
pages = {2511--2528},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.003},
doi = {10.1016/J.TCS.2009.03.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Sudholt09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SunP09,
author = {He Sun and
Chung Keung Poon},
title = {Two improved range-efficient algorithms for F\({}_{\mbox{0}}\) estimation},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {11},
pages = {1073--1080},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.031},
doi = {10.1016/J.TCS.2008.10.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SunP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Susilo09,
author = {Willy Susilo},
title = {Short fail-stop signature scheme based on factorization and discrete
logarithm assumptions},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {736--744},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.025},
doi = {10.1016/J.TCS.2008.10.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Susilo09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Tani09,
author = {Seiichiro Tani},
title = {Claw finding algorithms using quantum walk},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {50},
pages = {5285--5297},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.030},
doi = {10.1016/J.TCS.2009.08.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Tani09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ThakurT09,
author = {Mayur Thakur and
Rahul Tripathi},
title = {Linear connectivity problems in directed hypergraphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2592--2618},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.038},
doi = {10.1016/J.TCS.2009.02.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ThakurT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TianFY09,
author = {Ji Tian and
Ruyan Fu and
Jinjiang Yuan},
title = {A best online algorithm for scheduling on two parallel batch machines},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2291--2294},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.011},
doi = {10.1016/J.TCS.2009.02.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TianFY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TijdemanZ09,
author = {Robert Tijdeman and
Luca Q. Zamboni},
title = {Fine and Wilf words for any periods {II}},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {30-32},
pages = {3027--3034},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.004},
doi = {10.1016/J.TCS.2009.02.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TijdemanZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TirnaucaK09,
author = {Cristina Tirn\u{a}uc\u{a} and
Satoshi Kobayashi},
title = {Necessary and sufficient conditions for learning with correction queries},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5145--5157},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.09.004},
doi = {10.1016/J.TCS.2009.09.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TirnaucaK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Tsai09,
author = {Tsung{-}Hsi Tsai},
title = {Efficient computation of the iteration of functions},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {988--993},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.019},
doi = {10.1016/J.TCS.2008.12.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Tsai09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TsaiFC09,
author = {Ping{-}Ying Tsai and
Jung{-}Sheng Fu and
Gen{-}Huey Chen},
title = {Fault-free longest paths in star networks with conditional link faults},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {766--775},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.012},
doi = {10.1016/J.TCS.2008.11.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TsaiFC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ueda09,
author = {Kazunori Ueda},
title = {LMNtal as a hierarchical logic programming language},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {46},
pages = {4784--4800},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.043},
doi = {10.1016/J.TCS.2009.07.043},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ueda09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ukkonen09,
author = {Esko Ukkonen},
title = {Maximal and minimal representations of gapped and non-gapped motifs
of a string},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4341--4349},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.015},
doi = {10.1016/J.TCS.2009.07.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ukkonen09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Uscka-Wehlou09,
author = {Hanna Uscka{-}Wehlou},
title = {Two equivalence relations on digital lines with irrational slopes.
{A} continued fraction approach to upper mechanical words},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3655--3669},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.026},
doi = {10.1016/J.TCS.2009.04.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Uscka-Wehlou09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Vagvolgyi09,
author = {S{\'{a}}ndor V{\'{a}}gv{\"{o}}lgyi},
title = {Deterministic bottom-up tree transducers and ground term rewrite systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2250--2278},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.040},
doi = {10.1016/J.TCS.2009.02.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Vagvolgyi09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/VersariB09,
author = {Cristian Versari and
Nadia Busi},
title = {Stochastic biological modelling in the presence of multiple compartments},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {33-34},
pages = {3039--3064},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.038},
doi = {10.1016/J.TCS.2009.03.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/VersariB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Volkov09,
author = {Mikhail V. Volkov},
title = {Synchronizing automata preserving a chain of partial orders},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {37},
pages = {3513--3519},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.021},
doi = {10.1016/J.TCS.2009.03.021},
timestamp = {Thu, 09 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Volkov09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Vyugin09,
author = {Vladimir V. V'yugin},
title = {On calibration error of randomized forecasting algorithms},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {19},
pages = {1781--1795},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.010},
doi = {10.1016/J.TCS.2009.01.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Vyugin09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WagnerB09,
author = {Peter Wagner and
Andreas Brandst{\"{a}}dt},
title = {The complete inclusion structure of leaf power classes},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5505--5514},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.031},
doi = {10.1016/J.TCS.2009.06.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WagnerB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Wahlen09,
author = {Martin Wahlen},
title = {On the complexity of approximating the Hadwiger number},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {994--996},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.020},
doi = {10.1016/J.TCS.2008.12.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Wahlen09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WangL09,
author = {Guanghui Wang and
Guizhen Liu},
title = {Paths, cycles and circular colorings in digraphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {1982--1985},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.014},
doi = {10.1016/J.TCS.2008.12.014},
timestamp = {Mon, 14 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WangL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Welch09,
author = {Philip D. Welch},
title = {Characteristics of discrete transfinite time Turing machine models:
Halting times, stabilization times, and Normal Form theorems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {426--442},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.050},
doi = {10.1016/J.TCS.2008.09.050},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Welch09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Winskel09,
author = {Glynn Winskel},
title = {Prime algebraicity},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {41},
pages = {4160--4168},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.015},
doi = {10.1016/J.TCS.2009.06.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Winskel09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WittmannSBT09,
author = {Dominik M. Wittmann and
Daniel Schmidl and
Florian Bl{\"{o}}chl and
Fabian J. Theis},
title = {Reconstruction of graphs based on random walks},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3826--3838},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.026},
doi = {10.1016/J.TCS.2009.05.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WittmannSBT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WoodsN09,
author = {Damien Woods and
Turlough Neary},
title = {The complexity of small universal Turing machines: {A} survey},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {443--450},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.051},
doi = {10.1016/J.TCS.2008.09.051},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/WoodsN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WuLC09,
author = {Weiwei Wu and
Minming Li and
Enhong Chen},
title = {Optimal tree structures for group key tree management considering
insertion and deletion cost},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2619--2631},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.039},
doi = {10.1016/J.TCS.2009.02.039},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WuLC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YakaryilmazS09,
author = {Abuzer Yakaryilmaz and
A. C. Cem Say},
title = {Efficient probability amplification in two-way quantum finite automata},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {20},
pages = {1932--1941},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.029},
doi = {10.1016/J.TCS.2009.01.029},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/YakaryilmazS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YangCTW09,
author = {Jinn{-}Shyong Yang and
Jou{-}Ming Chang and
Shyue{-}Ming Tang and
Yue{-}Li Wang},
title = {On the independent spanning trees of recursive circulant graphs G(cd\({}^{\mbox{m}}\),
d) with d{\textgreater}2},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2001--2010},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.042},
doi = {10.1016/J.TCS.2008.12.042},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YangCTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YangW09,
author = {Boting Yang and
Cao An Wang},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5383},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.09.027},
doi = {10.1016/J.TCS.2009.09.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YangW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YaoYZ09,
author = {Andrew Chi{-}Chih Yao and
Frances F. Yao and
Yunlei Zhao},
title = {A note on universal composable zero-knowledge in the common reference
string model},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {11},
pages = {1099--1108},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.027},
doi = {10.1016/J.TCS.2008.10.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YaoYZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YenC09,
author = {Hsu{-}Chun Yen and
Chien{-}Liang Chen},
title = {On minimal elements of upward-closed sets},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {24-25},
pages = {2442--2452},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.036},
doi = {10.1016/J.TCS.2009.02.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YenC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Yi09,
author = {Chih{-}Wei Yi},
title = {Maximum scan statistics and channel assignment problems in homogeneous
wireless networks},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2223--2233},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.027},
doi = {10.1016/J.TCS.2009.02.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Yi09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Yoshinaka09,
author = {Ryo Yoshinaka},
title = {Learning efficiency of very simple grammars from positive data},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {19},
pages = {1807--1825},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.012},
doi = {10.1016/J.TCS.2009.01.012},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Yoshinaka09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Yu09,
author = {Changyuan Yu},
title = {Truthful mechanisms for two-range-values variant of unrelated scheduling},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2196--2206},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.001},
doi = {10.1016/J.TCS.2009.02.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Yu09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YuHLLX09,
author = {Dongxiao Yu and
Jianfeng Hou and
Guizhen Liu and
Bin Liu and
Lan Xu},
title = {Acyclic edge coloring of planar graphs with large girth},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5196--5200},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.08.015},
doi = {10.1016/J.TCS.2009.08.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YuHLLX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Zandron09,
author = {Claudio Zandron},
title = {Nadia Busi {(1968-2007)}},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {4-5},
pages = {285},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.09.063},
doi = {10.1016/J.TCS.2008.09.063},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Zandron09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangGW09,
author = {Zhao Zhang and
Xiaofeng Gao and
Weili Wu},
title = {Algorithms for connected set cover problem and fault-tolerant connected
set cover problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {812--817},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.005},
doi = {10.1016/J.TCS.2008.11.005},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ZhangGW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangGW09a,
author = {Zhao Zhang and
Xiaofeng Gao and
Weili Wu},
title = {{PTAS} for connected vertex cover in unit disk graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {52},
pages = {5398--5402},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.01.035},
doi = {10.1016/J.TCS.2009.01.035},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ZhangGW09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangJT09,
author = {An Zhang and
Yiwei Jiang and
Zhiyi Tan},
title = {Online parallel machines scheduling with two hierarchies},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3597--3605},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.04.007},
doi = {10.1016/J.TCS.2009.04.007},
timestamp = {Mon, 16 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZhangJT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangS09,
author = {Yuchen Zhang and
Xiaoming Sun},
title = {The antimagicness of the Cartesian product of graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {727--735},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.023},
doi = {10.1016/J.TCS.2008.10.023},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ZhangS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangX09,
author = {Peng Zhang and
Mingji Xia},
title = {An approximation algorithm to the k-Steiner Forest problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {11},
pages = {1093--1098},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.033},
doi = {10.1016/J.TCS.2008.10.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZhangX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangZP09,
author = {Xingyi Zhang and
Xiangxiang Zeng and
Linqiang Pan},
title = {On languages generated by asynchronous spiking neural {P} systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {26},
pages = {2478--2488},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.055},
doi = {10.1016/J.TCS.2008.12.055},
timestamp = {Tue, 26 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ZhangZP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhaoCT09,
author = {Yingchao Zhao and
Wei Chen and
Shang{-}Hua Teng},
title = {The isolation game: {A} game of distances},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4905--4919},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.036},
doi = {10.1016/J.TCS.2009.06.036},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZhaoCT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhaoG09,
author = {Shang{-}Wei Zhao and
Xiao{-}Shan Gao},
title = {Minimal achievable approximation ratio for {MAX-MQ} in finite fields},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2285--2290},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.003},
doi = {10.1016/J.TCS.2009.02.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZhaoG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhaoT09,
author = {Yingchao Zhao and
Shang{-}Hua Teng},
title = {Combinatorial and spectral aspects of nearest neighbor graphs in doubling
dimensional and nearly-Euclidean spaces},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {11},
pages = {1081--1092},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.032},
doi = {10.1016/J.TCS.2008.10.032},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ZhaoT09.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-11 03:40 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:
