Category Archives: Projects


This is just a quick announcement that we have migrated all our projects like PGSolver, MLSolver, FADecider and so on to GitHub. This allows you to get the newest versions of our software easily and to contribute your own code to our codebase.

Assuming that you might be an avid user of Subversion, you might want to read this tutorial which explains Git from a Subversion-point-of-view.

New paper on Cunningham’s Rule & a new Wiki for TCS

David Avis and myself have just finished a paper on Cunningham’s Rule for solving linear programs, featuring an exponential lower bound. Have a look at the preprint here and let us know what you think.

We also thought about a way of providing other scientists with additional material such as instances of linear programs, animations and so on. We decided to start a Wiki for theoretical computer science and add an entry on Cunningham’s Rule as a start. We invite other scientists to add their research to the Wiki!

New version of PGSolver

We’ve just released a new version of PGSolver (3.1 -> 3.2), see Projects.

PGSolver now contains an exhaustive generator base for policy-iteration and some additional tools to play around with it. You can now, for instance, get the corresponding MDPs or LPs.

We have also fixed a strange segmentation fault bug that could happen when printing the winning sets to the screen. It seems to be due to a memory manager problem of OCaml. We thank Jim Huan-Pu Kuo for bringing this bug to our attention.

Note: all policy iteration lower bound generators are now included in a single generating application called “stratimprgen”.