Остановите войну!
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 29 matches
- 2013
- Serge Abiteboul, Victor Vianu:
Collaborative data-driven workflows: think global, act local. PODS 2013: 91-102 - Azza Abouzied, Dana Angluin, Christos H. Papadimitriou, Joseph M. Hellerstein, Avi Silberschatz:
Learning and verifying quantified boolean queries by example. PODS 2013: 49-60 - Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang:
Nearest neighbor searching under uncertainty II. PODS 2013: 115-126 - Tom J. Ameloot, Jan Van den Bussche, Emmanuel Waller:
On the expressive power of update primitives. PODS 2013: 139-150 - Pablo Barceló Baeza:
Querying graph databases. PODS 2013: 175-188 - Pablo Barceló Baeza, Miguel Romero, Moshe Y. Vardi:
Semantic acyclicity on graph databases. PODS 2013: 237-248 - Guillaume Bagan, Angela Bonifati, Benoît Groz:
A trichotomy for regular simple path queries on graphs. PODS 2013: 261-272 - Paul Beame, Paraschos Koutris, Dan Suciu:
Communication steps for parallel query processing. PODS 2013: 273-284 - Michael Benedikt, Tova Milo, Dirk Van Gucht:
The ACM PODS Alberto O. Mendelzon test-of-time award 2013. PODS 2013: 61-62 - Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, Frank Wolter:
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP. PODS 2013: 213-224 - Mikolaj Bojanczyk, Luc Segoufin, Szymon Torunczyk:
Verification of database-driven systems via amalgamation. PODS 2013: 63-74 - Diego Calvanese, Giuseppe De Giacomo, Marco Montali:
Foundations of data-aware process analysis: a database theory perspective. PODS 2013: 1-12 - Hubie Chen, Moritz Müller:
The fine classification of conjunctive queries and parameterized logarithmic space complexity. PODS 2013: 309-320 - Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Spanners: a formal framework for information extraction. PODS 2013: 37-48 - Diego Figueira:
On XPath with transitive axes and data tests. PODS 2013: 249-260 - Amélie Gheerbrant, Leonid Libkin, Cristina Sirangelo:
When is naive evaluation possible? PODS 2013: 75-86 - Tomasz Gogacz, Jerzy Marcinkowski:
On the BDD/FC conjecture. PODS 2013: 127-138 - Georg Gottlob:
Deciding monotone duality and identifying frequent itemsets in quadratic logspace. PODS 2013: 25-36 - Babak Bagheri Hariri, Diego Calvanese, Giuseppe De Giacomo, Alin Deutsch, Marco Montali:
Verification of relational data-centric dynamic systems with external services. PODS 2013: 163-174 - André Hernich, Clemens Kupke, Thomas Lukasiewicz, Georg Gottlob:
Well-founded semantics for extended datalog and ontological reasoning. PODS 2013: 225-236 - Piotr Indyk:
Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform. PODS 2013: 87-90 - Wojciech Kazana, Luc Segoufin:
Enumeration of first-order queries on classes of structures with bounded expansion. PODS 2013: 297-308 - Casper Kejlberg-Rasmussen, Yufei Tao, Konstantinos Tsakalidis, Kostas Tsichlas, Jeonghun Yoon:
I/O-efficient planar range skyline and attrition priority queues. PODS 2013: 103-114 - Benny Kimelfeld, Phokion G. Kolaitis:
The complexity of mining maximal frequent subgraphs. PODS 2013: 13-24 - Leonid Libkin, Juan L. Reutter, Domagoj Vrgoc:
Trial for RDF: adapting graph query languages for RDF data. PODS 2013: 201-212 - Sebastian Rudolph, Markus Krötzsch:
Flag & check: data access with monadically defined queries. PODS 2013: 151-162 - Jef Wijsen:
Charting the tractability frontier of certain conjunctive query answering. PODS 2013: 189-200 - Limsoon Wong:
A dichotomy in the intensional expressive power of nested relational calculi augmented with aggregate functions and a powerset operator. PODS 2013: 285-296 - Richard Hull, Wenfei Fan:
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, USA - June 22 - 27, 2013. ACM 2013, ISBN 978-1-4503-2066-5 [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-05-03 04:16 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