Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Rabinovich, Yuri"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On multiplicative
\lambda
-approximations and some geometric applications
Ilan Newman
,
Yuri Rabinovich
SIAM Journal on Computing
42
(3), 2013, pp. 855-883
Local versus global properties of metric spaces
Sanjeev Arora
,
László Lovász
,
Ilan Newman
,
Yuval Rabani
,
Yuri Rabinovich
,
Santosch Vempala
SIAM Journal on Computing
41
(1), 2012, pp. 250-271
On the boolean-width of a graph: Structure and applications
Isolde Adler
,
Binh-Minh Bui-Xuan
,
Yuri Rabinovich
,
Gabriel Renault
,
Jan Arne Telle
,
et al.
Lecture Notes in Computer Science
6410
, 2010, pp. 159-170
On complexity of the subpattern problem
Shlomo Ahal
,
Yuri Rabinovich
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 629-649
Hard metrics from Cayley graphs of Abelian groups
Ilan Newman
,
Yuri Rabinovich
Lecture Notes in Computer Science
4393
, 2007, pp. 157-162
Embedding
k
-outerplanar graphs into
l_1
Chandra Chekuri
,
Anupam Gupta
,
Ilan Newman
,
Yuri Rabinovich
,
Alistair Sinclair
SIAM Journal on Discrete Mathematics
20
(1), 2006, pp. 119-136
Cuts, trees and
l_1
-embeddings of graphs
Anupam Gupta
,
Ilan Newman
,
Yuri Rabinovich
,
Alistair Sinclair
Combinatorica
24
(2), 2004, pp. 233-269
On average distortion of embedding metrics into the line and into
L_1
Yuri Rabinovich
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 456-462
On the complexity of the sub-permutation problem
Shlomo Ahal
,
Yuri Rabinovich
Lecture Notes in Computer Science
1851
, 2000, pp. 490-503
A note on the influence of an
\epsilon
-biased random source
Amir Ben-Dor
,
Anna Karlin
,
Nathan Linial
,
Yuri Rabinovich
Journal of Computer and System Sciences
58
(1), 1999, pp. 174-176
Optimal bounds on tail probabilities - A simplified approach
Aviad Cohen
,
Yuri Rabinovich
,
Assaf Schuster
,
Hadas Shachnai
Lecture Notes in Computer Science
1388
, 1998, pp. 341-350
Deterministic approximation of the cover time
Uriel Feige
,
Yuri Rabinovich
Proceedings of the 4th Israel Symposium on Theory of Computing and Systems, ISTCS'96 (Jerusalem, Israel, June 10-12, 1996)
, 1996, pp. 208-218
Witness sets for families of binary vectors
Eydal Kushilevitz
,
Nathan Linial
,
Yuri Rabinovich
,
Michael Saks
Journal of Combinatorial Theory Series A
73
(2), 1996, pp. 376-380
The geometry of graphs and some of its algorithmic applications
Nathan Linial
,
Eran London
,
Yuri Rabinovich
Combinatorica
15
(2), 1995, pp. 215-245
A computational view of population genetics
Yuval Rabani
,
Yuri Rabinovich
,
Alistair Sinclair
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, USA, May 29 - June 1, 1995)
, 1995, pp. 83-92
The geometry of graphs and some of its algorithmic applications
Nathan Linial
,
Eran London
,
Yuri Rabinovich
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 577-591
Local and global clique numbers
Nathan Linial
,
Yuri Rabinovich
Journal of Combinatorial Theory Series B
61
(1), 1994, pp. 5-15
Quadratic dynamical systems
Yuri Rabinovich
,
Alistair Sinclair
,
Avi Wigderson
Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'92 (Pittsburgh, PA, October 24-27, 1992)
, 1992, pp. 304-313