| On the enumeration complexity of unions of conjunctive queries N Carmeli, M Kröll ACM Transactions on Database Systems (TODS) 46 (2), 1-41, 2021 | 47 | 2021 |
| Enumeration complexity of conjunctive queries with functional dependencies N Carmeli, M Kröll Theory of Computing Systems 64 (5), 828-860, 2020 | 35 | 2020 |
| Answering (unions of) conjunctive queries using random access and random-order enumeration N Carmeli, S Zeevi, C Berkholz, B Kimelfeld, N Schweikardt Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2020 | 27 | 2020 |
| Efficiently enumerating minimal triangulations N Carmeli, B Kenig, B Kimelfeld Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2017 | 25 | 2017 |
| Tractable orders for direct access to ranked answers of conjunctive queries N Carmeli, N Tziavelis, W Gatterbauer, B Kimelfeld, M Riedewald ACM Transactions on Database Systems 48 (1), 1-45, 2023 | 23 | 2023 |
| Answering (unions of) conjunctive queries using random access and random-order enumeration N Carmeli, S Zeevi, C Berkholz, A Conte, B Kimelfeld, N Schweikardt ACM Transactions on Database Systems (TODS) 47 (3), 1-49, 2022 | 11 | 2022 |
| ExtremeReader: An interactive explorer for customizable and explainable review summarization X Wang, Y Suhara, N Nuno, Y Li, J Li, N Carmeli, S Angelidis, ... Companion Proceedings of the Web Conference 2020, 176-180, 2020 | 11 | 2020 |
| Unbalanced triangle detection and enumeration hardness for unions of conjunctive queries K Bringmann, N Carmeli arXiv preprint arXiv:2210.11996, 2022 | 8 | 2022 |
| Tight fine-grained bounds for direct access on join queries K Bringmann, N Carmeli, S Mengel Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022 | 8 | 2022 |
| Conjunctive queries with self-joins, towards a fine-grained enumeration complexity analysis N Carmeli, L Segoufin Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2023 | 7 | 2023 |
| Tuple-independent representations of infinite probabilistic databases N Carmeli, M Grohe, P Lindner, C Standke Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2021 | 7 | 2021 |
| Constructing explainable opinion graphs from reviews N Carmeli, X Wang, Y Suhara, S Angelidis, Y Li, J Li, WC Tan Proceedings of the Web Conference 2021, 3419-3431, 2021 | 6* | 2021 |
| Conjunctive queries with self-joins, towards a fine-grained complexity analysis N Carmeli, L Segoufin arXiv preprint arXiv:2206.04988, 2022 | 4 | 2022 |
| Direct access for answers to conjunctive queries with aggregation I Eldar, N Carmeli, B Kimelfeld arXiv preprint arXiv:2303.05327, 2023 | 3 | 2023 |
| Database repairing with soft functional dependencies N Carmeli, M Grohe, B Kimelfeld, E Livshits, M Tibi ACM Transactions on Database Systems, 2021 | 2 | 2021 |
| Efficient Computation of Quantiles over Joins N Tziavelis, N Carmeli, W Gatterbauer, B Kimelfeld, M Riedewald Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2023 | 1 | 2023 |
| Accessing Answers to Conjunctive Queries with Ideal Time Guarantees N Carmeli | | 2023 |
| Answering Unions of Conjunctive Queries with Ideal Time Guarantees (Invited Talk). N Carmeli ICDT, 3:1-3:1, 2022 | | 2022 |
| Answering Aggregate Queries with Ordered Direct Access I Eldar, N Carmeli, B Kimelfeld | | 2021 |
| The Power of Implicit Acyclicity in the Enumeration Complexity of Database Queries N Carmeli, B Kimelfeld Computer Science Department, Technion, 2020 | | 2020 |
Benny KimelfeldTechnion - Israel Institute of TechnologyVerified email at cs.technion.ac.il
