Ora Nova Fandina

According to our database, Ora Nova Fandina authored at least 13 papers between 2010 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Unveiling Safety Vulnerabilities of Large Language Models.

George Kour, Marcel Zalmanovici, Naama Zwerdling, Esther Goldbraich, Ora Nova Fandina, Ateret Anaby-Tavor, Orna Raz, Eitan Farchi

CoRR, 2023

Barriers for Faster Dimensionality Reduction.

Ora Nova Fandina, Mikael Møller Høgsgaard, Kasper Green Larsen

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

The Fast Johnson-Lindenstrauss Transform Is Even Faster.

Ora Nova Fandina, Mikael Møller Høgsgaard, Kasper Green Larsen

Proceedings of the International Conference on Machine Learning, 2023

2022

Covering metric spaces by few trees.

Yair Bartal, Ora Nova Fandina, Ofer Neiman

J. Comput. Syst. Sci., 2022

Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures.

Yair Bartal, Ora Nova Fandina, Kasper Green Larsen

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2020

Resource Parameterized Metric Embedding (כותר נוסף בעברית: שיכונים מטריים בעלי משאבים מוגבלים).

Ora Nova Fandina

PhD thesis, 2020

Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds.

Yair Bartal, Nova Fandina, Seeun William Umboh

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Dimensionality reduction: theoretical perspective on practical measures.

Yair Bartal, Nova Fandina, Ofer Neiman

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2015

Holographic parallel processor for calculating Kronecker product.

Shlomi Dolev, Nova Fandina, Joseph Rosen

Nat. Comput., 2015

2013

Succinct Permanent Is <i>NEXP</i>-Hard with Many Hard Instances.

Shlomi Dolev, Nova Fandina, Dan Gutfreund

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

Succinct Permanent is NEXP-hard with Many Hard Instances.

Shlomi Dolev, Nova Fandina, Dan Gutfreund

Electron. Colloquium Comput. Complex., 2012

Nested Merkle's Puzzles against Sampling Attacks.

Shlomi Dolev, Nova Fandina, Ximing Li

Proceedings of the Information Security and Cryptology - 8th International Conference, 2012

2010

Holographic Computation of Balanced Succinct Permanent Instances.

Shlomi Dolev, Nova Fandina, Joseph Rosen

Proceedings of the Optical Supercomputing - Third International Workshop, 2010