Name: Jeremy, Felix, Barbay Nationality: French Current address: 808-400 Parkside Drive, Waterloo, Ontario N2L 6E5, Canada [phone 1-519-746-2243] Short CV: English (ps/pdf) or French (ps/pdf). Detailed CV: English (ps/pdf) or French (ps/pdf).

Positions:		Français
Mar 2008 - Present	University of Chili	Visitor
Sep 2004 - Feb 2008	University of Waterloo	Assistant Professor
2002-2004	University of British Columbia	Postdoctoral Researcher Sponsors: INRIA, J. Friedman, David Kirkpatrick, William Evans.

Academia:	Français
Publications	Journals: Transaction on Algorithms (TALG@ACM), Theoretical Computer Science (TCS@Elsevier) . Refereed Conferences and Workshops: ISAAC'07, SODA'07, CPM'06, WEA'06, ISAAC'03, SAGA'03, SODA'02, SODA'01.
Teaching	Operating Systems, Data Structures and Data Management, Introduction to Computing Theory.
Students	Master: Aleh Veraskouski, January 2006 - July 2007. Undergraduate Research Assistants: Ryan Berckmans, Fall 2007; Cheolsoo Park, Fall 2007; Dmitri Denisenkov, Spring 2007; Richard Hu, Spring 2007; Fady Samuel, Winter 2007; Jui-Yi Kao, Fall 2006; Zhi (Zuck) Li, Spring 2006; Joshua Tam, Winter and Spring 2005; Annie Lee, Winter 2005; Frank Chen, Winter 2005.
Referee	Journals: Journal of Discrete Algorithms (JDA@Elsevier). Conferences and Workshops: LATIN 2007, ISAAC 2007, STACS 2007, SODA 2007, PRICAI 2006, ICALP 2006, SWAT 2006, ALENEX 2006, STACS 2006, ICALP 2005, CARI 2001. Ph D thesis: Meng He, January 2007; Alex Golynski, August 2007. Master thesis: Ziaur Rahman, August 2007; Cristian Gaspar, November 2005; Neeraj Dumir, September 26, 2005.
Events	Chair of the Algorithms and Data-Structures Seminar and Discussion Group, Waterloo, 2005-2007; Chair of the student theory Seminar, Orsay, 1999-2002; Co-organisation of Spring school on On-Line algorithms, Orsay, May 17-19, 2001; Co-organisation of Workshop on Phase Transition and Complexity, Orsay, May 24-28, 1999.

Degrees:		Français
1999-2002	Paris XI	Ph.D. in Computer Science Fine Analysis: lower bounds and algorithms for the intersection problem in search engines Advisor: C. Kenyon, Defended 09/24/2002. MaxCut - Discrete Bak Sneppen Model - Bouncing Towers - Intersection problems. - Integrated Search Engines (FFSS, Slashome)
1998	Paris XI	M.S. in Computer Science: (B 2nd) AI, Language, Calculability and Complexity, Parallelism, Calculability and Robust Transmission, Calculability and Incertitude, Repartited Algorithmic, Computer Vision. Thesis in LRI's Inference and Learning group.
1997	Rouen	B.S. in Mathematics (B First) Language theory, Compilation, Combinatorial Optimization, Formal Calculus, Numerical analysis, Statistics and Probability.

Miscellaneous:	Français
Languages	French native; English fluent with an accent; notions of Russian and Spanish.
Technical skills	(Basic, Turbo Pascal, Prolog, C), C++, Java, Python, CAML, OCAML, LaTeX, HTML, Php, installation/administration Linux servers.