![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 26 matches
- 2019
- Antoine Amarilli
, Pierre Bourhis
, Stefan Mengel
, Matthias Niewerth
:
Constant-Delay Enumeration for Nondeterministic Document Spanners. ICDT 2019: 22:1-22:19 - Gerald Berger, Martin Otto, Andreas Pieris, Dimitri Surinx, Jan Van den Bussche
:
Additive First-Order Queries. ICDT 2019: 19:1-19:14 - Leopoldo E. Bertossi, Georg Gottlob, Reinhard Pichler:
Datalog: Bag Semantics via Set Semantics. ICDT 2019: 16:1-16:19 - Marco Calautti, Andreas Pieris:
Oblivious Chase Termination: The Sticky Case. ICDT 2019: 17:1-17:18 - Marco Console, Paolo Guagliardo
, Leonid Libkin
:
Fragments of Bag Relational Algebra: Expressiveness and Certain Answers. ICDT 2019: 8:1-8:16 - Arnab Ganguly, J. Ian Munro, Yakov Nekrich
, Rahul Shah, Sharma V. Thankachan:
Categorical Range Reporting with Frequencies. ICDT 2019: 9:1-9:19 - Floris Geerts:
On the Expressive Power of Linear Algebra on Graphs. ICDT 2019: 7:1-7:19 - Lise Getoor:
The Power of Relational Learning (Invited Talk). ICDT 2019: 2:1-2:1 - Grzegorz Gluch, Jerzy Marcinkowski
, Piotr Ostropolski-Nalewaja
:
The First Order Truth Behind Undecidability of Regular Path Queries Determinacy. ICDT 2019: 15:1-15:18 - Alejandro Grez, Cristian Riveros, Martín Ugarte:
A Formal Framework for Complex Event Processing. ICDT 2019: 5:1-5:18 - Émilie Grienenberger, Martin Ritzert:
Learning Definable Hypotheses on Trees. ICDT 2019: 24:1-24:18 - Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Counting Triangles under Updates in Worst-Case Optimal Time. ICDT 2019: 4:1-4:18 - Mahmoud Abo Khamis
, Hung Q. Ngo, Dan Olteanu, Dan Suciu
:
Boolean Tensor Decomposition for Conjunctive Queries with Negation. ICDT 2019: 21:1-21:19 - Paraschos Koutris, Jef Wijsen:
Consistent Query Answering for Primary Keys in Logspace. ICDT 2019: 23:1-23:19 - Markus Krötzsch
, Maximilian Marx
, Sebastian Rudolph
:
The Power of the Terminating Chase (Invited Talk). ICDT 2019: 3:1-3:17 - Nirman Kumar, Benjamin Raichel, Stavros Sintos, Gregory Van Buskirk:
Approximating Distance Measures for the Skyline. ICDT 2019: 10:1-10:20 - Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo, Federico Ulliana:
A Single Approach to Decide Chase Termination on Linear Existential Rules. ICDT 2019: 18:1-18:19 - Yuliang Li, Jianguo Wang
, Benjamin S. Pullman, Nuno Bandeira, Yannis Papakonstantinou:
Index-Based, High-Dimensional, Cosine Threshold Querying with Optimality Guarantees. ICDT 2019: 11:1-11:20 - Silviu Maniu
, Pierre Senellart, Suraj Jog:
An Experimental Study of the Treewidth of Real-World Graph Data. ICDT 2019: 12:1-12:18 - Stefan Mengel, Sebastian Skritek:
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. ICDT 2019: 20:1-20:18 - Frank Neven
, Thomas Schwentick, Christopher Spinrath, Brecht Vandevoort
:
Parallel-Correctness and Parallel-Boundedness for Datalog Programs. ICDT 2019: 14:1-14:19 - Dan Olteanu:
Learning Models over Relational Databases (Invited Talk). ICDT 2019: 1:1-1:1 - Liat Peterfreund, Balder ten Cate, Ronald Fagin, Benny Kimelfeld:
Recursive Programs for Document Spanners. ICDT 2019: 13:1-13:18 - Christopher De Sa, Ihab F. Ilyas, Benny Kimelfeld, Christopher Ré, Theodoros Rekatsinas
:
A Formal Framework for Probabilistic Unclean Databases. ICDT 2019: 6:1-6:18 - Front Matter, Table of Contents, Preface, Conference Organization. ICDT 2019: 0:i-0:xvi
- Pablo Barceló, Marco Calautti:
22nd International Conference on Database Theory, ICDT 2019, March 26-28, 2019, Lisbon, Portugal. LIPIcs 127, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-101-6 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-09 21:10 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