An algorithm for linear programming which requires O((m+n)n2 + (m+n)1.5n)L) arithmetic operations

Output-sensitive algorithms for Tukey depth and related problems

Statistics and Computing

New Efficient Attacks on Statistical Disclosure Control Mechanisms

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology

Random walks on polytopes and an affine interior point method for linear programming

Proceedings of the forty-first annual ACM symposium on Theory of computing

Network coding: a computational perspective

IEEE Transactions on Information Theory

Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming

Mathematics of Operations Research

Enumerating a subset of the integer points inside a Minkowski sum

Computational Geometry: Theory and Applications

An interactive interior point algorithm for multiobjective linear programming problems

Operations Research Letters

A(3/2+ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures