Остановите войну!
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 19 matches
- 2005
- Tomasz Borzyszkowski:
Generalized Interpolation in First Order Logic. Fundam. Informaticae 66(3): 199-219 (2005) - Yun Chi, Richard R. Muntz, Siegfried Nijssen, Joost N. Kok:
Frequent Subtree Mining - An Overview. Fundam. Informaticae 66(1-2): 161-198 (2005) - Alcino Cunha, Jorge Sousa Pinto:
Point-free Program Transformation. Fundam. Informaticae 66(4): 315-352 (2005) - Olivier Danvy, Mayer Goldberg:
There and Back Again. Fundam. Informaticae 66(4): 397-413 (2005) - Raymond R. Devillers, Hanna Klaudel:
Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets. Fundam. Informaticae 66(3): 221-257 (2005) - Ernst-Erich Doberkat:
Tracing Relations Probabilistically. Fundam. Informaticae 66(3): 259-275 (2005) - Sébastien Ferré, Ross D. King:
A Dichotomic Search Algorithm for Mining and Learning in Domain-Specific Logics. Fundam. Informaticae 66(1-2): 1-32 (2005) - Olivier Finkel:
On Winning Conditions of High Borel Complexity in Pushdown Games. Fundam. Informaticae 66(3): 277-298 (2005) - Warodom Geamsakul, Tetsuya Yoshida, Kouzou Ohara, Hiroshi Motoda, Hideto Yokoi, Katsuhiko Takabayashi:
Constructing a Decision Tree for Graph-Structured Data and its Applications. Fundam. Informaticae 66(1-2): 131-160 (2005) - Jeremy Gibbons, Graham Hutton:
Proof Methods for Corecursive Programs. Fundam. Informaticae 66(4): 353-366 (2005) - Robert Glück, Masahiko Kawabe:
A Method for Automatic Program Inversion Based on LR(0) Parsing. Fundam. Informaticae 66(4): 367-395 (2005) - Amaury Habrard, Marc Bernard, Marc Sebban:
Detecting Irrelevant Subtrees to Improve Probabilistic Learning from Tree-structured Data. Fundam. Informaticae 66(1-2): 103-130 (2005) - Lawrence B. Holder, Diane J. Cook, Jeffrey Coble, Maitrayee Mukherjee:
Graph-based Relational Learning with Application to Security. Fundam. Informaticae 66(1-2): 83-101 (2005) - Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda:
A General Framework for Mining Frequent Subgraphs from Labeled Graphs. Fundam. Informaticae 66(1-2): 53-82 (2005) - Björn Lisper:
Infinite Unfolding and Transformations of Nondeterministic Programs. Fundam. Informaticae 66(4): 415-439 (2005) - Albina Moshkova:
On Effective Methods for Diagnosis of Retaining Faults in Circuits. Fundam. Informaticae 66(3): 299-313 (2005) - Alberto Pettorossi, Maurizio Proietti:
Program Transformation: Theoretical Foundations and Basic Techniques. Part 1. Fundam. Informaticae 66(4) (2005) - Takashi Washio, Luc De Raedt, Joost N. Kok:
Advances in Mining Graphs, Trees and Sequences. Fundam. Informaticae 66(1-2) (2005) - Mohammed Javeed Zaki:
Efficiently Mining Frequent Embedded Unordered Trees. Fundam. Informaticae 66(1-2): 33-52 (2005)
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-04-25 01:46 CEST 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