Curriculum vitae of Ales Privetivy

Name:  Ales Privetivy
Nationality:  Czech 
E-mail:  privetivy "at" kam.mff.cuni.cz
Homepage:  http://kam.mff.cuni.cz/~privetivy/

Education

10/2003-10/2007 postgraduate study in the field of the geometric dicrepancy at the Faculty of Mathematics and Physics of Charles University, Prague, Czech Republic. Finished with PhD degree.
10/1997-10/2003    undergraduate studies in Computer Science at Faculty of Mathematics and Physics of Charles University, Prague, Czech Republic. Finished with master's degree in 2003 (Master thesis - "On Graph Coloring in Geometric Context").

Main fields of interest

  • geometric and combinatorial discrepancy
  • computational geometry
  • algebraic graph theory
  • algebraic topology

Journal Papers

  • J. Matousek, A. Privetivy, P. Skovron: How many points can be reconstructed from k projections?, SIAM Journal on Discrete Mathematics 22, 4, 1605-1623, 2008.
  • J. Matousek, A. Privetivy: Large Monochromatic Components in Two-Colored Grids, SIAM Journal on Discrete Mathematics 22, 1, 295-311, 2008.
  • N. Ahuja, A. Baltz, B. Doerr, A. Privetivy, A. Srivastav: On the Minimum Load Coloring Problem, Journal of Discrete Algorithms, to appear.
  • J. Matousek, A. Privetivy: The Minimum Independence Number of a Hasse Diagram, Comb. Probab. Comput. 15, 3, 473-475, 2006.
  • A. Privetivy: Discrepancy of Sums of Three Arithmetic Progressions, Electronic Journal on Combinatorics 13 (1), #R5, 2006.

Conference Papers

  • J. Matousek, A. Privetivy, P. Skovron: How many points can be reconstructed from k projections?, Proc. of Eurocomb 2007, Vol 29C of ENDM, 427-434, 2007.
  • J. Matousek, A. Privetivy: Large Monochromatic Components in Two-colored Grids, Proc. of Eurocomb 2007, Vol 29C of ENDM, 3-9, 2007.
  • N. Ahuja, A. Baltz, B. Doerr, A. Privetivy, A. Srivastav: On the Minimum Load Coloring Problem, Proc. of WAOA 2005, vol 3879 of LNCS, 15-26,Springer-Verlag,2006

Teaching at the university

  • 2003-2007    teaching assistant of computational geometry courses
  • 2005-2006    teaching assistant of calculus courses
  • 2004-2006    teaching assistant of algorithms courses
  • 1999-2004    teaching assistent of programming courses

Activities during university studies

Confrences, workshops and summer schools visited

  • Winter School on Additive Number Theory 2006 (Montreal)
  • DMV 2006 (Berlin)
  • Summer School on Random Structures 2006 (Chorin, Berlin)
  • Winter School on probablilistic phenomena 2005 (Toulouse)
  • DocCourse 2004 (Prague-Berlin), 2005 (Prague), 2006 (Prague)
  • Reasearch stay at Christian Albertsen University in 2004 (Kiel)
  • Combinatorial Midsummer workshop 2003, 2004, 2005 (Prague)
  • Research experience for undergraduates 2003 (DIMACS, Rutgers University, New Jersey)
  • PCMI Summer Session 2002, 2003 (Park City, Utah)
  • Eurocomb 2003 (Prague)

Awards and competitions during master's studies

  • high scores at the CTU Open Competitions 1998, 1999 (part of the ACM International Collegiate Programming Contest)
  • the fifth place at the Central Europe Region Constest 1998 (part of the ACM International Collegiate Programming Contest)

Awards and competitions during secondary school attendance

  • the bronze medal at the International Olympiad in Informatics 1997, Cape Town, South Africa
    (WWW of international olympiads: http://olympiads.win.tue.nl/ioi/index.html)
  • high scores at the national olympiads in informatics, mathematics and physics in 1995, 1996 and 1997
  • high scores at the International Contest in Programming 1995, 1996

Language skills

  • English (fluently speaking)
  • German (basic knowledge)

Prague, March 2007