Santiago Figueira Ph.D. in Computer Science (University of Buenos Aires). Professor (Adjunto) at the Computer Science Department (University of Buenos Aires). His research area is theoretical computer science, computability theory, algorithmic randomness and Kolmogorov complexity. He is also interested in modal logics. [Home page] 
Daniel Gorín Ph.D. in Computer Science (cotutelle between University of Buenos Aires and University Henri Poincaré) and teaching assistant at the Computer Science Department (University of Buenos Aires). His research field is inference and reasoning techniques for hybrid logics. [Home page] 

Sergio Mera Ph.D. in Computer Science (cotutelle between University of Buenos Aires and University Henri Poincaré) and lecturer at the Computer Science Department (University of Buenos Aires). His research field is the study of fragments of first order logic with good computational behaviour. More specifically, modal and hybrid logics and their properties. [Home page] 

Gabriel Ignacio Senno MSc. in Computer Science and Teaching Assistant at the Computer Science Department (both of the University of Buenos Aires). In his MSc. thesis, using results from the theory of bad sequences and well quasiorders, he gave multiplyrecursive upper bounds for the complexity of some decision problems of automata over trees which were known to be nonprimitive recursive. Currently, he is working on his Ph.D. under the direction of Santiago Figueira in the study logical and computer theoretical aspects of quantum computing. [Home page] 

Sergio Abriola MSc. in Pure Mathematics at the University of Buenos Aires. His MSc. thesis was about the obtention of upper bounds for the lenght of controlled bad sequences in some wellquasiorders. He is currently working on the calculation of the order types of various wellpartialorders. [Home page] 