| Publication | Date of Publication | Type |
|---|
A simple method for resolving degeneracies in Delaunay triangulations
Automata, Languages and Programming | 2019-03-29 | Paper |
| Probabilistic lower bounds on maximal determinants of binary matrices | 2017-11-17 | Paper |
Probabilistic lower bounds on maximal determinants of binary matrices
(available as arXiv preprint) | 2017-11-17 | Paper |
Linear-Time Nearest Point Algorithms for Coxeter Lattices
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Note on best possible bounds for determinants of matrices close to the identity matrix
Linear Algebra and its Applications | 2014-11-19 | Paper |
| Lower bounds on maximal determinants of binary matrices via the probabilistic method | 2014-02-27 | Paper |
Testing closeness of discrete distributions
Journal of the ACM | 2014-02-17 | Paper |
| Lower bounds on maximal determinants of +-1 matrices via the probabilistic method | 2012-11-14 | Paper |
Church's thesis meets the \(N\)-body problem
Applied Mathematics and Computation | 2006-08-04 | Paper |
Three counterexamples refuting Kieu's plan for ``quantum adiabatic hypercomputation; and some uncomputable quantum mechanical tasks
Applied Mathematics and Computation | 2006-08-04 | Paper |
| scientific article; zbMATH DE number 2209734 (Why is no real title available?) | 2005-09-28 | Paper |
| New lower bounds for the maximal determinant problem | 2003-04-25 | Paper |
| scientific article; zbMATH DE number 1775442 (Why is no real title available?) | 2002-09-17 | Paper |
A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes
European Journal of Combinatorics | 2002-04-11 | Paper |
A Bayesian approach to relevance in game playing
Artificial Intelligence | 1998-08-13 | Paper |
Graph-theoretical conditions for inscribability and Delaunay realizability
Discrete Mathematics | 1997-09-15 | Paper |
| scientific article; zbMATH DE number 1003278 (Why is no real title available?) | 1997-08-03 | Paper |
Clarification of sensitivity measure \(A'\)
Journal of Mathematical Psychology | 1997-01-05 | Paper |
Disproofs of generalized Gilbert-Pollak conjecture on the Steiner ratio in three or more dimensions
Journal of Combinatorial Theory. Series A | 1996-07-09 | Paper |
On the Steiner ratio in 3-space
Journal of Combinatorial Theory. Series A | 1996-02-12 | Paper |
A LINEAR-TIME ALGORITHM FOR TESTING THE INSCRIBABILITY OF TRIVALENT POLYHEDRA
International Journal of Computational Geometry & Applications | 1995-05-17 | Paper |
| scientific article; zbMATH DE number 486983 (Why is no real title available?) | 1994-02-01 | Paper |
Graded tetrahedral finite element meshes
International Journal for Numerical Methods in Engineering | 1993-04-01 | Paper |
A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
Bulletin of the American Mathematical Society | 1993-01-16 | Paper |
How to find Steiner minimal trees in Euclidean \(d\)-space
Algorithmica | 1992-06-28 | Paper |
Steiner tree problems
Algorithmica | 1992-06-28 | Paper |
A new table of constant weight codes
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
Better-than-average uniform random variables and Eulerian numbers, or: How many candidates should a voter approve?
(available as arXiv preprint) | N/A | Paper |
