Teaching Python

I used this interactive book for the lectures of Laboratorio di Algoritmica, at University of Pisa, a.a. 2015-2016, to teach basic programming. I then used this other one to teach basic algorithms and data structures. These are shorten versions of the original books by Runestone Interactive. This version has been modified by me for the[…]


On the several proofs about P and NP

Recently, I’ve found this nice web site that collects wrong proofs about P and NP relationship. Currently there are 107 proofs. Probably, all of them are wrong (otherwise, probably we would know the guy) and the nice scoring function provided by Scott Aaranson here can be applied. This scoring function is the number of signs exhibited[…]



Our paper “Computing Top-k Closeness Centrality Faster in Unweighted Graphs” has been accepted for ALENEX 2016 (Algorithms Engineering and Experiments). Thanks to all the coauthors Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi and Henning Meyerhenke. This work is the result of a merge between our work (see here) and the work by Elisabetta and Henning. It’s a pleasure to start this new collaboration. This is the abstract[…]


Fender Stratocaster

Some days ago, I visited a very nice museum in Pistoia. In occasion of Pistoia Blues 2015, the Flavio Camorani’s Fender collection has been shown in the so-called “Fender Vintage Museum”. The museum contained all the guitar and amplifier models produced in the golden age of Fender, that is from 1951 to 1974. Indeed, during these[…]


Enumeration Catalogue

Some months ago, a very nice web page came out. I am talking about the catalogue of enumeration algorithms by Kunihiro Wasa. There you can find an “Enumeration of Enumeration Algorithms and Its Complexity”. For each class of the followings: Geometry Graph Hypergraph Matroid Order Other Permutation SAT Set String several enumeration problems are enumerated. For[…]