Остановите войну!
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
- 2011
- Ali Akhtarzada, Cristian S. Calude, John G. Hosking:
A Multi-Criteria Metric Algorithm for Recommender Systems. Fundam. Informaticae 110(1-4): 1-11 (2011) - Artiom Alhazov, Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
P Systems with Insertion and Deletion Exo-Operations. Fundam. Informaticae 110(1-4): 13-28 (2011) - Sepinoud Azimi, Tero Harju, Miika Langille, Ion Petre, Vladimir Rogojin:
Directed Overlap-inclusion Graphs as Representations of Ciliate Genes. Fundam. Informaticae 110(1-4): 29-44 (2011) - Alexis Ballier, Pierre Guillon, Jarkko Kari:
Limit Sets of Stable and Unstable Cellular Automata. Fundam. Informaticae 110(1-4): 45-57 (2011) - Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock:
On the Hardness of Reoptimization with Multiple Given Solutions. Fundam. Informaticae 110(1-4): 59-76 (2011) - Paola Bonizzoni, Claudio Ferretti, Anthonath Roslin Sagaya Mary, Giancarlo Mauri:
Picture Languages Generated by Assembling Tiles. Fundam. Informaticae 110(1-4): 77-93 (2011) - Cewei Cui, Zhe Dang, Thomas R. Fischer:
Typical Paths of a Graph. Fundam. Informaticae 110(1-4): 95-109 (2011) - Ömer Egecioglu, László Hegedüs, Benedek Nagy:
Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages. Fundam. Informaticae 110(1-4): 111-123 (2011) - Gerry Eisman, Bala Ravikumar:
On Approximating Non-regular Languages by Regular Languages. Fundam. Informaticae 110(1-4): 125-142 (2011) - Yuan Gao, Kai Salomaa, Sheng Yu:
Transition Complexity of Incomplete DFAs. Fundam. Informaticae 110(1-4): 143-158 (2011) - Markus Holzer, Andreas Klein, Martin Kutrib, Oliver Ruepp:
Computational Complexity of NURIKABE. Fundam. Informaticae 110(1-4): 159-174 (2011) - Juha Honkala:
The Sequence Equivalence Problem for Marked DT0L Systems. Fundam. Informaticae 110(1-4): 175-182 (2011) - Lucian Ilie, William F. Smyth:
Minimum Unique Substrings and Maximum Repeats. Fundam. Informaticae 110(1-4): 183-195 (2011) - Juhani Karhumäki, Aleksi Saarela:
The Unique Decipherability in the Monoid of Regular Languages is Undecidable. Fundam. Informaticae 110(1-4): 197-200 (2011) - Lila Kari, Shinnosuke Seki, Steffen Kopecki:
On the Regularity of Iterated Hairpin Completion of a Single Word. Fundam. Informaticae 110(1-4): 201-215 (2011) - Jetty Kleijn, Maciej Koutny:
Membrane Systems with Qualitative Evolution Rules. Fundam. Informaticae 110(1-4): 217-230 (2011) - Michal Kunc, Alexander Okhotin:
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata. Fundam. Informaticae 110(1-4): 231-239 (2011) - Kenichi Morita:
Two-Way Reversible Multi-Head Finite Automata. Fundam. Informaticae 110(1-4): 241-254 (2011) - Fumiya Okubo, Takashi Yokomori:
On the Hairpin Incompletion. Fundam. Informaticae 110(1-4): 255-269 (2011) - Linqiang Pan, Jun Wang, Hendrik Jan Hoogeboom:
Limited Asynchronous Spiking Neural P Systems. Fundam. Informaticae 110(1-4): 271-293 (2011) - Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Miquel Rius-Font, Francisco José Romero-Campero:
Looking for Small Efficient P Systems. Fundam. Informaticae 110(1-4): 295-308 (2011) - Rama Raghavan, H. Ramesh, Marian Gheorghe, Shankara Narayanan Krishna:
On Restricted Bio-Turing Machines. Fundam. Informaticae 110(1-4): 309-320 (2011) - Nicholas Q. Tran:
Characterizations and Existence of Easy Sets without Hard Subsets. Fundam. Informaticae 110(1-4): 321-328 (2011) - Sergey Verlan, Maurice Margenstern:
Universality of Splicing Test Tube Systems with Two Tubes. Fundam. Informaticae 110(1-4): 329-342 (2011) - Hsu-Chun Yen:
On Almost-Sure Properties of Probabilistic Discrete Event Systems. Fundam. Informaticae 110(1-4): 343-359 (2011) - Juhani Karhumäki, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Preface. Fundam. Informaticae 110(1-4) (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-25 08:49 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