Vera Asodi

School of Computer Science

Tel Aviv University

Ramat Aviv, Tel Aviv 69978, Israel

Tel: 03-6405398

Email: mailto:veraa@post.tau.ac.il

---

I am a postdoc at Caltech.

I was a Ph.D. student at Tel Aviv University under the supervision of Prof. Noga Alon.

Fields of interest

• Combinatorics
• Theoretical Computer Science

List of Publications

• N. Alon and V. Asodi
  Sparse Universal Graphs
  Journal of Computational and Applied Mathematics 142 (2002), 1-11.
  
  
• N. Alon and V. Asodi
  Learning a Hidden Subgraph
  ICALP, 2004, LNCS 3142, 110-121.
  Also: SIAM J. Discrete Math. 18 (2005), 697-712.
  
  
• N. Alon and V. Asodi
  Edge Coloring with Delays
  RANDOM-APPROX 2004, LNCS 3122, 237-248.
  Also: Combinatorics, Probability and Computing 16 (2007), 173-191.
  
  
• N. Alon and V. Asodi
  Tracing a Single User
  European J. Combinatorics 27 (2006), 1227-1234.
  
  
• N. Alon, V. Asodi, C. Cantor, S. Kasif and J. Rachlin
  Multi-node graphs: a framework for multiplexed biological assays
  Journal of Computational Biology 13 (2006), 1659-1672.
  
  
• N. Alon and V. Asodi
  Tracing Many Users with Almost No Rate Penalty
  IEEE Transactions on Information Theory 53 (2007), 437-439.

Teaching

Current

· Algorithms (Spring 2006)

· Computational Models (Spring 2006)

Past

· Algorithms (Fall 2005)

· Computational Models (Fall 2005)

· Efficiency of Computations (Algorithms) (Spring 2005)

· Computational Models (Spring 2005)

· Efficiency of Computations (Algorithms) (Fall 2004)

· Workshop in Computer Science (Fall 2004)

· Efficiency of Computations (Algorithms) (Summer 2004)

· Efficiency of Computations (Algorithms) (Spring 2004)

· Workshop in Computer Science (Spring 2004)

· Efficiency of Computations (Algorithms) (Fall 2003)

· Efficiency of Computations (Algorithms) (Summer 2003)

· Efficiency of Computations (Algorithms) (Spring 2003)

· Workshop in Computer Science (Spring 2003)

· Efficiency of Computations (Algorithms) (Fall 2002)

· Computational Complexity (Fall 2002)

· Computational Models (Spring 2002)

· Computational Complexity (Spring 2002)

· Computational Models (Fall 2001)

· Computational Complexity (Fall 2001)