Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs429.bht:"
@article{DBLP:journals/tcs/AusielloHKPS12, author = {Giorgio Ausiello and Hendrik Jan Hoogeboom and Juhani Karhum{\"{a}}ki and Ion Petre and Arto Salomaa}, title = {Preface}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {1--20}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.019}, doi = {10.1016/J.TCS.2011.12.019}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/AusielloHKPS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BeekK12, author = {Maurice H. ter Beek and Jetty Kleijn}, title = {Vector team automata}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {21--29}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.020}, doi = {10.1016/J.TCS.2011.12.020}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BeekK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BodlaenderH12, author = {Hans L. Bodlaender and Jurriaan Hage}, title = {On switching classes, NLC-width, cliquewidth and treewidth}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {30--35}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.021}, doi = {10.1016/J.TCS.2011.12.021}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BodlaenderH12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BonizzoniVD12, author = {Paola Bonizzoni and Gianluca Della Vedova and Riccardo Dondi}, title = {A randomized {PTAS} for the minimum Consensus Clustering with a fixed number of clusters}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {36--45}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.022}, doi = {10.1016/J.TCS.2011.12.022}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BonizzoniVD12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BrijderGB12, author = {Robert Brijder and Joris J. M. Gillis and Jan Van den Bussche}, title = {A comparison of graph-theoretic {DNA} hybridization models}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {46--53}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.023}, doi = {10.1016/J.TCS.2011.12.023}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BrijderGB12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DaleyJKM12, author = {Mark Daley and Helmut J{\"{u}}rgensen and Lila Kari and Kalpana Mahalingam}, title = {Relativized codes}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {54--64}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.024}, doi = {10.1016/J.TCS.2011.12.024}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DaleyJKM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DiekertK12, author = {Volker Diekert and Steffen Kopecki}, title = {Language theoretical properties of hairpin formations}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {65--73}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.025}, doi = {10.1016/J.TCS.2011.12.025}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DiekertK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FriscoGL12, author = {Pierluigi Frisco and Gordon Govan and Alberto Leporati}, title = {Asynchronous {P} systems with active membranes}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {74--86}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.026}, doi = {10.1016/J.TCS.2011.12.026}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/FriscoGL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GabrielE12, author = {Karsten Gabriel and Hartmut Ehrig}, title = {Modelling evolution of communication platforms and scenarios based on transformations of high-level nets and processes}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {87--97}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.027}, doi = {10.1016/J.TCS.2011.12.027}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GabrielE12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GaoKY12, author = {Yuan Gao and Lila Kari and Sheng Yu}, title = {State complexity of union and intersection of star on k regular languages}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {98--107}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.028}, doi = {10.1016/J.TCS.2011.12.028}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GaoKY12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GenovaJ12, author = {Daniela Genova and Natasa Jonoska}, title = {Forbidding and enforcing on graphs}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {108--117}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.029}, doi = {10.1016/J.TCS.2011.12.029}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GenovaJ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HarelK12, author = {David Harel and Amir Kantor}, title = {Multi-modal scenarios revisited: {A} net-based representation}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {118--127}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.030}, doi = {10.1016/J.TCS.2011.12.030}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/HarelK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Harju12, author = {Tero Harju}, title = {Square-free words obtained from prefixes by permutations}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {128--133}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.031}, doi = {10.1016/J.TCS.2011.12.031}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Harju12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Hirvensalo12, author = {Mika Hirvensalo}, title = {On probabilistic and quantum reaction systems}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {134--143}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.032}, doi = {10.1016/J.TCS.2011.12.032}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Hirvensalo12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HosodaHIOSW12, author = {Jun Hosoda and Juraj Hromkovic and Taisuke Izumi and Hirotaka Ono and Monika Steinov{\'{a}} and Koichi Wada}, title = {On the approximability and hardness of minimum topic connected overlay and its special instances}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {144--154}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.033}, doi = {10.1016/J.TCS.2011.12.033}, timestamp = {Fri, 19 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/HosodaHIOSW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/IbarraY12, author = {Oscar H. Ibarra and Hsu{-}Chun Yen}, title = {On the containment and equivalence problems for two-way transducers}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {155--163}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.034}, doi = {10.1016/J.TCS.2011.12.034}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/IbarraY12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Ito12, author = {Masami Ito}, title = {Algebraic structures of automata}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {164--168}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.035}, doi = {10.1016/J.TCS.2011.12.035}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Ito12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/JensenKM12, author = {Kurt Jensen and Lars Michael Kristensen and Thomas Mailund}, title = {The sweep-line state space exploration method}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {169--179}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.036}, doi = {10.1016/J.TCS.2011.12.036}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/JensenKM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Kari12, author = {Jarkko Kari}, title = {Universal pattern generation by cellular automata}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {180--184}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.037}, doi = {10.1016/J.TCS.2011.12.037}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Kari12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KleijnK12, author = {Jetty Kleijn and Maciej Koutny}, title = {Localities in systems with a/sync communication}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {185--192}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.038}, doi = {10.1016/J.TCS.2011.12.038}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KleijnK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KreowskiK12, author = {Hans{-}J{\"{o}}rg Kreowski and Sabine Kuske}, title = {Polynomial graph transformability}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {193--201}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.039}, doi = {10.1016/J.TCS.2011.12.039}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KreowskiK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LeeuwenW12, author = {Jan van Leeuwen and Jir{\'{\i}} Wiedermann}, title = {Computation as an unbounded process}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {202--212}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.040}, doi = {10.1016/J.TCS.2011.12.040}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/LeeuwenW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ManzoniVM12, author = {Luca Manzoni and Leonardo Vanneschi and Giancarlo Mauri}, title = {A distance between populations for one-point crossover in genetic algorithms}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {213--221}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.041}, doi = {10.1016/J.TCS.2011.12.041}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ManzoniVM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Maurer12, author = {Hermann A. Maurer}, title = {A linear ordering of a multi-parameter universe is usually nonsense}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {222--226}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.042}, doi = {10.1016/J.TCS.2011.12.042}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Maurer12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Mazurkiewicz12, author = {Antoni W. Mazurkiewicz}, title = {Petri net languages revisited}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {227--235}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.043}, doi = {10.1016/J.TCS.2011.12.043}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Mazurkiewicz12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/NielsenK12, author = {Mogens Nielsen and Karl Krukow}, title = {Transfer of trust in event-based reputation systems}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {236--246}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.044}, doi = {10.1016/J.TCS.2011.12.044}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/NielsenK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/OkuboKY12, author = {Fumiya Okubo and Satoshi Kobayashi and Takashi Yokomori}, title = {Reaction automata}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {247--257}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.045}, doi = {10.1016/J.TCS.2011.12.045}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/OkuboKY12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/PaunP12, author = {Gheorghe Paun and Mario J. P{\'{e}}rez{-}Jim{\'{e}}nez}, title = {Towards bridging two cell-inspired models: {P} systems and {R} systems}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {258--264}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.046}, doi = {10.1016/J.TCS.2011.12.046}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/PaunP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/PerrinR12, author = {Dominique Perrin and Antonio Restivo}, title = {A note on Sturmian words}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {265--272}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.047}, doi = {10.1016/J.TCS.2011.12.047}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/PerrinR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/PiaoS12, author = {Xiaoxue Piao and Kai Salomaa}, title = {State complexity of the concatenation of regular tree languages}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {273--281}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.048}, doi = {10.1016/J.TCS.2011.12.048}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/PiaoS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/RestivoV12, author = {Antonio Restivo and Roberto Vaglica}, title = {A graph theoretic approach to automata minimality}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {282--291}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.049}, doi = {10.1016/J.TCS.2011.12.049}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/RestivoV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ThiagarajanY12, author = {P. S. Thiagarajan and Shaofa Yang}, title = {Modular discrete time approximations of distributed hybrid automata}, journal = {Theor. Comput. Sci.}, volume = {429}, pages = {292--304}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.12.050}, doi = {10.1016/J.TCS.2011.12.050}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ThiagarajanY12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.