Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Kenig, Batya
25  Ergebnisse:
Personensuche X
?
1

Quantifying the Loss of Acyclic Join Dependencies:

, In: Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,
Kenig, Batya ; Weinberger, Nir - p. 329-338 , 2023
Link: https://dl.acm.org/doi/1..
 
?
2

Integrity Constraints Revisited: From Exact to Approximate ..:

Kenig, Batya ; Suciu, Dan
Logical Methods in Computer Science.  18, Issue 1 (2022)  - p. , 2022
Link: https://doi.org/10.46298..
 
?
3

Efficiently enumerating minimal triangulations:

Carmeli, Nofar ; Kenig, Batya ; Kimelfeld, Benny.
Discrete Applied Mathematics.  303 (2021)  - p. 216-236 , 2021
Link: https://doi.org/10.1016/..
 
?
4

A Dichotomy for the Generalized Model Counting Problem for ..:

, In: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,
Kenig, Batya ; Suciu, Dan - p. 312-324 , 2021
Link: https://dl.acm.org/doi/1..
 
?
5

Mining Approximate Acyclic Schemes from Relations:

, In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data,
Kenig, Batya ; Mundra, Pranay ; Prasaad, Guna.. - p. 297-312 , 2020
Link: https://dl.acm.org/doi/1..
 
?
6

The Complexity of the Possible Winner Problem with Partitio..:

, In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems,
Kenig, Batya - p. 2051-2053 , 2019
Link: https://dl.acm.org/doi/1..
 
?
7

A Query Engine for Probabilistic Preferences:

, In: Proceedings of the 2018 International Conference on Management of Data,
Cohen, Uzi ; Kenig, Batya ; Ping, Haoyue.. - p. 1509-1524 , 2018
Link: https://dl.acm.org/doi/1..
 
?
8

Querying Probabilistic Preferences in Databases:

, In: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,
Kenig, Batya ; Kimelfeld, Benny ; Ping, Haoyue. - p. 21-36 , 2017
Link: https://dl.acm.org/doi/1..
 
?
9

Efficiently Enumerating Minimal Triangulations:

, In: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,
Carmeli, Nofar ; Kenig, Batya ; Kimelfeld, Benny - p. 273-287 , 2017
Link: https://dl.acm.org/doi/1..
 
?
10

MFIBlocks: An effective blocking algorithm for entity resol..:

Kenig, Batya ; Gal, Avigdor
Information Systems.  38 (2013)  6 - p. 908-926 , 2013
Link: https://doi.org/10.1016/..
 
?
11

A practical approximation algorithm for optimal k-anonymity:

Kenig, Batya ; Tassa, Tamir
Data Mining and Knowledge Discovery.  25 (2011)  1 - p. 134-168 , 2011
Link: https://doi.org/10.1007/..
 
?
12

Approximate Implication for Probabilistic Graphical Models:

Kenig, Batya
http://arxiv.org/abs/2310.13942.  , 2023
Link: http://arxiv.org/abs/231..
 
?
13

Listing Small Minimal $s,t$-separators in FPT-Delay:

Kenig, Batya
http://arxiv.org/abs/2307.00604.  , 2023
Link: http://arxiv.org/abs/230..
 
?
14

Quantifying the Loss of Acyclic Join Dependencies:

Kenig, Batya ; Weinberger, Nir
http://arxiv.org/abs/2210.14572.  , 2022
Link: http://arxiv.org/abs/221..
 
?
15

Enumerating Minimal Separators in Ranked Order:

Kenig, Batya
http://arxiv.org/abs/2111.07647.  , 2021
Link: http://arxiv.org/abs/211..
 
1-15