Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 27 matches
- 2011
- Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters:
The compositional construction of Markov processes II. RAIRO Theor. Informatics Appl. 45(1): 117-142 (2011) - Davide Ancona, Giovanni Lagorio:
Idealized coinductive type systems for imperative object-oriented programs. RAIRO Theor. Informatics Appl. 45(1): 3-33 (2011) - Mouhebeddine Berrima, Narjes Ben Rajeb, Véronique Cortier:
Deciding knowledge in security protocols under some e-voting theories. RAIRO Theor. Informatics Appl. 45(3): 269-299 (2011) - Livio Bioglio:
Enumerated type semantics for the calculus of looping sequences. RAIRO Theor. Informatics Appl. 45(1): 35-58 (2011) - Rafael C. Carrasco, Alexander Sánchez Díaz:
Normalization of edit sequences for text synchronization. RAIRO Theor. Informatics Appl. 45(2): 235-248 (2011) - Giusi Castiglione, Antonio Restivo, Marinella Sciortino:
Hopcroft's algorithm and tree-like automata. RAIRO Theor. Informatics Appl. 45(1): 59-75 (2011) - 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. RAIRO Theor. Informatics Appl. 45(3): 331-346 (2011) - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Consensual languages and matching finite-state computations. RAIRO Theor. Informatics Appl. 45(1): 77-97 (2011) - Mariangiola Dezani-Ciancaglini, Paola Giannini, Elena Zucca:
Extending the lambda-calculus with unbind and rebind. RAIRO Theor. Informatics Appl. 45(1): 143-162 (2011) - Diego de Falco, Dario Tamascelli:
An introduction to quantum annealing. RAIRO Theor. Informatics Appl. 45(1): 99-116 (2011) - Olivier Finkel:
Some problems in automata theory which depend on the models of set theory. RAIRO Theor. Informatics Appl. 45(4): 383-397 (2011) - Oliver Friedmann:
Recursive algorithm for parity games requires exponential time. RAIRO Theor. Informatics Appl. 45(4): 449-457 (2011) - Stepan Holub:
Corrigendum: On multiperiodic words. RAIRO Theor. Informatics Appl. 45(4): 467-469 (2011) - Juha Honkala:
The cyclicity problem for the images of Q-rational series. RAIRO Theor. Informatics Appl. 45(4): 375-381 (2011) - Juhani Karhumäki, Svetlana Puzynina:
Locally catenative sequences and Turtle graphics. RAIRO Theor. Informatics Appl. 45(3): 311-330 (2011) - Dennis Komm, Richard Královic:
Advice Complexity and Barely Random Algorithms. RAIRO Theor. Informatics Appl. 45(2): 249-267 (2011) - Dietrich Kuske, Ingmar Meinecke:
Construction of tree automata from regular expressions. RAIRO Theor. Informatics Appl. 45(3): 347-370 (2011) - Lan Lin, Yixun Lin:
Square-root rule of two-dimensional bandwidth problem. RAIRO Theor. Informatics Appl. 45(4): 399-411 (2011) - Violetta Lonati, Matteo Pradella:
Strategies to scan pictures with automata based on Wang tiles. RAIRO Theor. Informatics Appl. 45(1): 163-180 (2011) - Carlos A. J. Martinhon, Fábio Protti:
An improved derandomized approximation algorithm for the max-controlled set problem. RAIRO Theor. Informatics Appl. 45(2): 181-196 (2011) - J. Andrés Montoya:
On the parameterized complexity of approximate counting. RAIRO Theor. Informatics Appl. 45(2): 197-223 (2011) - Benedek Nagy, Friedrich Otto:
CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store. RAIRO Theor. Informatics Appl. 45(4): 413-448 (2011) - Ashot S. Pahlevanyan:
The Fibonacci automorphism of free Burnside groups. RAIRO Theor. Informatics Appl. 45(3): 301-309 (2011) - Aleksi Saarela:
Unique decipherability in the additive monoid of sets of numbers. RAIRO Theor. Informatics Appl. 45(2): 225-234 (2011) - Bruno Salvy, Robert Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
In memoriam: Philippe Flajolet, the father of analytic combinatorics. RAIRO Theor. Informatics Appl. 45(4): 371-373 (2011) - Andrzej Szepietowski:
Closure properties of hyper-minimized automata. RAIRO Theor. Informatics Appl. 45(4): 459-466 (2011) - ICTCS 09 Foreword. RAIRO Theor. Informatics Appl. 45(1): 1-2 (2011)
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-30 13:02 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