![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.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 26 matches
- 2015
- Nicolas Anciaux, Danae Boutara, Benjamin Nguyen
, Michalis Vazirgiannis:
Limiting Data Exposure in Multi-Label Classification Processes. Fundam. Informaticae 137(2): 219-236 (2015) - Robin Bergenthum, Robert Lorenz:
Verification of Scenarios in Petri Nets Using Compact Tokenflows. Fundam. Informaticae 137(1): 117-142 (2015) - Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Ludovic Mignot:
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions. Fundam. Informaticae 137(4): 425-455 (2015) - Wuhui Chen, Incheon Paik, Patrick C. K. Hung:
Privacy Issues in SOAP Message Exchange Pattern for Social Services. Fundam. Informaticae 137(2): 253-271 (2015) - José Manuel Colom, Jörg Desel, Jetty Kleijn:
Preface. Fundam. Informaticae 137(1) (2015) - Johnson Fernandes, Maciej Koutny, Lukasz Mikulski
, Marta Pietkiewicz-Koutny, Danil Sokolov, Alex Yakovlev
:
Persistent and Nonviolent Steps and the Design of GALS Systems. Fundam. Informaticae 137(1): 143-170 (2015) - Estíbaliz Fraca
, Serge Haddad:
Complexity Analysis of Continuous Petri Nets. Fundam. Informaticae 137(1): 1-28 (2015) - Emanuele G. Fusco
, Andrzej Pelc:
Communication Complexity of Consensus in Anonymous Message Passing Systems. Fundam. Informaticae 137(3): 305-322 (2015) - Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin:
ω-Petri Nets: Algorithms and Complexity. Fundam. Informaticae 137(1): 29-60 (2015) - Zengtai Gong, Xiaoxia Zhang:
On Characterization of Fuzzy Soft Rough Sets Based on a Pair of Border Implicators. Fundam. Informaticae 137(4): 457-491 (2015) - Piotr Honko
:
Description Languages for Relational Information Granules. Fundam. Informaticae 137(3): 323-340 (2015) - Haruko Iwata, Shoji Hirano, Shusaku Tsumoto:
Maintenance and Discovery of Domain Knowledge for Nursing Care using Data in Hospital Information System. Fundam. Informaticae 137(2): 237-252 (2015) - Jouni Järvinen
, Sándor Radeleczki:
Tolerances Induced by Irredundant Coverings. Fundam. Informaticae 137(3): 341-353 (2015) - Junpei Kawamoto:
A Locality Sensitive Hashing Filter for Encrypted Vector Databases. Fundam. Informaticae 137(2): 291-304 (2015) - Waldemar W. Koczkodaj, Marek Kosiek, Jacek Szybowski
, Ding Xu:
Fast Convergence of Distance-based Inconsistency in Pairwise Comparisons. Fundam. Informaticae 137(3): 355-367 (2015) - Sachin Kumar, Rajendra Kumar Sharma
:
Random-Grid Based Region Incrementing Visual Secret Sharing. Fundam. Informaticae 137(3): 369-386 (2015) - Alexis Marechal, Didier Buchs:
Generalizing the Compositions of Petri Nets Modules. Fundam. Informaticae 137(1): 87-116 (2015) - Emad A. Marei, Mohamed Mohamed Ezzat Abd El-Monsef, Hassan M. Abu-Donia:
Modification of Near Sets Theory. Fundam. Informaticae 137(3): 387-402 (2015) - Ernst W. Mayr, Jeremias Weihmann:
Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms. Fundam. Informaticae 137(1): 61-86 (2015) - Michal Meina, Hung Son Nguyen
:
Search Result Clustering Based on Query Context. Fundam. Informaticae 137(2): 273-290 (2015) - Georg Peters:
Assessing Rough Classifiers. Fundam. Informaticae 137(4): 493-515 (2015) - Jan Rauch:
Formal Framework for Data Mining with Association Rules and Domain Knowledge - Overview of an Approach. Fundam. Informaticae 137(2): 171-217 (2015) - Dominik Slezak
, Benjamin C. M. Fung, William Kwok-Wai Cheung:
Preface. Fundam. Informaticae 137(2) (2015) - Guanghong Sun, Chuankun Wu:
Higher Order Nonlinearity of Niho Functions. Fundam. Informaticae 137(3): 403-412 (2015) - Pavel Surynek
:
On the Complexity of Optimal Parallel Cooperative Path-Finding. Fundam. Informaticae 137(4): 517-548 (2015) - Dwaraganathan Umadevi:
On the Completion of Rough Sets System Determined by Arbitrary Binary Relations. Fundam. Informaticae 137(3): 413-424 (2015)
loading more results
failed to load more results, please try again later
![](https://dblp.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 2025-02-18 05:46 CET 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