default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuri Rabinovich
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i4]Ilan Newman, Yuri Rabinovich:
Online embedding of metrics. CoRR abs/2303.15945 (2023)- 2022
- [j21]Yuri Rabinovich:
A generalization of the Blind Rotating Table game. Inf. Process. Lett. 176: 106233 (2022) - 2021
- [j20]Rogers Mathew
, Ilan Newman, Yuri Rabinovich, Deepak Rajendraprasad:
Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes. J. Comb. Theory B 150: 119-143 (2021) - 2020
- [c21]Ilan Newman, Yuri Rabinovich:
Online Embedding of Metrics. SWAT 2020: 32:1-32:13
2010 – 2019
- 2019
- [j19]Ilan Newman, Yuri Rabinovich, Deepak Rajendraprasad, Christian Sohler:
Testing for forbidden order patterns in an array. Random Struct. Algorithms 55(2): 402-426 (2019) - [j18]Anastasios Sidiropoulos, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Piotr Indyk, Yuri Rabinovich, Harald Räcke, R. Ravi:
Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces. SIAM J. Discret. Math. 33(1): 454-473 (2019) - 2017
- [c20]Ilan Newman, Yuri Rabinovich, Deepak Rajendraprasad, Christian Sohler:
Testing for Forbidden Order Patterns in an Array. SODA 2017: 1582-1597 - 2014
- [i3]Danny Hermelin, Gad M. Landau, Yuri Rabinovich, Oren Weimann:
Binary Jumbled Pattern Matching via All-Pairs Shortest Paths. CoRR abs/1401.2065 (2014) - 2013
- [j17]Ilan Newman, Yuri Rabinovich:
On Multiplicative Lambda-Approximations and Some Geometric Applications. SIAM J. Comput. 42(3): 855-883 (2013) - [c19]Yuri Rabinovich, Jan Arne Telle, Martin Vatshelle:
Upper Bounds on Boolean-Width with Applications to Exact Algorithms. IPEC 2013: 308-320 - 2012
- [j16]Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès:
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. Discret. Comput. Geom. 47(1): 187-214 (2012) - [j15]Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh S. Vempala:
Local Versus Global Properties of Metric Spaces. SIAM J. Comput. 41(1): 250-271 (2012) - [c18]Ilan Newman, Yuri Rabinovich:
On multiplicative λ-approximations and some geometric applications. SODA 2012: 51-67 - 2010
- [c17]Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès:
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. APPROX-RANDOM 2010: 95-109 - [c16]Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle:
On the Boolean-Width of a Graph: Structure and Applications. WG 2010: 159-170 - [i2]Ilan Newman, Yuri Rabinovich:
On Cut Dimension of ℓ1 Metrics and Volumes, and Related Sparsification Techniques. CoRR abs/1002.3541 (2010) - [i1]Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès:
Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs. CoRR abs/1007.0489 (2010)
2000 – 2009
- 2009
- [j14]Ilan Newman, Yuri Rabinovich:
Hard Metrics from Cayley Graphs of Abelian Groups. Theory Comput. 5(1): 125-134 (2009) - 2008
- [j13]Yuri Rabinovich:
On Average Distortion of Embedding Metrics into the Line. Discret. Comput. Geom. 39(4): 720-733 (2008) - [j12]Shlomo Ahal, Yuri Rabinovich:
On Complexity of the Subpattern Problem. SIAM J. Discret. Math. 22(2): 629-649 (2008) - 2007
- [c15]Ilan Newman, Yuri Rabinovich:
Hard Metrics from Cayley Graphs of Abelian Groups. STACS 2007: 157-162 - 2006
- [j11]Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair:
Embedding k-Outerplanar Graphs into l 1. SIAM J. Discret. Math. 20(1): 119-136 (2006) - [c14]Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh S. Vempala:
Local versus global properties of metric spaces. SODA 2006: 41-50 - 2005
- [c13]Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos:
Approximation algorithms for low-distortion embeddings into low-dimensional spaces. SODA 2005: 119-128 - 2004
- [j10]Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair:
Cuts, Trees and l1-Embeddings of Graphs. Comb. 24(2): 233-269 (2004) - 2003
- [j9]Uriel Feige, Yuri Rabinovich:
Deterministic approximation of the cover time. Random Struct. Algorithms 23(1): 1-22 (2003) - [c12]Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair:
Embedding k-outerplanar graphs into l1. SODA 2003: 527-536 - [c11]Yuri Rabinovich:
On average distortion of embedding metrics into the line and into L1. STOC 2003: 456-462 - 2002
- [c10]Ilan Newman, Yuri Rabinovich:
A lower bound on the distortion of embedding planar metrics into Euclidean space. SCG 2002: 94-96 - 2000
- [c9]Shlomo Ahal, Yuri Rabinovich:
On the Complexity of the Sub-permutation Problem. SWAT 2000: 490-503
1990 – 1999
- 1999
- [j8]Tomás Kaiser, Yuri Rabinovich:
Intersection Properties of Families of Convex (n, d)-Bodies. Discret. Comput. Geom. 21(2): 275-287 (1999) - [j7]Amir Ben-Dor, Anna R. Karlin, Nathan Linial, Yuri Rabinovich:
A Note on the Influence of an epsilon-Biased Random Source. J. Comput. Syst. Sci. 58(1): 174-176 (1999) - [j6]Yuri Rabinovich, Avi Wigderson:
Techniques for bounding the convergence rate of genetic algorithms. Random Struct. Algorithms 14(2): 111-138 (1999) - [c8]Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair:
Cuts, Trees and l1-Embeddings of Graphs. FOCS 1999: 399-409 - 1998
- [j5]Yuri Rabinovich, Ran Raz:
Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs. Discret. Comput. Geom. 19(1): 79-94 (1998) - [j4]Yuval Rabani, Yuri Rabinovich, Alistair Sinclair:
A computational view of population genetics. Random Struct. Algorithms 12(4): 313-334 (1998) - [c7]Aviad Cohen, Yuri Rabinovich, Assaf Schuster, Hadas Shachnai:
Optimal Bounds on Tail Probabilities - A Simplified Approach. IPPS/SPDP Workshops 1998: 341-350 - 1996
- [j3]Eyal Kushilevitz, Nathan Linial, Yuri Rabinovich, Michael E. Saks:
Witness Sets for Families of Binary Vectors. J. Comb. Theory A 73(2): 376-380 (1996) - [c6]Uriel Feige, Yuri Rabinovich:
Deterministic Approximation of the Cover Time. ISTCS 1996: 208-218 - 1995
- [j2]Nathan Linial, Eran London, Yuri Rabinovich:
The Geometry of Graphs and Some of its Algorithmic Applications. Comb. 15(2): 215-245 (1995) - [c5]Yuval Rabani, Yuri Rabinovich, Alistair Sinclair:
A computational view of population genetics. STOC 1995: 83-92 - 1994
- [j1]Nathan Linial, Yuri Rabinovich:
Local and Global Clique Numbers. J. Comb. Theory B 61(1): 5-15 (1994) - [c4]Nathan Linial, Eran London, Yuri Rabinovich:
The geometry of graphs and some of its algorithmic applications. FOCS 1994: 577-591 - 1993
- [b1]Yuri Rabinovich:
Quadratic dynamical systems and theoretical aspects of genetic algorithms (מערכות דינמיות רבועיות והבטים תיאורטיים של אלגוריתמים גנטיים.). Hebrew University of Jerusalem, Israel, 1993 - [c3]Nathan Linial, David Peleg, Yuri Rabinovich, Michael E. Saks:
Sphere Packing and Local Majorities in Graphs. ISTCS 1993: 141-149 - 1992
- [c2]Yuri Rabinovich, Alistair Sinclair, Avi Wigderson:
Quadratic Dynamical Systems (Preliminary Version). FOCS 1992: 304-313 - 1991
- [c1]Yuri Rabinovich, Avi Wigderson:
An Analysis of a Simple Genetic Algorithm. ICGA 1991: 215-221
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 2025-03-04 21:12 CET 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:
