Остановите войну!
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 26 matches
- 2009
- Alex A. Aravind, Wim H. Hesselink:
A queue based mutual exclusion algorithm. Acta Informatica 46(1): 73-86 (2009) - José Enrique Armendáriz-Iñigo, José Ramón González de Mendívil, José Ramón Garitagoitia, Francesc D. Muñoz-Escoí:
Correctness proof of a database replication protocol under the perspective of the I/O automaton model. Acta Informatica 46(4): 297-330 (2009) - John Aycock, Angelo Borsotti:
Early action in an Earley parser. Acta Informatica 46(8): 549-559 (2009) - Vince Bárány:
Semi-synchronous transductions. Acta Informatica 46(1): 29-42 (2009) - Rza Bashirov, Fabrice Kordon, Hüseyin Lort:
Exploiting colored Petri nets to decide on permutation admissibility. Acta Informatica 46(1): 43-55 (2009) - Amir M. Ben-Amram:
A complexity tradeoff in ranking-function termination proofs. Acta Informatica 46(1): 57-72 (2009) - Jan A. Bergstra, Cornelis A. Middelburg:
Machine structure oriented control code logic. Acta Informatica 46(5): 375-401 (2009) - Eike Best, Philippe Darondeau:
A decomposition theorem for finite persistent transition systems. Acta Informatica 46(3): 237-254 (2009) - Laura Bozzelli, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
On decidability of LTL model checking for process rewrite systems. Acta Informatica 46(1): 1-28 (2009) - Davide Bresolin, Angelo Montanari, Gabriele Puppis:
A theory of ultimately periodic languages and automata with an application to time granularity. Acta Informatica 46(5): 331-360 (2009) - Achim D. Brucker, Burkhart Wolff:
Semantics, calculi, and analysis for object-oriented specifications. Acta Informatica 46(4): 255-284 (2009) - Cezar Câmpeanu, Nicolae Santean:
On the closure of pattern expressions languages under intersection with regular languages. Acta Informatica 46(3): 193-207 (2009) - Arturo Carpi, Flavio D'Alessandro:
Strongly transitive automata and the Cerný conjecture. Acta Informatica 46(8): 591-607 (2009) - Gabriel Ciobanu, Sergiu Rudeanu:
Final and sequential behaviours of M-automata. Acta Informatica 46(5): 361-374 (2009) - Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
Liveness of a mutex algorithm in a fair process algebra. Acta Informatica 46(3): 209-235 (2009) - Joost Engelfriet:
The time complexity of typechecking tree-walking tree transducers. Acta Informatica 46(2): 139-154 (2009) - Joost Engelfriet, Eric Lilin, Andreas Maletti:
Extended multi bottom-up tree transducers. Acta Informatica 46(8): 561-590 (2009) - Jan Janousek, Borivoj Melichar:
On regular tree languages and deterministic pushdown automata. Acta Informatica 46(7): 533-547 (2009) - Victor Khomenko, Mark Schäfer, Walter Vogler, Ralf Wollowski:
STG decomposition strategies in combination with unfolding. Acta Informatica 46(6): 433-474 (2009) - Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad:
The maximum gain of increasing the number of preemptions in multiprocessor scheduling. Acta Informatica 46(4): 285-295 (2009) - Roland Meyer:
A theory of structural stationarity in the pi -Calculus. Acta Informatica 46(2): 87-137 (2009) - Argimiro Arratia Quesada, Iain A. Stewart:
On the power of deep pushdown stacks. Acta Informatica 46(7): 509-531 (2009) - Zdenek Sawa, Petr Jancar:
Hardness of equivalence checking for composed finite-state systems. Acta Informatica 46(3): 169-191 (2009) - Md. Sumon Shahriar, Jixue Liu:
Preserving key in XML data transformation. Acta Informatica 46(7): 475-507 (2009) - K. Subramani, Hong-Jian Lai, Xiaofeng Gu:
Random walks for selected boolean implication and equivalence problems. Acta Informatica 46(2): 155-168 (2009) - Paolo Zuliani:
Reasoning about faulty quantum programs. Acta Informatica 46(6): 403-432 (2009)
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-05-27 04:43 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