|scientific||technical columns||math notes||newspapers||language and media||stories||blogs|
Some notes on universal algebra No. 1/2009;
estructura de datos y de la información II; heap y grafos (in Spanish) No. 2/2009;
estructura de datos y de la información II; estructuras para memoria secundaria (in Spanish) No. 3/2009;
Kant and modern philosophy No. 4/2009;
some notes on category theory No. 5/2009;
on the recursive computation of aggregates No. 6/2009;
summa contra ontologiam No. 7/2009;
documentación de programas y estilo de programación (in Spanish) No. 8/2009;
principles of creation of visual categories No. 1/2010;
some early results on the complexity of processing regular expressions with variables No. 2/2010;
an algorithmic "ratatuille" No. 3/2010;
novelty and diversity in information retrieval No. 1/2011;
morphisms in data types No. 2/2011;
a fast algorithm for geometric aggregation No. 3/2011;
Heidegger: technology as revealing No. 4/2011;
modeling functional data sources as relations No. 5/2011;
on the role of experiments in computing engineering No. 6/2011;
multimedia semantics No. 1/2012;
starry starry night: a brief introduction to regular expressions No. 2/2012;
logic and search in artificial intelligence: a gentle introduction No. 1/2013;
Computing science notes
Counting the number of directed acyclic graphs (2006).
A connectdeness criterion for directed acyclic graphs. (2005).
A theorem on a tiling game. (2004).
Cutting a volume with a curve. (2002).
A safe way to compute the binomial coefficients. (2002).
A document on how to compute indices for a non-trivial summation
A document on the (classic) algorithm for drawing a straight line
Details on another classic: the fft algorithm.
A type checking program for a nice type system. I put it together for a mediator project but it is, I believe, valid on its own.