( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Enumeration of Tree Decompositions.

, , и . AMW, том 1644 из CEUR Workshop Proceedings, CEUR-WS.org, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

No persons found for author name Carmeli, Nofar
add a person with the name Carmeli, Nofar
 

Другие публикации лиц с тем же именем

Enumeration Complexity of Conjunctive Queries with Functional Dependencies., и . Theory Comput. Syst., 64 (5): 828-860 (2020)Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries., , , , и . ACM Trans. Database Syst., 48 (1): 1:1-1:45 (марта 2023)Direct Access for Answers to Conjunctive Queries with Aggregation., , и . ICDT, том 290 из LIPIcs, стр. 4:1-4:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Answering Unions of Conjunctive Queries with Ideal Time Guarantees (Invited Talk).. ICDT, том 220 из LIPIcs, стр. 3:1-3:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Tuple-Independent Representations of Infinite Probabilistic Databases., , , и . PODS, стр. 388-401. ACM, (2021)Efficiently Enumerating Minimal Triangulations., , и . PODS, стр. 273-287. ACM, (2017)The Power of Implicit Acyclicity in the Enumeration Complexity of Database Queries.. Technion - Israel Institute of Technology, Israel, (2020)Tight Fine-Grained Bounds for Direct Access on Join Queries., , и . PODS, стр. 427-436. ACM, (2022)Accessing Answers to Conjunctive Queries with Ideal Time Guarantees (Abstract of Invited Talk).. Description Logics, том 3515 из CEUR Workshop Proceedings, CEUR-WS.org, (2023)Answering Aggregate Queries with Ordered Direct Access (short paper)., , и . AMW, том 3409 из CEUR Workshop Proceedings, CEUR-WS.org, (2023)