Liat Peterfreund, Freydenberger, Dominik D, Kimelfeld, Benny , and Kröll, Markus . 2019. “Complexity Bounds For Relational Algebra Over Document Spanners”. In Proceedings Of The 38Th Acm Sigmod-Sigact-Sigai Symposium On Principles Of Database Systems, Pods 2019, Amsterdam, The Netherlands, June 30 - July 5, 2019, Pp. 320–334. ACM. doi:10.1145/3294052.3319699. Publisher's Version
Liat Peterfreund, Cate, Balder ten, Fagin, Ronald , and Kimelfeld, Benny . 2019. “Recursive Programs For Document Spanners”. In 22Nd International Conference On Database Theory, Icdt 2019, March 26-28, 2019, Lisbon, Portugal, 127:Pp. 13:1–13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. doi:10.4230/LIPICS.ICDT.2019.13. Publisher's Version
2018
Daniel Genkin, Kaminski, Michael , and Peterfreund, Liat . 2018. “Closure Under Reversal Of Languages Over Infinite Alphabets”. In Computer Science - Theory And Applications - 13Th International Computer Science Symposium In Russia, Csr 2018, Moscow, Russia, June 6-10, 2018, Proceedings, 10846:Pp. 145–156. Springer. doi:10.1007/978-3-319-90530-3_13. Publisher's Version
Dominik D Freydenberger, Kimelfeld, Benny , and Peterfreund, Liat . 2018. “Joining Extractions Of Regular Expressions”. In Proceedings Of The 37Th Acm Sigmod-Sigact-Sigai Symposium On Principles Of Database Systems, Houston, Tx, Usa, June 10-15, 2018, Pp. 137–149. ACM. doi:10.1145/3196959.3196967. Publisher's Version
2017
Benny Kimelfeld, Livshits, Ester , and Peterfreund, Liat . 2017. “Detecting Ambiguity In Prioritized Database Repairing”. In 20Th International Conference On Database Theory, Icdt 2017, March 21-24, 2017, Venice, Italy, 68:Pp. 17:1–17:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. doi:10.4230/LIPICS.ICDT.2017.17. Publisher's Version
The Hebrew University websites utilize cookies to enhance user experience and analyze site usage. By continuing to browse these sites, you consent to our use of cookies.