Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRAIRO - Theoretical Informatics and Applications, Volume 45
Volume 45, Number 1, January 2011
- ICTCS 09 Foreword. 1-2
- Davide Ancona, Giovanni Lagorio
:
Idealized coinductive type systems for imperative object-oriented programs. 3-33 - Livio Bioglio:
Enumerated type semantics for the calculus of looping sequences. 35-58 - Giusi Castiglione, Antonio Restivo, Marinella Sciortino:
Hopcroft's algorithm and tree-like automata. 59-75 - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Consensual languages and matching finite-state computations. 77-97 - Diego de Falco, Dario Tamascelli:
An introduction to quantum annealing. 99-116 - Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters:
The compositional construction of Markov processes II. 117-142 - Mariangiola Dezani-Ciancaglini, Paola Giannini, Elena Zucca:
Extending the lambda-calculus with unbind and rebind. 143-162 - Violetta Lonati, Matteo Pradella:
Strategies to scan pictures with automata based on Wang tiles. 163-180
Volume 45, Number 2, April 2011
- Carlos A. J. Martinhon, Fábio Protti:
An improved derandomized approximation algorithm for the max-controlled set problem. 181-196 - J. Andrés Montoya:
On the parameterized complexity of approximate counting. 197-223 - Aleksi Saarela:
Unique decipherability in the additive monoid of sets of numbers. 225-234 - Rafael C. Carrasco, Alexander Sánchez Díaz:
Normalization of edit sequences for text synchronization. 235-248 - Dennis Komm, Richard Královic:
Advice Complexity and Barely Random Algorithms. 249-267
Volume 45, Number 3, July 2011
- Mouhebeddine Berrima, Narjes Ben Rajeb, Véronique Cortier:
Deciding knowledge in security protocols under some e-voting theories. 269-299 - Ashot S. Pahlevanyan:
The Fibonacci automorphism of free Burnside groups. 301-309 - Juhani Karhumäki, Svetlana Puzynina:
Locally catenative sequences and Turtle graphics. 311-330 - Márcia R. Cerioli, Luérbio Faria, Talita O. Ferreira, Fábio Protti:
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation. 331-346 - Dietrich Kuske, Ingmar Meinecke:
Construction of tree automata from regular expressions. 347-370
Volume 45, Number 4, November 2011
- Bruno Salvy, Robert Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
In memoriam: Philippe Flajolet, the father of analytic combinatorics. 371-373
- Juha Honkala:
The cyclicity problem for the images of Q-rational series. 375-381 - Olivier Finkel:
Some problems in automata theory which depend on the models of set theory. 383-397 - Lan Lin, Yixun Lin:
Square-root rule of two-dimensional bandwidth problem. 399-411 - Benedek Nagy, Friedrich Otto:
CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store. 413-448 - Oliver Friedmann:
Recursive algorithm for parity games requires exponential time. 449-457 - Andrzej Szepietowski:
Closure properties of hyper-minimized automata. 459-466
- Stepan Holub:
Corrigendum: On multiperiodic words. 467-469
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.
last updated on 2024-04-22 20:03 CEST 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:
