| A practical approximation algorithm for optimal k-anonymity B Kenig, T Tassa Data Mining and Knowledge Discovery 25, 134-168, 2012 | 78 | 2012 |
| MFIBlocks: An effective blocking algorithm for entity resolution B Kenig, A Gal Information Systems 38 (6), 908-926, 2013 | 76 | 2013 |
| Efficiently enumerating minimal triangulations N Carmeli, B Kenig, B Kimelfeld Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2017 | 25 | 2017 |
| Approximate inference of outcomes in probabilistic elections B Kenig, B Kimelfeld Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2061-2068, 2019 | 17 | 2019 |
| Integrity constraints revisited: From exact to approximate implication B Kenig, D Suciu Logical Methods in Computer Science 18, 2022 | 12 | 2022 |
| Mining approximate acyclic schemes from relations B Kenig, P Mundra, G Prasaad, B Salimi, D Suciu Proceedings of the 2020 ACM SIGMOD International Conference on Management of …, 2020 | 11 | 2020 |
| On the impact of junction-tree topology on weighted model counting B Kenig, A Gal Scalable Uncertainty Management: 9th International Conference, SUM 2015 …, 2015 | 11 | 2015 |
| A dichotomy for the generalized model counting problem for unions of conjunctive queries B Kenig, D Suciu Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2021 | 10 | 2021 |
| A new class of lineage expressions over probabilistic databases computable in p-time B Kenig, A Gal, O Strichman Scalable Uncertainty Management: 7th International Conference, SUM 2013 …, 2013 | 10 | 2013 |
| Querying probabilistic preferences in databases B Kenig, B Kimelfeld, H Ping, J Stoyanovich Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2017 | 9 | 2017 |
| The complexity of the possible winner problem with partitioned preferences B Kenig Proceedings of the 18th International Conference on Autonomous Agents and …, 2019 | 7 | 2019 |
| A query engine for probabilistic preferences U Cohen, B Kenig, H Ping, B Kimelfeld, J Stoyanovich Proceedings of the 2018 International Conference on Management of Data, 1509 …, 2018 | 5 | 2018 |
| Probabilistic inference over repeated insertion models B Kenig, L Ilijasić, H Ping, B Kimelfeld, J Stoyanovich Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018 | 5 | 2018 |
| Approximate implication with d-separation B Kenig Uncertainty in Artificial Intelligence, 301-311, 2021 | 2 | 2021 |
| A Database Framework for Probabilistic Preferences. B Kenig, B Kimelfeld, H Ping, J Stoyanovich AMW, 2017 | 1 | 2017 |
| Approximate Implication for Probabilistic Graphical Models B Kenig arXiv preprint arXiv:2310.13942, 2023 | | 2023 |
| Ranked Enumeration of Minimal Separators B Kenig arXiv preprint arXiv:2307.00604, 2023 | | 2023 |
| Quantifying the Loss of Acyclic Join Dependencies B Kenig, N Weinberger Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2023 | | 2023 |
| Enumerating Minimal Separators in Ranked Order B Kenig arXiv preprint arXiv:2111.07647, 2021 | | 2021 |
| The Complexity of the Possible Winner Problem over Partitioned Preferences B Kenig arXiv preprint arXiv:1802.09001, 2018 | | 2018 |
Benny KimelfeldTechnion - Israel Institute of TechnologyDirección de correo verificada de cs.technion.ac.il
