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 31 matches
- 2012
- Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang, Jeff M. Phillips, Zhewei Wei, Ke Yi:
Mergeable summaries. PODS 2012: 23-34 - Pankaj K. Agarwal, Alon Efrat, Swaminathan Sankararaman, Wuzhou Zhang:
Nearest-neighbor searching under uncertainty. PODS 2012: 225-236 - Kook Jin Ahn, Sudipto Guha, Andrew McGregor:
Graph sketches: sparsification, spanners, and subgraphs. PODS 2012: 5-14 - Pablo Barceló, Leonid Libkin, Miguel Romero:
Efficient approximations of conjunctive queries. PODS 2012: 249-260 - Allan Borodin, Hyun Chul Lee, Yuli Ye:
Max-Sum diversification, monotone submodular functions and dynamic updates. PODS 2012: 155-166 - Surajit Chaudhuri:
What next?: a half-dozen data management research goals for big data and the cloud. PODS 2012: 1-4 - Krzysztof Choromanski, Tal Malkin:
The power of the dinur-nissim algorithm: breaking privacy of statistical and graph databases. PODS 2012: 65-76 - Ting Deng, Wenfei Fan, Floris Geerts:
On the complexity of package recommendation problems. PODS 2012: 261-272 - Ronald Fagin, Phokion G. Kolaitis:
Local transformations and conjunctive-query equivalence. PODS 2012: 179-190 - Roberto Grossi, Giuseppe Ottaviano:
The wavelet trie: maintaining an indexed sequence of strings in compressed space. PODS 2012: 203-214 - Benoît Groz, Sebastian Maneth, Slawek Staworko:
Deterministic regular expressions in linear time. PODS 2012: 49-60 - Zengfeng Huang, Ke Yi, Qin Zhang:
Randomized algorithms for tracking distributed count, frequencies, and ranks. PODS 2012: 295-306 - Richard Hull, Phokion G. Kolaitis, Dirk Van Gucht:
The ACM PODS Alberto O. Mendelzon test-of-time award 2012. PODS 2012: 35-36 - Piotr Indyk, Reut Levi, Ronitt Rubinfeld:
Approximating and testing k-histogram distributions in sub-linear time. PODS 2012: 15-22 - Daniel Kifer, Ashwin Machanavajjhala:
A rigorous and customizable framework for privacy. PODS 2012: 77-88 - Benny Kimelfeld:
A dichotomy in the complexity of deletion propagation with functional dependencies. PODS 2012: 191-202 - Egor V. Kostylev, Juan L. Reutter, András Z. Salamon:
Classification of annotation semirings over query containment. PODS 2012: 237-248 - Paraschos Koutris, Prasang Upadhyaya, Magdalena Balazinska, Bill Howe, Dan Suciu:
Query-based data pricing. PODS 2012: 167-178 - Andrés Letelier, Jorge Pérez, Reinhard Pichler, Sebastian Skritek:
Static analysis and optimization of semantic web queries. PODS 2012: 89-100 - Zhenming Liu, Bozidar Radunovic, Milan Vojnovic:
Continuous distributed counting for non-monotonic streams. PODS 2012: 307-318 - Katja Losemann, Wim Martens:
The complexity of evaluating path expressions in SPARQL. PODS 2012: 101-112 - Michael W. Mahoney:
Approximate computation and implicit regularization for very large-scale data analysis. PODS 2012: 143-154 - Andrew McGregor, A. Pavan, Srikanta Tirthapura, David P. Woodruff:
Space-efficient estimation of statistics over sub-sampled streams. PODS 2012: 273-282 - Yakov Nekrich:
Space-efficient range reporting for categorical data. PODS 2012: 113-120 - Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra:
Worst-case optimal join algorithms: [extended abstract]. PODS 2012: 37-48 - Benjamin C. Pierce:
Linguistic foundations for bidirectional transformations: invited tutorial. PODS 2012: 61-64 - Cheng Sheng, Yufei Tao:
Dynamic top-k range reporting in external memory. PODS 2012: 121-130 - Yufei Tao:
Indexability of 2D range search revisited: constant redundancy and weak indivisibility. PODS 2012: 131-142 - Srikanta Tirthapura, David P. Woodruff:
Rectangle-efficient aggregation in spatial data streams. PODS 2012: 283-294 - Pan Xu, Srikanta Tirthapura:
On the optimality of clustering properties of space filling curves. PODS 2012: 215-224
skipping 1 more match
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-11-05 05:55 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