default search action
Batya Kenig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i10]Batya Kenig, Dan Shlomo Mizrahi:
Enumeration of Minimal Hitting Sets Parameterized by Treewidth. CoRR abs/2408.15776 (2024) - 2023
- [c16]Batya Kenig
, Nir Weinberger
Quantifying the Loss of Acyclic Join Dependencies. PODS 2023: 329-338 - [i9]Batya Kenig:
Ranked Enumeration of Minimal Separators. CoRR abs/2307.00604 (2023) - [i8]Batya Kenig:
Approximate Implication for Probabilistic Graphical Models. CoRR abs/2310.13942 (2023) - 2022
- [j4]Batya Kenig, Dan Suciu
Integrity Constraints Revisited: From Exact to Approximate Implication. Log. Methods Comput. Sci. 18(1) (2022) - [i7]Batya Kenig, Nir Weinberger:
Quantifying the Loss of Acyclic Join Dependencies. CoRR abs/2210.14572 (2022) - 2021
- [j3]Nofar Carmeli
Efficiently enumerating minimal triangulations. Discret. Appl. Math. 303: 216-236 (2021) - [c15]Batya Kenig, Dan Suciu
A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries. PODS 2021: 312-324 - [c14]Batya Kenig:
Approximate implication with d-separation. UAI 2021: 301-311 - [i6]Batya Kenig:
Approximate Implication with d-Separation. CoRR abs/2105.14463 (2021) - 2020
- [c13]Batya Kenig, Dan Suciu
Integrity Constraints Revisited: From Exact to Approximate Implication. ICDT 2020: 18:1-18:20 - [c12]Batya Kenig, Pranay Mundra
Mining Approximate Acyclic Schemes from Relations. SIGMOD Conference 2020: 297-312 - [i5]Batya Kenig, Dan Suciu:
A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries. CoRR abs/2008.00896 (2020)
2010 – 2019
- 2019
- [c11]Batya Kenig, Benny Kimelfeld:
Approximate Inference of Outcomes in Probabilistic Elections. AAAI 2019: 2061-2068 - [c10]Batya Kenig:
The Complexity of the Possible Winner Problem with Partitioned Preferences. AAMAS 2019: 2051-2053 - [i4]Batya Kenig, Pranay Mundra, Guna Prasaad, Babak Salimi, Dan Suciu:
Mining Approximate Acyclic Schemes from Relations. CoRR abs/1911.12933 (2019) - 2018
- [c9]Batya Kenig, Lovro Ilijasic, Haoyue Ping, Benny Kimelfeld, Julia Stoyanovich:
Probabilistic Inference Over Repeated Insertion Models. AAAI 2018: 1897-1904 - [c8]Uzi Cohen, Batya Kenig, Haoyue Ping, Benny Kimelfeld, Julia Stoyanovich:
A Query Engine for Probabilistic Preferences. SIGMOD Conference 2018: 1509-1524 - [i3]Batya Kenig:
The Complexity of the Possible Winner Problem over Partitioned Preferences. CoRR abs/1802.09001 (2018) - [i2]Batya Kenig, Dan Suciu:
Integrity Constraints Revisited: From Exact to Approximate Implication. CoRR abs/1812.09987 (2018) - 2017
- [c7]Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich:
A Database Framework for Probabilistic Preferences. AMW 2017 - [c6]Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich:
Querying Probabilistic Preferences in Databases. PODS 2017: 21-36 - [c5]Nofar Carmeli, Batya Kenig, Benny Kimelfeld:
Efficiently Enumerating Minimal Triangulations. PODS 2017: 273-287 - 2016
- [c4]Batya Kenig, Avigdor Gal:
Exploiting the Hidden Structure of Junction Trees for MPE. AAAI Workshop: Beyond NP 2016 - [c3]Nofar Carmeli, Batya Kenig, Benny Kimelfeld:
On the Enumeration of Tree Decompositions. AMW 2016 - [i1]Nofar Carmeli, Batya Kenig, Benny Kimelfeld:
On the Enumeration of all Minimal Triangulations. CoRR abs/1604.02833 (2016) - 2015
- [c2]Batya Kenig, Avigdor Gal:
On the Impact of Junction-Tree Topology on Weighted Model Counting. SUM 2015: 83-98 - 2013
- [j2]Batya Kenig, Avigdor Gal:
MFIBlocks: An effective blocking algorithm for entity resolution. Inf. Syst. 38(6): 908-926 (2013) - [c1]Batya Kenig, Avigdor Gal, Ofer Strichman
A New Class of Lineage Expressions over Probabilistic Databases Computable in P-Time. SUM 2013: 219-232 - 2012
- [j1]Batya Kenig, Tamir Tassa:
A practical approximation algorithm for optimal k-anonymity. Data Min. Knowl. Discov. 25(1): 134-168 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 01:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: