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 25 matches
- 2011
- Stefano Bistarelli, Francesco Santini:
A Nonmonotonic Soft Concurrent Constraint Language to Model the Negotiation Process. Fundam. Informaticae 111(3): 257-279 (2011) - John Case, Samuel E. Moelius:
Properties Complementary to Program Self-Reference. Fundam. Informaticae 111(3): 281-311 (2011) - Jean-Marc Champarnaud, Jacques Farré, Franck Guingne:
Reduction Techniques for Acyclic Cover Transducers. Fundam. Informaticae 111(4): 357-371 (2011) - Zhe Chen:
On the Generative Power of ω-Grammars and ω-Automata. Fundam. Informaticae 111(2): 119-145 (2011) - Francisco Claude, Gonzalo Navarro:
Self-Indexed Grammar-Based Compression. Fundam. Informaticae 111(3): 313-337 (2011) - Zhi-Hong Deng, Ning Gao, Xiaoran Xu:
Mop: An Efficient Algorithm for Mining Frequent Pattern with Subtree Traversing. Fundam. Informaticae 111(4): 373-390 (2011) - Yong Du, Qinghua Hu, Degang Chen, Peijun Ma:
Kernelized Fuzzy Rough Sets Based Yawn Detection for Driver Fatigue Monitoring. Fundam. Informaticae 111(1): 65-79 (2011) - Wit Forys, Piotr Oprocha:
Infinite Traces and Symbolic Dynamics - the Minimal Shift Case. Fundam. Informaticae 111(2): 147-161 (2011) - Zoltán Fülöp, Andreas Maletti, Heiko Vogler:
Weighted Extended Tree Transducers. Fundam. Informaticae 111(2): 163-202 (2011) - Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu:
Efficient Algorithms for Games Played on Trees with Back-edges. Fundam. Informaticae 111(4): 391-412 (2011) - Manish Garg, Sugata Gangopadhyay:
A Lower Bound of the Second-order Nonlinearities of Boolean Bent Functions. Fundam. Informaticae 111(4): 413-422 (2011) - Taichi Haruna, Yukio-Pegio Gunji:
Double Approximation and Complete Lattices. Fundam. Informaticae 111(1): 1-14 (2011) - Benedetto Intrigila, Richard Statman:
Solution to the Range Problem for Combinatory Logic. Fundam. Informaticae 111(2): 203-222 (2011) - Mihai Ionescu, Gheorghe Paun, Mario J. Pérez-Jiménez, Takashi Yokomori:
Spiking Neural dP Systems. Fundam. Informaticae 111(4): 423-436 (2011) - Andrzej Kisielewicz, Marek Szykula:
Rainbow Induced Subgraphs in Proper Vertex Colorings. Fundam. Informaticae 111(4): 437-451 (2011) - Tong-Jun Li, Wei-Zhi Wu:
Attribute Reduction in Formal Contexts: A Covering Rough Set Approach. Fundam. Informaticae 111(1): 15-32 (2011) - Alessio Lomuscio, Wojciech Penczek, Monika Solanki, Maciej Szreter:
Runtime Monitoring of Contract Regulated Web Services. Fundam. Informaticae 111(3): 339-355 (2011) - Deepti Mishra, Alok Mishra:
Object-Oriented Inheritance Metrics in the Context of Cognitive Complexity. Fundam. Informaticae 111(1): 91-117 (2011) - Taishin Yasunobu Nishida:
Computing k-block Morphisms by Spiking Neural P Systems. Fundam. Informaticae 111(4): 453-464 (2011) - Yanhong She, Xiaoli He, Guojun Wang:
Rough Truth Degrees of Formulas and Approximate Reasoning in Rough Logic. Fundam. Informaticae 111(2): 223-239 (2011) - Zhengjiang Wu, Tianrui Li, Keyun Qin, Da Ruan:
Approximation Operators, Binary Relation and Basis Algebra in L-fuzzy Rough Sets. Fundam. Informaticae 111(1): 47-63 (2011) - Wei-Zhi Wu, Dominik Slezak, Hung Son Nguyen:
Preface. Fundam. Informaticae 111(1) (2011) - Yanqing Yao, Ju-Sheng Mi, Zhoujun Li, Bin Xie:
The Construction of Fuzzy Concept Lattices Based on (θ, σ)-Fuzzy Rough Approximation Operators. Fundam. Informaticae 111(1): 33-45 (2011) - Jia Yu, Fanyu Kong, Xiangguo Cheng, Rong Hao, Jianxi Fan:
Forward-Secure Identity-Based Public-Key Encryption without Random Oracles. Fundam. Informaticae 111(2): 241-256 (2011) - Jian Yu, Miin-Shen Yang, Pengwei Hao:
A Novel Multimodal Probability Model for Cluster Analysis. Fundam. Informaticae 111(1): 81-90 (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-28 21:47 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