Остановите войну!
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
- 2015
- Suna Bensch, Frank Drewes, Mika Hirvensalo, Friedrich Otto:
Preface. Fundam. Informaticae 136(1-2) (2015) - Nadia Creignou, Heribert Vollmer:
Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting. Fundam. Informaticae 136(4): 297-316 (2015) - Jürgen Dassow, Florin Manea, Bianca Truthe:
On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters. Fundam. Informaticae 136(1-2): 1-35 (2015) - Manfred Droste, Doreen Heusel:
The Supports of Weighted Unranked Tree Automata. Fundam. Informaticae 136(1-2): 37-58 (2015) - Aldo V. Figallo, Gustavo Pelaitay:
Discrete Duality for Tense Łukasiewicz-Moisil Algebras. Fundam. Informaticae 136(4): 317-329 (2015) - Rudolf Freund, Marion Oswald, Gheorghe Paun:
Catalytic and Purely Catalytic P Systems and P Automata: Control Mechanisms for Obtaining Computational Completeness. Fundam. Informaticae 136(1-2): 59-84 (2015) - Maciej Grzeskowiak:
An Algorithmic Construction of Finite Elliptic Curves of Order Divisible by a Large Prime. Fundam. Informaticae 136(4): 331-343 (2015) - Juanjuan He, Kai Zhang:
A Hybrid Distribution Algorithm Based on Membrane Computing for Solving the Multiobjective Multiple Traveling Salesman Problem. Fundam. Informaticae 136(3): 199-208 (2015) - Petr Hoffmann:
Power of S-kR-RRWW-automata. Fundam. Informaticae 136(1-2): 85-112 (2015) - Markus Holzer, Sebastian Jakobi:
Minimization and Characterizations for Biautomata. Fundam. Informaticae 136(1-2): 113-137 (2015) - Richelle Ann B. Juayong, Henry N. Adorna:
Relating Computations in Non-cooperative Transition P Systems and Evolution-Communication P Systems with Energy. Fundam. Informaticae 136(3): 209-217 (2015) - Mariusz Kaniecki, Justyna Kosakowska, Piotr Malicki, Grzegorz Marczak:
A Horizontal Mesh Algorithm for a Class of Edge-bipartite Graphs and their Matrix Morsifications. Fundam. Informaticae 136(4): 345-379 (2015) - Yuan Kong, Xiaolong Shi, Jinbang Xu, Xinquan Huang:
Reversible Spiking Neural P Systems with Astrocytes. Fundam. Informaticae 136(3): 219-230 (2015) - Yuan Kong, Zheng Zhang, Yang Liu:
On String Languages Generated by Spiking Neural P Systems with Astrocytes. Fundam. Informaticae 136(3): 231-240 (2015) - Michal Korpusik, Witold Lukaszewicz, Ewa Madalinska-Bugaj:
Consistency-based Revision of Structured Belief Bases. Fundam. Informaticae 136(4): 381-404 (2015) - Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt:
Deterministic One-Way Turing Machines with Sublinear Space. Fundam. Informaticae 136(1-2): 139-155 (2015) - Yanzhang Li, Changjun Zhou, Xuedong Zheng:
Artificial Bee Colony Algorithm for the Protein Structure Prediction Based on the Toy Model. Fundam. Informaticae 136(3): 241-252 (2015) - Luis F. Macías-Ramos, Mario J. Pérez-Jiménez, Tao Song, Linqiang Pan:
Extending Simulation of Asynchronous Spiking Neural P Systems in P-Lingua. Fundam. Informaticae 136(3): 253-267 (2015) - Pradipta Maji, Partha Garai:
Simultaneous Feature Selection and Extraction Using Feature Significance. Fundam. Informaticae 136(4): 405-431 (2015) - Miguel A. Martínez-del-Amor, Manuel García-Quismondo, Luis F. Macías-Ramos, Luis Valencia-Cabrera, Agustin Riscos-Núñez, Mario J. Pérez-Jiménez:
Simulating P Systems on GPU Devices: A Survey. Fundam. Informaticae 136(3): 269-284 (2015) - Stefano Mazzanti:
Bases for AC0 and Other Complexity Classes. Fundam. Informaticae 136(4): 433-460 (2015) - Yunyun Niu, Ibrahim Venkat, Ahamad Tajudin Khader, K. G. Subramanian:
Uniform Solution to Common Algorithmic Problem by P Systems Working in the Minimally Parallel Mode. Fundam. Informaticae 136(3): 285-296 (2015) - Linqiang Pan, Gheorghe Paun, Mario J. Pérez-Jiménez:
Preface. Fundam. Informaticae 136(3) (2015) - Giovanni Pighizzini, Andrea Pisoni:
Limited Automata and Context-Free Languages. Fundam. Informaticae 136(1-2): 157-176 (2015) - Marcel Vollweiler:
Asynchronous Systems of Parallel Communicating Finite Automata. Fundam. Informaticae 136(1-2): 177-197 (2015) - Andreas Wichert, Catarina Moreira:
On Projection Based Operators in lp Space for Exact Similarity Search. Fundam. Informaticae 136(4): 461-474 (2015)
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-20 05:37 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