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/tcs412.bht:"
download as .bib file
@article{DBLP:journals/tcs/Abraham11,
author = {Uri Abraham},
title = {Logical classification of distributed algorithms (Bakery algorithms
as an example)},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {25},
pages = {2724--2745},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.030},
doi = {10.1016/J.TCS.2011.01.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Abraham11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AbujaradK11,
author = {Fuad Abujarad and
Sandeep S. Kulkarni},
title = {Automated constraint-based addition of nonmasking and stabilizing
fault-tolerance},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {33},
pages = {4228--4246},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.008},
doi = {10.1016/J.TCS.2011.02.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AbujaradK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AcetoCILP11,
author = {Luca Aceto and
Taolue Chen and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Bas Luttik and
Jaco van de Pol},
title = {On the axiomatizability of priority {II}},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3035--3044},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.033},
doi = {10.1016/J.TCS.2011.02.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AcetoCILP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AcetoCIMR11,
author = {Luca Aceto and
Matteo Cimini and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Mohammad Reza Mousavi and
Michel A. Reniers},
title = {{SOS} rule formats for zero and unit elements},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3045--3071},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.024},
doi = {10.1016/J.TCS.2011.01.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AcetoCIMR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AdamekMV11,
author = {Jir{\'{\i}} Ad{\'{a}}mek and
Stefan Milius and
Jir{\'{\i}} Velebil},
title = {On second-order iterative monads},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {38},
pages = {4969--4988},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.027},
doi = {10.1016/J.TCS.2011.04.027},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AdamekMV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AdlerDFST11,
author = {Isolde Adler and
Frederic Dorn and
Fedor V. Fomin and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {Faster parameterized algorithms for minor containment},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {7018--7028},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.015},
doi = {10.1016/J.TCS.2011.09.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AdlerDFST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Afrati11,
author = {Foto N. Afrati},
title = {Determinacy and query rewriting for conjunctive queries and views},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {11},
pages = {1005--1021},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.031},
doi = {10.1016/J.TCS.2010.12.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Afrati11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AgrawalL11,
author = {Manindra Agrawal and
Angsheng Li},
title = {Theory and applications of models of computation {(TAMC} 2008)},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {18},
pages = {1645},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.039},
doi = {10.1016/J.TCS.2010.12.039},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AgrawalL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AguadoM11,
author = {Joaqu{\'{\i}}n Aguado and
Michael Mendler},
title = {Constructive semantics for instantaneous reactions},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {11},
pages = {931--961},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.007},
doi = {10.1016/J.TCS.2010.09.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AguadoM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Akama11,
author = {Yohji Akama},
title = {Set systems: Order types, continuous nondeterministic deformations,
and quasi-orders},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6235--6251},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.010},
doi = {10.1016/J.TCS.2011.08.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Akama11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AkutsuFTT11,
author = {Tatsuya Akutsu and
Daiji Fukagawa and
Atsuhiro Takasu and
Takeyuki Tamura},
title = {Exact algorithms for computing the tree edit distance between unordered
trees},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {352--364},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.002},
doi = {10.1016/J.TCS.2010.10.002},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AkutsuFTT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlbersM11,
author = {Susanne Albers and
Alberto Marchetti{-}Spaccamela},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {24},
pages = {2563},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.019},
doi = {10.1016/J.TCS.2011.01.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlbersM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlechinaDLM11,
author = {Natasha Alechina and
Mehdi Dastani and
Brian Logan and
John{-}Jules Ch. Meyer},
title = {Reasoning about plan revision in {BDI} agent programs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {44},
pages = {6115--6134},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.052},
doi = {10.1016/J.TCS.2011.05.052},
timestamp = {Wed, 08 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlechinaDLM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlhazovKRV11,
author = {Artiom Alhazov and
Alexander Krassovitskiy and
Yurii Rogozhin and
Sergey Verlan},
title = {P systems with minimal insertion and deletion},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {136--144},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.025},
doi = {10.1016/J.TCS.2010.08.025},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlhazovKRV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlhazovV11,
author = {Artiom Alhazov and
Sergey Verlan},
title = {Minimization strategies for maximally parallel multiset rewriting
systems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {17},
pages = {1581--1591},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.033},
doi = {10.1016/J.TCS.2010.10.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlhazovV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlimontiFLN11,
author = {Paola Alimonti and
Esteban Feuerstein and
Luigi Laura and
Umberto Nanni},
title = {Linear time analysis of properties of conflict-free and general Petri
nets},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {320--338},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.030},
doi = {10.1016/J.TCS.2010.09.030},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlimontiFLN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlloucheM11,
author = {Jean{-}Paul Allouche and
Laurence Maillard{-}Teyssier},
title = {Inconstancy of finite and infinite sequences},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2268--2281},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.004},
doi = {10.1016/J.TCS.2011.01.004},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AlloucheM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AltshulerB11,
author = {Yaniv Altshuler and
Alfred M. Bruckstein},
title = {Static and expanding grid coverage with ant robots: Complexity results},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4661--4674},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.001},
doi = {10.1016/J.TCS.2011.05.001},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AltshulerB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Alvarez-MirandaCHHC11,
author = {Eduardo {\'{A}}lvarez{-}Miranda and
Xujin Chen and
Jie Hu and
Xiaodong Hu and
Alfredo Candia{-}V{\'{e}}jar},
title = {Deterministic risk control for cost-effective network connections},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {3},
pages = {257--264},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.08.019},
doi = {10.1016/J.TCS.2009.08.019},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Alvarez-MirandaCHHC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlvarezBS11,
author = {Carme {\`{A}}lvarez and
Maria J. Blesa and
Maria J. Serna},
title = {The robustness of stability under link and node failures},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {6855--6878},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.038},
doi = {10.1016/J.TCS.2011.08.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlvarezBS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AmanoT11,
author = {Kazuyuki Amano and
Jun Tarui},
title = {A well-mixed function with circuit complexity 5n: Tightness of the
Lachish-Raz-type bounds},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {18},
pages = {1646--1651},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.040},
doi = {10.1016/J.TCS.2010.12.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AmanoT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ambos-SpiesBG11,
author = {Klaus Ambos{-}Spies and
Serikzhan A. Badaev and
Sergey S. Goncharov},
title = {Inductive inference and computable numberings},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {18},
pages = {1652--1668},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.041},
doi = {10.1016/J.TCS.2010.12.041},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ambos-SpiesBG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AmirEKLP11,
author = {Amihood Amir and
Estrella Eisenberg and
Orgad Keller and
Avivit Levy and
Ely Porat},
title = {Approximate string matching with stuck address bits},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3537--3544},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.044},
doi = {10.1016/J.TCS.2011.02.044},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AmirEKLP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AmirLNPPS11,
author = {Amihood Amir and
Gad M. Landau and
Joong Chae Na and
Heejin Park and
Kunsoo Park and
Jeong Seop Sim},
title = {Efficient algorithms for consensus string problems minimizing both
distance sum and radius},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5239--5246},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.034},
doi = {10.1016/J.TCS.2011.05.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AmirLNPPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AnagnostopoulosKMU11,
author = {Aris Anagnostopoulos and
Ravi Kumar and
Mohammad Mahdian and
Eli Upfal},
title = {Sorting and selection on dynamic data},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {24},
pages = {2564--2576},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.003},
doi = {10.1016/J.TCS.2010.10.003},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AnagnostopoulosKMU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AndreevRS11,
author = {Mikhail Andreev and
Ilya P. Razenshteyn and
Alexander Shen},
title = {Not every domain of a plain decompressor contains the domain of a
prefix-free one},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {482--486},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.012},
doi = {10.1016/J.TCS.2010.10.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AndreevRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AndrekaMN11,
author = {Hajnal Andr{\'{e}}ka and
Szabolcs Mikul{\'{a}}s and
Istv{\'{a}}n N{\'{e}}meti},
title = {The equational theory of Kleene lattices},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {52},
pages = {7099--7108},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.024},
doi = {10.1016/J.TCS.2011.09.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AndrekaMN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AndresPRS11,
author = {Miguel E. Andr{\'{e}}s and
Catuscia Palamidessi and
Peter van Rossum and
Ana Sokolova},
title = {Information hiding in probabilistic concurrent systems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3072--3089},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.045},
doi = {10.1016/J.TCS.2011.02.045},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AndresPRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AngelelliF11,
author = {Enrico Angelelli and
Carlo Filippi},
title = {On the complexity of interval scheduling with a resource constraint},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3650--3657},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.025},
doi = {10.1016/J.TCS.2011.03.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AngelelliF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AnshelevichC11,
author = {Elliot Anshelevich and
Bugra {\c{C}}askurlu},
title = {Exact and approximate equilibria for optimal group network formation},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5298--5314},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.049},
doi = {10.1016/J.TCS.2011.05.049},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AnshelevichC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AntonakopoulosZ11,
author = {Spyridon Antonakopoulos and
Lisa Zhang},
title = {Approximation algorithms for grooming in optical network design},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3738--3751},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.034},
doi = {10.1016/J.TCS.2011.03.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AntonakopoulosZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Armon11,
author = {Amitai Armon},
title = {On min-max r-gatherings},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {7},
pages = {573--582},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.04.040},
doi = {10.1016/J.TCS.2010.04.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Armon11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ArroyueloCDDHLMNSS11,
author = {Diego Arroyuelo and
Francisco Claude and
Reza Dorrigiv and
Stephane Durocher and
Meng He and
Alejandro L{\'{o}}pez{-}Ortiz and
J. Ian Munro and
Patrick K. Nicholson and
Alejandro Salinger and
Matthew Skala},
title = {Untangled monotonic chains and adaptive range search},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4200--4211},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.037},
doi = {10.1016/J.TCS.2011.01.037},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ArroyueloCDDHLMNSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ArslanovCKS11,
author = {Marat M. Arslanov and
S. Barry Cooper and
Iskander Sh. Kalimullin and
Mariya Ivanova Soskova},
title = {Splitting and nonsplitting in the {\(\Sigma\)}\({}_{\mbox{2}}\)\({}^{\mbox{0}}\)
enumeration degrees},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {18},
pages = {1669--1685},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.042},
doi = {10.1016/J.TCS.2010.12.042},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ArslanovCKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AttiyaH11,
author = {Hagit Attiya and
Eshcar Hillel},
title = {Highly concurrent multi-word synchronization},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1243--1262},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.049},
doi = {10.1016/J.TCS.2010.12.049},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AttiyaH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AupyB11,
author = {Guillaume Aupy and
Olivier Bournez},
title = {On the number of binary-minded individuals required to compute sqrt(1/2)},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2262--2267},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.003},
doi = {10.1016/J.TCS.2011.01.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AupyB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AvgustinovichFKS11,
author = {Sergey V. Avgustinovich and
Anna E. Frid and
Teturo Kamae and
Pavel Salimov},
title = {Infinite permutations of lowest maximal pattern complexity},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {27},
pages = {2911--2921},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.062},
doi = {10.1016/J.TCS.2010.12.062},
timestamp = {Thu, 04 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AvgustinovichFKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ayala-RinconPK11,
author = {Mauricio Ayala{-}Rinc{\'{o}}n and
Elaine Pimentel and
Fairouz Kamareddine},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {37},
pages = {4851--4852},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.002},
doi = {10.1016/J.TCS.2011.06.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ayala-RinconPK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AzarMMPS11,
author = {Yossi Azar and
Aleksander Madry and
Thomas Moscibroda and
Debmalya Panigrahi and
Aravind Srinivasan},
title = {Maximum bipartite flow in networks with adaptive channel width},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {24},
pages = {2577--2587},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.023},
doi = {10.1016/J.TCS.2010.10.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AzarMMPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BaazCP11,
author = {Matthias Baaz and
Agata Ciabattoni and
Norbert Preining},
title = {First-order satisfiability in G{\"{o}}del logics: An NP-complete
fragment},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {47},
pages = {6612--6623},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.015},
doi = {10.1016/J.TCS.2011.07.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BaazCP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bader11,
author = {Martin Bader},
title = {The transposition median problem is NP-complete},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1099--1110},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.009},
doi = {10.1016/J.TCS.2010.12.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bader11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Badkobeh11,
author = {Golnaz Badkobeh},
title = {Fewest repetitions versus maximal-exponent powers in infinite binary
words},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6625--6633},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.011},
doi = {10.1016/J.TCS.2011.08.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Badkobeh11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BaetenL11,
author = {Jos C. M. Baeten and
Bas Luttik},
title = {Unguardedness mostly means many solutions},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3090--3100},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.046},
doi = {10.1016/J.TCS.2011.02.046},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BaetenL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BalanK11,
author = {Adriana Balan and
Alexander Kurz},
title = {On coalgebras over algebras},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {38},
pages = {4989--5005},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.021},
doi = {10.1016/J.TCS.2011.03.021},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BalanK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BaldoniAIM11,
author = {Roberto Baldoni and
Antonio Fern{\'{a}}ndez Anta and
Kleoni Ioannidou and
Alessia Milani},
title = {The impact of mobility on the geocasting problem in mobile ad-hoc
networks: Solvability and cost},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1066--1080},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.006},
doi = {10.1016/J.TCS.2010.12.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BaldoniAIM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BalkovaBT11,
author = {L'ubom{\'{\i}}ra Balkov{\'{a}} and
Karel Brinda and
Ondrej Turek},
title = {Abelian complexity of infinite words associated with quadratic Parry
numbers},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6252--6260},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.016},
doi = {10.1016/J.TCS.2011.08.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BalkovaBT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BalkovaPS11,
author = {L'ubom{\'{\i}}ra Balkov{\'{a}} and
Edita Pelantov{\'{a}} and
Step{\'{a}}n Starosta},
title = {On Brlek-Reutenauer conjecture},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5649--5655},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.031},
doi = {10.1016/J.TCS.2011.06.031},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BalkovaPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BansalDF11,
author = {Mukul S. Bansal and
Jianrong Dong and
David Fern{\'{a}}ndez{-}Baca},
title = {Comparing and aggregating partially resolved trees},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6634--6652},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.027},
doi = {10.1016/J.TCS.2011.08.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BansalDF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BarbutiMMP11,
author = {Roberto Barbuti and
Andrea Maggiolo{-}Schettini and
Paolo Milazzo and
Giovanni Pardini},
title = {Spatial Calculus of Looping Sequences},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {43},
pages = {5976--6001},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.020},
doi = {10.1016/J.TCS.2011.01.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BarbutiMMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BarmpaliasS11,
author = {George Barmpalias and
Tom F. Sterkenburg},
title = {On the number of infinite sequences with trivial initial segment complexity},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {52},
pages = {7133--7146},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.020},
doi = {10.1016/J.TCS.2011.09.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BarmpaliasS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BarmpaliasV11,
author = {George Barmpalias and
C. S. Vlek},
title = {Kolmogorov complexity of initial segments of sequences and arithmetical
definability},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5656--5667},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.006},
doi = {10.1016/J.TCS.2011.06.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BarmpaliasV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BarrettHMRRS11,
author = {Christopher L. Barrett and
Harry B. Hunt III and
Madhav V. Marathe and
S. S. Ravi and
Daniel J. Rosenkrantz and
Richard Edwin Stearns},
title = {Modeling and analyzing social network dynamics using stochastic discrete
graphical dynamical systems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {30},
pages = {3932--3946},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.027},
doi = {10.1016/J.TCS.2011.02.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BarrettHMRRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BasinCRV11,
author = {David A. Basin and
Carlos Caleiro and
Jaime Ramos and
Luca Vigan{\`{o}}},
title = {Distributed temporal logic for the analysis of security protocol models},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {31},
pages = {4007--4043},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.006},
doi = {10.1016/J.TCS.2011.04.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BasinCRV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Baudru11,
author = {Nicolas Baudru},
title = {Compositional synthesis of asynchronous automata},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3701--3716},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.030},
doi = {10.1016/J.TCS.2011.03.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Baudru11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BauerHW11,
author = {Sebastian S. Bauer and
Rolf Hennicker and
Martin Wirsing},
title = {Interface theories for concurrency and data},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3101--3121},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.007},
doi = {10.1016/J.TCS.2011.04.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BauerHW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BazganCT11,
author = {Cristina Bazgan and
Basile Cou{\"{e}}toux and
Zsolt Tuza},
title = {Complexity and approximation of the Constrained Forest problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4081--4091},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.07.018},
doi = {10.1016/J.TCS.2010.07.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BazganCT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeaudryH11,
author = {Martin Beaudry and
Markus Holzer},
title = {On the size of inverse semigroups given by generators},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {765--772},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.021},
doi = {10.1016/J.TCS.2010.11.021},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BeaudryH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeauquierBK11,
author = {Joffroy Beauquier and
Janna Burman and
Shay Kutten},
title = {A self-stabilizing transformer for population protocols with covering},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {33},
pages = {4247--4259},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.016},
doi = {10.1016/J.TCS.2010.09.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeauquierBK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeckmannB11,
author = {Arnold Beckmann and
Samuel R. Buss},
title = {Corrected upper bounds for free-cut elimination},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5433--5445},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.053},
doi = {10.1016/J.TCS.2011.05.053},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeckmannB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BedonR11,
author = {Nicolas Bedon and
Chloe Rispal},
title = {Series-parallel languages on scattered and countable posets},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2356--2369},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.016},
doi = {10.1016/J.TCS.2011.01.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BedonR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeiCTZZ11,
author = {Xiaohui Bei and
Wei Chen and
Shang{-}Hua Teng and
Jialin Zhang and
Jiajie Zhu},
title = {Bounded budget betweenness centrality game for strategic network formations},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {52},
pages = {7147--7168},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.028},
doi = {10.1016/J.TCS.2011.09.028},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeiCTZZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeinIKLO11,
author = {Wolfgang W. Bein and
Kazuo Iwama and
Jun Kawahara and
Lawrence L. Larmore and
James A. Oravec},
title = {A randomized algorithm for two servers in cross polytope spaces},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {7},
pages = {563--572},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.022},
doi = {10.1016/J.TCS.2010.08.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeinIKLO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ben-AmramY11,
author = {Amir M. Ben{-}Amram and
Simon Yoffe},
title = {A simple and efficient Union-Find-Delete algorithm},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {487--492},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.005},
doi = {10.1016/J.TCS.2010.11.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ben-AmramY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ben-ZwiR11,
author = {Oren Ben{-}Zwi and
Amir Ronen},
title = {Local and global price of anarchy of graphical games},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1196--1207},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.064},
doi = {10.1016/J.TCS.2010.12.064},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ben-ZwiR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BenevidesS11,
author = {Mario R. F. Benevides and
Luis Menasch{\'{e}} Schechter},
title = {A study on multi-dimensional products of graphs and hybrid logics},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {37},
pages = {4946--4966},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.011},
doi = {10.1016/J.TCS.2011.05.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BenevidesS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bentz11,
author = {C{\'{e}}dric Bentz},
title = {On the hardness of finding near-optimal multicuts in directed acyclic
graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5325--5332},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.003},
doi = {10.1016/J.TCS.2011.06.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bentz11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeregJYZ11,
author = {Sergey Bereg and
Minghui Jiang and
Boting Yang and
Binhai Zhu},
title = {On the red/blue spanning tree problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {23},
pages = {2459--2467},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.038},
doi = {10.1016/J.TCS.2010.10.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeregJYZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BergM11,
author = {Benno van den Berg and
Ieke Moerdijk},
title = {Aspects of predicative algebraic set theory, {II:} Realizability},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {20},
pages = {1916--1940},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.019},
doi = {10.1016/J.TCS.2010.12.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BergM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BergstraP11,
author = {Jan A. Bergstra and
Jaco van de Pol},
title = {A calculus for four-valued sequential logic},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3122--3128},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.035},
doi = {10.1016/J.TCS.2011.02.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BergstraP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Berthe11,
author = {Val{\'{e}}rie Berth{\'{e}}},
title = {About thin arithmetic discrete planes},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {36},
pages = {4757--4769},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.014},
doi = {10.1016/J.TCS.2011.04.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Berthe11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BetelF11,
author = {Heather Betel and
Paola Flocchini},
title = {On the relationship between fuzzy and Boolean cellular automata},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {703--713},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.006},
doi = {10.1016/J.TCS.2010.11.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BetelF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BethkePR11,
author = {Inge Bethke and
Alban Ponse and
Piet Rodenburg},
title = {Preface: This issue is dedicated to Jan Bergstra on the occasion of
his sixtieth birthday},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3033--3034},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.016},
doi = {10.1016/J.TCS.2011.04.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BethkePR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiedlDS11,
author = {Therese Biedl and
Stephane Durocher and
Jack Snoeyink},
title = {Reconstructing polygons from scanner data},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4161--4172},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.026},
doi = {10.1016/J.TCS.2010.10.026},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BiedlDS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BielyH11,
author = {Martin Biely and
Martin Hutle},
title = {Consensus when all processes may be Byzantine for some time},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {33},
pages = {4260--4272},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.012},
doi = {10.1016/J.TCS.2010.11.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BielyH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BielySW11,
author = {Martin Biely and
Ulrich Schmid and
Bettina Weiss},
title = {Synchronous consensus under hybrid process and link failures},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {40},
pages = {5602--5630},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.032},
doi = {10.1016/J.TCS.2010.09.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BielySW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BienkowskiCJ11,
author = {Marcin Bienkowski and
Marek Chrobak and
Lukasz Jez},
title = {Randomized competitive algorithms for online buffer management in
the adaptive adversary model},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5121--5131},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.015},
doi = {10.1016/J.TCS.2011.05.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BienkowskiCJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiloF11,
author = {Vittorio Bil{\`{o}} and
Michele Flammini},
title = {Extending the notion of rationality of selfish agents: Second Order
Nash equilibria},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2296--2311},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.008},
doi = {10.1016/J.TCS.2011.01.008},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BiloF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiskupW11,
author = {Joachim Biskup and
Lena Wiese},
title = {A sound and complete model-generation procedure for consistent and
confidentiality-preserving databases},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {31},
pages = {4044--4072},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.026},
doi = {10.1016/J.TCS.2011.04.026},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BiskupW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Blanchet-SadriCM11,
author = {Francine Blanchet{-}Sadri and
Ilkyoo Choi and
Robert Mercas},
title = {Avoiding large squares in partial words},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3752--3758},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.009},
doi = {10.1016/J.TCS.2011.04.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Blanchet-SadriCM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Blumensath11,
author = {Achim Blumensath},
title = {Recognisability for algebras of infinite trees},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3463--3486},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.037},
doi = {10.1016/J.TCS.2011.02.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Blumensath11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BockerBT11,
author = {Sebastian B{\"{o}}cker and
Quang Bao Anh Bui and
Anke Tru{\ss}},
title = {Computing bond orders in molecule graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1184--1195},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.063},
doi = {10.1016/J.TCS.2010.12.063},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BockerBT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodiniFRR11,
author = {Olivier Bodini and
Thomas Fernique and
Micha{\"{e}}l Rao and
Eric R{\'{e}}mila},
title = {Distances on rhombus tilings},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {36},
pages = {4787--4794},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.015},
doi = {10.1016/J.TCS.2011.04.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BodiniFRR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodlaenderTY11,
author = {Hans L. Bodlaender and
St{\'{e}}phan Thomass{\'{e}} and
Anders Yeo},
title = {Kernel bounds for disjoint cycles and disjoint paths},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4570--4578},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.039},
doi = {10.1016/J.TCS.2011.04.039},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderTY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BogdanowiczGJ11,
author = {Damian Bogdanowicz and
Krzysztof Giaro and
Robert Janczewski},
title = {Consensus models: Computational complexity aspects in modern approaches
to the list coloring problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4721--4728},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.020},
doi = {10.1016/J.TCS.2011.05.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BogdanowiczGJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bollig11,
author = {Beate Bollig},
title = {On the {OBDD} complexity of the most significant bit of integer multiplication},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {18},
pages = {1686--1695},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.043},
doi = {10.1016/J.TCS.2010.12.043},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bollig11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BonfanteMM11,
author = {Guillaume Bonfante and
Jean{-}Yves Marion and
Jean{-}Yves Moyen},
title = {Quasi-interpretations a way to control resources},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {25},
pages = {2776--2796},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.007},
doi = {10.1016/J.TCS.2011.02.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BonfanteMM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BonifaciKMS11,
author = {Vincenzo Bonifaci and
Peter Korteweg and
Alberto Marchetti{-}Spaccamela and
Leen Stougie},
title = {The distributed wireless gathering problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {633--641},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.018},
doi = {10.1016/J.TCS.2010.10.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BonifaciKMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BonnetR11,
author = {Fran{\c{c}}ois Bonnet and
Michel Raynal},
title = {On the road to the weakest failure detector for k-set agreement in
message-passing systems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {33},
pages = {4273--4284},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.007},
doi = {10.1016/J.TCS.2010.11.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BonnetR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BonomoMO11,
author = {Flavia Bonomo and
Sara Mattia and
Gianpaolo Oriolo},
title = {Bounded coloring of co-comparability graphs and the pickup and delivery
tour combination problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6261--6268},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.012},
doi = {10.1016/J.TCS.2011.07.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BonomoMO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BorghiDP11,
author = {Alexandre Borghi and
J{\'{e}}r{\^{o}}me Darbon and
Sylvain Peyronnet},
title = {Exact optimization for the {\(\mathscr{l}\)}\({}^{\mbox{1}}\)-Compressive
Sensing problem using a modified Dantzig-Wolfe method},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {15},
pages = {1325--1337},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.032},
doi = {10.1016/J.TCS.2010.10.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BorghiDP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BozapalidisFR11,
author = {Symeon Bozapalidis and
Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
George Rahonis},
title = {Equational tree transformations},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3676--3692},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.028},
doi = {10.1016/J.TCS.2011.03.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BozapalidisFR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BozzelliLP11,
author = {Laura Bozzelli and
Axel Legay and
Sophie Pinchinat},
title = {Hardness of preorder checking for basic formalisms},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {49},
pages = {6795--6808},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.037},
doi = {10.1016/J.TCS.2011.08.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BozzelliLP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandenburgC11,
author = {Franz{-}Josef Brandenburg and
Mao{-}cheng Cai},
title = {Shortest path and maximum flow problems in networks with additive
losses and gains},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {391--401},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.019},
doi = {10.1016/J.TCS.2010.11.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandenburgC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandtFH11,
author = {Felix Brandt and
Felix A. Fischer and
Markus Holzer},
title = {Equilibria of graphical games with symmetries},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {675--685},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.002},
doi = {10.1016/J.TCS.2010.11.002},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BrandtFH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrimkovBW11,
author = {Valentin E. Brimkov and
Reneta P. Barneva and
Petra Wiederhold},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {15},
pages = {1299--1300},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.001},
doi = {10.1016/J.TCS.2010.12.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrimkovBW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrimkovLMW11,
author = {Valentin E. Brimkov and
Andrew Leach and
Michael Mastroianni and
Jimmy Wu},
title = {Guarding a set of line segments in the plane},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {15},
pages = {1313--1324},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.014},
doi = {10.1016/J.TCS.2010.08.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrimkovLMW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BritoV11,
author = {Carlos Fisch Brito and
Shailesh Vaya},
title = {Improved lower bound for deterministic broadcasting in radio networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3568--3578},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.003},
doi = {10.1016/J.TCS.2011.03.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BritoV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrlekKP11,
author = {Srecko Brlek and
Michel Koskas and
Xavier Proven{\c{c}}al},
title = {A linear time and space algorithm for detecting path intersection
in Z\({}^{\mbox{d}}\)},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {36},
pages = {4841--4850},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.019},
doi = {10.1016/J.TCS.2011.04.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrlekKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrlekP11,
author = {Srecko Brlek and
Xavier Proven{\c{c}}al},
title = {Advances in discrete geometry},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {36},
pages = {4755--4756},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.048},
doi = {10.1016/J.TCS.2011.04.048},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrlekP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrlekR11,
author = {Srecko Brlek and
Christophe Reutenauer},
title = {Complexity and palindromic defect of infinite words},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {493--497},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.025},
doi = {10.1016/J.TCS.2010.11.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrlekR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrocchiFR11,
author = {Stefano Brocchi and
Andrea Frosini and
Simone Rinaldi},
title = {A reconstruction algorithm for a subclass of instances of the 2-color
problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {36},
pages = {4795--4804},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.004},
doi = {10.1016/J.TCS.2010.08.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrocchiFR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrodalGJS11,
author = {Gerth St{\o}lting Brodal and
Beat Gfeller and
Allan Gr{\o}nlund J{\o}rgensen and
Peter Sanders},
title = {Towards optimal range medians},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {24},
pages = {2588--2601},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.05.003},
doi = {10.1016/J.TCS.2010.05.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrodalGJS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BshoutyM11,
author = {Nader H. Bshouty and
Hanna Mazzawi},
title = {Reconstructing weighted graphs with minimal query complexity},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {19},
pages = {1782--1790},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.055},
doi = {10.1016/J.TCS.2010.12.055},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BshoutyM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BuL11,
author = {Yuehua Bu and
Yulin Li},
title = {Backbone coloring of planar graphs without special circles},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {46},
pages = {6464--6468},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.032},
doi = {10.1016/J.TCS.2011.06.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BuL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BubeckMS11,
author = {S{\'{e}}bastien Bubeck and
R{\'{e}}mi Munos and
Gilles Stoltz},
title = {Pure exploration in finitely-armed and continuous-armed bandits},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {19},
pages = {1832--1852},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.059},
doi = {10.1016/J.TCS.2010.12.059},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BubeckMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bui-XuanTV11,
author = {Binh{-}Minh Bui{-}Xuan and
Jan Arne Telle and
Martin Vatshelle},
title = {Boolean-width of graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5187--5204},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.022},
doi = {10.1016/J.TCS.2011.05.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bui-XuanTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaiGL11,
author = {Zhipeng Cai and
Randy Goebel and
Guohui Lin},
title = {Size-constrained tree partitioning: Approximating the multicast k-tree
routing problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {3},
pages = {240--245},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.05.031},
doi = {10.1016/J.TCS.2009.05.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaiGL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaiLX11,
author = {Jin{-}yi Cai and
Pinyan Lu and
Mingji Xia},
title = {A computational proof of complexity of some restricted counting problems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {23},
pages = {2468--2485},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.039},
doi = {10.1016/J.TCS.2010.10.039},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CaiLX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaillaudDLLPW11,
author = {Beno{\^{\i}}t Caillaud and
Beno{\^{\i}}t Delahaye and
Kim G. Larsen and
Axel Legay and
Mikkel L. Pedersen and
Andrzej Wasowski},
title = {Constraint Markov Chains},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {34},
pages = {4373--4404},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.010},
doi = {10.1016/J.TCS.2011.05.010},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaillaudDLLPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Calude11,
author = {Cristian S. Calude},
title = {Simplicity via provability for universal prefix-free Turing machines},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {178--182},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.002},
doi = {10.1016/J.TCS.2010.08.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Calude11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaludeNSS11,
author = {Cristian S. Calude and
Andr{\'{e}} Nies and
Ludwig Staiger and
Frank Stephan},
title = {Universal recursively enumerable sets of strings},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2253--2261},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.002},
doi = {10.1016/J.TCS.2011.01.002},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CaludeNSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaludeSR11,
author = {Cristian S. Calude and
Kai Salomaa and
Tania Roblot},
title = {Finite state complexity},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5668--5677},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.021},
doi = {10.1016/J.TCS.2011.06.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaludeSR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Calvert11,
author = {Wesley Calvert},
title = {Metric structures and probabilistic computation},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {25},
pages = {2766--2775},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.005},
doi = {10.1016/J.TCS.2011.02.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Calvert11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaoLC11,
author = {Qian Cao and
Zhaohui Liu and
T. C. Edwin Cheng},
title = {Semi-online scheduling with known partial information about job sizes
on two identical machines},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3731--3737},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.032},
doi = {10.1016/J.TCS.2011.03.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaoLC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaoY11,
author = {Zhigang Cao and
Xiaoguang Yang},
title = {Selfish bin covering},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {7049--7058},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.017},
doi = {10.1016/J.TCS.2011.09.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaoY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Capobianco11,
author = {Silvio Capobianco},
title = {Generalized Besicovitch and Weyl spaces: Topology, patterns, and sliding
block codes},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {30},
pages = {3822--3837},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.020},
doi = {10.1016/J.TCS.2011.02.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Capobianco11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Capretta11,
author = {Venanzio Capretta},
title = {Coalgebras in functional programming and type theory},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {38},
pages = {5006--5024},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.024},
doi = {10.1016/J.TCS.2011.04.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Capretta11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CarboneD11,
author = {Alessandra Carbone and
Linda Dib},
title = {Co-evolution and information signals in biological sequences},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {23},
pages = {2486--2495},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.040},
doi = {10.1016/J.TCS.2010.10.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CarboneD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaronCM11,
author = {Pascal Caron and
Jean{-}Marc Champarnaud and
Ludovic Mignot},
title = {Erratum to "Acyclic automata and small expressions using multi-tilde-bar
operators" [Theoret. Comput. Sci. 411 {(38-39)} {(2010)} 3423-3435]},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3795--3796},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.033},
doi = {10.1016/J.TCS.2011.03.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaronCM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CarpiF11,
author = {Arturo Carpi and
Clelia de Felice},
title = {Combinatorics on words},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {27},
pages = {2909--2910},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.015},
doi = {10.1016/J.TCS.2011.01.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CarpiF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CarvalhoPF11,
author = {Daniel de Carvalho and
Michele Pagani and
Lorenzo Tortora de Falco},
title = {A semantic measure of the execution time in linear logic},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {20},
pages = {1884--1902},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.017},
doi = {10.1016/J.TCS.2010.12.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CarvalhoPF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CatusseCV11,
author = {Nicolas Catusse and
Victor Chepoi and
Yann Vax{\`{e}}s},
title = {Embedding into the rectilinear plane in optimal O(n\({}^{\mbox{2}}\))
time},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2425--2433},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.038},
doi = {10.1016/J.TCS.2011.01.038},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CatusseCV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CavaliereL11,
author = {Matteo Cavaliere and
Peter Leupold},
title = {Computing by observing: Simple systems and simple observers},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {113--123},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.05.040},
doi = {10.1016/J.TCS.2010.05.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CavaliereL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ceccherini-SilbersteinC11,
author = {Tullio Ceccherini{-}Silberstein and
Michel Coornaert},
title = {On the reversibility and the closed image property of linear cellular
automata},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {300--306},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.020},
doi = {10.1016/J.TCS.2010.09.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ceccherini-SilbersteinC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CedenoR11,
author = {Oscar Dalmau Cede{\~{n}}o and
Mariano Rivera},
title = {Alpha Markov Measure Field model for probabilistic image segmentation},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {15},
pages = {1434--1441},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.008},
doi = {10.1016/J.TCS.2010.11.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CedenoR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CenkO11,
author = {Murat Cenk and
Ferruh {\"{O}}zbudak},
title = {Multiplication of polynomials modulo x\({}^{\mbox{n}}\)},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3451--3462},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.031},
doi = {10.1016/J.TCS.2011.02.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CenkO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CentenoDPRS11,
author = {Carmen C. Centeno and
Mitre Costa Dourado and
Lucia Draque Penso and
Dieter Rautenbach and
Jayme Luiz Szwarcfiter},
title = {Irreversible conversion of graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3693--3700},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.029},
doi = {10.1016/J.TCS.2011.03.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CentenoDPRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Cesa-BianchiGV11,
author = {Nicol{\`{o}} Cesa{-}Bianchi and
Claudio Gentile and
Fabio Vitale},
title = {Predicting the labels of an unknown graph via adaptive exploration},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {19},
pages = {1791--1804},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.056},
doi = {10.1016/J.TCS.2010.12.056},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Cesa-BianchiGV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChMRT11,
author = {Eric Goles Ch. and
Pierre{-}Etienne Meunier and
Ivan Rapaport and
Guillaume Theyssier},
title = {Erratum to: "Communication Complexity and Intrinsic Universality in
Cellular Automata" [Theor. Comput. Sci 412 {(1-2)} {(2011)} 2-21]},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {52},
pages = {7169--7170},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.019},
doi = {10.1016/J.TCS.2011.09.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChMRT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChaccGR11,
author = {Eric Goles Ch. and
Pierre Guillon and
Ivan Rapaport},
title = {Traced communication complexity of cellular automata},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {30},
pages = {3906--3916},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.025},
doi = {10.1016/J.TCS.2011.02.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChaccGR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChaccMR11,
author = {Eric Goles Ch. and
Andr{\'{e}}s Moreira and
Ivan Rapaport},
title = {Communication complexity in number-conserving and monotone cellular
automata},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3616--3628},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.008},
doi = {10.1016/J.TCS.2011.03.008},
timestamp = {Mon, 16 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChaccMR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChaccMRT11,
author = {Eric Goles Ch. and
Pierre{-}Etienne Meunier and
Ivan Rapaport and
Guillaume Theyssier},
title = {Communication complexity and intrinsic universality in cellular automata},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {2--21},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.005},
doi = {10.1016/J.TCS.2010.10.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChaccMRT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChangHKP11,
author = {Maw{-}Shang Chang and
Ling{-}Ju Hung and
Ton Kloks and
Sheng{-}Lung Peng},
title = {Block-graph width},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {23},
pages = {2496--2502},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.041},
doi = {10.1016/J.TCS.2010.10.041},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChangHKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CharlierR11,
author = {Emilie Charlier and
Narad Rampersad},
title = {The growth function of S-recognizable sets},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5400--5408},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.057},
doi = {10.1016/J.TCS.2011.05.057},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CharlierR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CharrierFB11,
author = {Emilie Charrier and
Fabien Feschet and
Lilian Buzer},
title = {Computing efficiently the lattice width in any dimension},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {36},
pages = {4814--4823},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.009},
doi = {10.1016/J.TCS.2011.02.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CharrierFB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChatzigiannakisMNPS11,
author = {Ioannis Chatzigiannakis and
Othon Michail and
Stavros Nikolaou and
Andreas Pavlogiannis and
Paul G. Spirakis},
title = {Passively mobile communicating machines that use restricted space},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {46},
pages = {6469--6483},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.001},
doi = {10.1016/J.TCS.2011.07.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChatzigiannakisMNPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenC11,
author = {Jianer Chen and
S. Barry Cooper},
title = {Algorithms, complexity and computational models},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {23},
pages = {2457--2458},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.037},
doi = {10.1016/J.TCS.2010.10.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenF11,
author = {Li Chen and
Bin Fu},
title = {Linear and sublinear time algorithms for the basis of abelian groups},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4110--4122},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.06.011},
doi = {10.1016/J.TCS.2010.06.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenFLLW11,
author = {Jianer Chen and
Qilong Feng and
Yang Liu and
Songjian Lu and
Jianxin Wang},
title = {Improved deterministic algorithms for weighted matching and packing
problems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {23},
pages = {2503--2512},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.042},
doi = {10.1016/J.TCS.2010.10.042},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenFLLW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenLBDH11,
author = {Xin Chen and
Yan Lan and
Attila Benko and
Gy{\"{o}}rgy D{\'{o}}sa and
Xin Han},
title = {Optimal algorithms for online scheduling with bounded rearrangement
at the end},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6269--6278},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.014},
doi = {10.1016/J.TCS.2011.07.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenLBDH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenLS11,
author = {Lily Chen and
Xueliang Li and
Yongtang Shi},
title = {The complexity of determining the rainbow vertex-connection of a graph},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4531--4535},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.032},
doi = {10.1016/J.TCS.2011.04.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenLS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenLST11,
author = {Li{-}Jui Chen and
Jinn{-}Jy Lin and
Min{-}Zheng Shieh and
Shi{-}Chun Tsai},
title = {More on the Magnus-Derek game},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {339--344},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.031},
doi = {10.1016/J.TCS.2010.09.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenLST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenSZTL11,
author = {Xiaofeng Chen and
Willy Susilo and
Fangguo Zhang and
Haibo Tian and
Jin Li},
title = {Identity-based trapdoor mercurial commitments and applications},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5498--5512},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.031},
doi = {10.1016/J.TCS.2011.05.031},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenSZTL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChengL11,
author = {Qi Cheng and
Yu{-}Hsin Li},
title = {On the minimum gap between sums of square roots of small integers},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5458--5465},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.014},
doi = {10.1016/J.TCS.2011.06.014},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ChengL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChengLLS11,
author = {Eddie Cheng and
Marc J. Lipman and
L{\'{a}}szl{\'{o}} Lipt{\'{a}}k and
David Sherman},
title = {Conditional matching preclusion for the arrangement graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6279--6289},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.007},
doi = {10.1016/J.TCS.2011.07.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChengLLS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChevillardHJL11,
author = {Sylvain Chevillard and
J. Harrison and
Mioara Joldes and
Christoph Quirin Lauter},
title = {Efficient and accurate computation of upper bounds of approximation
errors},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {16},
pages = {1523--1543},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.052},
doi = {10.1016/J.TCS.2010.11.052},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChevillardHJL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChezeGMY11,
author = {Guillaume Ch{\`{e}}ze and
Andr{\'{e}} Galligo and
Bernard Mourrain and
Jean{-}Claude Yakoubsohn},
title = {A subdivision method for computing nearest gcd with certification},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4493--4503},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.018},
doi = {10.1016/J.TCS.2011.04.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChezeGMY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChiangWL11,
author = {Sheng{-}Hao Chiang and
I{-}Chen Wu and
Ping{-}Hung Lin},
title = {Drawn k-in-a-row games},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4558--4569},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.033},
doi = {10.1016/J.TCS.2011.04.033},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ChiangWL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChicanoWAL11,
author = {Francisco Chicano and
L. Darrell Whitley and
Enrique Alba and
Francisco Luna},
title = {Elementary landscape decomposition of the frequency assignment problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {43},
pages = {6002--6019},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.011},
doi = {10.1016/J.TCS.2011.02.011},
timestamp = {Wed, 12 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ChicanoWAL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChierichettiLP11,
author = {Flavio Chierichetti and
Silvio Lattanzi and
Alessandro Panconesi},
title = {Rumor spreading in social networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {24},
pages = {2602--2610},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.001},
doi = {10.1016/J.TCS.2010.11.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChierichettiLP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChrobakH11,
author = {Marek Chrobak and
Mathilde Hurand},
title = {Better bounds for incremental medians},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {7},
pages = {594--601},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.07.006},
doi = {10.1016/J.TCS.2009.07.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChrobakH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChuanCHL11,
author = {Wai{-}Fong Chuan and
Chun{-}Yu Chen and
Hui{-}Ling Ho and
Fang{-}Yi Liao},
title = {{\(\alpha\)}-words and the radix order},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {876--891},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.038},
doi = {10.1016/J.TCS.2010.11.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChuanCHL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Cibulka11,
author = {Josef Cibulka},
title = {On average and highest number of flips in pancake sorting},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {822--834},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.028},
doi = {10.1016/J.TCS.2010.11.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Cibulka11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CicaleseJLM11,
author = {Ferdinando Cicalese and
Tobias Jacobs and
Eduardo Sany Laber and
Marco Molinaro},
title = {On the complexity of searching in trees and partially ordered structures},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {6879--6896},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.042},
doi = {10.1016/J.TCS.2011.08.042},
timestamp = {Sat, 05 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CicaleseJLM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Cincotti11,
author = {Alessandro Cincotti},
title = {The game of n-player Cutcake},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5678--5683},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.036},
doi = {10.1016/J.TCS.2011.06.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Cincotti11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Cirstea11,
author = {Corina C{\^{\i}}rstea},
title = {Maximal traces and path-based coalgebraic temporal logics},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {38},
pages = {5025--5042},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.025},
doi = {10.1016/J.TCS.2011.04.025},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Cirstea11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CobbG11,
author = {Jorge Arturo Cobb and
Mohamed G. Gouda},
title = {Stabilization of max-min fair networks without per-flow state},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {40},
pages = {5562--5579},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.042},
doi = {10.1016/J.TCS.2010.11.042},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CobbG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CohenCMNN11,
author = {Nathann Cohen and
David Coudert and
Dorian Mazauric and
Napole{\~{a}}o Nepomuceno and
Nicolas Nisse},
title = {Tradeoffs in process strategy games with application in the {WDM}
reconfiguration problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4675--4687},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.002},
doi = {10.1016/J.TCS.2011.05.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CohenCMNN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Colussi11,
author = {Livio Colussi},
title = {The convergence classes of Collatz function},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5409--5419},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.056},
doi = {10.1016/J.TCS.2011.05.056},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Colussi11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CorderoHMNPPPVSBB11,
author = {Francesca Cordero and
Andr{\'{a}}s Horv{\'{a}}th and
Daniele Manini and
Lucia Napione and
Massimiliano De Pierro and
Simona Pavan and
Andrea Picco and
Andrea Veglio and
Matteo Sereno and
Federico Bussolino and
Gianfranco Balbo},
title = {Simplification of a complex signal transduction model using invariants
and flow equivalent servers},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {43},
pages = {6036--6057},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.013},
doi = {10.1016/J.TCS.2011.06.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CorderoHMNPPPVSBB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CournierDV11,
author = {Alain Cournier and
Swan Dubois and
Vincent Villain},
title = {How to improve snap-stabilizing point-to-point communication space
complexity?},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {33},
pages = {4285--4296},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.014},
doi = {10.1016/J.TCS.2010.11.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CournierDV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CousotC11,
author = {Patrick Cousot and
Radhia Cousot},
title = {Grammar semantics, analysis and parsing by abstract interpretation},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {44},
pages = {6135--6192},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.005},
doi = {10.1016/J.TCS.2011.06.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CousotC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CranenGR11,
author = {Sjoerd Cranen and
Jan Friso Groote and
Michel A. Reniers},
title = {A linear translation from CTL* to the first-order modal {\(\mu\)}
-calculus},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3129--3139},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.034},
doi = {10.1016/J.TCS.2011.02.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CranenGR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrochemoreIT11,
author = {Maxime Crochemore and
Lucian Ilie and
Liviu Tinta},
title = {The "runs" conjecture},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {27},
pages = {2931--2941},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.06.019},
doi = {10.1016/J.TCS.2010.06.019},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CrochemoreIT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Csajbok11,
author = {Zolt{\'{a}}n Csajb{\'{o}}k},
title = {Approximation of sets based on partial covering},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {42},
pages = {5820--5833},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.037},
doi = {10.1016/J.TCS.2011.05.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Csajbok11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Csuhaj-VarjuV11,
author = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Sergey Verlan},
title = {On generalized communicating {P} systems with minimal interaction
rules},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {124--135},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.020},
doi = {10.1016/J.TCS.2010.08.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Csuhaj-VarjuV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CuiKS11,
author = {Bo Cui and
Lila Kari and
Shinnosuke Seki},
title = {Block insertion and deletion on trajectories},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {714--728},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.009},
doi = {10.1016/J.TCS.2010.11.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CuiKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Curien11,
author = {Pierre{-}Louis Curien},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {20},
pages = {1853--1859},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.015},
doi = {10.1016/J.TCS.2010.12.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Curien11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Currie11,
author = {James D. Currie},
title = {Lexicographically least words in the orbit closure of the Rudin-Shapiro
word},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4742--4746},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.036},
doi = {10.1016/J.TCS.2011.04.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Currie11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CusickC11,
author = {Thomas W. Cusick and
Lavinia Corina Ciungu},
title = {Sum of digits sequences modulo m},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4738--4741},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.030},
doi = {10.1016/J.TCS.2011.05.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CusickC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CuytL11,
author = {Annie A. M. Cuyt and
Wen{-}shin Lee},
title = {Sparse interpolation of multivariate rational functions},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {16},
pages = {1445--1456},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.050},
doi = {10.1016/J.TCS.2010.11.050},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CuytL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CyganPPPW11,
author = {Marek Cygan and
Geevarghese Philip and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Dominating set is fixed parameter tractable in claw-free graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {6982--7000},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.010},
doi = {10.1016/J.TCS.2011.09.010},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CyganPPPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CzyzowiczDGKKOSU11,
author = {Jurek Czyzowicz and
Stefan Dobrev and
Hern{\'{a}}n Gonz{\'{a}}lez{-}Aguilar and
Rastislav Kralovic and
Evangelos Kranakis and
Jaroslav Opatrny and
Ladislav Stacho and
Jorge Urrutia},
title = {Local 7-coloring for planar subgraphs of unit disk graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {18},
pages = {1696--1704},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.044},
doi = {10.1016/J.TCS.2010.12.044},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CzyzowiczDGKKOSU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CzyzowiczILP11,
author = {Jurek Czyzowicz and
David Ilcinkas and
Arnaud Labourel and
Andrzej Pelc},
title = {Asynchronous deterministic rendezvous in bounded terrains},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {6926--6937},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.002},
doi = {10.1016/J.TCS.2011.09.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CzyzowiczILP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Dalen11,
author = {Dirk van Dalen},
title = {Brouwer's {\unicode{1013}}-fixed point and Sperner's lemma},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3140--3144},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.002},
doi = {10.1016/J.TCS.2011.04.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Dalen11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DangGM11,
author = {Thao Dang and
Colas Le Guernic and
Oded Maler},
title = {Computing reachable states for nonlinear biological models},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {21},
pages = {2095--2107},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.014},
doi = {10.1016/J.TCS.2011.01.014},
timestamp = {Tue, 03 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DangGM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DanicicBHHKL11,
author = {Sebastian Danicic and
Richard W. Barraclough and
Mark Harman and
John Howroyd and
{\'{A}}kos Kiss and
Michael R. Laurence},
title = {A unifying theory of control dependence and its application to arbitrary
program structures},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {49},
pages = {6809--6842},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.033},
doi = {10.1016/J.TCS.2011.08.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DanicicBHHKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DarnstadtS11,
author = {Malte Darnst{\"{a}}dt and
Hans Ulrich Simon},
title = {Smart PAC-learners},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {19},
pages = {1756--1766},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.053},
doi = {10.1016/J.TCS.2010.12.053},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DarnstadtS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Dasgupta11,
author = {Sanjoy Dasgupta},
title = {Two faces of active learning},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {19},
pages = {1767--1781},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.054},
doi = {10.1016/J.TCS.2010.12.054},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Dasgupta11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DasguptaGX11,
author = {Anurag Dasgupta and
Sukumar Ghosh and
Xin Xiao},
title = {Fault containment in weakly stabilizing systems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {33},
pages = {4297--4311},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.039},
doi = {10.1016/J.TCS.2011.02.039},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DasguptaGX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DastidarH11,
author = {K. Ghosh Dastidar and
T. Herman},
title = {Separation of circulating tokens},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {33},
pages = {4312--4324},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.013},
doi = {10.1016/J.TCS.2010.09.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DastidarH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DattaLV11,
author = {Ajoy Kumar Datta and
Lawrence L. Larmore and
Priyanka Vemula},
title = {Self-stabilizing leader election in optimal space under an arbitrary
scheduler},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {40},
pages = {5541--5561},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.05.001},
doi = {10.1016/J.TCS.2010.05.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DattaLV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DattaPG11,
author = {Ajoy Kumar Datta and
Franck Petit and
Rachid Guerraoui},
title = {Stabilization, Safety, and Security of Distributed Systems {(SSS}
2009)},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {33},
pages = {4227},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.001},
doi = {10.1016/J.TCS.2011.04.001},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DattaPG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/David11,
author = {Ren{\'{e}} David},
title = {A short proof that adding some permutation rules to {\(\beta\)} preserves
{SN}},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {11},
pages = {1022--1026},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.048},
doi = {10.1016/J.TCS.2010.10.048},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/David11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Degano11,
author = {Pierpaolo Degano},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {21},
pages = {2094},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.022},
doi = {10.1016/J.TCS.2011.01.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Degano11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DelacourtPST11,
author = {Martin Delacourt and
Victor Poupet and
Mathieu Sablik and
Guillaume Theyssier},
title = {Directional dynamics along arbitrary curves in cellular automata},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {30},
pages = {3800--3821},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.019},
doi = {10.1016/J.TCS.2011.02.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DelacourtPST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DelaetMRT11,
author = {Sylvie Dela{\"{e}}t and
Partha Sarathi Mandal and
Mariusz A. Rokicki and
S{\'{e}}bastien Tixeuil},
title = {Deterministic secure positioning in wireless sensor networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4471--4481},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.010},
doi = {10.1016/J.TCS.2011.04.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DelaetMRT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DelormeMOT11,
author = {Marianne Delorme and
Jacques Mazoyer and
Nicolas Ollinger and
Guillaume Theyssier},
title = {Bulking {I:} An abstract theory of bulking},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {30},
pages = {3866--3880},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.023},
doi = {10.1016/J.TCS.2011.02.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DelormeMOT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DelormeMOT11a,
author = {Marianne Delorme and
Jacques Mazoyer and
Nicolas Ollinger and
Guillaume Theyssier},
title = {Bulking {II:} Classifications of cellular automata},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {30},
pages = {3881--3905},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.024},
doi = {10.1016/J.TCS.2011.02.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DelormeMOT11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Dereniowski11,
author = {Dariusz Dereniowski},
title = {Connected searching of weighted trees},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5700--5713},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.017},
doi = {10.1016/J.TCS.2011.06.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Dereniowski11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DiaconescuT11,
author = {Razvan Diaconescu and
Ionut Tutu},
title = {On the algebra of structured specifications},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3145--3174},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.008},
doi = {10.1016/J.TCS.2011.04.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DiaconescuT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DidierHMW11,
author = {Fr{\'{e}}d{\'{e}}ric Didier and
Thomas A. Henzinger and
Maria Mateescu and
Verena Wolf},
title = {Approximation of event probabilities in noisy cellular processes},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {21},
pages = {2128--2141},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.022},
doi = {10.1016/J.TCS.2010.10.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DidierHMW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DidimoEL11,
author = {Walter Didimo and
Peter Eades and
Giuseppe Liotta},
title = {Drawing graphs with right angle crossings},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5156--5166},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.025},
doi = {10.1016/J.TCS.2011.05.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DidimoEL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DimitrovP11,
author = {Nedialko B. Dimitrov and
C. Greg Plaxton},
title = {Buyer-supplier games: Optimization over the core},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {7},
pages = {614--625},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.05.017},
doi = {10.1016/J.TCS.2009.05.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DimitrovP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DimitrovaGHJLSSV11,
author = {Elena S. Dimitrova and
Luis David Garc{\'{\i}}a{-}Puente and
Franziska Hinkelmann and
Abdul Salam Jarrah and
Reinhard C. Laubenbacher and
Brandilyn Stigler and
Michael Eugene Stillman and
Paola Vera{-}Licona},
title = {Parameter estimation for Boolean models of biological networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {26},
pages = {2816--2826},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.04.034},
doi = {10.1016/J.TCS.2010.04.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DimitrovaGHJLSSV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DingX11,
author = {Wei Ding and
Guoliang Xue},
title = {A linear time algorithm for computing a most reliable source on a
tree network with faulty nodes},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {3},
pages = {225--232},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.08.003},
doi = {10.1016/J.TCS.2009.08.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DingX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DoerrENTT11,
author = {Benjamin Doerr and
Anton V. Eremeev and
Frank Neumann and
Madeleine Theile and
Christian Thyssen},
title = {Evolutionary algorithms and dynamic programming},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {43},
pages = {6020--6035},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.024},
doi = {10.1016/J.TCS.2011.07.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DoerrENTT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DoerrNSW11,
author = {Benjamin Doerr and
Frank Neumann and
Dirk Sudholt and
Carsten Witt},
title = {Runtime analysis of the 1-ANT ant colony optimizer},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {17},
pages = {1629--1644},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.030},
doi = {10.1016/J.TCS.2010.12.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DoerrNSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DolevKS11,
author = {Shlomi Dolev and
Sandeep S. Kulkarni and
Andr{\'{e}} Schiper},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {40},
pages = {5513--5514},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.023},
doi = {10.1016/J.TCS.2011.07.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DolevKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DombekMP11,
author = {Daniel Dombek and
Zuzana Mas{\'{a}}kov{\'{a}} and
Edita Pelantov{\'{a}}},
title = {Number representation using generalized (-beta)-transformation},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6653--6665},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.028},
doi = {10.1016/J.TCS.2011.08.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DombekMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DominguezNC11,
author = {Manuel Dom{\'{\i}}nguez and
Thomas Noll and
Marco Castrill{\'{o}}n},
title = {An extension of Christoffel duality to a subset of Sturm numbers and
their characteristic words},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {27},
pages = {2942--2954},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.060},
doi = {10.1016/J.TCS.2010.12.060},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DominguezNC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DominguezR11,
author = {C{\'{e}}sar Dom{\'{\i}}nguez and
Julio Rubio},
title = {Effective homology of bicomplexes, formalized in Coq},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {11},
pages = {962--970},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.016},
doi = {10.1016/J.TCS.2010.11.016},
timestamp = {Mon, 07 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DominguezR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DosaWHG11,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Yuxin Wang and
Xin Han and
He Guo},
title = {Online scheduling with rearrangement on two related machines},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {642--653},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.019},
doi = {10.1016/J.TCS.2010.10.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DosaWHG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DotyPS11,
author = {David Doty and
Matthew J. Patitz and
Scott M. Summers},
title = {Limitations of self-assembly at temperature 1},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {145--158},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.023},
doi = {10.1016/J.TCS.2010.08.023},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DotyPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DraganFG11,
author = {Feodor F. Dragan and
Fedor V. Fomin and
Petr A. Golovach},
title = {Approximation of minimum weight spanners for sparse graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {846--852},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.034},
doi = {10.1016/J.TCS.2010.11.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DraganFG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DraismaKW11,
author = {Jan Draisma and
Eyal Kushilevitz and
Enav Weinreb},
title = {Partition arguments in multiparty communication complexity},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {24},
pages = {2611--2622},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.01.018},
doi = {10.1016/J.TCS.2010.01.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DraismaKW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DrevetIS11,
author = {Charles{-}{\'{E}}ric Drevet and
Md. Nazrul Islam and
{\'{E}}ric Schost},
title = {Optimization techniques for small matrix multiplication},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2219--2236},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.012},
doi = {10.1016/J.TCS.2010.12.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DrevetIS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DrosteQ11,
author = {Manfred Droste and
Karin Quaas},
title = {A Kleene-Sch{\"{u}}tzenberger theorem for weighted timed automata},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1140--1153},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.033},
doi = {10.1016/J.TCS.2010.12.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DrosteQ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Drucker11,
author = {Andrew Drucker},
title = {Block sensitivity of minterm-transitive functions},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5796--5801},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.025},
doi = {10.1016/J.TCS.2011.06.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Drucker11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DuDZ11,
author = {Ding{-}Zhu Du and
Yingfei Dong and
Zhao Zhang},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4073},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.017},
doi = {10.1016/J.TCS.2011.02.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DuDZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DuHP11,
author = {Ding{-}Zhu Du and
Xiaodong Hu and
Panos M. Pardalos},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {3},
pages = {191},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.019},
doi = {10.1016/J.TCS.2010.09.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DuHP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DuanLMMW11,
author = {Ziming Duan and
Pingli Lv and
Lianying Miao and
Zhengke Miao and
Cuiqi Wang},
title = {New upper bounds on the L(2, 1)-labeling of the skew and converse
skew product graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2393--2397},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.031},
doi = {10.1016/J.TCS.2011.01.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DuanLMMW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DuboisPT11,
author = {Swan Dubois and
Maria Potop{-}Butucaru and
S{\'{e}}bastien Tixeuil},
title = {Dynamic {FTSS} in asynchronous systems: The case of unison},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3418--3439},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.012},
doi = {10.1016/J.TCS.2011.02.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DuboisPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Durand-Lose11,
author = {J{\'{e}}r{\^{o}}me Durand{-}Lose},
title = {Abstract geometrical computation 4: Small Turing universal signal
machines},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {57--67},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.07.013},
doi = {10.1016/J.TCS.2010.07.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Durand-Lose11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DurzinskyWW11,
author = {Markus Durzinsky and
Annegret Wagler and
Robert Weismantel},
title = {An algorithmic framework for network reconstruction},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {26},
pages = {2800--2815},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.016},
doi = {10.1016/J.TCS.2010.08.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DurzinskyWW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EidenbenzW11,
author = {Raphael Eidenbenz and
Roger Wattenhofer},
title = {Good programming in transactional memory: Game theory meets multicore
architecture},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4136--4150},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.008},
doi = {10.1016/J.TCS.2010.09.008},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/EidenbenzW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ElberfeldT11,
author = {Michael Elberfeld and
Johannes Textor},
title = {Negative selection algorithms on strings with efficient training and
linear-time classification},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {6},
pages = {534--542},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.022},
doi = {10.1016/J.TCS.2010.09.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ElberfeldT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ElorB11,
author = {Yotam Elor and
Alfred M. Bruckstein},
title = {Uniform multi-agent deployment on a ring},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {783--795},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.023},
doi = {10.1016/J.TCS.2010.11.023},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ElorB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ElsasserS11,
author = {Robert Els{\"{a}}sser and
Thomas Sauerwald},
title = {Tight bounds for the cover time of multiple random walks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {24},
pages = {2623--2641},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.010},
doi = {10.1016/J.TCS.2010.08.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ElsasserS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EmekFKR11,
author = {Yuval Emek and
Pierre Fraigniaud and
Amos Korman and
Adi Ros{\'{e}}n},
title = {Online computation with advice},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {24},
pages = {2642--2656},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.007},
doi = {10.1016/J.TCS.2010.08.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EmekFKR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EndrullisGKO11,
author = {J{\"{o}}rg Endrullis and
Clemens Grabmayer and
Jan Willem Klop and
Vincent van Oostrom},
title = {On equal {\(\mu\)}-terms},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3175--3202},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.011},
doi = {10.1016/J.TCS.2011.04.011},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/EndrullisGKO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EndrullisH11,
author = {J{\"{o}}rg Endrullis and
Dimitri Hendriks},
title = {Lazy productivity via termination},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3203--3225},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.024},
doi = {10.1016/J.TCS.2011.03.024},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/EndrullisH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EpsteinZ11,
author = {Leah Epstein and
Hanan Zebedat{-}Haider},
title = {Online scheduling with rejection and withdrawal},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6666--6674},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.031},
doi = {10.1016/J.TCS.2011.08.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EpsteinZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EsbelinMC11,
author = {Henri{-}Alex Esbelin and
R{\'{e}}my Malgouyres and
Colin Cartade},
title = {Convergence of binomial-based derivative estimation for C\({}^{\mbox{2}}\)
noisy discretized curves},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {36},
pages = {4805--4813},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.035},
doi = {10.1016/J.TCS.2010.12.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EsbelinMC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EsikI11,
author = {Zolt{\'{a}}n {\'{E}}sik and
Szabolcs Iv{\'{a}}n},
title = {B{\"{u}}chi context-free languages},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {805--821},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.026},
doi = {10.1016/J.TCS.2010.11.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EsikI11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EsparzaKL11,
author = {Javier Esparza and
Stefan Kiefer and
Michael Luttenberger},
title = {Derivation tree analysis for accelerated fixed-point computation},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3226--3241},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.020},
doi = {10.1016/J.TCS.2011.03.020},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/EsparzaKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EvenM11,
author = {Guy Even and
Moti Medina},
title = {Parallel randomized load balancing: {A} lower bound for a more general
model},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2398--2408},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.033},
doi = {10.1016/J.TCS.2011.01.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EvenM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FanJCY11,
author = {Jianxi Fan and
Xiaohua Jia and
Baolei Cheng and
Jia Yu},
title = {An efficient fault-tolerant routing algorithm in bijective connection
networks with restricted faulty edges},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3440--3450},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.014},
doi = {10.1016/J.TCS.2011.02.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FanJCY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FanLZZ11,
author = {Baoqiang Fan and
Shisheng Li and
Li Zhou and
Liqi Zhang},
title = {Scheduling resumable deteriorating jobs on a single machine with non-availability
constraints},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {275--280},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.017},
doi = {10.1016/J.TCS.2010.09.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FanLZZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FangLL11,
author = {Yang Fang and
Xiwen Lu and
Peihai Liu},
title = {Online batch scheduling on parallel machines with delivery times},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5333--5339},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.011},
doi = {10.1016/J.TCS.2011.06.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FangLL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FanghanelKV11,
author = {Alexander Fangh{\"{a}}nel and
Thomas Kesselheim and
Berthold V{\"{o}}cking},
title = {Improved algorithms for latency minimization in wireless networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {24},
pages = {2657--2667},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.05.004},
doi = {10.1016/J.TCS.2010.05.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FanghanelKV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FarzanM11,
author = {Arash Farzan and
J. Ian Munro},
title = {Succinct representation of dynamic trees},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {24},
pages = {2668--2678},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.030},
doi = {10.1016/J.TCS.2010.10.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FarzanM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FernauKKLLRR11,
author = {Henning Fernau and
Joachim Kneis and
Dieter Kratsch and
Alexander Langer and
Mathieu Liedloff and
Daniel Raible and
Peter Rossmanith},
title = {An exact algorithm for the Maximum Leaf Spanning Tree problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6290--6302},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.011},
doi = {10.1016/J.TCS.2011.07.011},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FernauKKLLRR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FerreiraM11,
author = {Francicleber Martins Ferreira and
Ana Teresa C. Martins},
title = {Recursive definitions and fixed-points on well-founded structures},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {37},
pages = {4893--4904},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.028},
doi = {10.1016/J.TCS.2011.01.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FerreiraM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FialaGK11,
author = {Jir{\'{\i}} Fiala and
Petr A. Golovach and
Jan Kratochv{\'{\i}}l},
title = {Parameterized complexity of coloring problems: Treewidth versus vertex
cover},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {23},
pages = {2513--2523},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.043},
doi = {10.1016/J.TCS.2010.10.043},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FialaGK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Fici11,
author = {Gabriele Fici},
title = {Special factors and the combinatorics of suffix and factor automata},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3604--3615},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.007},
doi = {10.1016/J.TCS.2011.03.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Fici11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FiorenziOV11,
author = {Francesca Fiorenzi and
Pascal Ochem and
Elise Vaslet},
title = {Bounds for the generalized repetition threshold},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {27},
pages = {2955--2963},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.009},
doi = {10.1016/J.TCS.2010.10.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FiorenziOV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Fischer11,
author = {Johannes Fischer},
title = {Combined data structure for previous- and next-smaller-values},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2451--2456},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.036},
doi = {10.1016/J.TCS.2011.01.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Fischer11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FlamminiMMSZ11,
author = {Michele Flammini and
Gianpiero Monaco and
Luca Moscardelli and
Mordechai Shalom and
Shmuel Zaks},
title = {Optimizing regenerator cost in traffic grooming},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {52},
pages = {7109--7121},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.023},
doi = {10.1016/J.TCS.2011.09.023},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FlamminiMMSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FleinerIM11,
author = {Tam{\'{a}}s Fleiner and
Robert W. Irving and
David F. Manlove},
title = {An algorithm for a super-stable roommates problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {7059--7065},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.012},
doi = {10.1016/J.TCS.2011.09.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FleinerIM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FominFKT11,
author = {Fedor V. Fomin and
Pierre Fraigniaud and
Stephan Kreutzer and
Dimitrios M. Thilikos},
title = {Special Issue on "Theory and Applications of Graph Searching Problems"},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {24},
pages = {2699},
year = {2011},
url = {https://doi.org/10.1016/S0304-3975(11)00295-7},
doi = {10.1016/S0304-3975(11)00295-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FominFKT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FominGL11,
author = {Fedor V. Fomin and
Petr A. Golovach and
Daniel Lokshtanov},
title = {Guard games on graphs: Keep the intruder out!},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {46},
pages = {6484--6497},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.024},
doi = {10.1016/J.TCS.2011.08.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FominGL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FominLS11,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Saket Saurabh},
title = {An exact algorithm for minimum distortion embedding},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3530--3536},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.043},
doi = {10.1016/J.TCS.2011.02.043},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FominLS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FrandsenS11,
author = {Gudmund Skovbjerg Frandsen and
Piotr Sankowski},
title = {Dynamic normal forms and dynamic characteristic polynomial},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {16},
pages = {1470--1483},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.049},
doi = {10.1016/J.TCS.2010.11.049},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FrandsenS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FrankeRW11,
author = {Robert Franke and
Ignaz Rutter and
Dorothea Wagner},
title = {Computing large matchings in planar graphs with fixed minimum degree},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4092--4099},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.06.012},
doi = {10.1016/J.TCS.2010.06.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FrankeRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FriedrichHN11,
author = {Tobias Friedrich and
Christian Horoba and
Frank Neumann},
title = {Illustration of fairness in evolutionary multi-objective optimization},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {17},
pages = {1546--1556},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.023},
doi = {10.1016/J.TCS.2010.09.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FriedrichHN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FrougnyPS11,
author = {Christiane Frougny and
Edita Pelantov{\'{a}} and
Milena Svobodov{\'{a}}},
title = {Parallel addition in non-standard numeration systems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5714--5727},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.028},
doi = {10.1016/J.TCS.2011.06.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FrougnyPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FulopS11,
author = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Magnus Steinby},
title = {Varieties of recognizable tree series over fields},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {736--752},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.018},
doi = {10.1016/J.TCS.2010.11.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FulopS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GabarroGS11,
author = {Joaquim Gabarr{\'{o}} and
Alina Garc{\'{\i}}a and
Maria J. Serna},
title = {The complexity of game isomorphism},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6675--6695},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.022},
doi = {10.1016/J.TCS.2011.07.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GabarroGS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GalligoP11,
author = {Andr{\'{e}} Galligo and
Adrien Poteaux},
title = {Computing monodromy via continuation methods on random Riemann surfaces},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {16},
pages = {1492--1507},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.047},
doi = {10.1016/J.TCS.2010.11.047},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GalligoP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Galpin11,
author = {Vashti Galpin},
title = {Equivalences for a biological process algebra},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {43},
pages = {6058--6082},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.006},
doi = {10.1016/J.TCS.2011.07.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Galpin11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GalpinH11,
author = {Vashti Galpin and
Jane Hillston},
title = {A semantic equivalence for Bio-PEPA based on discretisation of continuous
values},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {21},
pages = {2142--2161},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.007},
doi = {10.1016/J.TCS.2011.01.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GalpinH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Gamzu11,
author = {Iftah Gamzu},
title = {Improved lower bounds for non-utilitarian truthfulness},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {7},
pages = {626--632},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.05.012},
doi = {10.1016/J.TCS.2009.05.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Gamzu11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GanivadaDP11,
author = {Avatharam Ganivada and
Soumitra Dutta and
Sankar K. Pal},
title = {Fuzzy rough granular neural networks, fuzzy granules, and classification},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {42},
pages = {5834--5853},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.038},
doi = {10.1016/J.TCS.2011.05.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GanivadaDP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GaoLYGW11,
author = {Suogang Gao and
Zengti Li and
Jiangchen Yu and
Xiaofeng Gao and
Weili Wu},
title = {{DNA} library screening, pooling design and unitary spaces},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {3},
pages = {217--224},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.06.004},
doi = {10.1016/J.TCS.2009.06.004},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GaoLYGW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GarciaLRA11,
author = {Pedro Garc{\'{\i}}a and
Dami{\'{a}}n L{\'{o}}pez and
Jos{\'{e}} Ruiz and
Gloria In{\'{e}}s Alvarez},
title = {From regular expressions to smaller NFAs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5802--5807},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.058},
doi = {10.1016/J.TCS.2011.05.058},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GarciaLRA11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Gebauer11,
author = {Heidi Gebauer},
title = {Finding and enumerating Hamilton cycles in 4-regular graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4579--4591},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.038},
doi = {10.1016/J.TCS.2011.04.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Gebauer11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GehrkeV11,
author = {Mai Gehrke and
Jacob Vosmaer},
title = {Canonical extensions and canonicity via dcpo presentations},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {25},
pages = {2714--2723},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.032},
doi = {10.1016/J.TCS.2010.12.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GehrkeV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GeuversK11,
author = {Herman Geuvers and
Robbert Krebbers},
title = {The correctness of Newman's typability algorithm and some of its extensions},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3242--3261},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.016},
doi = {10.1016/J.TCS.2011.03.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GeuversK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GhareghaniMS11,
author = {Narges Ghareghani and
Morteza Mohammad Noori and
Pouyeh Sharifani},
title = {On z-factorization and c-factorization of standard episturmian words},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5232--5238},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.035},
doi = {10.1016/J.TCS.2011.05.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GhareghaniMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GhassemiFM11,
author = {Fatemeh Ghassemi and
Wan J. Fokkink and
Ali Movaghar},
title = {Verification of mobile ad hoc networks: An algebraic approach},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3262--3282},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.017},
doi = {10.1016/J.TCS.2011.03.017},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GhassemiFM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Girard11,
author = {Jean{-}Yves Girard},
title = {Geometry of Interaction {V:} Logic in the hyperfinite factor},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {20},
pages = {1860--1883},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.016},
doi = {10.1016/J.TCS.2010.12.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Girard11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Glabbeek11,
author = {Rob J. van Glabbeek},
title = {On cool congruence formats for weak bisimulations},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3283--3302},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.036},
doi = {10.1016/J.TCS.2011.02.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Glabbeek11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GlasserRS11,
author = {Christian Gla{\ss}er and
Christian Reitwie{\ss}ner and
Victor L. Selivanov},
title = {The shrinking property for {NP} and coNP},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {853--864},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.035},
doi = {10.1016/J.TCS.2010.11.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GlasserRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GnaedigK11,
author = {Isabelle Gnaedig and
H{\'{e}}l{\`{e}}ne Kirchner},
title = {Proving weak properties of rewriting},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {34},
pages = {4405--4438},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.028},
doi = {10.1016/J.TCS.2011.04.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GnaedigK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Goldstein11,
author = {Ilya Goldstein},
title = {Subword complexity of uniform {D0L} words over finite groups},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5728--5743},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.019},
doi = {10.1016/J.TCS.2011.06.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Goldstein11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolovachHKLMS11,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Daniel Lokshtanov and
Daniel Meister and
Saket Saurabh},
title = {Bandwidth on AT-free graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {7001--7008},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.011},
doi = {10.1016/J.TCS.2011.09.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GolovachHKLMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GosselinDS11,
author = {St{\'{e}}phane Gosselin and
Guillaume Damiand and
Christine Solnon},
title = {Efficient search of combinatorial maps using signatures},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {15},
pages = {1392--1405},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.029},
doi = {10.1016/J.TCS.2010.10.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GosselinDS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Goubault-Larrecq11,
author = {Jean Goubault{-}Larrecq},
title = {Musings around the geometry of interaction, and coherence},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {20},
pages = {1998--2014},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.023},
doi = {10.1016/J.TCS.2010.12.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Goubault-Larrecq11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GoudaA11,
author = {Mohamed G. Gouda and
Hrishikesh B. Acharya},
title = {Nash equilibria in stabilizing systems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {33},
pages = {4325--4335},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.027},
doi = {10.1016/J.TCS.2010.11.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GoudaA11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GrabnerS11,
author = {Peter J. Grabner and
Wolfgang Steiner},
title = {Redundancy of minimal weight expansions in Pisot bases},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6303--6315},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.018},
doi = {10.1016/J.TCS.2011.08.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GrabnerS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GrayM11,
author = {Robert D. Gray and
Ant{\'{o}}nio Malheiro},
title = {Finite complete rewriting systems for regular semigroups},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {654--661},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.020},
doi = {10.1016/J.TCS.2010.10.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GrayM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Grossi11,
author = {Roberto Grossi},
title = {A quick tour on suffix arrays and compressed suffix arrays},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {27},
pages = {2964--2973},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.036},
doi = {10.1016/J.TCS.2010.12.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Grossi11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GuL11,
author = {Xiaoyang Gu and
Jack H. Lutz},
title = {Effective dimensions and relative frequencies},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6696--6711},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.023},
doi = {10.1016/J.TCS.2011.08.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GuL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GuT11,
author = {Qian{-}Ping Gu and
Hisao Tamaki},
title = {Constant-factor approximations of branch-decomposition and largest
grid minor of planar graphs in O(n\({}^{\mbox{1+{\unicode{1013}}}}\))
time},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4100--4109},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.07.017},
doi = {10.1016/J.TCS.2010.07.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GuT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Guerrini11,
author = {Stefano Guerrini},
title = {A linear algorithm for {MLL} proof net correctness and sequentialization},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {20},
pages = {1958--1978},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.021},
doi = {10.1016/J.TCS.2010.12.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Guerrini11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GuiHZY11,
author = {Xiangquan Gui and
Xiaohong Hao and
Yuanping Zhang and
Xuerong Yong},
title = {A volume first maxima-finding algorithm},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6316--6326},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.013},
doi = {10.1016/J.TCS.2011.08.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GuiHZY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GutinJY11,
author = {Gregory Z. Gutin and
Mark Jones and
Anders Yeo},
title = {Kernels for below-upper-bound parameterizations of the hitting set
and directed dominating set problems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5744--5751},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.018},
doi = {10.1016/J.TCS.2011.06.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GutinJY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Haghverdi11,
author = {Esfandiar Haghverdi},
title = {Towards a geometry of recursion},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {20},
pages = {2015--2028},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.024},
doi = {10.1016/J.TCS.2010.12.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Haghverdi11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HarjuK11,
author = {Tero Harju and
Tomi K{\"{a}}rki},
title = {On the number of frames in binary words},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5276--5284},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.032},
doi = {10.1016/J.TCS.2011.05.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HarjuK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HashemiM11,
author = {Amir Hashemi and
Benyamin M.{-}Alizadeh},
title = {Applying IsRewritten criterion on Buchberger algorithm},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4592--4603},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.040},
doi = {10.1016/J.TCS.2011.04.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HashemiM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Heam11,
author = {Pierre{-}Cyrille H{\'{e}}am},
title = {On the complexity of computing the profinite closure of a rational
language},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5808--5813},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.022},
doi = {10.1016/J.TCS.2011.06.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Heam11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HeggernesMP11,
author = {Pinar Heggernes and
Daniel Meister and
Andrzej Proskurowski},
title = {Computing minimum distortion embeddings into a path for bipartite
permutation graphs and threshold graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1275--1297},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.005},
doi = {10.1016/J.TCS.2011.01.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HeggernesMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HeggernesMP11a,
author = {Pinar Heggernes and
Daniel Meister and
Charis Papadopoulos},
title = {Graphs of linear clique-width at most 3},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5466--5486},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.016},
doi = {10.1016/J.TCS.2011.06.016},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HeggernesMP11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HeinerU11,
author = {Monika Heiner and
Adelinde M. Uhrmacher},
title = {Foundations of formal reconstruction of biochemical networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {26},
pages = {2798--2799},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.001},
doi = {10.1016/J.TCS.2011.02.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HeinerU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Herranz11,
author = {Javier Herranz},
title = {Restricted adaptive oblivious transfer},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {46},
pages = {6498--6506},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.023},
doi = {10.1016/J.TCS.2011.06.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Herranz11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HoeferMRT11,
author = {Martin Hoefer and
Vahab S. Mirrokni and
Heiko R{\"{o}}glin and
Shang{-}Hua Teng},
title = {Competitive routing over time},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5420--5432},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.055},
doi = {10.1016/J.TCS.2011.05.055},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HoeferMRT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HoepmanLST11,
author = {Jaap{-}Henk Hoepman and
Andreas Larsson and
Elad Michael Schiller and
Philippas Tsigas},
title = {Secure and self-stabilizing clock synchronization in sensor networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {40},
pages = {5631--5647},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.04.012},
doi = {10.1016/J.TCS.2010.04.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HoepmanLST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HofnerM11,
author = {Peter H{\"{o}}fner and
Bernhard M{\"{o}}ller},
title = {Fixing Zeno gaps},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3303--3322},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.018},
doi = {10.1016/J.TCS.2011.03.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HofnerM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HolzerKM11,
author = {Markus Holzer and
Martin Kutrib and
Andreas Malcher},
title = {Complexity of multi-head finite automata: Origins and directions},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {83--96},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.024},
doi = {10.1016/J.TCS.2010.08.024},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HolzerKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HonLSTV11,
author = {Wing{-}Kai Hon and
Tak Wah Lam and
Rahul Shah and
Siu{-}Lung Tam and
Jeffrey Scott Vitter},
title = {Cache-oblivious index for approximate string matching},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3579--3588},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.004},
doi = {10.1016/J.TCS.2011.03.004},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HonLSTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HonSS11,
author = {Wing{-}Kai Hon and
Kunihiko Sadakane and
Wing{-}Kin Sung},
title = {Succinct data structures for Searchable Partial Sums with optimal
worst-case performance},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5176--5186},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.023},
doi = {10.1016/J.TCS.2011.05.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HonSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HoppenKMS11,
author = {Carlos Hoppen and
Yoshiharu Kohayakawa and
Carlos Gustavo T. de A. Moreira and
Rudini Menezes Sampaio},
title = {Testing permutation properties through subpermutations},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3555--3567},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.002},
doi = {10.1016/J.TCS.2011.03.002},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HoppenKMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HoppenRT11,
author = {Carlos Hoppen and
Virginia M. Rodrigues and
Vilmar Trevisan},
title = {A note on Gao's algorithm for polynomial factorization},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {16},
pages = {1508--1522},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.048},
doi = {10.1016/J.TCS.2010.11.048},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HoppenRT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HorcikT11,
author = {Rostislav Horc{\'{\i}}k and
Kazushige Terui},
title = {Disjunction property and complexity of substructural logics},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {31},
pages = {3992--4006},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.004},
doi = {10.1016/J.TCS.2011.04.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HorcikT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HorozalR11,
author = {Feryal Fulya Horozal and
Florian Rabe},
title = {Representing model theory in a type-theoretical logical framework},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {37},
pages = {4919--4945},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.022},
doi = {10.1016/J.TCS.2011.03.022},
timestamp = {Tue, 05 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HorozalR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HortaAC11,
author = {Danilo Horta and
Ivan C. de Andrade and
Ricardo J. G. B. Campello},
title = {Evolutionary fuzzy clustering of relational data},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {42},
pages = {5854--5870},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.039},
doi = {10.1016/J.TCS.2011.05.039},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HortaAC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HouK11,
author = {Li{-}ying Hou and
Liying Kang},
title = {Online and semi-online hierarchical scheduling for load balancing
on uniform machines},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1092--1098},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.008},
doi = {10.1016/J.TCS.2010.12.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HouK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Hsieh11,
author = {Sun{-}Yuan Hsieh},
title = {On parallel recognition of cographs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {686--694},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.003},
doi = {10.1016/J.TCS.2010.11.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Hsieh11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HsiehD11,
author = {Hsien{-}Jone Hsieh and
Dyi{-}Rong Duh},
title = {{\(\omega\)}-wide diameters of enhanced pyramid networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3658--3675},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.026},
doi = {10.1016/J.TCS.2011.03.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HsiehD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Huang11,
author = {Yun Bao Huang},
title = {The complexity of smooth words on 2-letter alphabets},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6327--6339},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.002},
doi = {10.1016/J.TCS.2011.07.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Huang11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HuangHH11,
author = {Chao{-}Wen Huang and
Hui{-}Ling Huang and
Sun{-}Yuan Hsieh},
title = {Edge-bipancyclicity of star graphs with faulty elements},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {6938--6947},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.006},
doi = {10.1016/J.TCS.2011.09.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HuangHH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Hung11,
author = {Ruo{-}Wei Hung},
title = {Embedding two edge-disjoint Hamiltonian cycles into locally twisted
cubes},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4747--4753},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.004},
doi = {10.1016/J.TCS.2011.05.004},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Hung11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HungC11,
author = {Ruo{-}Wei Hung and
Maw{-}Shang Chang},
title = {An efficient certifying algorithm for the Hamiltonian cycle problem
on circular-arc graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5351--5373},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.009},
doi = {10.1016/J.TCS.2011.06.009},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HungC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HuoZ11,
author = {Yumei Huo and
Hairong Zhao},
title = {Bicriteria scheduling concerned with makespan and total completion
time subject to machine availability constraints},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1081--1091},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.007},
doi = {10.1016/J.TCS.2010.12.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HuoZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HurinkP11,
author = {Johann L. Hurink and
Jacob Jan Paulus},
title = {Improved online algorithms for parallel job scheduling and strip packing},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {7},
pages = {583--593},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.05.033},
doi = {10.1016/J.TCS.2009.05.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HurinkP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Hwang11,
author = {Jung Yeon Hwang},
title = {A note on an identity-based ring signature scheme with signer verifiability},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {796--804},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.024},
doi = {10.1016/J.TCS.2010.11.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Hwang11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/IIBT11,
author = {Tomohiro I and
Shunsuke Inenaga and
Hideo Bannai and
Masayuki Takeda},
title = {Verifying and enumerating parameterized border arrays},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {6959--6981},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.008},
doi = {10.1016/J.TCS.2011.09.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/IIBT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ItoDHPSUU11,
author = {Takehiro Ito and
Erik D. Demaine and
Nicholas J. A. Harvey and
Christos H. Papadimitriou and
Martha Sideri and
Ryuhei Uehara and
Yushi Uno},
title = {On the complexity of reconfiguration problems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1054--1065},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.005},
doi = {10.1016/J.TCS.2010.12.005},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ItoDHPSUU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ItoKPT11,
author = {Takehiro Ito and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Parameterizing cut sets in a graph by the number of their components},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6340--6350},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.005},
doi = {10.1016/J.TCS.2011.07.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ItoKPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Jacobs11,
author = {Bart Jacobs},
title = {Probabilities, distribution monads, and convex categories},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3323--3336},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.005},
doi = {10.1016/J.TCS.2011.04.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Jacobs11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JacobsNRS11,
author = {Bart Jacobs and
Milad Niqui and
Jan J. M. M. Rutten and
Alexandra Silva},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {38},
pages = {4967--4968},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.001},
doi = {10.1016/J.TCS.2011.06.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JacobsNRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JainLSS11,
author = {Sanjay Jain and
Qinglong Luo and
Pavel Semukhin and
Frank Stephan},
title = {Uncountable automatic classes and learning},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {19},
pages = {1805--1820},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.057},
doi = {10.1016/J.TCS.2010.12.057},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JainLSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JametPRV11,
author = {Damien Jamet and
Genevi{\`{e}}ve Paquin and
Gw{\'{e}}na{\"{e}}l Richomme and
Laurent Vuillon},
title = {On the fixed points of the iterated pseudopalindromic closure operator},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {27},
pages = {2974--2987},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.03.018},
doi = {10.1016/J.TCS.2010.03.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JametPRV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JansenZ11,
author = {Thomas Jansen and
Christine Zarges},
title = {Analyzing different variants of immune inspired somatic contiguous
hypermutations},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {6},
pages = {517--533},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.027},
doi = {10.1016/J.TCS.2010.09.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JansenZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JansenZ11a,
author = {Thomas Jansen and
Christine Zarges},
title = {On benefits and drawbacks of aging strategies for randomized search
heuristics},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {6},
pages = {543--559},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.03.032},
doi = {10.1016/J.TCS.2010.03.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JansenZ11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Japaridze11,
author = {Giorgi Japaridze},
title = {Toggling operators in computability logic},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {11},
pages = {971--1004},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.037},
doi = {10.1016/J.TCS.2010.11.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Japaridze11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JensenC11,
author = {Richard Jensen and
Chris Cornelis},
title = {Fuzzy-rough nearest neighbour classification and prediction},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {42},
pages = {5871--5884},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.040},
doi = {10.1016/J.TCS.2011.05.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JensenC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JhaL11,
author = {Sumit Kumar Jha and
Christopher James Langmead},
title = {Synthesis and infeasibility analysis for stochastic models of biochemical
systems using statistical model checking and abstraction refinement},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {21},
pages = {2162--2187},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.012},
doi = {10.1016/J.TCS.2011.01.012},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/JhaL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Jiang11,
author = {Minghui Jiang},
title = {Inapproximability of maximal strip recovery},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3759--3774},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.021},
doi = {10.1016/J.TCS.2011.04.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Jiang11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JiangC11,
author = {Pei Jiang and
Ying{-}Ping Chen},
title = {Free lunches on the discrete Lipschitz class},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {17},
pages = {1614--1628},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.028},
doi = {10.1016/J.TCS.2010.12.028},
timestamp = {Mon, 13 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JiangC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JingHT11,
author = {Caixia Jing and
Wanzhen Huang and
Guochun Tang},
title = {Minimizing total completion time for re-entrant flow shop scheduling
problems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6712--6719},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.030},
doi = {10.1016/J.TCS.2011.08.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JingHT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JuknaS11,
author = {Stasys Jukna and
Georg Schnitger},
title = {Yet harder knapsack problems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6351--6358},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.003},
doi = {10.1016/J.TCS.2011.07.003},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/JuknaS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KaklamanisS11,
author = {Christos Kaklamanis and
Martin Skutella},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {7},
pages = {561--562},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.050},
doi = {10.1016/J.TCS.2010.12.050},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KaklamanisS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KakugawaYKM11,
author = {Hirotsugu Kakugawa and
Yukiko Yamauchi and
Sayaka Kamei and
Toshimitsu Masuzawa},
title = {Observations on non-silent self-stabilizing algorithms in sensor networks
with probabilistically intermittent link failures},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {33},
pages = {4336--4349},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.013},
doi = {10.1016/J.TCS.2010.11.013},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KakugawaYKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KaminskiMM11,
author = {Marcin Kaminski and
Paul Medvedev and
Martin Milanic},
title = {Shortest paths between shortest paths},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5205--5210},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.021},
doi = {10.1016/J.TCS.2011.05.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KaminskiMM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KanjWZ11,
author = {Iyad A. Kanj and
Andreas Wiese and
Fenghui Zhang},
title = {Local algorithms for edge colorings in UDGs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4704--4714},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.005},
doi = {10.1016/J.TCS.2011.05.005},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KanjWZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KanovichV11,
author = {Max I. Kanovich and
Jacqueline Vauzeilles},
title = {Linear logic as a tool for planning under temporal uncertainty},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {20},
pages = {2072--2092},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.027},
doi = {10.1016/J.TCS.2010.12.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KanovichV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KaplanL11,
author = {Marc Kaplan and
Sophie Laplante},
title = {Kolmogorov complexity and combinatorial methods in communication complexity},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {23},
pages = {2524--2535},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.044},
doi = {10.1016/J.TCS.2010.10.044},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KaplanL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KardosKS11,
author = {Frantisek Kardos and
J{\'{a}}n Katrenic and
Ingo Schiermeyer},
title = {On computing the minimum 3-path vertex cover and dissociation number
of graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {7009--7017},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.009},
doi = {10.1016/J.TCS.2011.09.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KardosKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kari11,
author = {Jarkko Kari},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {30},
pages = {3798--3799},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.018},
doi = {10.1016/J.TCS.2011.02.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Kari11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KariM11,
author = {Lila Kari and
Beno{\^{\i}}t Masson},
title = {Polyominoes simulating arbitrary-neighborhood zippers and tilings},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {43},
pages = {6083--6100},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.012},
doi = {10.1016/J.TCS.2011.05.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KariM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KasperskiZ11,
author = {Adam Kasperski and
Pawel Zielinski},
title = {On the approximability of robust spanning tree problems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {365--374},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.006},
doi = {10.1016/J.TCS.2010.10.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KasperskiZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KavithaMN11,
author = {Telikepalli Kavitha and
Juli{\'{a}}n Mestre and
Meghana Nasre},
title = {Popular mixed matchings},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {24},
pages = {2679--2690},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.03.028},
doi = {10.1016/J.TCS.2010.03.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KavithaMN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KavithaN11,
author = {Telikepalli Kavitha and
Meghana Nasre},
title = {Popular matchings with variable item copies},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1263--1274},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.067},
doi = {10.1016/J.TCS.2010.12.067},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KavithaN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KeimelRS11,
author = {Klaus Keimel and
Artus Ph. Rosenbusch and
Thomas Streicher},
title = {Relating direct and predicate transformer partial correctness semantics
for an imperative probabilistic-nondeterministic language},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {25},
pages = {2701--2713},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.029},
doi = {10.1016/J.TCS.2010.12.029},
timestamp = {Mon, 18 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KeimelRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KelnerM11,
author = {Jonathan A. Kelner and
Petar Maymounkov},
title = {Electric routing and concurrent flow cutting},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4123--4135},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.06.013},
doi = {10.1016/J.TCS.2010.06.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KelnerM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KesnerR11,
author = {Delia Kesner and
Fabien Renaud},
title = {A prismoid framework for languages with resources},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {37},
pages = {4867--4892},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.026},
doi = {10.1016/J.TCS.2011.01.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KesnerR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kim11,
author = {Dong Han Kim},
title = {Return time complexity of Sturmian sequences},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3413--3417},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.004},
doi = {10.1016/J.TCS.2011.02.004},
timestamp = {Mon, 09 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Kim11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kim11a,
author = {Changwook Kim},
title = {Quasi-rocking real-time pushdown automata},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6720--6735},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.029},
doi = {10.1016/J.TCS.2011.08.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Kim11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KimLP11,
author = {Sook{-}Yeon Kim and
Jae{-}Ha Lee and
Jung{-}Heum Park},
title = {Disjoint path covers in recursive circulants G(2\({}^{\mbox{m}}\),
4) with faulty elements},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4636--4649},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.045},
doi = {10.1016/J.TCS.2011.04.045},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KimLP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KiranN11,
author = {S. Kanthi Kiran and
N. S. Narayanaswamy},
title = {Hardness of subgraph and supergraph problems in c-tournaments},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4629--4635},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.046},
doi = {10.1016/J.TCS.2011.04.046},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KiranN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KiwiNT11,
author = {Marcos A. Kiwi and
Gonzalo Navarro and
Claudio Telha},
title = {On-line approximate string matching with bounded errors},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6359--6370},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.005},
doi = {10.1016/J.TCS.2011.08.005},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KiwiNT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Klin11,
author = {Bartek Klin},
title = {Bialgebras for structural operational semantics: An introduction},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {38},
pages = {5043--5069},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.023},
doi = {10.1016/J.TCS.2011.03.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Klin11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KnauerKS11,
author = {Christian Knauer and
Klaus Kriegel and
Fabian Stehn},
title = {Minimizing the weighted directed Hausdorff distance between colored
point sets under translations and rigid motions},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {375--382},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.03.020},
doi = {10.1016/J.TCS.2010.03.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KnauerKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KnauerLSW11,
author = {Christian Knauer and
Maarten L{\"{o}}ffler and
Marc Scherfenberg and
Thomas Wolle},
title = {The directed Hausdorff distance between imprecise point sets},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4173--4186},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.039},
doi = {10.1016/J.TCS.2011.01.039},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KnauerLSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kock11,
author = {Anders Kock},
title = {Affine connections, midpoint formation, and point reflection},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {36},
pages = {4770--4777},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.037},
doi = {10.1016/J.TCS.2010.12.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Kock11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KohHT11,
author = {Geoffrey Koh and
David Hsu and
P. S. Thiagarajan},
title = {Component-based construction of bio-pathway models: The parameter
estimation problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {26},
pages = {2840--2853},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.013},
doi = {10.1016/J.TCS.2011.02.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KohHT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KolpakovR11,
author = {Roman Kolpakov and
Micha{\"{e}}l Rao},
title = {On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and
10 letters},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {46},
pages = {6507--6516},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.006},
doi = {10.1016/J.TCS.2011.08.006},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KolpakovR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kopecki11,
author = {Steffen Kopecki},
title = {On iterated hairpin completion},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3629--3638},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.009},
doi = {10.1016/J.TCS.2011.03.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Kopecki11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KorpelainenLMT11,
author = {Nicholas Korpelainen and
Vadim V. Lozin and
Dmitriy S. Malyshev and
Alexander Tiskin},
title = {Boundary properties of graphs for algorithmic graph problems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3545--3554},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.001},
doi = {10.1016/J.TCS.2011.03.001},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KorpelainenLMT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KortsarzN11,
author = {Guy Kortsarz and
Zeev Nutov},
title = {Approximating some network design problems with node costs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4482--4492},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.013},
doi = {10.1016/J.TCS.2011.04.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KortsarzN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KosowskiNP11,
author = {Adrian Kosowski and
Alfredo Navarra and
Maria Cristina Pinotti},
title = {Synchronous black hole search in directed graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5752--5759},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.054},
doi = {10.1016/J.TCS.2011.05.054},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KosowskiNP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KotsireasMP11,
author = {Ilias S. Kotsireas and
Bernard Mourrain and
Victor Y. Pan},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {16},
pages = {1443--1444},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.002},
doi = {10.1016/J.TCS.2010.12.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KotsireasMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KountouriotisNR11,
author = {Vassilis Kountouriotis and
Christos Nomikos and
Panos Rondogiannis},
title = {A game-theoretic characterization of Boolean grammars},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1169--1183},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.051},
doi = {10.1016/J.TCS.2010.12.051},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KountouriotisNR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KourniotisMT11,
author = {Michalis Kourniotis and
Marilena Mitrouli and
Dimitrios Triantafyllou},
title = {Parallel {QR} processing of Generalized Sylvester matrices},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {16},
pages = {1484--1491},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.051},
doi = {10.1016/J.TCS.2010.11.051},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KourniotisMT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KrauthgamerMR11,
author = {Robert Krauthgamer and
Aranyak Mehta and
Atri Rudra},
title = {Pricing commodities},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {7},
pages = {602--613},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.10.002},
doi = {10.1016/J.TCS.2009.10.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KrauthgamerMR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KreutzerO11,
author = {Stephan Kreutzer and
Sebastian Ordyniak},
title = {Digraph decompositions and monotonicity in digraph searching},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4688--4703},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.003},
doi = {10.1016/J.TCS.2011.05.003},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KreutzerO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KrynickiTZ11,
author = {Michal Krynicki and
Jerzy Tomasik and
Konrad Zdanowski},
title = {Theories of initial segments of standard models of arithmetics and
their complete extensions},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {31},
pages = {3975--3991},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.030},
doi = {10.1016/J.TCS.2011.04.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KrynickiTZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kulich11,
author = {Tom{\'{a}}s Kulich},
title = {Dynamic monopolies with randomized starting configuration},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6371--6381},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.004},
doi = {10.1016/J.TCS.2011.08.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Kulich11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KulikSSS11,
author = {Ariel Kulik and
Hadas Shachnai and
Oded Shmueli and
Robert Sayegh},
title = {Approximation schemes for deal splitting and covering integer programs
with multiplicity constraints},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {52},
pages = {7087--7098},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.018},
doi = {10.1016/J.TCS.2011.09.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KulikSSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KupkeP11,
author = {Clemens Kupke and
Dirk Pattinson},
title = {Coalgebraic semantics of modal logics: An overview},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {38},
pages = {5070--5094},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.023},
doi = {10.1016/J.TCS.2011.04.023},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KupkeP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KushwahL11,
author = {Prashant Kushwah and
Sunder Lal},
title = {An efficient identity based generalized signcryption scheme},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6382--6389},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.009},
doi = {10.1016/J.TCS.2011.08.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KushwahL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KutribM11,
author = {Martin Kutrib and
Andreas Malcher},
title = {Cellular automata with limited inter-cell bandwidth},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {30},
pages = {3917--3931},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.026},
doi = {10.1016/J.TCS.2011.02.026},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KutribM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LabarreC11,
author = {Anthony Labarre and
Josef Cibulka},
title = {Polynomial-time sortable stacks of burnt pancakes},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {695--702},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.004},
doi = {10.1016/J.TCS.2010.11.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LabarreC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LagoH11,
author = {Ugo Dal Lago and
Martin Hofmann},
title = {Realizability models and implicit complexity},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {20},
pages = {2029--2047},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.025},
doi = {10.1016/J.TCS.2010.12.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LagoH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LarsenFT11,
author = {Kim G. Larsen and
Uli Fahrenberg and
Claus R. Thrane},
title = {Metrics for weighted transition systems: Axiomatization and complexity},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3358--3369},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.003},
doi = {10.1016/J.TCS.2011.04.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LarsenFT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LarssonHF11,
author = {Urban Larsson and
Peter Hegarty and
Aviezri S. Fraenkel},
title = {Invariant and dual subtraction games resolving the Duch{\^{e}}ne-Rigo
conjecture},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {729--735},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.015},
doi = {10.1016/J.TCS.2010.11.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LarssonHF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeIDH11,
author = {Phuc Quang Le and
Abdullah M. Iliyasu and
Fangyan Dong and
Kaoru Hirota},
title = {Strategies for designing geometric transformations on quantum images},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {15},
pages = {1406--1418},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.029},
doi = {10.1016/J.TCS.2010.11.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeIDH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LenzMP11,
author = {Daniel Lenz and
Zuzana Mas{\'{a}}kov{\'{a}} and
Edita Pelantov{\'{a}}},
title = {Note on powers in three interval exchange transformations},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3788--3794},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.027},
doi = {10.1016/J.TCS.2011.03.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LenzMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeviL11,
author = {Tamir Levi and
Ami Litman},
title = {Bitonic sorters of minimal depth},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2282--2295},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.006},
doi = {10.1016/J.TCS.2011.01.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeviL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LevinY11,
author = {Asaf Levin and
Uri Yovel},
title = {Uniform unweighted set cover: The power of non-oblivious local search},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1033--1053},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.004},
doi = {10.1016/J.TCS.2010.12.004},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LevinY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Li11,
author = {Minming Li},
title = {Approximation algorithms for variable voltage processors: Min energy,
max throughput and online heuristics},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4074--4080},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.011},
doi = {10.1016/J.TCS.2010.10.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Li11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiHS11,
author = {Yongjian Li and
William N. N. Hung and
Xiaoyu Song},
title = {A novel formalization of symbolic trajectory evaluation semantics
in Isabelle/HOL},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {25},
pages = {2746--2765},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.032},
doi = {10.1016/J.TCS.2011.01.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiHS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiL11,
author = {Zhong Li and
Guohui Lin},
title = {The three column Bandpass problem is solvable in linear time},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {281--299},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.018},
doi = {10.1016/J.TCS.2010.09.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiLT11,
author = {Tseng{-}Kuei Li and
Chia{-}Jui Lai and
Chang{-}Hsiung Tsai},
title = {A novel algorithm to embed a multi-dimensional torus into a locally
twisted cube},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2418--2424},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.035},
doi = {10.1016/J.TCS.2011.01.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiLT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiN11,
author = {Shuai Cheng Li and
Yen Kaow Ng},
title = {On protein structure alignment under distance constraint},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4187--4199},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.045},
doi = {10.1016/J.TCS.2010.11.045},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiWZY11,
author = {Deying Li and
Yuexuan Wang and
Qinghua Zhu and
Huiqiang Yang},
title = {Fault-tolerant routing: k-inconnected many-to-one routing in wireless
networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {3},
pages = {209--216},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.06.035},
doi = {10.1016/J.TCS.2009.06.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiWZY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LibertY11,
author = {Beno{\^{\i}}t Libert and
Moti Yung},
title = {Efficient traceable signatures in the standard model},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1220--1242},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.066},
doi = {10.1016/J.TCS.2010.12.066},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LibertY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Lim11,
author = {Chae Hoon Lim},
title = {A note on the average number of {RSA} fixed points},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4729--4737},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.013},
doi = {10.1016/J.TCS.2011.03.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Lim11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LimLC11,
author = {Kyungkuk Lim and
Kangbok Lee and
Soo Y. Chang},
title = {Improved bounds for online scheduling with eligibility constraints},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5211--5224},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.029},
doi = {10.1016/J.TCS.2011.05.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LimLC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LinYPF11,
author = {Chun{-}Cheng Lin and
Hsu{-}Chun Yen and
Sheung{-}Hung Poon and
Jia{-}Hao Fan},
title = {Complexity analysis of balloon drawing for rooted trees},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {430--447},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.015},
doi = {10.1016/J.TCS.2010.10.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LinYPF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LingrasB11,
author = {Pawan Lingras and
Cory J. Butz},
title = {Conservative and aggressive rough {SVR} modeling},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {42},
pages = {5885--5901},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.042},
doi = {10.1016/J.TCS.2011.05.042},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LingrasB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuHT11,
author = {Bing Liu and
David Hsu and
P. S. Thiagarajan},
title = {Probabilistic approximations of ODEs based bio-pathway dynamics},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {21},
pages = {2188--2206},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.021},
doi = {10.1016/J.TCS.2011.01.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiuHT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuL11,
author = {Peihai Liu and
Xiwen Lu},
title = {An improved approximation algorithm for single machine scheduling
with job delivery},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {3},
pages = {270--274},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.025},
doi = {10.1016/J.TCS.2010.09.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiuL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuLCC11,
author = {Yi{-}Jiun Liu and
James K. Lan and
Well Y. Chou and
Chiuyuan Chen},
title = {Constructing independent spanning trees for locally twisted cubes},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2237--2252},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.061},
doi = {10.1016/J.TCS.2010.12.061},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiuLCC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuM11,
author = {Jiamou Liu and
Mia Minnes},
title = {Deciding the isomorphism problem in classes of unary automatic structures},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {18},
pages = {1705--1717},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.045},
doi = {10.1016/J.TCS.2010.12.045},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LiuM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuZCX11,
author = {Ming Liu and
Feifeng Zheng and
Chengbin Chu and
Yinfeng Xu},
title = {Optimal algorithms for online scheduling on parallel machines to minimize
the makespan with a periodic availability constraint},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5225--5231},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.028},
doi = {10.1016/J.TCS.2011.05.028},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LiuZCX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LoboVD11,
author = {Daniel Lobo and
Francisco J. Vico and
J{\"{u}}rgen Dassow},
title = {Graph grammars with string-regulated rewriting},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {43},
pages = {6101--6111},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.004},
doi = {10.1016/J.TCS.2011.07.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LoboVD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LokshtanovMS11,
author = {Daniel Lokshtanov and
Matthias Mnich and
Saket Saurabh},
title = {A linear kernel for planar connected dominating set},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {23},
pages = {2536--2543},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.045},
doi = {10.1016/J.TCS.2010.10.045},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LokshtanovMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LuLYF11,
author = {Juan Lu and
Sheng{-}Gang Li and
Xiao{-}Fei Yang and
Wen{-}Qing Fu},
title = {Categorical properties of M-indiscernibility spaces},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {42},
pages = {5902--5908},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.041},
doi = {10.1016/J.TCS.2011.05.041},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LuLYF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LugosiZ11,
author = {G{\'{a}}bor Lugosi and
Sandra Zilles},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {19},
pages = {1755},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.052},
doi = {10.1016/J.TCS.2010.12.052},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LugosiZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LuoHS11,
author = {Zhongxuan Luo and
Wenyu Hu and
Dongwoo Sheen},
title = {The nearest complex polynomial with a zero in a given complex domain},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {7029--7043},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.016},
doi = {10.1016/J.TCS.2011.09.016},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LuoHS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LuttgenV11,
author = {Gerald L{\"{u}}ttgen and
Walter Vogler},
title = {Safe reasoning with Logic {LTS}},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3337--3357},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.015},
doi = {10.1016/J.TCS.2011.03.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LuttgenV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Lutz11,
author = {Jack H. Lutz},
title = {A divergence formula for randomness and dimension},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {166--177},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.005},
doi = {10.1016/J.TCS.2010.09.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Lutz11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MacLeanD11,
author = {Stuart MacLean and
Suprakash Datta},
title = {The minimum positional error incurred by any connectivity-based positioning
algorithm for mobile wireless systems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {6897--6912},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.040},
doi = {10.1016/J.TCS.2011.08.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MacLeanD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MakinoTY11,
author = {Kazuhisa Makino and
Suguru Tamaki and
Masaki Yamamoto},
title = {An exact algorithm for the Boolean connectivity problem for k-CNF},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4613--4618},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.041},
doi = {10.1016/J.TCS.2011.04.041},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MakinoTY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MalmbergLSN11,
author = {Filip Malmberg and
Joakim Lindblad and
Natasa Sladoje and
Ingela Nystr{\"{o}}m},
title = {A graph-based framework for sub-pixel image segmentation},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {15},
pages = {1338--1349},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.030},
doi = {10.1016/J.TCS.2010.11.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MalmbergLSN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MaltaisM11,
author = {Elizabeth Maltais and
Lucia Moura},
title = {Hardness results for covering arrays avoiding forbidden edges and
error-locating arrays},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {46},
pages = {6517--6530},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.010},
doi = {10.1016/J.TCS.2011.07.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MaltaisM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ManjunathS11,
author = {Madhusudan Manjunath and
Vikram Sharma},
title = {Applications of dimensionality reduction and exponential sums to graph
automorphism},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3639--3649},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.014},
doi = {10.1016/J.TCS.2011.03.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ManjunathS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ManneMPT11,
author = {Fredrik Manne and
Morten Mjelde and
Laurence Pilard and
S{\'{e}}bastien Tixeuil},
title = {A self-stabilizing 2/3-approximation algorithm for the maximum matching
problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {40},
pages = {5515--5526},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.019},
doi = {10.1016/J.TCS.2011.05.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ManneMPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ManriqueRS11,
author = {Daniel Manrique and
Alfonso Rodr{\'{\i}}guez{-}Pat{\'{o}}n and
Petr Sos{\'{\i}}k},
title = {On the scalability of biocomputing algorithms: The case of the maximum
clique problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {51},
pages = {7075--7086},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.004},
doi = {10.1016/J.TCS.2011.09.004},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ManriqueRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MantzaflarisMT11,
author = {Angelos Mantzaflaris and
Bernard Mourrain and
Elias P. Tsigaridas},
title = {On continued fraction expansion of real roots of polynomial systems,
complexity and condition numbers},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2312--2330},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.009},
doi = {10.1016/J.TCS.2011.01.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MantzaflarisMT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Margenstern11,
author = {Maurice Margenstern},
title = {A universal cellular automaton on the heptagrid of the hyperbolic
plane with four states},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {33--56},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.04.015},
doi = {10.1016/J.TCS.2010.04.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Margenstern11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MariaFRS11,
author = {Elisabetta De Maria and
Fran{\c{c}}ois Fages and
Aur{\'{e}}lien Rizk and
Sylvain Soliman},
title = {Design, optimization and predictions of a coupled model of the cell
cycle, circadian clock, {DNA} repair system, irinotecan metabolism
and exposure control under temporal logic constraints},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {21},
pages = {2108--2127},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.036},
doi = {10.1016/J.TCS.2010.10.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MariaFRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MariniSSS11,
author = {Claudio Marini and
Giulia Simi and
Andrea Sorbi and
Marianna Sorrentino},
title = {A note on algebras of languages},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {46},
pages = {6531--6536},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.022},
doi = {10.1016/J.TCS.2011.08.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MariniSSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Marschall11,
author = {Tobias Marschall},
title = {Construction of minimal deterministic finite automata from biological
motifs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {922--930},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.003},
doi = {10.1016/J.TCS.2010.12.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Marschall11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MartinezPP11,
author = {Conrado Mart{\'{\i}}nez and
Alois Panholzer and
Helmut Prodinger},
title = {The analysis of Range Quickselect and related problems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {46},
pages = {6537--6555},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.030},
doi = {10.1016/J.TCS.2011.06.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MartinezPP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Marx11,
author = {D{\'{a}}niel Marx},
title = {Complexity of clique coloring and related problems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3487--3500},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.038},
doi = {10.1016/J.TCS.2011.02.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Marx11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MasakovaPV11,
author = {Zuzana Mas{\'{a}}kov{\'{a}} and
Edita Pelantov{\'{a}} and
Tom{\'{a}}s V{\'{a}}vra},
title = {Arithmetics in number systems with a negative base},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {835--845},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.033},
doi = {10.1016/J.TCS.2010.11.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MasakovaPV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MassbergS11,
author = {Jens Ma{\ss}berg and
Jan Schneider},
title = {Rectangle packing with additional restrictions},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {6948--6958},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.007},
doi = {10.1016/J.TCS.2011.09.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MassbergS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MasseBGL11,
author = {Alexandre Blondin Mass{\'{e}} and
Srecko Brlek and
Ariane Garon and
S{\'{e}}bastien Labb{\'{e}}},
title = {Equations on palindromes and circular words},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {27},
pages = {2922--2930},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.07.005},
doi = {10.1016/J.TCS.2010.07.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MasseBGL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MasseBGL11a,
author = {Alexandre Blondin Mass{\'{e}} and
Srecko Brlek and
Ariane Garon and
S{\'{e}}bastien Labb{\'{e}}},
title = {Two infinite families of polyominoes that tile the plane by translation
in two distinct ways},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {36},
pages = {4778--4786},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.034},
doi = {10.1016/J.TCS.2010.12.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MasseBGL11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MasseBLV11,
author = {Alexandre Blondin Mass{\'{e}} and
Srecko Brlek and
S{\'{e}}bastien Labb{\'{e}} and
Laurent Vuillon},
title = {Palindromic complexity of codings of rotations},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {46},
pages = {6455--6463},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.007},
doi = {10.1016/J.TCS.2011.08.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MasseBLV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MateescuMDJ11,
author = {Radu Mateescu and
Pedro T. Monteiro and
Estelle Dumas and
Hidde de Jong},
title = {{CTRL:} Extension of {CTL} with regular expressions and fairness operators
to verify genetic regulatory networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {26},
pages = {2854--2883},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.05.009},
doi = {10.1016/J.TCS.2010.05.009},
timestamp = {Thu, 04 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/MateescuMDJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/McCaigNS11,
author = {Chris McCaig and
Rachel Norman and
Carron Shankland},
title = {From individuals to populations: {A} mean field semantics for process
algebra},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {17},
pages = {1557--1580},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.024},
doi = {10.1016/J.TCS.2010.09.024},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/McCaigNS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/McEwanH11,
author = {Chris McEwan and
Emma Hart},
title = {On clonal selection},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {6},
pages = {502--516},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.017},
doi = {10.1016/J.TCS.2010.11.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/McEwanH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/McKay11,
author = {Neil A. McKay},
title = {Canonical forms of uptimals},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {52},
pages = {7122--7132},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.021},
doi = {10.1016/J.TCS.2011.09.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/McKay11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MedunaZ11,
author = {Alexander Meduna and
Petr Zemek},
title = {Workspace theorems for regular-controlled grammars},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4604--4612},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.042},
doi = {10.1016/J.TCS.2011.04.042},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MedunaZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MejiaM11,
author = {Carolina Mej{\'{\i}}a and
J. Andr{\'{e}}s Montoya},
title = {On the complexity of sandpile critical avalanches},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {30},
pages = {3964--3974},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.029},
doi = {10.1016/J.TCS.2011.02.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MejiaM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MerliniS11,
author = {Donatella Merlini and
Renzo Sprugnoli},
title = {Algebraic aspects of some Riordan arrays related to binary words avoiding
a pattern},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {27},
pages = {2988--3001},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.07.019},
doi = {10.1016/J.TCS.2010.07.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MerliniS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MerroBS11,
author = {Massimo Merro and
Francesco Ballardin and
Eleonora Sibilio},
title = {A timed calculus for wireless systems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {47},
pages = {6585--6611},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.016},
doi = {10.1016/J.TCS.2011.07.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MerroBS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MeyerP11,
author = {David A. Meyer and
James Pommersheim},
title = {On the uselessness of quantum queries},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {51},
pages = {7068--7074},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.037},
doi = {10.1016/J.TCS.2011.06.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MeyerP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Mezzini11,
author = {Mauro Mezzini},
title = {Fast minimal triangulation algorithm using minimum degree criterion},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3775--3787},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.022},
doi = {10.1016/J.TCS.2011.04.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Mezzini11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MichailCS11,
author = {Othon Michail and
Ioannis Chatzigiannakis and
Paul G. Spirakis},
title = {Mediated population protocols},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2434--2450},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.003},
doi = {10.1016/J.TCS.2011.02.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MichailCS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MitankinMS11,
author = {Petar Mitankin and
Stoyan Mihov and
Klaus U. Schulz},
title = {Deciding word neighborhood with universal neighborhood automata},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2340--2355},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.013},
doi = {10.1016/J.TCS.2011.01.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MitankinMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MitscheSS11,
author = {Dieter Mitsche and
Maria Saumell and
Rodrigo I. Silveira},
title = {On the number of higher order Delaunay triangulations},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3589--3597},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.005},
doi = {10.1016/J.TCS.2011.03.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MitscheSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MiyataTT11,
author = {Akinobu Miyata and
Jun Tarui and
Etsuji Tomita},
title = {Learning Boolean functions in AC\({}^{\mbox{0}}\) on attribute and
classification noise - Estimating an upper bound on attribute and
classification noise},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4650--4660},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.047},
doi = {10.1016/J.TCS.2011.04.047},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MiyataTT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Mol11,
author = {Liesbeth De Mol},
title = {On the complex behavior of simple tag systems - An experimental approach},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {97--112},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.026},
doi = {10.1016/J.TCS.2010.08.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Mol11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Monroe11,
author = {Hunter Monroe},
title = {Speedup for natural problems and noncomputability},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {478--481},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.029},
doi = {10.1016/J.TCS.2010.09.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Monroe11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MontanaroNR11,
author = {Ashley Montanaro and
Harumichi Nishimura and
Rudy Raymond},
title = {Unbounded-error quantum query complexity},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4619--4628},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.043},
doi = {10.1016/J.TCS.2011.04.043},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/MontanaroNR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MontiS11,
author = {Angelo Monti and
Blerina Sinaimeri},
title = {Rainbow graph splitting},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5315--5324},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.004},
doi = {10.1016/J.TCS.2011.06.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MontiS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Morita11,
author = {Kenichi Morita},
title = {Simulating reversible Turing machines and cyclic tag systems by one-dimensional
reversible cellular automata},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {30},
pages = {3856--3865},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.022},
doi = {10.1016/J.TCS.2011.02.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Morita11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Moura11,
author = {Ana Moura},
title = {The word problem for omega-terms over {DA}},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {46},
pages = {6556--6569},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.003},
doi = {10.1016/J.TCS.2011.08.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Moura11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MurataM11,
author = {Atsushi Murata and
Akira Matsubayashi},
title = {Minimum energy broadcast on rectangular grid wireless networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5167--5175},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.024},
doi = {10.1016/J.TCS.2011.05.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MurataM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Nagamochi11,
author = {Hiroshi Nagamochi},
title = {Cop-robber guarding game with cycle robber-region},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {383--390},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.04.014},
doi = {10.1016/J.TCS.2010.04.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Nagamochi11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NagyS11,
author = {Benedek Nagy and
Robin Strand},
title = {Approximating Euclidean circles by neighbourhood sequences in a hexagonal
grid},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {15},
pages = {1364--1377},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.028},
doi = {10.1016/J.TCS.2010.10.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NagyS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NakazawaTKN11,
author = {Koji Nakazawa and
Makoto Tatsuta and
Yukiyoshi Kameyama and
Hiroshi Nakano},
title = {Type checking and typability in domain-free lambda calculi},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {44},
pages = {6193--6207},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.020},
doi = {10.1016/J.TCS.2011.06.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NakazawaTKN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NaldiRTC11,
author = {Aur{\'{e}}lien Naldi and
Elisabeth Remy and
Denis Thieffry and
Claudine Chaouiya},
title = {Dynamically consistent reduction of logical regulatory graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {21},
pages = {2207--2218},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.021},
doi = {10.1016/J.TCS.2010.10.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NaldiRTC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NamKL11,
author = {Wonhong Nam and
Hyunyoung Kil and
Dongwon Lee},
title = {On the computational complexity of behavioral description-based web
service composition},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6736--6749},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.020},
doi = {10.1016/J.TCS.2011.04.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NamKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NarangS11,
author = {Ankur Narang and
Rudrapatna K. Shyamasundar},
title = {Performance driven distributed scheduling of parallel hybrid computations},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4212--4225},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.044},
doi = {10.1016/J.TCS.2010.11.044},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NarangS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NauroisM11,
author = {Paulin Jacob{\'{e}} de Naurois and
Virgile Mogbil},
title = {Correctness of linear logic proof structures is NL-complete},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {20},
pages = {1941--1957},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.020},
doi = {10.1016/J.TCS.2010.12.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NauroisM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NguyenPS11,
author = {Hung Son Nguyen and
Sankar K. Pal and
Andrzej Skowron},
title = {Rough sets and fuzzy sets in natural computing},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {42},
pages = {5816--5819},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.036},
doi = {10.1016/J.TCS.2011.05.036},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/NguyenPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NicholsU11,
author = {Warren D. Nichols and
Robert G. Underwood},
title = {Algebraic Myhill-Nerode Theorems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {448--457},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.016},
doi = {10.1016/J.TCS.2010.10.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NicholsU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NikoletseasRS11,
author = {Sotiris E. Nikoletseas and
Christoforos L. Raptopoulos and
Paul G. Spirakis},
title = {On the independence number and Hamiltonicity of uniform random intersection
graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6750--6760},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.003},
doi = {10.1016/J.TCS.2011.09.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NikoletseasRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Nutov11,
author = {Zeev Nutov},
title = {Approximating directed weighted-degree constrained networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {901--912},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.043},
doi = {10.1016/J.TCS.2010.11.043},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Nutov11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OkazakiOSY11,
author = {Ryotaro Okazaki and
Hirotaka Ono and
Taizo Sadahiro and
Masafumi Yamashita},
title = {Broadcastings and digit tilings on three-dimensional torus networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {307--319},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.028},
doi = {10.1016/J.TCS.2010.09.028},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/OkazakiOSY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Okhotin11,
author = {Alexander Okhotin},
title = {A simple P-complete problem and its language-theoretic representations},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {68--82},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.015},
doi = {10.1016/J.TCS.2010.09.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Okhotin11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Okhotin11a,
author = {Alexander Okhotin},
title = {Expressive power of LL(k) Boolean grammars},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5132--5155},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.013},
doi = {10.1016/J.TCS.2011.05.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Okhotin11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OllingerR11,
author = {Nicolas Ollinger and
Ga{\'{e}}tan Richard},
title = {Four states are enough!},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {22--32},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.018},
doi = {10.1016/J.TCS.2010.08.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/OllingerR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OrensteinR11,
author = {Yaron Orenstein and
Dana Ron},
title = {Testing Eulerianity and connectivity in directed sparse graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6390--6408},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.038},
doi = {10.1016/J.TCS.2011.06.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/OrensteinR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OuangraouaGHC11,
author = {A{\"{\i}}da Ouangraoua and
Valentin Guignon and
Sylvie Hamel and
C{\'{e}}dric Chauve},
title = {A new algorithm for aligning nested arc-annotated sequences under
arbitrary weight schemes},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {753--764},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.020},
doi = {10.1016/J.TCS.2010.11.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/OuangraouaGHC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PaoliniPR11,
author = {Luca Paolini and
Elaine Pimentel and
Simona Ronchi Della Rocca},
title = {Strong normalization from an unusual point of view},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {20},
pages = {1903--1915},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.018},
doi = {10.1016/J.TCS.2010.12.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PaoliniPR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PaquinR11,
author = {Genevi{\`{e}}ve Paquin and
Christophe Reutenauer},
title = {On the superimposition of Christoffel words},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {402--418},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.007},
doi = {10.1016/J.TCS.2010.10.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PaquinR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PardubskaPO11,
author = {Dana Pardubsk{\'{a}} and
Martin Pl{\'{a}}tek and
Friedrich Otto},
title = {Parallel communicating grammar systems with regular control and skeleton
preserving {FRR} automata},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {458--477},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.017},
doi = {10.1016/J.TCS.2010.10.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PardubskaPO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ParkI11,
author = {Jung{-}Heum Park and
Insung Ihm},
title = {Strong matching preclusion},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6409--6419},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.008},
doi = {10.1016/J.TCS.2011.08.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ParkI11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PatitzS11,
author = {Matthew J. Patitz and
Scott M. Summers},
title = {Self-assembly of infinite structures: {A} survey},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {159--165},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.015},
doi = {10.1016/J.TCS.2010.08.015},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/PatitzS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Patt-ShamirR11,
author = {Boaz Patt{-}Shamir and
Dror Rawitz},
title = {Video distribution under multiple constraints},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3717--3730},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.031},
doi = {10.1016/J.TCS.2011.03.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Patt-ShamirR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PaulusmaR11,
author = {Dani{\"{e}}l Paulusma and
Johan M. M. van Rooij},
title = {On partitioning a graph into two connected subgraphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6761--6769},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.001},
doi = {10.1016/J.TCS.2011.09.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PaulusmaR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PebayRT11,
author = {Philippe P. P{\'{e}}bay and
J. Maurice Rojas and
David C. Thompson},
title = {Optimizing n-variate (n+k)-nomials for small k},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {16},
pages = {1457--1469},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.053},
doi = {10.1016/J.TCS.2010.11.053},
timestamp = {Sat, 31 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/PebayRT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Perrucci11,
author = {Daniel Perrucci},
title = {Linear solving for sign determination},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4715--4720},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.006},
doi = {10.1016/J.TCS.2011.05.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Perrucci11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Pivato11,
author = {Marcus Pivato},
title = {Positive expansiveness versus network dimension in symbolic dynamical
systems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {30},
pages = {3838--3855},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.021},
doi = {10.1016/J.TCS.2011.02.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Pivato11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Pizzi11,
author = {Nick J. Pizzi},
title = {Fuzzy quartile encoding as a preprocessing method for biomedical pattern
classification},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {42},
pages = {5909--5925},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.043},
doi = {10.1016/J.TCS.2011.05.043},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Pizzi11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PonsL11,
author = {Pascal Pons and
Matthieu Latapy},
title = {Post-processing hierarchical community structures: Quality improvements
and multi-scale view},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {892--900},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.041},
doi = {10.1016/J.TCS.2010.11.041},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PonsL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PralatW11,
author = {Pawel Pralat and
Changping Wang},
title = {An edge deletion model for complex networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5111--5120},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.016},
doi = {10.1016/J.TCS.2011.05.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PralatW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Provencal11,
author = {Xavier Proven{\c{c}}al},
title = {Minimal non-convex words},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {27},
pages = {3002--3009},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.06.025},
doi = {10.1016/J.TCS.2010.06.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Provencal11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Puente11,
author = {V{\'{\i}}ctor Lav{\'{\i}}n Puente},
title = {On learning multivalued dependencies with queries},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2331--2339},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.011},
doi = {10.1016/J.TCS.2011.01.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Puente11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RajsbaumU11,
author = {Sergio Rajsbaum and
Jorge Urrutia},
title = {Some problems in distributed computational geometry},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5760--5770},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.035},
doi = {10.1016/J.TCS.2011.06.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RajsbaumU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RamannaMP11,
author = {Sheela Ramanna and
Amir H. Meghdadi and
James F. Peters},
title = {Nature-inspired framework for measuring visual image resemblance:
{A} near rough set approach},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {42},
pages = {5926--5938},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.044},
doi = {10.1016/J.TCS.2011.05.044},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RamannaMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rao11,
author = {Micha{\"{e}}l Rao},
title = {Last cases of Dejean's conjecture},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {27},
pages = {3010--3018},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.06.020},
doi = {10.1016/J.TCS.2010.06.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rao11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ReidenbachS11,
author = {Daniel Reidenbach and
Johannes C. Schneider},
title = {Restricted ambiguity of erasing morphisms},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3510--3523},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.041},
doi = {10.1016/J.TCS.2011.02.041},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ReidenbachS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ReifSY11,
author = {John H. Reif and
Sudheer Sahu and
Peng Yin},
title = {Complexity of graph self-assembly in accretive systems and self-destructible
systems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {17},
pages = {1592--1605},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.034},
doi = {10.1016/J.TCS.2010.10.034},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ReifSY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RenZ11,
author = {Wei Ren and
Qing Zhao},
title = {A note on 'Algorithms for connected set cover problem and fault-tolerant
connected set cover problem'},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6451--6454},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.008},
doi = {10.1016/J.TCS.2011.07.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RenZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RestivoR11,
author = {Antonio Restivo and
Giovanna Rosone},
title = {Balancing and clustering of words in the Burrows-Wheeler transform},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {27},
pages = {3019--3032},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.040},
doi = {10.1016/J.TCS.2010.11.040},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RestivoR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RichommeS11,
author = {Gw{\'{e}}na{\"{e}}l Richomme and
Patrice S{\'{e}}{\'{e}}bold},
title = {On factorially balanced sets of words},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5492--5497},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.027},
doi = {10.1016/J.TCS.2011.06.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RichommeS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RizkBFS11,
author = {Aur{\'{e}}lien Rizk and
Gr{\'{e}}gory Batt and
Fran{\c{c}}ois Fages and
Sylvain Soliman},
title = {Continuous valuations of temporal logic specifications with applications
to parameter optimization and robustness measures},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {26},
pages = {2827--2839},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.05.008},
doi = {10.1016/J.TCS.2010.05.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RizkBFS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RobinsonS11,
author = {Peter Robinson and
Ulrich Schmid},
title = {The Asynchronous Bounded-Cycle model},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {40},
pages = {5580--5601},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.001},
doi = {10.1016/J.TCS.2010.08.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RobinsonS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RochaMD11,
author = {Camilo Rocha and
C{\'{e}}sar A. Mu{\~{n}}oz and
Gilles Dowek},
title = {A formal library of set relations and its application to synchronous
languages},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {37},
pages = {4853--4866},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.027},
doi = {10.1016/J.TCS.2011.01.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RochaMD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RodenburgKKV11,
author = {Piet Rodenburg and
Jan Willem Klop and
Karst Koymans and
Jos L. M. Vrancken},
title = {The free process algebra generated by {\(\delta\)}, {\unicode{1013}}
and {\(\tau\)}},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3370--3377},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.019},
doi = {10.1016/J.TCS.2011.03.019},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/RodenburgKKV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rosa-VelardoF11,
author = {Fernando Rosa{-}Velardo and
David de Frutos{-}Escrig},
title = {Decidability and complexity of Petri nets with unordered data},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {34},
pages = {4439--4451},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.007},
doi = {10.1016/J.TCS.2011.05.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rosa-VelardoF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RouquierRT11,
author = {Jean{-}Baptiste Rouquier and
Damien Regnault and
Eric Thierry},
title = {Stochastic minority on graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {30},
pages = {3947--3963},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.028},
doi = {10.1016/J.TCS.2011.02.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RouquierRT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rozenberg11,
author = {Grzegorz Rozenberg},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {6},
pages = {499},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.001},
doi = {10.1016/J.TCS.2011.01.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rozenberg11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rozenberg11a,
author = {Grzegorz Rozenberg},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {17},
pages = {1545},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.032},
doi = {10.1016/J.TCS.2011.02.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rozenberg11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rozenberg11b,
author = {Grzegorz Rozenberg},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {21},
pages = {2093},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.010},
doi = {10.1016/J.TCS.2011.03.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rozenberg11b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rozenberg11c,
author = {Grzegorz Rozenberg},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {26},
pages = {2797},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.031},
doi = {10.1016/J.TCS.2011.04.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rozenberg11c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rozenberg11d,
author = {Grzegorz Rozenberg},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {30},
pages = {3797},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.026},
doi = {10.1016/J.TCS.2011.05.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rozenberg11d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rozenberg11e,
author = {Grzegorz Rozenberg},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {42},
pages = {5815},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.019},
doi = {10.1016/J.TCS.2011.08.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rozenberg11e.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rozenberg11f,
author = {Grzegorz Rozenberg},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {43},
pages = {5975},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.032},
doi = {10.1016/J.TCS.2011.08.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rozenberg11f.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rozenberg11g,
author = {Grzegorz Rozenberg},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {51},
pages = {7067},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.10.008},
doi = {10.1016/J.TCS.2011.10.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rozenberg11g.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SaFMF11,
author = {Vin{\'{\i}}cius G. P. de S{\'{a}} and
Guilherme Dias da Fonseca and
Raphael C. S. Machado and
Celina M. H. de Figueiredo},
title = {Complexity dichotomy on partial grid recognition},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2370--2379},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.018},
doi = {10.1016/J.TCS.2011.01.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SaFMF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SagolsM11,
author = {Feliu Sagols and
Ra{\'{u}}l Mar{\'{\i}}n},
title = {Two discrete versions of the Inscribed Square Conjecture and some
related problems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {15},
pages = {1301--1312},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.004},
doi = {10.1016/J.TCS.2010.10.004},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/SagolsM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SalvySSSV11,
author = {Bruno Salvy and
Bob Sedgewick and
Mich{\`{e}}le Soria and
Wojciech Szpankowski and
Brigitte Vall{\'{e}}e},
title = {Philippe Flajolet, the Father of Analytic Combinatorics},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4469--4470},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.048},
doi = {10.1016/J.TCS.2011.05.048},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SalvySSSV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SantisFM11,
author = {Alfredo De Santis and
Anna Lisa Ferrara and
Barbara Masucci},
title = {Efficient provably-secure hierarchical key assignment schemes},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5684--5699},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.024},
doi = {10.1016/J.TCS.2011.06.024},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/SantisFM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Santo11,
author = {Jos{\'{e}} Esp{\'{\i}}rito Santo},
title = {A note on preservation of strong normalisation in the {\(\lambda\)}-calculus},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {11},
pages = {1027--1032},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.049},
doi = {10.1016/J.TCS.2010.10.049},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Santo11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SarmaLN11,
author = {Atish Das Sarma and
Richard J. Lipton and
Danupon Nanongkai},
title = {Best-order streaming model},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {23},
pages = {2544--2555},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.046},
doi = {10.1016/J.TCS.2010.10.046},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SarmaLN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SasturkarYSR11,
author = {Amit Sasturkar and
Ping Yang and
Scott D. Stoller and
C. R. Ramakrishnan},
title = {Policy analysis for Administrative Role-Based Access Control},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {44},
pages = {6208--6234},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.009},
doi = {10.1016/J.TCS.2011.05.009},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/SasturkarYSR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SchneiderW11,
author = {Johannes Schneider and
Roger Wattenhofer},
title = {Bounds on contention management algorithms},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4151--4160},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.010},
doi = {10.1016/J.TCS.2010.10.010},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SchneiderW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SchwarickT11,
author = {Martin Schwarick and
Alexej Tovchigrechko},
title = {IDD-based model validation of biochemical networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {26},
pages = {2884--2908},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.06.030},
doi = {10.1016/J.TCS.2010.06.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SchwarickT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Seldin11,
author = {Jonathan P. Seldin},
title = {The search for a reduction in combinatory logic equivalent to {\(\lambda\)}{\(\beta\)}-reduction},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {37},
pages = {4905--4918},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.002},
doi = {10.1016/J.TCS.2011.02.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Seldin11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SevastyanovLH11,
author = {Sergey Sevastyanov and
Bertrand M. T. Lin and
Hsiao{-}Lan Huang},
title = {Tight complexity analysis of the relocation problem with arbitrary
release dates},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4536--4544},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.034},
doi = {10.1016/J.TCS.2011.04.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SevastyanovLH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShihK11,
author = {Yuan{-}Kang Shih and
Shin{-}Shin Kao},
title = {One-to-one disjoint path covers on k-ary n-cubes},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4513--4530},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.035},
doi = {10.1016/J.TCS.2011.04.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ShihK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShiloniAK11,
author = {Asaf Shiloni and
Noa Agmon and
Gal A. Kaminka},
title = {Of robot ants and elephants: {A} computational comparison},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5771--5788},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.026},
doi = {10.1016/J.TCS.2011.06.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ShiloniAK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Shin11,
author = {Sujin Shin},
title = {Pseudo-cyclic renewal systems},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5387--5399},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.007},
doi = {10.1016/J.TCS.2011.06.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Shin11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShoaranT11,
author = {Maryam Shoaran and
Alex Thomo},
title = {Evolving schemas for streaming {XML}},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4545--4557},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.037},
doi = {10.1016/J.TCS.2011.04.037},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ShoaranT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SkowronW11,
author = {Andrzej Skowron and
Piotr Wasilewski},
title = {Information systems in modeling interactive computations on granules},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {42},
pages = {5939--5959},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.045},
doi = {10.1016/J.TCS.2011.05.045},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SkowronW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sokolova11,
author = {Ana Sokolova},
title = {Probabilistic systems coalgebraically: {A} survey},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {38},
pages = {5095--5110},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.008},
doi = {10.1016/J.TCS.2011.05.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Sokolova11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SoloveichikW11,
author = {David Soloveichik and
Erik Winfree},
title = {Erratum to "The computational power of Benenson automata" [Theoret.
Comput. Sci. 344 {(2005)} 279-297]},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {43},
pages = {6112--6113},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.044},
doi = {10.1016/J.TCS.2011.04.044},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SoloveichikW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SouissiIW11,
author = {Samia Souissi and
Taisuke Izumi and
Koichi Wada},
title = {Oracle-based flocking of mobile robots in crash-recovery model},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {33},
pages = {4350--4360},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.011},
doi = {10.1016/J.TCS.2010.11.011},
timestamp = {Fri, 19 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SouissiIW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Starosta11,
author = {Step{\'{a}}n Starosta},
title = {On theta-palindromic richness},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1111--1121},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.011},
doi = {10.1016/J.TCS.2010.12.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Starosta11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Steinberg11,
author = {Benjamin Steinberg},
title = {The {\v{C}}ern{\'{y}} conjecture for one-cluster automata with
prime length cycle},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5487--5491},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.012},
doi = {10.1016/J.TCS.2011.06.012},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Steinberg11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/StellW11,
author = {John G. Stell and
Michael F. Worboys},
title = {Relations between adjacency trees},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {34},
pages = {4452--4468},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.029},
doi = {10.1016/J.TCS.2011.04.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/StellW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/StrandNB11,
author = {Robin Strand and
Benedek Nagy and
Gunilla Borgefors},
title = {Digital distance functions on three-dimensional grids},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {15},
pages = {1350--1363},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.027},
doi = {10.1016/J.TCS.2010.10.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/StrandNB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SuLF11,
author = {Shenghui Su and
Shuwang L{\"{u}} and
Xiubin Fan},
title = {Asymptotic granularity reduction and its application},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5374--5386},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.008},
doi = {10.1016/J.TCS.2011.06.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SuLF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sun11,
author = {Xiaoming Sun},
title = {An improved lower bound on the sensitivity complexity of graph properties},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3524--3529},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.042},
doi = {10.1016/J.TCS.2011.02.042},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Sun11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sutner11,
author = {Klaus Sutner},
title = {Computational processes, observers and Turing incompleteness},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {183--190},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.004},
doi = {10.1016/J.TCS.2010.09.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Sutner11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SzczukaS11,
author = {Marcin S. Szczuka and
Dominik Slezak},
title = {Feedforward neural networks for compound signals},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {42},
pages = {5960--5973},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.046},
doi = {10.1016/J.TCS.2011.05.046},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SzczukaS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TajineD11,
author = {Mohamed Tajine and
Alain Daurat},
title = {Patterns for multigrid equidistributed functions: Application to general
parabolas and length estimation},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {36},
pages = {4824--4840},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.010},
doi = {10.1016/J.TCS.2011.02.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TajineD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TanLWHL11,
author = {Haisheng Tan and
Tiancheng Lou and
Yuexuan Wang and
Qiang{-}Sheng Hua and
Francis C. M. Lau},
title = {Exact algorithms to minimize interference in wireless sensor networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {6913--6925},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.041},
doi = {10.1016/J.TCS.2011.08.041},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TanLWHL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TanZ11,
author = {Zhiyi Tan and
An Zhang},
title = {Online hierarchical scheduling: An approach using mathematical programming},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {3},
pages = {246--256},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.08.014},
doi = {10.1016/J.TCS.2009.08.014},
timestamp = {Mon, 16 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TanZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Tang11,
author = {Linqing Tang},
title = {On the derandomization of the graph test for homomorphism over groups},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {18},
pages = {1718--1728},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.046},
doi = {10.1016/J.TCS.2010.12.046},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Tang11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Terui11,
author = {Kazushige Terui},
title = {Computational ludics},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {20},
pages = {2048--2071},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.026},
doi = {10.1016/J.TCS.2010.12.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Terui11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ThibaultSK11,
author = {Yohan Thibault and
Akihiro Sugimoto and
Yukiko Kenmochi},
title = {3D discrete rotations using hinge angles},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {15},
pages = {1378--1391},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.031},
doi = {10.1016/J.TCS.2010.10.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ThibaultSK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ThielenW11,
author = {Clemens Thielen and
Stephan Westphal},
title = {Complexity of the traveling tournament problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {345--351},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.001},
doi = {10.1016/J.TCS.2010.10.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ThielenW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ThomoV11,
author = {Alex Thomo and
Srinivasan Venkatesh},
title = {Rewriting of visibly pushdown languages for {XML} data integration},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5285--5297},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.047},
doi = {10.1016/J.TCS.2011.05.047},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ThomoV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TianCNY11,
author = {Ji Tian and
T. C. Edwin Cheng and
C. T. Ng and
Jinjiang Yuan},
title = {Online scheduling on unbounded parallel-batch machines with incompatible
job families},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2380--2386},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.023},
doi = {10.1016/J.TCS.2011.01.023},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TianCNY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TianD11,
author = {Cong Tian and
Zhenhua Duan},
title = {Expressiveness of propositional projection temporal logic with star},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {18},
pages = {1729--1744},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.047},
doi = {10.1016/J.TCS.2010.12.047},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TianD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TimmisAH11,
author = {Jon Timmis and
Paul S. Andrews and
Andrew Hone},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {6},
pages = {500--501},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.014},
doi = {10.1016/J.TCS.2010.12.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TimmisAH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Tracol11,
author = {Mathieu Tracol},
title = {Recurrence and transience for finite probabilistic tables},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1154--1168},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.038},
doi = {10.1016/J.TCS.2010.12.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Tracol11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Tranquilli11,
author = {Paolo Tranquilli},
title = {Intuitionistic differential nets and lambda-calculus},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {20},
pages = {1979--1997},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.022},
doi = {10.1016/J.TCS.2010.12.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Tranquilli11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TuZ11,
author = {Jianhua Tu and
Wenli Zhou},
title = {A primal-dual approximation algorithm for the vertex cover P\({}_{\mbox{3}}\)
problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {7044--7048},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.013},
doi = {10.1016/J.TCS.2011.09.013},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/TuZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TuckerZ11,
author = {John V. Tucker and
Jeffery I. Zucker},
title = {Continuity of operators on continuous and discrete time streams},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3378--3403},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.012},
doi = {10.1016/J.TCS.2011.04.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TuckerZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TuraevDS11,
author = {Sherzod Turaev and
J{\"{u}}rgen Dassow and
Mohd Hasan Selamat},
title = {Nonterminal complexity of tree controlled grammars},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {41},
pages = {5789--5795},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.033},
doi = {10.1016/J.TCS.2011.06.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TuraevDS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TurauH11,
author = {Volker Turau and
Bernd Hauck},
title = {A fault-containing self-stabilizing {(3} - 2/(Delta+1))-approximation
algorithm for vertex cover in anonymous networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {33},
pages = {4361--4371},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.010},
doi = {10.1016/J.TCS.2010.11.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TurauH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TurauH11a,
author = {Volker Turau and
Bernd Hauck},
title = {A new analysis of a self-stabilizing maximum weight matching algorithm
with approximation ratio 2},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {40},
pages = {5527--5540},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.032},
doi = {10.1016/J.TCS.2010.11.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TurauH11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Turetsky11,
author = {Daniel Turetsky},
title = {Connectedness properties of dimension level sets},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3598--3603},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.03.006},
doi = {10.1016/J.TCS.2011.03.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Turetsky11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/UchizawaTN11,
author = {Kei Uchizawa and
Eiji Takimoto and
Takao Nishizeki},
title = {Size-energy tradeoffs for unate circuits computing symmetric Boolean
functions},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {773--782},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.022},
doi = {10.1016/J.TCS.2010.11.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/UchizawaTN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Visser11,
author = {Albert Visser},
title = {On the ambiguation of Polish notation},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {28},
pages = {3404--3411},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.025},
doi = {10.1016/J.TCS.2011.01.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Visser11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/VladimerouPVD11,
author = {Vladimeros Vladimerou and
Pavithra Prabhakar and
Mahesh Viswanathan and
Geir E. Dullerud},
title = {Specifications for decidable hybrid games},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6770--6785},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.036},
doi = {10.1016/J.TCS.2011.08.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/VladimerouPVD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WangCC11,
author = {Haitao Wang and
Amitabh Chaudhary and
Danny Z. Chen},
title = {Online rectangle filling},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5247--5275},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.033},
doi = {10.1016/J.TCS.2011.05.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WangCC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WangDCXLSS11,
author = {Feng Wang and
David Hongwei Du and
Erika Camacho and
Kuai Xu and
Wonjun Lee and
Yan Shi and
Shan Shan},
title = {On positive influence dominating sets in social networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {3},
pages = {265--269},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.10.001},
doi = {10.1016/J.TCS.2009.10.001},
timestamp = {Fri, 12 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/WangDCXLSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WangFC11,
author = {Jianxin Wang and
Qilong Feng and
Jianer Chen},
title = {An O\({}^{\mbox{*}}\)(3.53\({}^{\mbox{3k}}\))-time parameterized algorithm
for the 3-set packing problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {18},
pages = {1745--1753},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.048},
doi = {10.1016/J.TCS.2010.12.048},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WangFC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WangYZ11,
author = {Weifan Wang and
Xubin Yue and
Xuding Zhu},
title = {The surviving rate of an outerplanar graph for the firefighter problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {913--921},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.046},
doi = {10.1016/J.TCS.2010.11.046},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WangYZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WangZ11,
author = {Shiying Wang and
Shurong Zhang},
title = {Embedding hamiltonian paths in k-ary n-cubes with conditional edge
faults},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {46},
pages = {6570--6584},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.030},
doi = {10.1016/J.TCS.2011.02.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WangZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Weller11,
author = {Daniel Weller},
title = {On the elimination of quantifier-free cuts},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {49},
pages = {6843--6854},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.035},
doi = {10.1016/J.TCS.2011.08.035},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Weller11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WoodsNS11,
author = {Damien Woods and
Turlough Neary and
Anthony Karel Seda},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {1-2},
pages = {1},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.013},
doi = {10.1016/J.TCS.2010.10.013},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/WoodsNS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Woryna11,
author = {Adam Woryna},
title = {The concept of duality for automata over a changing alphabet and generation
of a free group by such automata},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6420--6431},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.017},
doi = {10.1016/J.TCS.2011.08.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Woryna11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WuCPW11,
author = {Ro{-}Yu Wu and
Jou{-}Ming Chang and
Kung{-}Jui Pai and
Yue{-}Li Wang},
title = {Amortized efficiency of generating planar paths in convex position},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4504--4512},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.017},
doi = {10.1016/J.TCS.2011.04.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WuCPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WuLC11,
author = {Weiwei Wu and
Minming Li and
Enhong Chen},
title = {Min-energy scheduling for aligned jobs in accelerate model},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1122--1139},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.013},
doi = {10.1016/J.TCS.2010.12.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WuLC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/XiaZ11,
author = {Ge Xia and
Yong Zhang},
title = {On the small cycle transversal of planar graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {29},
pages = {3501--3509},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.02.040},
doi = {10.1016/J.TCS.2011.02.040},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/XiaZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/XieFZ11,
author = {Xie Xie and
Jiu{-}Lun Fan and
Yin Zhu},
title = {The optimal All-Partial-Sums algorithm in commutative semigroups and
its applications for image thresholding segmentation},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {15},
pages = {1419--1433},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.039},
doi = {10.1016/J.TCS.2010.11.039},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/XieFZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/XuZZ11,
author = {Yinfeng Xu and
Wenming Zhang and
Feifeng Zheng},
title = {Optimal algorithms for the online time series search problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {3},
pages = {192--197},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.09.026},
doi = {10.1016/J.TCS.2009.09.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/XuZZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Yamakami11,
author = {Tomoyuki Yamakami},
title = {Immunity and pseudorandomness of context-free languages},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6432--6450},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.013},
doi = {10.1016/J.TCS.2011.07.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Yamakami11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Yang11,
author = {Boting Yang},
title = {Fast edge searching and fast searching on graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1208--1219},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.065},
doi = {10.1016/J.TCS.2010.12.065},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Yang11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YangDYC11,
author = {Xiaofan Yang and
Qiang Dong and
Erjie Yang and
Jianqiu Cao},
title = {Hamiltonian properties of twisted hypercube-like networks with more
faulty elements},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2409--2417},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.034},
doi = {10.1016/J.TCS.2011.01.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YangDYC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YangL11,
author = {Chaoxia Yang and
Guojun Li},
title = {A polynomial time approximation scheme for embedding hypergraph in
a weighted cycle},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6786--6793},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.014},
doi = {10.1016/J.TCS.2011.08.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YangL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YangT11,
author = {Guomin Yang and
Chik How Tan},
title = {Certificateless public key encryption: {A} new generic construction
and two pairing-free schemes},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {662--674},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.025},
doi = {10.1016/J.TCS.2010.10.025},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/YangT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YangT11a,
author = {Guomin Yang and
Chik How Tan},
title = {Certificateless cryptography with {KGC} trust level 3},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5446--5457},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.015},
doi = {10.1016/J.TCS.2011.06.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YangT11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YangXHSP11,
author = {Guowu Yang and
Fei Xie and
William N. N. Hung and
Xiaoyu Song and
Marek A. Perkowski},
title = {Realization and synthesis of reversible functions},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {17},
pages = {1606--1613},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.031},
doi = {10.1016/J.TCS.2010.11.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YangXHSP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YeHZ11,
author = {Deshi Ye and
Xin Han and
Guochuan Zhang},
title = {Online multiple-strip packing},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {3},
pages = {233--239},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.09.029},
doi = {10.1016/J.TCS.2009.09.029},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YeHZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Yoshinaka11,
author = {Ryo Yoshinaka},
title = {Efficient learning of multiple context-free languages with multidimensional
substitutability from positive data},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {19},
pages = {1821--1831},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.058},
doi = {10.1016/J.TCS.2010.12.058},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Yoshinaka11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Zhang11,
author = {Li Zhang},
title = {Proportional response dynamics in the Fisher market},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {24},
pages = {2691--2698},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.06.021},
doi = {10.1016/J.TCS.2010.06.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Zhang11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangB11,
author = {Jinshan Zhang and
Fengshan Bai},
title = {An improved fully polynomial randomized approximation scheme {(FPRAS)}
for counting the number of Hamiltonian cycles in dense digraphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {4-5},
pages = {419--429},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.014},
doi = {10.1016/J.TCS.2010.10.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZhangB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangC11,
author = {Zhongzhi Zhang and
Francesc Comellas},
title = {Farey graphs as models for complex networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {865--875},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.036},
doi = {10.1016/J.TCS.2010.11.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZhangC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangL11,
author = {Wen{-}Qi Zhang and
Yong{-}Jin Liu},
title = {Approximating the longest paths in grid graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5340--5350},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.010},
doi = {10.1016/J.TCS.2011.06.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZhangL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhaoKS11,
author = {Yancai Zhao and
Liying Kang and
Moo Young Sohn},
title = {The algorithmic complexity of mixed domination in graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2387--2392},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.029},
doi = {10.1016/J.TCS.2011.01.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZhaoKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZouWXLDWW11,
author = {Feng Zou and
Yuexuan Wang and
XiaoHua Xu and
Xianyue Li and
Hongwei Du and
Peng{-}Jun Wan and
Weili Wu},
title = {New approximations for minimum-weighted dominating sets and minimum-weighted
connected dominating sets on unit disk graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {3},
pages = {198--208},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.06.022},
doi = {10.1016/J.TCS.2009.06.022},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZouWXLDWW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Zuylen11,
author = {Anke van Zuylen},
title = {Linear programming based approximation algorithms for feedback set
problems in bipartite tournaments},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {23},
pages = {2556--2561},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.10.047},
doi = {10.1016/J.TCS.2010.10.047},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Zuylen11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-04-25 15:55 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:
