Yuri Rabinovich

According to our database1, Yuri Rabinovich authored at least 37 papers between 1991 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
A generalization of the Blind Rotating Table game.
Inf. Process. Lett., 2022

2021
Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes.
J. Comb. Theory B, 2021

2020
Online Embedding of Metrics.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019
Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces.
SIAM J. Discret. Math., 2019

2017
Testing for Forbidden Order Patterns in an Array.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2014
Binary Jumbled Pattern Matching via All-Pairs Shortest Paths.
CoRR, 2014

2013
On Multiplicative Lambda-Approximations and Some Geometric Applications.
SIAM J. Comput., 2013

Upper Bounds on Boolean-Width with Applications to Exact Algorithms.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012
On multiplicative λ-approximations and some geometric applications.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2010
On Cut Dimension of ℓ<sub>1</sub> Metrics and Volumes, and Related Sparsification Techniques
CoRR, 2010

On the Boolean-Width of a Graph: Structure and Applications.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs.
Proceedings of the Approximation, 2010

2008
On Complexity of the Subpattern Problem.
SIAM J. Discret. Math., 2008

On Average Distortion of Embedding Metrics into the Line.
Discret. Comput. Geom., 2008

2007
Hard Metrics from Cayley Graphs of Abelian Groups.
Proceedings of the STACS 2007, 2007

2006
Embedding <i>k</i>-Outerplanar Graphs into <i>l</i> <sub>1</sub>.
SIAM J. Discret. Math., 2006

Local versus global properties of metric spaces.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Approximation algorithms for low-distortion embeddings into low-dimensional spaces.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2003
On average distortion of embedding metrics into the line and into L1.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Embedding k-outerplanar graphs into l1.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
A lower bound on the distortion of embedding planar metrics into Euclidean space.
Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2000
On the Complexity of the Sub-permutation Problem.
Proceedings of the Algorithm Theory, 2000

1999
Techniques for bounding the convergence rate of genetic algorithms.
Random Struct. Algorithms, 1999

A Note on the Influence of an epsilon-Biased Random Source.
J. Comput. Syst. Sci., 1999

Intersection Properties of Families of Convex (n, d)-Bodies.
Discret. Comput. Geom., 1999

Cuts, Trees and l<sub>1</sub>-Embeddings of Graphs.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998
Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs.
Discret. Comput. Geom., 1998

Optimal Bounds on Tail Probabilities - A Simplified Approach.
Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998

1996
Witness Sets for Families of Binary Vectors.
J. Comb. Theory A, 1996

Deterministic Approximation of the Cover Time.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995
A computational view of population genetics.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994
Local and Global Clique Numbers.
J. Comb. Theory B, 1994

The geometry of graphs and some of its algorithmic applications
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
Quadratic dynamical systems and theoretical aspects of genetic algorithms (מערכות דינמיות רבועיות והבטים תיאורטיים של אלגוריתמים גנטיים.).
PhD thesis, 1993

Sphere Packing and Local Majorities in Graphs.
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

1992
Quadratic Dynamical Systems (Preliminary Version)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
An Analysis of a Simple Genetic Algorithm.
Proceedings of the 4th International Conference on Genetic Algorithms, 1991


  Loading...