default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOra Nova Fandina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]Ora Nova Fandina, Leshem Choshen, Eitan Farchi, George Kour, Yotam Perlitz, Orna Raz:
Can You Trust Your Metric? Automatic Concatenation-Based Tests for Metric Validity. CoRR abs/2408.12259 (2024)- [i8]Yair Bartal, Ora Nova Fandina, Seeun William Umboh:
Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds. CoRR abs/2408.16298 (2024) - [i7]George Kour, Naama Zwerdling, Marcel Zalmanovici, Ateret Anaby-Tavor, Ora Nova Fandina, Eitan Farchi:
Exploring Straightforward Conversational Red-Teaming. CoRR abs/2409.04822 (2024) - 2023
- [c9]Ora Nova Fandina, Mikael Møller Høgsgaard, Kasper Green Larsen:
The Fast Johnson-Lindenstrauss Transform Is Even Faster. ICML 2023: 9689-9715 - [c8]Ora Nova Fandina, Mikael Møller Høgsgaard, Kasper Green Larsen:
Barriers for Faster Dimensionality Reduction. STACS 2023: 31:1-31:15 - [i6]George Kour, Marcel Zalmanovici, Naama Zwerdling, Esther Goldbraich, Ora Nova Fandina, Ateret Anaby-Tavor, Orna Raz, Eitan Farchi:
Unveiling Safety Vulnerabilities of Large Language Models. CoRR abs/2311.04124 (2023) - 2022
- [j2]Yair Bartal, Ora Nova Fandina
, Ofer Neiman:
Covering metric spaces by few trees. J. Comput. Syst. Sci. 130: 26-42 (2022) - [c7]Yair Bartal, Ora Nova Fandina, Kasper Green Larsen:
Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures. SoCG 2022: 13:1-13:16 - [i5]Ora Nova Fandina, Mikael Møller Høgsgaard, Kasper Green Larsen:
The Fast Johnson-Lindenstrauss Transform is Even Faster. CoRR abs/2204.01800 (2022) - [i4]Ora Nova Fandina, Mikael Møller Høgsgaard, Kasper Green Larsen:
Barriers for Faster Dimensionality Reduction. CoRR abs/2207.03304 (2022) - 2021
- [i3]Yair Bartal, Ora Nova Fandina, Kasper Green Larsen:
Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures. CoRR abs/2107.06626 (2021) - 2020
- [b1]Ora Nova Fandina:
Resource Parameterized Metric Embedding (כותר נוסף בעברית: שיכונים מטריים בעלי משאבים מוגבלים). Hebrew University of Jerusalem, Israel, 2020 - [c6]Yair Bartal, Nova Fandina, Seeun William Umboh:
Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds. SODA 2020: 1538-1557
2010 – 2019
- 2019
- [c5]Yair Bartal, Nova Fandina, Ofer Neiman:
Covering Metric Spaces by Few Trees. ICALP 2019: 20:1-20:16 - [c4]Yair Bartal, Nova Fandina, Ofer Neiman:
Dimensionality reduction: theoretical perspective on practical measures. NeurIPS 2019: 10576-10588 - [i2]Yair Bartal, Nova Fandina, Ofer Neiman:
Covering Metric Spaces by Few Trees. CoRR abs/1905.07559 (2019) - 2015
- [j1]Shlomi Dolev, Nova Fandina, Joseph Rosen:
Holographic parallel processor for calculating Kronecker product. Nat. Comput. 14(3): 433-436 (2015) - 2013
- [c3]Shlomi Dolev, Nova Fandina, Dan Gutfreund:
Succinct Permanent Is NEXP-Hard with Many Hard Instances. CIAC 2013: 183-196 - 2012
- [c2]Shlomi Dolev, Nova Fandina, Ximing Li:
Nested Merkle's Puzzles against Sampling Attacks. Inscrypt 2012: 157-174 - [i1]Shlomi Dolev, Nova Fandina, Dan Gutfreund:
Succinct Permanent is NEXP-hard with Many Hard Instances. Electron. Colloquium Comput. Complex. TR12 (2012) - 2010
- [c1]Shlomi Dolev, Nova Fandina, Joseph Rosen:
Holographic Computation of Balanced Succinct Permanent Instances. OSC 2010: 100-112
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-10-10 21:13 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:
