Остановите войну!
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 27 matches
- 2020
- Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche:
Executable First-Order Queries in the Logic of Information Flows. ICDT 2020: 4:1-4:14 - Antoine Amarilli, Ismail Ilkan Ceylan:
A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs. ICDT 2020: 5:1-5:20 - Pablo Barceló, Nelson Higuera, Jorge Pérez, Bernardo Subercaseaux:
On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra. ICDT 2020: 6:1-6:20 - Yu Chen, Ke Yi:
Random Sampling and Size Estimation Over Cyclic Joins. ICDT 2020: 7:1-7:18 - Johannes Doleschal, Benny Kimelfeld, Wim Martens, Liat Peterfreund:
Weight Annotation in Information Extraction. ICDT 2020: 8:1-8:18 - Diego Figueira:
Containment of UC2RPQ: The Hard and Easy Cases. ICDT 2020: 9:1-9:18 - Henrik Forssell, Evgeny Kharlamov, Evgenij Thorstensen:
On Equivalence and Cores for Incomplete Databases in Open and Closed Worlds. ICDT 2020: 10:1-10:21 - Dominik D. Freydenberger, Sam M. Thompson:
Dynamic Complexity of Document Spanners. ICDT 2020: 11:1-11:21 - Gaetano Geck, Frank Neven, Thomas Schwentick:
Distribution Constraints: The Chase for Distributed Data. ICDT 2020: 13:1-13:19 - Floris Geerts:
When Can Matrix Query Languages Discern Matrices? ICDT 2020: 12:1-12:18 - Alejandro Grez, Cristian Riveros:
Towards Streaming Evaluation of Queries with Correlation in Complex Event Processing. ICDT 2020: 14:1-14:17 - Alejandro Grez, Cristian Riveros, Martín Ugarte, Stijn Vansummeren:
On the Expressiveness of Languages for Complex Event Recognition. ICDT 2020: 15:1-15:17 - Martin Grohe, Peter Lindner:
Infinite Probabilistic Databases. ICDT 2020: 16:1-16:20 - Jelle Hellings, Mohammad Sadoghi:
Coordination-Free Byzantine Replication with Minimal Communication Costs. ICDT 2020: 17:1-17:20 - Batya Kenig, Dan Suciu:
Integrity Constraints Revisited: From Exact to Approximate Implication. ICDT 2020: 18:1-18:20 - Bas Ketsman, Christoph Koch:
Datalog with Negation and Monotonicity. ICDT 2020: 19:1-19:18 - Benny Kimelfeld:
Facets of Probabilistic Databases (Invited Talk). ICDT 2020: 1:1-1:1 - Ester Livshits, Leopoldo E. Bertossi, Benny Kimelfeld, Moshe Sebag:
The Shapley Value of Tuples in Query Answering. ICDT 2020: 20:1-20:19 - Jerzy Marcinkowski:
What Makes a Variant of Query Determinacy (Un)Decidable? (Invited Talk). ICDT 2020: 2:1-2:20 - Gonzalo Navarro, Juan L. Reutter, Javiel Rojas-Ledesma:
Optimal Joins Using Compact Data Structures. ICDT 2020: 21:1-21:21 - Rasmus Pagh, Johan Sivertsen:
The Space Complexity of Inner Product Filters. ICDT 2020: 22:1-22:14 - Juan L. Reutter:
Current Challenges in Graph Databases (Invited Talk). ICDT 2020: 3:1-3:1 - Cristian Riveros, Jorge Salas:
A Family of Centrality Measures for Graph Data Based on Subgraphs. ICDT 2020: 23:1-23:18 - Michael Simpson, Venkatesh Srinivasan, Alex Thomo:
Reverse Prevention Sampling for Misinformation Mitigation in Social Networks. ICDT 2020: 24:1-24:18 - Yufei Tao:
A Simple Parallel Algorithm for Natural Joins on Binary Relations. ICDT 2020: 25:1-25:18 - Front Matter, Table of Contents, Preface, Conference Organization. ICDT 2020: 0:1-0:16
- Carsten Lutz, Jean Christoph Jung:
23rd International Conference on Database Theory, ICDT 2020, March 30-April 2, 2020, Copenhagen, Denmark. LIPIcs 155, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-139-9 [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-07-13 12:21 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