Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/ita/ita45.bht:"
@article{DBLP:journals/ita/AlbasiniSW11, author = {Luisa de Francesco Albasini and Nicoletta Sabadini and Robert F. C. Walters}, title = {The compositional construction of Markov processes {II}}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {1}, pages = {117--142}, year = {2011}, url = {https://doi.org/10.1051/ita/2011015}, doi = {10.1051/ITA/2011015}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/AlbasiniSW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/AnconaL11, author = {Davide Ancona and Giovanni Lagorio}, title = {Idealized coinductive type systems for imperative object-oriented programs}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {1}, pages = {3--33}, year = {2011}, url = {https://doi.org/10.1051/ita/2011009}, doi = {10.1051/ITA/2011009}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/AnconaL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/BerrimaRC11, author = {Mouhebeddine Berrima and Narjes Ben Rajeb and V{\'{e}}ronique Cortier}, title = {Deciding knowledge in security protocols under some e-voting theories}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {3}, pages = {269--299}, year = {2011}, url = {https://doi.org/10.1051/ita/2011119}, doi = {10.1051/ITA/2011119}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/BerrimaRC11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Bioglio11, author = {Livio Bioglio}, title = {Enumerated type semantics for the calculus of looping sequences}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {1}, pages = {35--58}, year = {2011}, url = {https://doi.org/10.1051/ita/2011010}, doi = {10.1051/ITA/2011010}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Bioglio11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/CarrascoD11, author = {Rafael C. Carrasco and Alexander S{\'{a}}nchez D{\'{\i}}az}, title = {Normalization of edit sequences for text synchronization}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {2}, pages = {235--248}, year = {2011}, url = {https://doi.org/10.1051/ita/2011017}, doi = {10.1051/ITA/2011017}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/CarrascoD11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/CastiglioneRS11, author = {Giusi Castiglione and Antonio Restivo and Marinella Sciortino}, title = {Hopcroft's algorithm and tree-like automata}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {1}, pages = {59--75}, year = {2011}, url = {https://doi.org/10.1051/ita/2011011}, doi = {10.1051/ITA/2011011}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/CastiglioneRS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/CerioliFFP11, author = {M{\'{a}}rcia R. Cerioli and Lu{\'{e}}rbio Faria and Talita O. Ferreira and F{\'{a}}bio Protti}, title = {A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {3}, pages = {331--346}, year = {2011}, url = {https://doi.org/10.1051/ita/2011106}, doi = {10.1051/ITA/2011106}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/CerioliFFP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Crespi-ReghizziP11, author = {Stefano Crespi{-}Reghizzi and Pierluigi {San Pietro}}, title = {Consensual languages and matching finite-state computations}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {1}, pages = {77--97}, year = {2011}, url = {https://doi.org/10.1051/ita/2011012}, doi = {10.1051/ITA/2011012}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Crespi-ReghizziP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Dezani-CiancagliniGZ11, author = {Mariangiola Dezani{-}Ciancaglini and Paola Giannini and Elena Zucca}, title = {Extending the lambda-calculus with unbind and rebind}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {1}, pages = {143--162}, year = {2011}, url = {https://doi.org/10.1051/ita/2011008}, doi = {10.1051/ITA/2011008}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Dezani-CiancagliniGZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/FalcoT11, author = {Diego de Falco and Dario Tamascelli}, title = {An introduction to quantum annealing}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {1}, pages = {99--116}, year = {2011}, url = {https://doi.org/10.1051/ita/2011013}, doi = {10.1051/ITA/2011013}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/FalcoT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Finkel11, author = {Olivier Finkel}, title = {Some problems in automata theory which depend on the models of set theory}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {4}, pages = {383--397}, year = {2011}, url = {https://doi.org/10.1051/ita/2011113}, doi = {10.1051/ITA/2011113}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Finkel11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Friedmann11, author = {Oliver Friedmann}, title = {Recursive algorithm for parity games requires exponential time}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {4}, pages = {449--457}, year = {2011}, url = {https://doi.org/10.1051/ita/2011124}, doi = {10.1051/ITA/2011124}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Friedmann11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Holub11, author = {Stepan Holub}, title = {Corrigendum: On multiperiodic words}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {4}, pages = {467--469}, year = {2011}, url = {https://doi.org/10.1051/ita/2011130}, doi = {10.1051/ITA/2011130}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Holub11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Honkala11, author = {Juha Honkala}, title = {The cyclicity problem for the images of Q-rational series}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {4}, pages = {375--381}, year = {2011}, url = {https://doi.org/10.1051/ita/2011111}, doi = {10.1051/ITA/2011111}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Honkala11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/KarhumakiP11, author = {Juhani Karhum{\"{a}}ki and Svetlana Puzynina}, title = {Locally catenative sequences and Turtle graphics}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {3}, pages = {311--330}, year = {2011}, url = {https://doi.org/10.1051/ita/2011104}, doi = {10.1051/ITA/2011104}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/KarhumakiP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/KommK11, author = {Dennis Komm and Richard Kr{\'{a}}lovic}, title = {Advice Complexity and Barely Random Algorithms}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {2}, pages = {249--267}, year = {2011}, url = {https://doi.org/10.1051/ita/2011105}, doi = {10.1051/ITA/2011105}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/KommK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/KuskeM11, author = {Dietrich Kuske and Ingmar Meinecke}, title = {Construction of tree automata from regular expressions}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {3}, pages = {347--370}, year = {2011}, url = {https://doi.org/10.1051/ita/2011107}, doi = {10.1051/ITA/2011107}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/KuskeM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/LinL11, author = {Lan Lin and Yixun Lin}, title = {Square-root rule of two-dimensional bandwidth problem}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {4}, pages = {399--411}, year = {2011}, url = {https://doi.org/10.1051/ita/2011120}, doi = {10.1051/ITA/2011120}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/LinL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/LonatiP11, author = {Violetta Lonati and Matteo Pradella}, title = {Strategies to scan pictures with automata based on Wang tiles}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {1}, pages = {163--180}, year = {2011}, url = {https://doi.org/10.1051/ita/2011016}, doi = {10.1051/ITA/2011016}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ita/LonatiP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/MartinhonP11, author = {Carlos A. J. Martinhon and F{\'{a}}bio Protti}, title = {An improved derandomized approximation algorithm for the max-controlled set problem}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {2}, pages = {181--196}, year = {2011}, url = {https://doi.org/10.1051/ita/2011006}, doi = {10.1051/ITA/2011006}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/MartinhonP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Montoya11, author = {J. Andr{\'{e}}s Montoya}, title = {On the parameterized complexity of approximate counting}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {2}, pages = {197--223}, year = {2011}, url = {https://doi.org/10.1051/ita/2011007}, doi = {10.1051/ITA/2011007}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ita/Montoya11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/NagyO11, author = {Benedek Nagy and Friedrich Otto}, title = {CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {4}, pages = {413--448}, year = {2011}, url = {https://doi.org/10.1051/ita/2011123}, doi = {10.1051/ITA/2011123}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/NagyO11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Pahlevanyan11, author = {Ashot S. Pahlevanyan}, title = {The Fibonacci automorphism of free Burnside groups}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {3}, pages = {301--309}, year = {2011}, url = {https://doi.org/10.1051/ita/2011118}, doi = {10.1051/ITA/2011118}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Pahlevanyan11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Saarela11, author = {Aleksi Saarela}, title = {Unique decipherability in the additive monoid of sets of numbers}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {2}, pages = {225--234}, year = {2011}, url = {https://doi.org/10.1051/ita/2011018}, doi = {10.1051/ITA/2011018}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Saarela11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/SalvySSSV11, author = {Bruno Salvy and Robert Sedgewick and Mich{\`{e}}le Soria and Wojciech Szpankowski and Brigitte Vall{\'{e}}e}, title = {In memoriam: Philippe Flajolet, the father of analytic combinatorics}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {4}, pages = {371--373}, year = {2011}, url = {https://doi.org/10.1051/ita/2011110}, doi = {10.1051/ITA/2011110}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/SalvySSSV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Szepietowski11, author = {Andrzej Szepietowski}, title = {Closure properties of hyper-minimized automata}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {4}, pages = {459--466}, year = {2011}, url = {https://doi.org/10.1051/ita/2011128}, doi = {10.1051/ITA/2011128}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Szepietowski11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/X11, title = {{ICTCS} 09 Foreword}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {45}, number = {1}, pages = {1--2}, year = {2011}, url = {https://doi.org/10.1051/ita/2011014}, doi = {10.1051/ITA/2011014}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/X11.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.