![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 19 matches
- 2011
- Bogdan Aman
, Gabriel Ciobanu
:
Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems. Acta Informatica 48(7-8): 409-415 (2011) - Alex A. Aravind, Wim H. Hesselink
:
Nonatomic dual bakery algorithm with bounded tokens. Acta Informatica 48(2): 67-96 (2011) - Francine Blanchet-Sadri, Robert Mercas
, Sean Simmons, Eric Weissenstein:
Avoidable binary patterns in partial words. Acta Informatica 48(1): 25-41 (2011) - Ana Cavalcanti
, Marie-Claude Gaudel:
Testing for refinement in Circus. Acta Informatica 48(2): 97-147 (2011) - Amit Chakrabarti
, Venkatesan Guruswami, Andrew Wirth, Anthony Wirth
:
The query complexity of estimating weighted averages. Acta Informatica 48(7-8): 417-426 (2011) - Tien Van Do, Ram Chakka, Nam H. Do, László Pap:
A Markovian queue with varying number of servers and applications to the performance comparison of HSDPA user equipment. Acta Informatica 48(4): 243-269 (2011) - Pál Dömösi, György Maróti:
On α 2 - ν 2-products of automata. Acta Informatica 48(7-8): 397-408 (2011) - Frank Drewes, Johanna Högberg, Andreas Maletti:
MAT learners for tree series: an abstract data type and two realizations. Acta Informatica 48(3): 165-189 (2011) - Juha Honkala:
A characterization of rational D0L power series. Acta Informatica 48(1): 19-24 (2011) - Md. Enamul Kabir
, Hua Wang
, Elisa Bertino:
Efficient systematic clustering method for k-anonymization. Acta Informatica 48(1): 51-66 (2011) - Zheng-Zhu Li, Y. S. Tsai:
Some properties of the disjunctive languages contained in Q. Acta Informatica 48(1): 1-18 (2011) - Alexander Meduna
, Petr Zemek:
One-sided random context grammars. Acta Informatica 48(3): 149-163 (2011) - Victor Mitrana, Cristina Tîrnauca
:
New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries. Acta Informatica 48(1): 43-50 (2011) - Juan Ignacio Perna, Jim Woodcock
, Augusto Sampaio, Juliano Iyoda:
Correct hardware synthesis - An algebraic approach. Acta Informatica 48(7-8): 363-396 (2011) - Artem Polyvyanyy
, Matthias Weidlich
, Mathias Weske:
Connectivity of workflow nets: the foundations of stepwise verification. Acta Informatica 48(4): 213-242 (2011) - Daowen Qiu
, Lvzhou Li, Xiangfu Zou
, Paulo Mateus
, Jozef Gruska:
Multi-letter quantum finite automata: decidability of the equivalence and minimization of states. Acta Informatica 48(5-6): 271-290 (2011) - Markus N. Rabe, Sven Schewe
:
Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games. Acta Informatica 48(5-6): 291-315 (2011) - Daniel Seidel, Janis Voigtländer:
Refined typing to localize the impact of forced strictness on free theorems. Acta Informatica 48(3): 191-211 (2011) - Sándor Vágvölgyi:
CHAP and rewrite components. Acta Informatica 48(5-6): 317-361 (2011)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-09-03 05:32 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