Nofar Carmeli

Orcid: 0000-0003-0673-5510

Affiliations:
  • École Normale Supérieure (ENS), Paris, France


According to our database1, Nofar Carmeli authored at least 25 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
PACMMOD, V2, N5 (PODS), November 2024 Editorial.
Proc. ACM Manag. Data, November, 2024

Database Repairing with Soft Functional Dependencies.
ACM Trans. Database Syst., June, 2024

Direct Access for Answers to Conjunctive Queries with Aggregation.
Proceedings of the 27th International Conference on Database Theory, 2024

2023
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries.
ACM Trans. Database Syst., March, 2023

Efficient Computation of Quantiles over Joins.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

Accessing Answers to Conjunctive Queries with Ideal Time Guarantees (Abstract of Invited Talk).
Proceedings of the 36th International Workshop on Description Logics (DL 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning (KR 2023 and NMR 2023)., 2023

Answering Aggregate Queries with Ordered Direct Access (short paper).
Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023), 2023

2022
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration.
ACM Trans. Database Syst., 2022

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries.
CoRR, 2022

Conjunctive queries with self-joins, towards a fine-grained complexity analysis.
CoRR, 2022

Tight Fine-Grained Bounds for Direct Access on Join Queries.
Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Answering Unions of Conjunctive Queries with Ideal Time Guarantees (Invited Talk).
Proceedings of the 25th International Conference on Database Theory, 2022

2021
On the Enumeration Complexity of Unions of Conjunctive Queries.
ACM Trans. Database Syst., 2021

Efficiently enumerating minimal triangulations.
Discret. Appl. Math., 2021

Constructing Explainable Opinion Graphs from Reviews.
Proceedings of the WWW '21: The Web Conference 2021, 2021

Tuple-Independent Representations of Infinite Probabilistic Databases.
Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

2020
The Power of Implicit Acyclicity in the Enumeration Complexity of Database Queries.
PhD thesis, 2020

Enumeration Complexity of Conjunctive Queries with Functional Dependencies.
Theory Comput. Syst., 2020

ExplainIt: Explainable Review Summarization with Opinion Causality Graphs.
CoRR, 2020

ExtremeReader: An interactive explorer for customizable and explainable review summarization.
Proceedings of the Companion of The 2020 Web Conference 2020, 2020

Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration.
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

2017
Efficiently Enumerating Minimal Triangulations.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

2016
On the Enumeration of all Minimal Triangulations.
CoRR, 2016

On the Enumeration of Tree Decompositions.
Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, 2016


  Loading...