default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 16 matches
- 2021
- Étienne André, Emmanuel Coquard, Laurent Fribourg, Jawher Jerray, David Lesens:
Parametric Schedulability Analysis of a Launcher Flight Control System under Reactivity Constraints. Fundam. Informaticae 182(1): 31-67 (2021) - Étienne André, Didier Lime, Mathias Ramparison, Mariëlle Stoelinga:
Parametric Analyses of Attack-fault Trees. Fundam. Informaticae 182(1): 69-94 (2021) - Mostafa Haghir Chehreghani, Albert Bifet
, Talel Abdessalem:
Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. Fundam. Informaticae 182(3): 219-242 (2021) - Zaineb Chelly Dagdia, Christine Zarges:
A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique. Fundam. Informaticae 182(2): 111-179 (2021) - Paolo Felli, Massimiliano de Leoni, Marco Montali:
Soundness Verification of Data-Aware Process Models with Variable-to-Variable Conditions. Fundam. Informaticae 182(1): 1-29 (2021) - Yu Jin, Bosheng Song, Yanyan Li, Ying Zhu:
Time-free Solution to Independent Set Problem using P Systems with Active Membranes. Fundam. Informaticae 182(3): 243-255 (2021) - Jörg Keller, Wojciech Penczek:
Preface. Fundam. Informaticae 182(1) (2021) - Linh Le, Ying Xie, Vijay Raghavan:
KNN Loss and Deep KNN. Fundam. Informaticae 182(2): 95-110 (2021) - Viet Dung Nguyen, Ba-Thai Pham, Phan-Thuan Do:
Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs. Fundam. Informaticae 182(3): 257-283 (2021) - Dominik Slezak, Tzung-Pei Hong, Leon S. L. Wang:
Preface: Information Granulation in Data Science and Scalable Computing. Fundam. Informaticae 182(2) (2021) - G. Jessy Sujana, T. M. Rajalaxmi, Indra Rajasingh, R. Sundara Rajan:
Edge Forcing in Butterfly Networks. Fundam. Informaticae 182(3): 285-299 (2021) - Claude Sureson:
The Inverse of Ackermann Function is Computable in Linear Time. Fundam. Informaticae 182(4): 345-361 (2021) - Shusaku Tsumoto, Shoji Hirano, Tomohiro Kimura, Haruko Iwata:
Mining Clinical Process from Hospital Information System: A Granular Computing Approach. Fundam. Informaticae 182(2): 181-218 (2021) - Joachim Wehler:
Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions. Fundam. Informaticae 182(4): 363-393 (2021) - Zhengwei Xie, Daowen Qiu, Guangya Cai, Jozef Gruska, Paulo Mateus:
Testing Boolean Functions Properties. Fundam. Informaticae 182(4): 321-344 (2021) - Mohammad Reza Zarrabi, Nasrollah Moghaddam Charkari:
Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons. Fundam. Informaticae 182(3): 301-319 (2021)
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-26 13:34 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
