Остановите войну!
for scientists:
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 20 matches
- 2009
- Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier:
Undecidability Results for Timed Automata with Silent Transitions. Fundam. Informaticae 92(1-2): 1-25 (2009) - Chin-Chen Chang, Tzungher Chen, Li-Jen Liu:
Preventing Cheating in Computational Visual Cryptography. Fundam. Informaticae 92(1-2): 27-42 (2009) - Willem Conradie, Valentin Goranko, Dimiter Vakarelov:
Algorithmic Correspondence and Completeness in Modal Logic. III. Extensions of the Algorithm SQEMA with Substitutions. Fundam. Informaticae 92(4): 307-343 (2009) - Jacek M. Czerniak:
Evolutionary Approach to Data Discretization for Rough Sets Theory. Fundam. Informaticae 92(1-2): 43-61 (2009) - Eugénie Foustoucos, Labrini Kalantzi:
The Monadic Second-order Logic Evaluation Problem on Finite Colored Trees: a Database-theoretic Approach. Fundam. Informaticae 92(3): 193-231 (2009) - Kimmo Fredriksson, Fedor Nikitin:
Simple Random Access Compression. Fundam. Informaticae 92(1-2): 63-81 (2009) - Anindya Halder, Ashish Ghosh, Susmita Ghosh:
Aggregation Pheromone Density Based Pattern Classification. Fundam. Informaticae 92(4): 345-362 (2009) - Sven Hartmann, Sebastian Link:
On Inferences ofWeak Multivalued Dependencies. Fundam. Informaticae 92(1-2): 83-102 (2009) - Johanna Högberg, Andreas Maletti, Heiko Vogler:
Bisimulation Minimisation of Weighted Automata on Unranked Trees. Fundam. Informaticae 92(1-2): 103-130 (2009) - Karsten Hölscher, Hans-Jörg Kreowski, Sabine Kuske:
Autonomous Units to Model Interacting Sequential and Parallel Processes. Fundam. Informaticae 92(3): 233-257 (2009) - Kuo Lung Hung, Shin-Wei He:
Feature Based Affine Invariant Watermarking Robust to Geometric Distortions. Fundam. Informaticae 92(1-2): 131-143 (2009) - Yinbin Lei, Maokang Luo:
A Proof of Plotkin's Conjecture. Fundam. Informaticae 92(3): 301-306 (2009) - Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
Greedy Algorithm for Construction of Partial Association Rules. Fundam. Informaticae 92(3): 259-277 (2009) - Anthony Spatharis, Ilias Foudalis, Martha Sideri, Christos H. Papadimitriou:
Comparing Trade-off Based Models of the Internet. Fundam. Informaticae 92(4): 363-372 (2009) - Jacek Sroka, Jan Hidders:
Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part I. Fundam. Informaticae 92(3): 279-299 (2009) - Jacek Sroka, Jan Hidders:
Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part II. Fundam. Informaticae 92(4): 373-396 (2009) - Rakesh M. Verma:
Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems. Fundam. Informaticae 92(1-2): 145-168 (2009) - Pawel Waszkiewicz:
On Domain Theory over Girard Quantales. Fundam. Informaticae 92(1-2): 169-192 (2009) - Cheng-Hsing Yang, Chi-Yao Weng, Shiuh-Jeng Wang, Hung-Min Sun:
Codebook-linked Watermarking Scheme for Digital Images. Fundam. Informaticae 92(4): 397-409 (2009) - Sheng Zhong:
On Distributed k-Anonymization. Fundam. Informaticae 92(4): 411-431 (2009)
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-03-29 02:59 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