
Jun 5 2011
1 min
After a long time, I have finally finished my thesis to get the MSc in Computer Science degree, from FCEN UBA. It has been almost a year since I started working in the thesis in the context of Manas Research, and before that I had been working on it...

Sep 16 2010
9 min
In previous posts I have presented separately the graph coloring problem, as well as its generalization, the partitioned graph coloring problem, and linear programming. It is time to put both of them toghether, by modelling an instance of graph...

Jul 22 2010
6 min
Before going into how to solve the partitioned graph coloring problem using integer linear programming (which is the goal of my thesis), I thought it would be a good idea to actually explain what is the partitioned graph coloring problem (or PCP...

Jul 6 2010
9 min
Despite being able to simply provide a link to wikipedia's already excellent article on Linear Programming, I wanted to provide a short introduction in order to present what I am doing exactly on my thesis in a future article. Linear Programming...

Mar 2 2009
9 min
How a simple algorithm for generating a random output can be biased may be a very difficult analysis, and unless every step is carefully analyzed, randomness can be easily lost. In this post I'll go through some basics of probabilities, using an ideal...
Contributors
Nicolás di Tada Founder
Juan Wajnerman CTO
Brian J. Cardiff Principal Engineer, Product Manager & Researcher
Martín Verzilli Product Manager & Team Lead
Matías García Isaía Fullstack Engineer
Leandro Matayoshi Fullstack Engineer
Martin Pettinati Marketing & Communications Lead
Sergio Medina
Pablo Brusco
Luis Ziliani
María Inti David
Ary Borenszweig
Santiago Palladino
Valeria Tiffenberg