default search action
Cem Okulmus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Georg Gottlob
, Matthias Lanzinger
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. ACM Trans. Database Syst. 49(1): 1:1-1:43 (2024) - [c9]Timotheus Kampik
Expressive Power and Complexity Results for SIGNAL, an Industry-Scale Process Query Language. BPM (Forum) 2024: 3-19 - [c8]Bianca Löhnert, Nikolaus Augsten, Cem Okulmus, Magdalena Ortiz:
Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite (Extended Abstract). Description Logics 2024 - [i6]Bianca Löhnert, Nikolaus Augsten, Cem Okulmus, Magdalena Ortiz:
Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite. CoRR abs/2405.18181 (2024) - 2023
- [c7]Diego Calvanese, Cem Okulmus, Magdalena Ortiz, Mantas Simkus
On the Way to Temporal OBDA Systems (short paper). AMW 2023 - [c6]Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler, Alexander Selzer:
Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization (short paper). AMW 2023 - [c5]Nikola Dragovic, Cem Okulmus, Magdalena Ortiz:
Rewriting Ontology-Mediated Navigational Queries into Cypher. Description Logics 2023 - [i5]Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler, Alexander Selzer:
Structure-Guided Query Evaluation: Towards Bridging the Gap from Theory to Practice. CoRR abs/2303.02723 (2023) - [i4]Timotheus Kampik, Cem Okulmus:
Expressivity and Complexity of the Conjunctive Core of the SIGNAL Process Query Language. CoRR abs/2310.14939 (2023) - 2022
- [j2]Georg Gottlob
Fast and parallel decomposition of constraint satisfaction problems. Constraints An Int. J. 27(3): 284-326 (2022) - [j1]Georg Gottlob
Incremental Updates of Generalized Hypertree Decompositions. ACM J. Exp. Algorithmics 27: 1.16:1-1.16:28 (2022) - [c4]Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler:
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. PODS 2022: 325-336 - [i3]Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus:
Incremental Updates of Generalized Hypertree Decompositions. CoRR abs/2209.10375 (2022) - 2021
- [i2]Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler:
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. CoRR abs/2104.13793 (2021) - 2020
- [c3]Georg Gottlob
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. CPAIOR 2020: 3-21 - [c2]Georg Gottlob, Cem Okulmus, Reinhard Pichler:
Fast and Parallel Decomposition of Constraint Satisfaction Problems. IJCAI 2020: 1155-1162 - [i1]Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler:
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. CoRR abs/2012.14762 (2020)
2010 – 2019
- 2019
- [c1]Georg Gottlob, Cem Okulmus, Reinhard Pichler:
Parallel Computation of Generalized Hypertree Decompositions. AMW 2019
Coauthor Index
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.
last updated on 2024-10-23 21:27 CEST 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: