default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 33 matches
- 2021
- Heba Aamer
, Jan Hidders, Jan Paredaens, Jan Van den Bussche:
Expressiveness within Sequence Datalog. PODS 2021: 70-81 - Rajeev Alur, Phillip Hilliard, Zachary G. Ives, Konstantinos Kallas, Konstantinos Mamouras, Filip Niksic, Caleb Stanford, Val Tannen, Anton Xue:
Synchronization Schemas. PODS 2021: 1-18 - Albert Atserias, Phokion G. Kolaitis:
Structure and Complexity of Bag Consistency. PODS 2021: 247-259 - Corentin Barloy, Filip Murlak, Charles Paperman:
Stackless Processing of Streamed Trees. PODS 2021: 109-125 - Christoph Berkholz, Maximilian Merz:
Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration. PODS 2021: 402-415 - Angela Bonifati, Rasmus Pagh, Thomas Schwentick:
2021 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS 2021: 82 - Marco Calautti, Marco Console, Andreas Pieris:
Benchmarking Approximate Consistent Query Answering. PODS 2021: 233-246 - Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke:
Tuple-Independent Representations of Infinite Probabilistic Databases. PODS 2021: 388-401 - Nofar Carmeli, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald:
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries. PODS 2021: 325-341 - Marco Console, Phokion G. Kolaitis, Andreas Pieris:
Model-theoretic Characterizations of Rule-based Ontologies. PODS 2021: 416-428 - Graham Cormode, Charlie Dickens, David P. Woodruff:
Subspace Exploration: Bounds on Projected Frequency Estimation. PODS 2021: 273-284 - Graham Cormode, Minos N. Garofalakis, Michael Shekelyan:
Data-Independent Space Partitionings for Summaries. PODS 2021: 285-298 - Graham Cormode, Zohar S. Karnin, Edo Liberty, Justin Thaler, Pavel Veselý:
Relative Error Streaming Quantiles. PODS 2021: 96-108 - Floris Geerts, Thomas Muñoz, Cristian Riveros, Domagoj Vrgoc:
Expressive Power of Linear Algebra Query Languages. PODS 2021: 342-354 - Xiao Hu:
Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins. PODS 2021: 181-198 - Xiao Hu, Paraschos Koutris, Spyros Blanas:
Algorithms for a Topology-aware Massively Parallel Computation Model. PODS 2021: 199-214 - Batya Kenig, Dan Suciu:
A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries. PODS 2021: 312-324 - Stanislav Kikot, Agi Kurucz, Vladimir V. Podolskii, Michael Zakharyaschev:
Deciding Boundedness of Monadic Sirups. PODS 2021: 370-387 - Christian Konrad:
Frequent Elements with Witnesses in Data Streams. PODS 2021: 83-95 - Paraschos Koutris, Xiating Ouyang, Jef Wijsen:
Consistent Query Answering for Primary Keys on Path Queries. PODS 2021: 215-232 - Matthias Lanzinger:
Tractability Beyond ß-Acyclicity for Conjunctive Queries with Negation. PODS 2021: 355-369 - Dániel Marx:
Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction. PODS 2021: 19-29 - Kuldeep S. Meel, N. V. Vinodchandran, Sourav Chakraborty:
Estimating the Size of Union of Sets in Streaming Models. PODS 2021: 126-137 - Kobbi Nissim:
Privacy: From Database Reconstruction to Legal Theorems. PODS 2021: 33-41 - Aduri Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel:
Model Counting meets F0 Estimation. PODS 2021: 299-311 - Miao Qiao, Yufei Tao:
Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins. PODS 2021: 166-180 - Barna Saha:
Approximation Algorithms for Large Scale Data Analysis. PODS 2021: 30-32 - Markus L. Schmid, Nicole Schweikardt:
Spanner Evaluation over SLP-Compressed Documents. PODS 2021: 153-165 - Nina Mesing Stausholm:
Improved Differentially Private Euclidean Distance Approximation. PODS 2021: 42-56 - Yufei Tao, Yu Wang:
New Algorithms for Monotone Classification. PODS 2021: 260-272
skipping 3 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 2025-02-16 18:00 CET 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
