Yuri Rabinovich

发表

Optimal Bounds on Tail Probabilities - A Simplified Approach

Hadas Shachnai, Assaf Schuster, Aviad Cohen, 1998, IPPS/SPDP Workshops.

Testing for Forbidden Order Patterns in an Array

Christian Sohler, Ilan Newman, Yuri Rabinovich, 2017, SODA.

Techniques for bounding the convergence rate of genetic algorithms

Avi Wigderson, Yuri Rabinovich, 1999, Random Struct. Algorithms.

Cuts, Trees and ℓ1-Embeddings of Graphs*

Anupam Gupta, Ilan Newman, Alistair Sinclair, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

On the Complexity of the Sub-permutation Problem

Yuri Rabinovich, Shlomo Ahal, Shlomo Ahal, 2000, SWAT.

The geometry of graphs and some of its algorithmic applications

Nathan Linial, Yuri Rabinovich, Eran London, 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

Quadratic dynamical systems

Avi Wigderson, Alistair Sinclair, Yuri Rabinovich, 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

On multiplicative λ-approximations and some geometric applications

Yuri Rabinovich, Ilan Newman, I. Newman, 2012, SODA.

Upper Bounds on Boolean-Width with Applications to Exact Algorithms

Jan Arne Telle, Martin Vatshelle, Yuri Rabinovich, 2013, IPEC.

An Analysis of a Simple Genetic Algorithm

Avi Wigderson, Yuri Rabinovich, A. Wigderson, 1991, ICGA.

Intersection Properties of Families of Convex (n,d)-Bodies

Yuri Rabinovich, Tomás Kaiser, 1999, Discret. Comput. Geom..

A Lower Bound on the Distortion of Embedding Planar Metrics into Euclidean Space

Ilan Newman, Yuri Rabinovich, I. Newman, 2002, SCG '02.

Hard Metrics from Cayley Graphs of Abelian Groups

Ilan Newman, Yuri Rabinovich, 2009, Theory Comput..

A computational view of population genetics

Yuval Rabani, Alistair Sinclair, Yuri Rabinovich, 1995, Symposium on the Theory of Computing.

Deterministic approximation of the cover time

Uriel Feige, Yuri Rabinovich, U. Feige, 2003, Random Struct. Algorithms.

Binary Jumbled Pattern Matching via All-Pairs Shortest Paths pdf

Gad M. Landau, Danny Hermelin, Oren Weimann, 2014, ArXiv.

On average distortion of embedding metrics into the line and into L1

Yuri Rabinovich, 2003, STOC '03.

On Average Distortion of Embedding Metrics into the Line

Yuri Rabinovich, Y. Rabinovich, 2008, Discret. Comput. Geom..

Online Embedding of Metrics

Yuri Rabinovich, Ilan Newman, I. Newman, 2023, SWAT.

Cuts, Trees and ℓ1-Embeddings of Graphs*

Anupam Gupta, Ilan Newman, Alistair Sinclair, 2004, Comb..

Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs

Ran Raz, Yuri Rabinovich, Yuri Rabinovich, 1998, Discret. Comput. Geom..

On the Boolean-Width of a Graph: Structure and Applications

Gabriel Renault, Jan Arne Telle, Martin Vatshelle, 2009, WG.

A Note on the Influence of an epsilon-Biased Random Source

Anna R. Karlin, Nathan Linial, Yuri Rabinovich, 1999, J. Comput. Syst. Sci..

Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs

Feodor F. Dragan, Victor Chepoi, Ilan Newman, 2010, APPROX-RANDOM.

Quadratic Dynamical Systems (Preliminary Version)

Avi Wigderson, Alistair Sinclair, Yuri Rabinovich, 1992, FOCS 1992.

Sphere packing and local majorities in graphs

Michael E. Saks, Nathan Linial, David Peleg, 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

On Complexity of the Subpattern Problem

Yuri Rabinovich, Shlomo Ahal, Shlomo Ahal, 2008, SIAM J. Discret. Math..

Witness Sets for Families of Binary Vectors

Eyal Kushilevitz, Michael E. Saks, Nathan Linial, 1996, J. Comb. Theory, Ser. A.

Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs

Feodor F. Dragan, Victor Chepoi, Ilan Newman, 2010, APPROX-RANDOM.

On Cut Dimension of ℓ1 Metrics and Volumes, and Related Sparsification Techniques pdf

Ilan Newman, Yuri Rabinovich, Yuri Rabinovich, 2010, arXiv.org.

A computational view of population genetics

Yuval Rabani, Alistair Sinclair, Yuri Rabinovich, 1995, STOC '95.

Hard Metrics from Cayley Graphs of Abelian Groups

Ilan Newman, Yuri Rabinovich, 2007, STACS.

On Multiplicative Lambda-Approximations and Some Geometric Applications

Ilan Newman, Yuri Rabinovich, I. Newman, 2013, SIAM J. Comput..

Embedding k-outerplanar graphs into ℓ1

Anupam Gupta, Ilan Newman, Alistair Sinclair, 2003, SODA '03.

Local and Global Clique Numbers

Nathan Linial, Yuri Rabinovich, 1994, J. Comb. Theory, Ser. B.

Approximation algorithms for low-distortion embeddings into low-dimensional spaces

Mihai Badoiu, Anastasios Sidiropoulos, Anupam Gupta, 2005, SODA '05.

Local versus global properties of metric spaces

Santosh S. Vempala, Yuval Rabani, László Lovász, 2006, SODA '06.

Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes

Ilan Newman, Yuri Rabinovich, Rogers Mathew, 2021, J. Comb. Theory, Ser. B.

A Computational View of Population Genetics ( preliminary version )

Yuval Rabani, Alistair Sinclair, Yuri Rabinovich, 1995 .

Techniques for bounding the convergence rate of genetic algorithms

Avi Wigderson, Yuri Rabinovich, 1999 .

On dominatedl1 metrics

Jiří Matoušek, Yuri Rabinovich, Yuri Rabinovich, 2001 .

Optimal Bounds on Tail Probabilities: A Study of an Approach

Hadas Shachnai, Assaf Schuster, Yuri Rabinovich, 1999 .

Extremal hypercuts and shadows of simplicial complexes

Ilan Newman, Yuri Rabinovich, Yuval Peled, 2014, Israel Journal of Mathematics.

Extremal problems on shadows and hypercuts in simplicial complexes

Ilan Newman, Yuri Rabinovich, Yuval Peled, 2014 .

Boundaries of Hypertrees, and Hamiltonian Cycles in Simplicial Complexes

Ilan Newman, Yuri Rabinovich, Rogers Mathew, 2015 .