Остановите войну!
for scientists:
default search action
Yuval Rabani
- > Home > Persons > Yuval Rabani
Publications
- 2022
- [j44]Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat:
A refined approximation for Euclidean k-means. Inf. Process. Lett. 176: 106251 (2022) - 2021
- [c68]Sandip Banerjee, Rafail Ostrovsky, Yuval Rabani:
Min-Sum Clustering (With Outliers). APPROX-RANDOM 2021: 16:1-16:16 - [i23]Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat:
A Refined Approximation for Euclidean k-Means. CoRR abs/2107.07358 (2021) - 2020
- [i18]Sandip Banerjee, Rafail Ostrovsky, Yuval Rabani:
Min-Sum Clustering (with Outliers). CoRR abs/2011.12169 (2020) - 2018
- [c62]Rafail Ostrovsky, Yuval Rabani, Arman Yousefi:
Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration. ICALP 2018: 93:1-93:11 - 2017
- [c60]Rafail Ostrovsky, Yuval Rabani, Arman Yousefi:
Matrix Balancing in Lp Norms: Bounding the Convergence Rate of Osborne's Iteration. SODA 2017: 154-169 - [i14]Rafail Ostrovsky, Yuval Rabani, Arman Yousefi:
Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration. CoRR abs/1704.07406 (2017) - 2016
- [i11]Rafail Ostrovsky, Yuval Rabani, Arman Yousefi:
Matrix Balancing in Lp Norms: A New Analysis of Osborne's Iteration. CoRR abs/1606.08083 (2016) - 2012
- [j39]Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
The effectiveness of lloyd-type methods for the k-means problem. J. ACM 59(6): 28:1-28:22 (2012) - [c53]Alfonso Cevallos, Serge Fehr, Rafail Ostrovsky, Yuval Rabani:
Unconditionally-Secure Robust Secret Sharing with Compact Shares. EUROCRYPT 2012: 195-208 - 2010
- [i4]Vladimir Braverman, Rafail Ostrovsky, Yuval Rabani:
Rademacher Chaos, Random Eulerian Graphs and The Sparse Johnson-Lindenstrauss Transform. CoRR abs/1011.2590 (2010) - 2009
- [j30]Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman:
Error-correcting codes for automatic control. IEEE Trans. Inf. Theory 55(7): 2931-2941 (2009) - 2007
- [j29]Rafail Ostrovsky, Yuval Rabani:
Low distortion embeddings for edit distance. J. ACM 54(5): 23 (2007) - 2006
- [j26]Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani:
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. Math. Oper. Res. 31(4): 730-738 (2006) - [c43]Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
The Effectiveness of Lloyd-Type Methods for the k-Means Problem. FOCS 2006: 165-176 - 2005
- [c38]Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman:
Error-Correcting Codes for Automatic Control. FOCS 2005: 309-316 - [c36]Rafail Ostrovsky, Yuval Rabani:
Low distortion embeddings for edit distance. STOC 2005: 218-224 - 2004
- [j23]Allan Borodin, Rafail Ostrovsky, Yuval Rabani:
Stability Preserving Transformations: Packet Routing Networks with Edge Capacities and Speeds. J. Interconnect. Networks 5(1): 1-12 (2004) - [j22]Allan Borodin, Rafail Ostrovsky, Yuval Rabani:
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces. Mach. Learn. 56(1-3): 153-167 (2004) - 2002
- [j20]Rafail Ostrovsky, Yuval Rabani:
Polynomial-time approximation schemes for geometric min-sum median clustering. J. ACM 49(2): 139-156 (2002) - 2001
- [c29]Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani:
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. FOCS 2001: 348-356 - [c26]Allan Borodin, Rafail Ostrovsky, Yuval Rabani:
Stability preserving transformations: packet routing networks with edge capacities and speeds. SODA 2001: 601-610 - 2000
- [j15]Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani:
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. SIAM J. Comput. 30(2): 457-474 (2000) - [c24]Rafail Ostrovsky, Yuval Rabani:
Polynomial Time Approximation Schemes for Geometric k-Clustering. FOCS 2000: 349-358 - 1999
- [c21]Allan Borodin, Rafail Ostrovsky, Yuval Rabani:
Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems. STOC 1999: 312-321 - [c20]Allan Borodin, Rafail Ostrovsky, Yuval Rabani:
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces. STOC 1999: 435-444 - 1998
- [c17]Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani:
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. STOC 1998: 614-623 - 1997
- [c16]Rafail Ostrovsky, Yuval Rabani:
Universal O(Congestion + Dilation + log1+epsilonN) Local Control Packet Switching Algorithms. STOC 1997: 644-653
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-04-21 17:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint