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 17 matches
- 2011
- Josep Carmona, Jorge Júlvez, Jordi Cortadella, Michael Kishinevsky:
A Scheduling Strategy for Synchronous Elastic Designs. Fundam. Informaticae 108(1-2): 1-21 (2011) - Gianpiero Cattaneo:
An Investigation About Rough Set Theory: Some Foundational and Mathematical Aspects. Fundam. Informaticae 108(3-4): 197-221 (2011) - Davide Ciucci:
Orthopairs: A Simple and Widely UsedWay to Model Uncertainty. Fundam. Informaticae 108(3-4): 287-304 (2011) - Davide Ciucci, Yiyu Yao:
Preface. Fundam. Informaticae 108(3-4) (2011) - Inés Couso, Didier Dubois:
Rough Sets, Coverings and Incomplete Information. Fundam. Informaticae 108(3-4): 223-247 (2011) - Silvia Crafa, Francesco Ranzato, Francesco Tapparo:
Saving Space in a Time Efficient Simulation Algorithm. Fundam. Informaticae 108(1-2): 23-42 (2011) - Murat Diker:
Textures and Fuzzy Rough Sets. Fundam. Informaticae 108(3-4): 305-336 (2011) - Stephen A. Edwards, Ryszard Janicki, Walter Vogler:
Preface. Fundam. Informaticae 108(1-2) (2011) - Joseph P. Herbert, Jingtao Yao:
Game-Theoretic Rough Sets. Fundam. Informaticae 108(3-4): 267-286 (2011) - Niels Lohmann, Karsten Wolf:
Compact Representations and Efficient Algorithms for Operating Guidelines. Fundam. Informaticae 108(1-2): 43-62 (2011) - Andrey Mokhov, Victor Khomenko, Alexandre Yakovlev:
Flat Arbiters. Fundam. Informaticae 108(1-2): 63-90 (2011) - Dumitru Potop-Butucaru, Yves Sorel, Robert de Simone, Jean-Pierre Talpin:
From Concurrent Multi-clock Programs to Deterministic Asynchronous Implementations. Fundam. Informaticae 108(1-2): 91-118 (2011) - Jean-Baptiste Raclet, Éric Badouel, Albert Benveniste, Benoît Caillaud, Axel Legay, Roberto Passerone:
A Modal Interface Theory for Component-based Design. Fundam. Informaticae 108(1-2): 119-149 (2011) - Karsten Wolf, Christian Stahl, Daniela Weinberg, Janine Ott, Robert Danitz:
Guaranteeing Weak Termination in Service Discovery. Fundam. Informaticae 108(1-2): 151-180 (2011) - Marcin Wolski:
Monadic Algebras: a Standpoint on Rough Sets. Fundam. Informaticae 108(3-4): 181-196 (2011) - Wei-Zhi Wu:
On Some Mathematical Structures of T-Fuzzy Rough Set Algebras in Infinite Universes of Discourse. Fundam. Informaticae 108(3-4): 337-369 (2011) - Yiyu Yao:
Two Semantic Issues in a Probabilistic Rough Set Model. Fundam. Informaticae 108(3-4): 249-265 (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-11-17 02:58 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