Communication Efficient Algorithms for Bounding and Approximating the Empirical Entropy in Distributed Systems. - Amit Shahar; Yuval Alfassi; Daniel Keren (Entropy, 2022)

A Fast and Reliable Solution to PnP, Using Polynomial Homogeneity and a Theorem of Hilbert. - Daniel Keren; Margarita Osadchy; Amit Shahar (Sensors, 2023)

Efficient Polynomial Sum-Of-Squares Programming for Planar Robotic Arms. - Daniel Keren; Amit Shahar; Roi Poranne (ICRA, 2024)

Privacy Preserving Epigenetic PaceMaker: Stronger Privacy and Improved Efficiency. - Meir Goldenberg; Loay Mualem; Amit Shahar; Sagi Snir; Adi Akavia (RECOMB, 2024)

Geometric covering using random fields. - Amit Shahar; Daniel Keren; Felipe Goncalves; Gal Yehuda (Theor. Comput. Sci., 2025)