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 15 matches
- 2009
- Radim Baca, Martin Pawlas:
Compression of the Stream Array Data Structure. DATESO 2009: 23-31 - Peter Chovanec, Michal Krátký:
Efficiency Improvement of Narrow Range Query Processing in R-tree. DATESO 2009: 154-165 - Alan Eckhardt:
Various aspects of user preference learning and recommender systems. DATESO 2009: 56-67 - Jakub Galgonek:
Tequila - a query language for the Semantic Web. DATESO 2009: 105-118 - Milos Kudelka, Václav Snásel, Zdenek Horak, Aboul Ella Hassanien:
From Web Pages to Web Communities. DATESO 2009: 13-22 - Pavel Loupal:
XML-Lambda Type System and Data Model Revealed. DATESO 2009: 130-141 - Ondrej Macek, Karel Richta:
The BPM to UML activity diagram transformation using XSLT. DATESO 2009: 119-129 - Vladislav Martinek, Michal Zemlicka:
Speeding Up Shortest Path Search in Public Transport Networks. DATESO 2009: 1-12 - Pavel Moravec, Václav Snásel:
Dimension Reduction Methods for Iris Recognition. DATESO 2009: 80-89 - Martin Necaský, Irena Mlýnková:
Five-Level Multi-Application Schema Evolution. DATESO 2009: 90-104 - Matús Ondreicka, Jaroslav Pokorný:
Combination of TA- and MD-algorithm for Efficient Solving of Top-K Problem according to User's Preferences. DATESO 2009: 142-153 - Jaroslav Pokorný, Jana Pribolová, Peter Vojtás:
Translation of Ontology Retrieval Problem into Relational Queries. DATESO 2009: 44-55 - Michal Vajbar:
Using Top Trees For Easy Programming of Tree Algorithms. DATESO 2009: 68-79 - Jirí Walder, Michal Krátký, Radim Baca:
Benchmarking Coding Algorithms for the R-tree Compression. DATESO 2009: 32-43 - Karel Richta, Jaroslav Pokorný, Václav Snásel:
Proceedings of the Dateso 2009 Annual International Workshop on DAtabases, TExts, Specifications and Objects, Spindleruv Mlyn, Czech Republic, April 15-17, 2009. CEUR Workshop Proceedings 471, CEUR-WS.org 2009 [contents]
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-10-08 09:27 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