photo

Hang Zhou

45 rue d'Ulm
hang.zhou (at) ens.fr
75005 Paris
France
CV

I am a student at École Normale Supérieure de Paris, in my second year of master studies in Computer Science.

My research interest is Theoretical Computer Science, mainly in Algorithms and Complexity.

Experiences

  • Approximation for maximum surjective CSPs

    March - July 2011
    Research internship at the Laboratoire d'Informatique de L'École Polytechnique
    report - slides
    Established a complexity dichotomy between PTAS and APX-complete for the Max-Sur-CSPs on the Boolean domain and 3-element domains and discovered some Max-Sur-CSP in PTAS but is NP-hard.

  • Checking the termination for counter automaton

    June - August 2010
    Research internship at the Laboratoire VERIMAG
    report - slides
    Established a necessary and sufficient termination condition in Presburger Arithmetic and applied this result on the termination check for general counter automata.

  • Small microprocessor and netlists simulator

    Spring 2010
    Project of the course Digital system — from algorithm to circuit
    report - slides - programs
    Developed an electronic circuit simulator to simulate a 16-bits microprocessor.

  • Dynamic Maintenance of Kinematic Structures

    Fall 2011
    Presentation in the course Robot Motion Planning
    report - slides
    Summerized and presented the method to maintain a dynamic data structure to treat efficiently a sequence of updates and queries concerning a collection of links.

  • Implementation of the Hopcroft's algorithm

    Spring 2010
    Presentation in the course Formal languages, computability and complexity
    report - slides
    Summerized and presented the method to implement the Hopcroft's algorithm for the minimization problem of a deterministic finite automaton.

  • Maximal flow by the MKM's algorithm

    Fall 2009
    Presentation in the course Algorithms and programming
    slides - programs
    Summerized and presented the Malhotra Kumar Maheshwari's algorithm which solves the maximal flow problem in cubic time.