Остановите войну!
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 35 matches
- 2019
- Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali:
Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding. PODS 2019: 335-352 - Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. PODS 2019: 89-103 - Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros:
Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation. PODS 2019: 59-73 - Sepehr Assadi, Nikolai Karpov, Qin Zhang:
Distributed and Streaming Linear Programming in Low Dimensions. PODS 2019: 236-253 - David Baelde, Anthony Lick, Sylvain Schmitz:
Decidable XPath Fragments in the Real World. PODS 2019: 285-302 - Pablo Barceló, Alexander Baumgartner, Victor Dalmau, Benny Kimelfeld:
Regularizing Conjunctive Features for Classification. PODS 2019: 2-16 - Gerald Berger, Georg Gottlob, Andreas Pieris, Emanuel Sallinger:
The Space-Efficient Core of Vadalog. PODS 2019: 270-284 - Christoph Berkholz, Hubie Chen:
Compiling Existential Positive Queries to Bounded-Variable Fragments. PODS 2019: 353-364 - Leopoldo E. Bertossi:
Database Repairs and Consistent Query Answering: Origins and Further Developments. PODS 2019: 48-58 - Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives. PODS 2019: 254-268 - Marco Calautti, Marco Console, Andreas Pieris:
Counting Database Repairs under Primary Keys Revisited. PODS 2019: 104-118 - Nofar Carmeli, Markus Kröll:
On the Enumeration Complexity of Unions of Conjunctive Queries. PODS 2019: 134-148 - Hubie Chen:
The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems. PODS 2019: 383-398 - Hubie Chen, Yuichi Yoshida:
Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory. PODS 2019: 365-382 - Johannes Doleschal, Benny Kimelfeld, Wim Martens, Yoav Nahshon, Frank Neven:
Split-Correctness in Information Extraction. PODS 2019: 149-163 - Cynthia Dwork:
Differential Privacy and the US Census. PODS 2019: 1 - Alan D. Fekete:
Making Consistency Protocols Serializable. PODS 2019: 269 - Wolfgang Fischl, Georg Gottlob, Davide Mario Longo, Reinhard Pichler:
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings. PODS 2019: 464-480 - Martin Grohe, Peter Lindner:
Probabilistic Databases with an Infinite Open-World Assumption. PODS 2019: 17-31 - Xiao Hu, Ke Yi:
Instance and Output Optimal Parallel Algorithms for Acyclic Joins. PODS 2019: 450-463 - Piotr Indyk, Ali Vakilian:
Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model. PODS 2019: 200-217 - Rajesh Jayaram, Gokarna Sharma, Srikanta Tirthapura, David P. Woodruff:
Weighted Reservoir Sampling from Distributed Streams. PODS 2019: 218-235 - John Kallaugher, Andrew McGregor, Eric Price, Sofya Vorotnikova:
The Complexity of Counting Cycles in the Adjacency List Streaming Model. PODS 2019: 119-133 - Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
On Functional Aggregate Queries with Additive Inequalities. PODS 2019: 414-431 - Benny Kimelfeld, Phokion G. Kolaitis, Muhammad Tibi:
Query Evaluation in Election Databases. PODS 2019: 32-46 - George Konstantinidis, Fabio Mogavero:
Attacking Diophantus: Solving a Special Case of Bag Containment. PODS 2019: 399-413 - Michael Langberg, Shi Li, Sai Vikneshwar Mani Jayaraman, Atri Rudra:
Topology Dependent Bounds For FAQs. PODS 2019: 432-449 - Michael Mitzenmacher, Tom Morgan:
Robust Set Reconciliation via Locality Sensitive Hashing. PODS 2019: 164-181 - Sarvar Patel, Giuseppe Persiano, Kevin Yeo:
What Storage Access Privacy is Achievable with Small Overhead? PODS 2019: 182-199 - Liat Peterfreund, Dominik D. Freydenberger, Benny Kimelfeld, Markus Kröll:
Complexity Bounds for Relational Algebra over Document Spanners. PODS 2019: 320-334
skipping 5 more matches
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-30 05:36 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