Uri Stav   àåøé ñúå

 

 

 

 

 

 

 

 

Ph.D. student

School of Computer Science

Tel-Aviv University

Israel

 

My advisor is Prof. Noga Alon.

 

Email:  uristav@post.tau.ac.il

 

Tel.:     +972-3-6405398        (Office, Open Space in Schreiber Building, TAU)

+972-77-6430277      (Home)

+972-57-6430287      (Cell)

 

Fields of interest

Combinatorics, Graph Theory, Theoretical Computer Science

Ph.D. Thesis

Graph edit distance and hereditary properties

Publications (PDF)

 

N. Alon and U. Stav

New bounds on parent-identifying codes: The case of multiple parents

Combinatorics, Probability and Computing 13 (2004), 795-807.

N. Alon and U. Stav

What is the furthest graph from a hereditary property?

Random Structures and Algorithms, to appear.

N. Alon and U. Stav

The maximum edit distance from hereditary graph properties

Journal of Combinatorial Theory, Ser. B, to appear.

N. Alon, A. Shapira and U. Stav

Can a graph have distinct regular partitions?

SIAM Journal of Discrete Math, to appear.

A preliminary version appeared in Proc. of 13th COCOON (2007), 428-438.

E. Lubetzky and U. Stav

Non-linear index coding outperforming the linear optimum

Proc. of 48th IEEE FOCS (2007), 161-167.

N. Alon and U. Stav

Stability type results for hereditary properties

Submitted

N. Alon, A. Hassidim, E. Lubetzky, U. Stav and A. Weinstein

Broadcasting with side information

Submitted

Some PowerPoint Presentations

Parent identifying codes – the case of multiple parents

(TAU and BIU Combinatorics seminars, 2002 and 2003)

What is the furthest graph from a hereditary property?

(Workshop on properties of large graphs, DIMACS, 2006)

Graph edit-distance and forbidden induced subgraphs

(Quasi-random structures, regularity lemmas and their applications, Budapest, 2007)

Graph edit-distance and hereditary properties

(TAU Combinatorics seminar, May 2007)

Can a graph have distinct regular partitions?

(Random Structures & Algorithms, Tel Aviv, May 2007)

Teaching (long time ago)

 

Computational models (TAU, Summer 2001)

Computational models (TAU, Winter 2000 20001)

Algorithmics (OU, Summer 2000)

Data structures and introduction to algorithms (OU, Spring 2000)