![](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 24 matches
- 2014
- Talha Amin, Igor Chikalov, Mikhail Moshkov
, Beata Zielosko
:
Relationships Between Length and Coverage of Decision Rules. Fundam. Informaticae 129(1-2): 1-13 (2014) - Annalisa Appice
, Michelangelo Ceci
, Donato Malerba
:
Multi-Relational Model Tree Induction Tightly-Coupled with a Relational Database. Fundam. Informaticae 129(3): 193-224 (2014) - Krzysztof R. Apt, Evangelos Markakis:
Social Networks with Competing Products. Fundam. Informaticae 129(3): 225-250 (2014) - Philippe Balbiani
, Tinko Tinchev
:
Definability and Canonicity for Boolean Logic with a Binary Relation. Fundam. Informaticae 129(4): 301-327 (2014) - Igor Chikalov, Shahid Hussain
, Mikhail Moshkov
:
Relationships between Average Depth and Number of Misclassifications for Decision Trees. Fundam. Informaticae 129(1-2): 15-26 (2014) - Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal
, M. Sohel Rahman
:
Computing a Longest Common Palindromic Subsequence. Fundam. Informaticae 129(4): 329-340 (2014) - Ludwik Czaja:
Preface. Fundam. Informaticae 129(1-2) (2014) - Ludwik Czaja:
Self-Modifying Nets for Synchronous, Connection-Oriented, Multicast Communication. Fundam. Informaticae 129(1-2): 27-36 (2014) - Marta Czyzewska, Jaroslaw Szkola, Krzysztof Pancerz
:
Towards Assessment of Innovativeness Economy Determinant Correlation: the Double Self-Organizing Feature Map Approach. Fundam. Informaticae 129(1-2): 37-48 (2014) - Mostafa Herajy
, Monika Heiner
:
Petri Net-Based Collaborative Simulation and Steering of Biochemical Reaction Networks. Fundam. Informaticae 129(1-2): 49-67 (2014) - Andrzej Jankowski, Andrzej Skowron, Roman W. Swiniarski:
Perspectives on Uncertainty and Risk in Rough Sets and Interactive Rough-Granular Computing. Fundam. Informaticae 129(1-2): 69-84 (2014) - Claude Jard, Didier Lime
, Olivier H. Roux:
Blending Timed Formal Models with Clock Transition Systems. Fundam. Informaticae 129(1-2): 85-100 (2014) - Michael Köhler-Bußmeier:
On the Complexity of the Reachability Problem for Safe, Elementary Hornets. Fundam. Informaticae 129(1-2): 101-115 (2014) - Manfred Kudlek, Nils Erik Flick:
Properties of Languages with Catenation and Shuffle. Fundam. Informaticae 129(1-2): 117-132 (2014) - Vladimir Kurbalija
, Mirjana Ivanovic
, Charlotte von Bernstorff, Jens Nachtwei, Hans-Dieter Burkhard:
Matching Observed with Empirical Reality - What you see is what you get? Fundam. Informaticae 129(1-2): 133-147 (2014) - Nicola Di Mauro
, Teresa Maria Altomare Basile
, Stefano Ferilli, Floriana Esposito
:
Grasp and Path-Relinking for Coalition Structure Generation. Fundam. Informaticae 129(3): 251-277 (2014) - Gábor Árpád Németh, Zoltán Pap:
The Incremental Maintenance of Transition Tour. Fundam. Informaticae 129(3): 279-300 (2014) - Lech Polkowski
, Maria Semeniuk-Polkowska:
Boundaries, Borders, Fences, Hedges. Fundam. Informaticae 129(1-2): 149-159 (2014) - Marcin S. Szczuka
, Lukasz Sosnowski
, Adam Krasuski
, Karol Krenski:
Using Domain Knowledge in Initial Stages of KDD: Optimization of Compound Object Processing. Fundam. Informaticae 129(4): 341-364 (2014) - Marcin Szpyrka, Piotr Matyasik, Rafal Mrowka, Leszek Kotulski:
Formal Description of Alvis Language with α0 System Layer. Fundam. Informaticae 129(1-2): 161-176 (2014) - Miaomiao Tian, Wei Yang, Liusheng Huang:
Cryptanalysis and Improvement of a Certificateless Multi-proxy Signature Scheme. Fundam. Informaticae 129(4): 365-375 (2014) - Shiping Wang, Qingxin Zhu, William Zhu
, Fan Min
:
Rough Set Characterization for 2-circuit Matroid. Fundam. Informaticae 129(4): 377-393 (2014) - Piotr Wisniewski, Krzysztof Stencel:
Universal Query Language for Unified State Model. Fundam. Informaticae 129(1-2): 177-192 (2014) - Lin You, Yilin Yang, Shuhong Gao, Yongxuan Sang:
Fast Scalar Multiplications on the Curve v2 = up - au - b over the Finite Field of Characteristic p. Fundam. Informaticae 129(4): 395-412 (2014)
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-08-25 14:22 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