Batya Kenig

Publication Activity (10 Years)

Years Active: 2012-2023
Publications (10 Years): 26

Top Topics

Join Dependencies

Probabilistic Inference

Top Venues

Publications

Batya Kenig
Approximate Implication for Probabilistic Graphical Models. CoRR (2023)
Batya Kenig, Nir Weinberger
Quantifying the Loss of Acyclic Join Dependencies. PODS (2023)
Batya Kenig
Ranked Enumeration of Minimal Separators. CoRR (2023)
Batya Kenig, Nir Weinberger
Quantifying the Loss of Acyclic Join Dependencies. CoRR (2022)
Batya Kenig, Dan Suciu
Integrity Constraints Revisited: From Exact to Approximate Implication. Log. Methods Comput. Sci. 18 (1) (2022)
Batya Kenig
Approximate implication with d-separation. UAI (2021)
Batya Kenig
Approximate Implication with d-Separation. CoRR (2021)
Nofar Carmeli, Batya Kenig, Benny Kimelfeld, Markus Kröll
Efficiently enumerating minimal triangulations. Discret. Appl. Math. 303 (2021)
Batya Kenig, Dan Suciu
A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries. PODS (2021)
Batya Kenig
Enumerating Minimal Separators in Ranked Order. CoRR (2021)
Batya Kenig, Pranay Mundra, Guna Prasaad, Babak Salimi, Dan Suciu
Mining Approximate Acyclic Schemes from Relations. SIGMOD Conference (2020)
Batya Kenig, Dan Suciu
A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries. CoRR (2020)
Batya Kenig, Dan Suciu
Integrity Constraints Revisited: From Exact to Approximate Implication. ICDT (2020)
Batya Kenig, Benny Kimelfeld
Approximate Inference of Outcomes in Probabilistic Elections. AAAI (2019)
Batya Kenig, Pranay Mundra, Guna Prasaad, Babak Salimi, Dan Suciu
Mining Approximate Acyclic Schemes from Relations. CoRR (2019)
Batya Kenig
The Complexity of the Possible Winner Problem with Partitioned Preferences. AAMAS (2019)
Batya Kenig
The Complexity of the Possible Winner Problem over Partitioned Preferences. CoRR (2018)
Uzi Cohen, Batya Kenig, Haoyue Ping, Benny Kimelfeld, Julia Stoyanovich
A Query Engine for Probabilistic Preferences. SIGMOD Conference (2018)
Batya Kenig, Lovro Ilijasic, Haoyue Ping, Benny Kimelfeld, Julia Stoyanovich
Probabilistic Inference Over Repeated Insertion Models. AAAI (2018)
Batya Kenig, Dan Suciu
Integrity Constraints Revisited: From Exact to Approximate Implication. CoRR (2018)
Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich
Querying Probabilistic Preferences in Databases. PODS (2017)
Nofar Carmeli, Batya Kenig, Benny Kimelfeld
Efficiently Enumerating Minimal Triangulations. PODS (2017)
Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich
A Database Framework for Probabilistic Preferences. AMW (2017)
Batya Kenig, Avigdor Gal
Exploiting the Hidden Structure of Junction Trees for MPE. AAAI Workshop: Beyond NP (2016)
Nofar Carmeli, Batya Kenig, Benny Kimelfeld
On the Enumeration of Tree Decompositions. AMW (2016)
Nofar Carmeli, Batya Kenig, Benny Kimelfeld
On the Enumeration of all Minimal Triangulations. CoRR (2016)
Batya Kenig, Avigdor Gal
On the Impact of Junction-Tree Topology on Weighted Model Counting. SUM (2015)
Batya Kenig, Avigdor Gal, Ofer Strichman
A New Class of Lineage Expressions over Probabilistic Databases Computable in P-Time. SUM (2013)
Batya Kenig, Avigdor Gal
MFIBlocks: An effective blocking algorithm for entity resolution. Inf. Syst. 38 (6) (2013)
Batya Kenig, Tamir Tassa
A practical approximation algorithm for optimal k-anonymity. Data Min. Knowl. Discov. 25 (1) (2012)