default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNofar Carmeli
Person information
- affiliation: École Normale Supérieure (ENS), Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
Books and Theses
- 2020
[b1]Nofar Carmeli:
The Power of Implicit Acyclicity in the Enumeration Complexity of Database Queries. Technion - Israel Institute of Technology, Israel, 2020
Journal Articles
- 2026
- [j14]Florent Capelli
, Nofar Carmeli, Oliver Irwin, Sylvain Salvati:
Direct Access for Conjunctive Queries with Negations. Log. Methods Comput. Sci. 22(1) (2026) - [j13]Idan Eldar, Nofar Carmeli, Benny Kimelfeld:
Direct Access for Answers to Conjunctive Queries with Aggregation. Log. Methods Comput. Sci. 22(2) (2026) - [j12]Nofar Carmeli, Nikolaos Tziavelis:
Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum. Proc. ACM Manag. Data 4(2): 103:1-103:25 (2026) - [j11]Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke:
Tuple-Independent Representations of Infinite Probabilistic Databases. ACM Trans. Database Syst. 51(3): 13:1-13:45 (2026) - 2025
- [j10]Karl Bringmann, Nofar Carmeli:
Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries. Log. Methods Comput. Sci. 21(1) (2025) - [j9]Nofar Carmeli, Floris Geerts, Ahmet Kara, Benny Kimelfeld:
PACMMOD, V3, N2 (PODS), May 2025 Editorial. Proc. ACM Manag. Data 3(2): 87:1-87:4 (2025) - [j8]Karl Bringmann, Nofar Carmeli, Stefan Mengel:
Tight Fine-Grained Bounds for Direct Access on Join Queries. ACM Trans. Database Syst. 50(1): 1:1-1:44 (2025) - 2024
- [j7]Nofar Carmeli, Floris Geerts, Benny Kimelfeld:
PACMMOD, V2, N5 (PODS), November 2024 Editorial. Proc. ACM Manag. Data 2(5): 207:1-207:3 (2024) - [j6]Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, Muhammad Tibi:
Database Repairing with Soft Functional Dependencies. ACM Trans. Database Syst. 49(2): 8:1-8:34 (2024) - 2023
- [j5]Nofar Carmeli, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald:
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries. ACM Trans. Database Syst. 48(1): 1:1-1:45 (2023) - 2022
- [j4]Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Alessio Conte, Benny Kimelfeld, Nicole Schweikardt:
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. ACM Trans. Database Syst. 47(3): 9:1-9:49 (2022) - 2021
- [j3]Nofar Carmeli, Batya Kenig, Benny Kimelfeld, Markus Kröll:
Efficiently enumerating minimal triangulations. Discret. Appl. Math. 303: 216-236 (2021) - [j2]Nofar Carmeli, Markus Kröll:
On the Enumeration Complexity of Unions of Conjunctive Queries. ACM Trans. Database Syst. 46(2): 5:1-5:41 (2021) - 2020
- [j1]Nofar Carmeli, Markus Kröll:
Enumeration Complexity of Conjunctive Queries with Functional Dependencies. Theory Comput. Syst. 64(5): 828-860 (2020)
Conference and Workshop Papers
- 2026
- [c18]Florent Capelli, Nofar Carmeli, Alessio Conte, Benny Kimelfeld, Reinhard Pichler, Nikolaos Tziavelis:
Enumeration Theory through the Lens of Database Challenges. PODS Companion 2026: 20-35 - 2024
- [c17]Idan Eldar, Nofar Carmeli, Benny Kimelfeld:
Direct Access for Answers to Conjunctive Queries with Aggregation. ICDT 2024: 4:1-4:20 - 2023
- [c16]Idan Eldar, Nofar Carmeli, Benny Kimelfeld:
Answering Aggregate Queries with Ordered Direct Access (short paper). AMW 2023 - [c15]Nofar Carmeli:
Accessing Answers to Conjunctive Queries with Ideal Time Guarantees (Abstract of Invited Talk). Description Logics 2023 - [c14]Nofar Carmeli, Luc Segoufin:
Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis. PODS 2023: 277-289 - [c13]Nikolaos Tziavelis, Nofar Carmeli, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald:
Efficient Computation of Quantiles over Joins. PODS 2023: 303-315 - 2022
- [c12]Nofar Carmeli:
Answering Unions of Conjunctive Queries with Ideal Time Guarantees (Invited Talk). ICDT 2022: 3:1-3:1 - [c11]Karl Bringmann, Nofar Carmeli, Stefan Mengel:
Tight Fine-Grained Bounds for Direct Access on Join Queries. PODS 2022: 427-436 - 2021
- [c10]Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, Muhammad Tibi:
Database Repairing with Soft Functional Dependencies. ICDT 2021: 16:1-16:17 - [c9]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 - [c8]Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke:
Tuple-Independent Representations of Infinite Probabilistic Databases. PODS 2021: 388-401 - [c7]Nofar Carmeli, Xiaolan Wang, Yoshihiko Suhara, Stefanos Angelidis, Yuliang Li, Jinfeng Li, Wang-Chiew Tan:
Constructing Explainable Opinion Graphs from Reviews. WWW 2021: 3419-3431 - 2020
- [c6]Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Benny Kimelfeld, Nicole Schweikardt:
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. PODS 2020: 393-409 - [c5]Xiaolan Wang, Yoshihiko Suhara, Natalie Nuno, Yuliang Li, Jinfeng Li, Nofar Carmeli, Stefanos Angelidis, Eser Kandogann, Wang-Chiew Tan:
ExtremeReader: An interactive explorer for customizable and explainable review summarization. WWW (Companion Volume) 2020: 176-180 - 2019
- [c4]Nofar Carmeli, Markus Kröll:
On the Enumeration Complexity of Unions of Conjunctive Queries. PODS 2019: 134-148 - 2018
- [c3]Nofar Carmeli, Markus Kröll:
Enumeration Complexity of Conjunctive Queries with Functional Dependencies. ICDT 2018: 11:1-11:17 - 2017
- [c2]Nofar Carmeli, Batya Kenig, Benny Kimelfeld:
Efficiently Enumerating Minimal Triangulations. PODS 2017: 273-287 - 2016
- [c1]Nofar Carmeli, Batya Kenig, Benny Kimelfeld:
On the Enumeration of Tree Decompositions. AMW 2016
Editorship
- 2027
- [e1]Felix Naumann, Senjuti Basu Roy, Pierre Bourhis, Nofar Carmeli, Fabian Panse, Suraj Shetiya:
Proceedings 30th International Conference on Extending Database Technology, EDBT 2027, Lille, France, April 6-9, 2027. OpenProceedings.org 2027, ISBN 978-3-89318-106-3 [contents]
Informal and Other Publications
- 2026
- [i16]Nofar Carmeli, Carsten Lutz, Marcin Przybylko:
Let's Play Tag: Linear Time Evaluation of Conjunctive Queries under TGD Constraints. CoRR abs/2603.18709 (2026) - [i15]Florent Capelli, Nofar Carmeli, Stefan Mengel:
Lexicographic Direct Access with Functional Dependencies. CoRR abs/2607.13875 (2026) - 2025
- [i14]Nofar Carmeli, Nikolaos Tziavelis:
Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum. CoRR abs/2510.19197 (2025) - 2023
- [i13]Idan Eldar, Nofar Carmeli, Benny Kimelfeld:
Direct Access for Answers to Conjunctive Queries with Aggregation. CoRR abs/2303.05327 (2023) - [i12]Nikolaos Tziavelis, Nofar Carmeli, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald:
Efficient Computation of Quantiles over Joins. CoRR abs/2305.16525 (2023) - 2022
- [i11]Karl Bringmann, Nofar Carmeli, Stefan Mengel:
Tight Fine-Grained Bounds for Direct Access on Join Queries. CoRR abs/2201.02401 (2022) - [i10]Nofar Carmeli, Luc Segoufin:
Conjunctive queries with self-joins, towards a fine-grained complexity analysis. CoRR abs/2206.04988 (2022) - [i9]Karl Bringmann, Nofar Carmeli:
Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries. CoRR abs/2210.11996 (2022) - 2020
- [i8]Nofar Carmeli, Xiaolan Wang, Yoshihiko Suhara, Stefanos Angelidis, Yuliang Li, Jinfeng Li, Wang-Chiew Tan:
ExplainIt: Explainable Review Summarization with Opinion Causality Graphs. CoRR abs/2006.00119 (2020) - [i7]Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke:
Tuple-Independent Representations of Infinite Probabilistic Databases. CoRR abs/2008.09511 (2020) - [i6]Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, Muhammad Tibi:
Database Repairing with Soft Functional Dependencies. CoRR abs/2009.13821 (2020) - [i5]Nofar Carmeli, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald:
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries. CoRR abs/2012.11965 (2020) - 2019
- [i4]Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Benny Kimelfeld, Nicole Schweikardt:
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. CoRR abs/1912.10704 (2019) - 2018
- [i3]Nofar Carmeli, Markus Kröll:
Enumeration Complexity of Unions of Conjunctive Queries. CoRR abs/1812.03831 (2018) - 2017
- [i2]Nofar Carmeli, Markus Kröll:
Enumeration Complexity of Conjunctive Queries with Functional Dependencies. CoRR abs/1712.07880 (2017) - 2016
- [i1]Nofar Carmeli, Batya Kenig, Benny Kimelfeld:
On the Enumeration of all Minimal Triangulations. CoRR abs/1604.02833 (2016)
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 2026-08-18 00:17 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
