8 citations · 14 across the 3 of their papers we have counts for
7 papers
lrsarith: a small fixed/hybrid arithmetic C library
David Avis, Charles Jordan
We describe lrsarith which is a small fixed precision and hybrid arithmetic C library for integers and rationals that we developed for use in the lrslib library for polyhedral comp…
mts: A light framework for parallelizing tree search codes
David Avis, Charles Jordan
We describe mts, a generic framework for parallelizing certain types of tree search programs including reverse search, backtracking, branch and bound and satisfiability testing. It…
Parallel Enumeration of Triangulations
Charles Jordan, Michael Joswig, Lars Kastner
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-f…
A parallel framework for reverse search using mts
David Avis, Charles Jordan
We describe mts, which is a generic framework for parallelizing certain types of tree search programs, that (a) provides a single common wrapper containing all of the parallelizati…
Machine Learning with Guarantees using Descriptive Complexity and SMT Solvers
Charles Jordan, Łukasz Kaiser
Machine learning is a thriving part of computer science. There are many efficient approaches to machine learning that do not provide strong theoretical guarantees, and a beautiful…
mplrs: A scalable parallel vertex/facet enumeration code
David Avis, Charles Jordan
We describe a new parallel implementation, mplrs, of the vertex enumeration code lrs that uses the MPI parallel environment and can be run on a network of computers. The implementa…