Mes compétences :
Latex
Java SE
Teaching
C
Python
Android applications development
Django
Algorithms
C++
OpenGL
Entreprises
Rizze
- PhD - R&D Consultant
2012 - maintenantDevelopment of Cloud-based services (Amazon Web Services, Python/Django, Solr, Stackless Python, HTML, Javascript).
Mobile development (Android SDK).
Teaching:
- "Formal Language Theory" at ESIEE School : 62 hours.
- "Compilers Design" at ESIEE School : 27 hours.
- "Project Management" at ESIEE School : 7 hours.
LIPN - Institut Galilée - IUT de Villetaneuse
- Temporary Teaching and Research Associate (ATER)
2011 - 2012Design and analysis of an algorithm that generically (that is with a probability that tends asymptotically to one) minimizes Aho-Corasick automata.
Teaching:
- "Introduction to C Programming" at IUT de Villetaneuse : 32 hours
- "Information Theory and Signal Processing" at IUT de Villetaneuse : 56 hours
This thesis addresses the following issue: given a pattern X over an alphabet A, how to efficiently build the minimal automaton of A∗X used to sequentially parse a text and find occurrences of the pattern in that text.
For a finite set of words, the classical construction due to Aho
and Corasick builds a deterministic and complete automaton of A∗X, but unfortunately not necessarily minimal.
Different solutions were proposed in this work:
- an algorithm for generically constructing the minimal automaton; it is based on Brzozowski’s minimization algorithm, and uses sparse lists to achieve a linear time and space complexities;
- a pseudo-minimization algorithm specific to Aho-Corasick automata, with linear time and space complexities;
- a direct construction of this pseudo-minimal automaton (thus avoiding the construction of the Aho-Corasick automaton);
- a generically linear algorithm that always computes the minimal automaton.
Universite PARIS -EST Marne la Vallée
- Algorithmic Research Internship
2008 - 2008Analysis of the classical Brzozowski's Algorithm for the minimization of non-deterministic automata.
I was particularly interested in the minimization of specific automata used for pattern matching.
Universite PARIS -EST Marne la Vallée
- Algorithmic Research Internship
2007 - 2007Development of a "data compression using antidictionnaries" algorithm and study of its compression ratio.
Design and development of an in-line version of this method of compression.
Highlight of some interesting properties of the compressed text, to be used for pattern matching in text compressed using antidictionnaries.
Enix S.A.R.L
- Student Internship
2006 - 2006Development of a Linux kernel module allowing for the synchronization
of the connection tracking table of two routers (Linux Kernel
Programming).
Development of a python module that is an interface to the new splice
and tee system calls under Linux Kernel 2.6.17 and higher
(https://pypi.python.org/pypi/splicetee).
Development of a python module that is an interface to open(), read(),
write() and close() system calls on a direct I/O context (O_DIRECT flag)
(https://pypi.python.org/pypi/directio/1.0).
