| Publication | Date of Publication | Type |
|---|
| Simplifying modular lattices by removing doubly irreducible elements | 2023-11-28 | Paper |
Cartesian lattice counting by the vertical 2-sum
Order | 2022-05-23 | Paper |
Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time
Algorithmica | 2020-10-21 | Paper |
Cartesian lattice counting by the vertical 2-sum
(available as arXiv preprint) | 2020-07-07 | Paper |
An adaptive prefix-assignment technique for symmetry reduction
Journal of Symbolic Computation | 2020-01-15 | Paper |
Generating modular lattices of up to 30 elements
Order | 2019-12-13 | Paper |
Counting graded lattices of rank 3 that have few coatoms
International Journal of Algebra and Computation | 2019-07-12 | Paper |
Exponential lower bounds of lattice counts by vertical sum and 2-sum
Algebra Universalis | 2019-02-28 | Paper |
Planar additive bases for rectangles
(available as arXiv preprint) | 2019-01-22 | Paper |
| Planar additive bases for rectangles | 2019-01-22 | Paper |
A faster subquadratic algorithm for finding outlier correlations
ACM Transactions on Algorithms | 2018-11-13 | Paper |
A Faster Subquadratic Algorithm for Finding Outlier Correlations
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Counting graded lattices of rank three that have few coatoms
(available as arXiv preprint) | 2018-04-10 | Paper |
scientific article; zbMATH DE number 6846423 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-02 | Paper |
An adaptive prefix-assignment technique for symmetry reduction
Theory and Applications of Satisfiability Testing – SAT 2017 | 2017-11-15 | Paper |
An adaptive prefix-assignment technique for symmetry reduction
Theory and Applications of Satisfiability Testing – SAT 2017 | 2017-11-15 | Paper |
An improved lower bound for finite additive 2-bases
Journal of Number Theory | 2017-01-23 | Paper |
Fast Möbius inversion in semimodular lattices and ER-labelable posets
The Electronic Journal of Combinatorics | 2016-09-13 | Paper |
Fast Möbius inversion in semimodular lattices and ER-labelable posets
The Electronic Journal of Combinatorics | 2016-09-13 | Paper |
Computing exact clustering posteriors with subset convolution
Communications in Statistics. Theory and Methods | 2016-06-30 | Paper |
| Early Pruning in the Restricted Postage Stamp Problem | 2015-03-11 | Paper |
A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases
Journal of Integer Sequences | 2014-08-28 | Paper |
A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases
Journal of Integer Sequences | 2014-08-28 | Paper |
| Addition chains meet postage stamps: reducing the number of multiplications | 2014-03-24 | Paper |
Addition chains meet postage stamps: reducing the number of multiplications
(available as arXiv preprint) | 2014-03-24 | Paper |
Exact and approximate balanced data gathering in energy-constrained sensor networks
Theoretical Computer Science | 2005-12-05 | Paper |
Algorithmic Aspects of Wireless Sensor Networks
Lecture Notes in Computer Science | 2005-08-25 | Paper |
