Edward A. Hirsch - Curriculum Vitae#

  • Habilitation thesis "Complexity of propositional logic", St.Petersburg State University, 2011
  • PhD in Theoretical Computer Science "Worst-case upper bounds for SAT", St.Petersburg State University, 1998

  • Best EATCS Paper Award (co-authored) from European Association for Theoretical Computer Science, 2000
  • Dynasty Foundation Young Scientists Fellowship, 2006

PhD students:
  • Dmitry Itsykson (PhD 2009)
  • Arist Kojevnikov (PhD 2007)
  • Alexander S. Kulikov (PhD 2009)
  • Sergey I. Nikolenko (PhD 2009)
  • Konstantin Pervyshev (PhD 2009)

Projects (principal investigator):
  • Ministry of education and science of Russian Federation, project 8216, PI (2011-2013)
  • Federal contract P265 "Hardness of computational problems", PI (2010-2011)
  • RFBR 06-01-00502 "Automated design and analysis of algorithms for Boolean satisfiability", PI (2006-2008)
  • INTAS 04-7173 "Data Flow Systems: Algorithms and Complexity" (PI of SPb team) (2005-2007)
  • CRDF RM0-1373 (sponsored by Intel Corporation), PI (2003-2005)

Service to the community:
  • CSR conference series, Steering Committee member.
  • ESA-2007, CSR-2007/8/12, WoLLIC-2006, IWPEC-2006/9, SAT-2002/3/4/5/7/9, MFCS-2010, STACS-2013, Program Committee member
  • CSR-2006, Conference Chair; CSR-2014, co-chair
  • Scientific Council of the Ministry of Education and Science of Russian Federation, member
  • JSAT (Journal on Satisfiability, Boolean Modeling and Computation), editorial board member (2005-2012)
  • SAT Competition 2002, co-organizer.
Imprint Privacy policy « This page (revision-3) was last changed on Wednesday, 13. August 2014, 15:31 by Kaiser Dana
  • operated by