| Publication | Date of Publication | Type |
|---|
Truncated log-concave sampling for convex bodies with reflective Hamiltonian Monte Carlo
ACM Transactions on Mathematical Software | 2024-09-10 | Paper |
A practical algorithm for volume estimation based on billiard trajectories and simulated annealing
ACM Journal of Experimental Algorithmics | 2024-07-26 | Paper |
| Supplementary files for the dingo Python library | 2023-12-26 | Dataset |
Geometric algorithms for sampling the flux space of metabolic networks
(available as arXiv preprint) | 2023-12-08 | Paper |
| Geometric algorithms for sampling the flux space of metabolic networks | 2023-12-08 | Paper |
Fast floating-point filters for robust predicates
BIT | 2023-05-22 | Paper |
Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises
Computational Geometry | 2022-11-16 | Paper |
Practical volume estimation of zonotopes by a new annealing schedule for cooling convex bodies
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Sampling the feasible sets of SDPs and volume approximation
ACM Communications in Computer Algebra | 2022-09-06 | Paper |
Efficient sampling in spectrahedra and volume approximation
Linear Algebra and its Applications | 2022-06-01 | Paper |
scientific article; zbMATH DE number 7236423 (Why is no real title available?)
(available as arXiv preprint) | 2020-08-18 | Paper |
Enumeration of 2-level polytopes
Mathematical Programming Computation | 2019-05-03 | Paper |
Experimental study of the Ehrhart interpolation polytope
Mathematical Aspects of Computer and Information Sciences | 2019-03-14 | Paper |
Practical polytope volume approximation
ACM Transactions on Mathematical Software | 2019-01-18 | Paper |
| Polytope membership in high dimension | 2018-08-17 | Paper |
Efficient random-walk methods for approximating polytope volume
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Combinatorics of 4-dimensional resultant polytopes
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
Two-level polytopes with a prescribed facet
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Faster geometric algorithms via dynamic determinant computation
Computational Geometry | 2016-05-17 | Paper |
Enumeration of 2-level polytopes
Lecture Notes in Computer Science | 2015-11-19 | Paper |
Efficient edge-skeleton computation for polytopes defined by oracles
Journal of Symbolic Computation | 2015-08-24 | Paper |
An oracle-based, output-sensitive algorithm for projections of resultant polytopes
International Journal of Computational Geometry & Applications | 2014-08-11 | Paper |
An output-sensitive algorithm for computing projections of resultant polytopes
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Faster geometric algorithms via dynamic determinant computation
Algorithms – ESA 2012 | 2012-09-25 | Paper |
