| Publication | Date of Publication | Type |
|---|
Spline quantile regression
Journal of Statistical Theory and Practice | 2026-03-30 | Paper |
| Remarks on Utility in Repeated Bets | 2023-06-06 | Paper |
Fast algorithms for finding randomized strategies in game trees
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Strategic classification
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Combining expert advice in reactive environments
Journal of the ACM | 2015-12-04 | Paper |
Constructing small sample spaces satisfying given constraints
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Combinatorial optimization with rational objective functions
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
Equilibrium in prediction markets with buyers and sellers
Economics Letters | 2010-12-20 | Paper |
Online Learning with Prior Knowledge
Learning Theory | 2008-01-03 | Paper |
| Maximizing concave functions in fixed dimension | 2001-09-18 | Paper |
Improved algorithms and analysis for secretary problems and generalizations
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
A sublinear parallel algorithm for stable matching
Theoretical Computer Science | 2000-08-23 | Paper |
| scientific article; zbMATH DE number 1306880 (Why is no real title available?) | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1380759 (Why is no real title available?) | 1999-12-20 | Paper |
A modified layered-step interior-point algorithm for linear programming
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
| scientific article; zbMATH DE number 1182931 (Why is no real title available?) | 1999-01-19 | Paper |
Using fast matrix multiplication to find basic solutions
Theoretical Computer Science | 1999-01-12 | Paper |
A conjugate direction method for approximating the analytic center of a polytope
Journal of Inequalities and Applications | 1998-10-15 | Paper |
| scientific article; zbMATH DE number 1003296 (Why is no real title available?) | 1997-04-23 | Paper |
Efficient computation of equilibria for extensive two-person games
Games and Economic Behavior | 1997-04-10 | Paper |
Finding mixed strategies with small supports in extensive form games
International Journal of Game Theory | 1997-02-27 | Paper |
A Deterministic ${\operatorname{Poly}}(\log \log N)$-Time<i>N</i>-Processor Algorithm for Linear Programming in Fixed Dimension
SIAM Journal on Computing | 1997-02-06 | Paper |
A linear programming instance with many crossover events
Journal of Complexity | 1997-02-04 | Paper |
On the geometric separability of Boolean functions
Discrete Applied Mathematics | 1997-01-13 | Paper |
Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
SIAM Journal on Computing | 1995-04-06 | Paper |
Parallel linear programming in fixed dimension almost surely in constant time
Journal of the ACM | 1995-03-01 | Paper |
New algorithms for generalized network flows
Mathematical Programming. Series A. Series B | 1994-10-10 | Paper |
Constructing Small Sample Spaces Satisfying Given Constraints
SIAM Journal on Discrete Mathematics | 1994-10-10 | Paper |
Algorithms and complexity analysis for some flow problems
Algorithmica | 1994-09-11 | Paper |
| scientific article; zbMATH DE number 592681 (Why is no real title available?) | 1994-07-13 | Paper |
A General Framework of Continuation Methods for Complementarity Problems
Mathematics of Operations Research | 1994-04-12 | Paper |
A primal-dual infeasible-interior-point algorithm for linear programming
Mathematical Programming. Series A. Series B | 1994-03-10 | Paper |
Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs
Journal of the ACM | 1994-02-24 | Paper |
| scientific article; zbMATH DE number 503394 (Why is no real title available?) | 1994-02-22 | Paper |
Linear time algorithms for some separable quadratic programming problems
Operations Research Letters | 1993-11-28 | Paper |
| scientific article; zbMATH DE number 432812 (Why is no real title available?) | 1993-10-20 | Paper |
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
Mathematical Programming. Series A. Series B | 1993-08-30 | Paper |
On Finding Primal- and Dual-Optimal Bases
ORSA Journal on Computing | 1993-02-18 | Paper |
A unified approach to interior point algorithms for linear complementary problems
Lecture Notes in Computer Science | 1993-01-23 | Paper |
An interior point potential reduction algorithm for the linear complementarity problem
Mathematical Programming. Series A. Series B | 1993-01-16 | Paper |
A note on approximate linear programming
Information Processing Letters | 1993-01-16 | Paper |
The complexity of two-person zero-sum games in extensive form
Games and Economic Behavior | 1993-01-12 | Paper |
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
Mathematical Programming. Series A. Series B | 1993-01-01 | Paper |
On computable beliefs of rational machines
Games and Economic Behavior | 1992-09-27 | Paper |
Homotopy Continuation Methods for Nonlinear Complementarity Problems
Mathematics of Operations Research | 1992-06-28 | Paper |
A unified approach to interior point algorithms for linear complementarity problems: A summary
Operations Research Letters | 1992-06-27 | Paper |
Exact Computation of Optimal Inventory Policies Over an Unbounded Horizon
Mathematics of Operations Research | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 16591 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 17635 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 19091 (Why is no real title available?) | 1992-06-26 | Paper |
Approximation algorithms for hitting objects with straight lines
Discrete Applied Mathematics | 1992-06-25 | Paper |
A logic for reasoning about probabilities
Information and Computation | 1992-06-25 | Paper |
The relation between the path of centers and Smale's regularization of the linear programming problem
Linear Algebra and its Applications | 1991-01-01 | Paper |
On total functions, existence theorems and computational complexity
Theoretical Computer Science | 1991-01-01 | Paper |
On the complexity of some geometric problems in unbounded dimension
Journal of Symbolic Computation | 1990-01-01 | Paper |
Linear Programming with Two Variables Per Inequality in Poly-Log Time
SIAM Journal on Computing | 1990-01-01 | Paper |
On orientations and shortest paths
Linear Algebra and its Applications | 1989-01-01 | Paper |
Extending NC and RNC algorithms
Algorithmica | 1989-01-01 | Paper |
On the ball spanned by balls
Discrete & Computational Geometry | 1989-01-01 | Paper |
On the \(\epsilon\)-perturbation method for avoiding degeneracy
Operations Research Letters | 1989-01-01 | Paper |
Boundary Behavior of Interior Point Algorithms in Linear Programming
Mathematics of Operations Research | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4126998 (Why is no real title available?) | 1989-01-01 | Paper |
On finding a minimum dominating set in a tournament
Theoretical Computer Science | 1988-01-01 | Paper |
On the complexity of polyhedral separability
Discrete & Computational Geometry | 1988-01-01 | Paper |
The complexity of searching a graph
Journal of the ACM | 1988-01-01 | Paper |
Computing circular separability
Discrete & Computational Geometry | 1986-01-01 | Paper |
Introduction: New approaches to linear programming
Algorithmica | 1986-01-01 | Paper |
A note on degeneracy in linear programming
Mathematical Programming | 1986-01-01 | Paper |
An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem
Journal of Algorithms | 1986-01-01 | Paper |
Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
Mathematical Programming | 1986-01-01 | Paper |
On the expected number of linear complementarity cones intersected by random and semi-random rays
Mathematical Programming | 1986-01-01 | Paper |
Optimal precision in the presence of uncertainty
Journal of Complexity | 1985-01-01 | Paper |
A Two-Resource Allocation Problem Solvable in Linear Time
Mathematics of Operations Research | 1985-01-01 | Paper |
Partitioning with two lines in the plane
Journal of Algorithms | 1985-01-01 | Paper |
An optimal algorithm for finding all the jumps of a monotone step-function
Journal of Algorithms | 1985-01-01 | Paper |
A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
Journal of the ACM | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3894831 (Why is no real title available?) | 1985-01-01 | Paper |
On the Complexity of Some Common Geometric Location Problems
SIAM Journal on Computing | 1984-01-01 | Paper |
New results on the average behavior of simplex algorithms
Bulletin of the American Mathematical Society | 1984-01-01 | Paper |
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM | 1984-01-01 | Paper |
Towards a Genuinely Polynomial Algorithm for Linear Programming
SIAM Journal on Computing | 1983-01-01 | Paper |
The Weighted Euclidean 1-Center Problem
Mathematics of Operations Research | 1983-01-01 | Paper |
The Maximum Coverage Location Problem
SIAM Journal on Algebraic Discrete Methods | 1983-01-01 | Paper |
Finding Least-Distances Lines
SIAM Journal on Algebraic Discrete Methods | 1983-01-01 | Paper |
Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
SIAM Journal on Computing | 1983-01-01 | Paper |
New Results on the Complexity of <i>p</i>-Centre Problems
SIAM Journal on Computing | 1983-01-01 | Paper |
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM | 1983-01-01 | Paper |
Is binary encoding appropriate for the problem-language relationship?
Theoretical Computer Science | 1982-01-01 | Paper |
On the complexity of the one-terminal network design problem
Operations Research Letters | 1982-01-01 | Paper |
On the complexity of locating linear facilities in the plane
Operations Research Letters | 1982-01-01 | Paper |
An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems
SIAM Journal on Computing | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3718538 (Why is no real title available?) | 1981-01-01 | Paper |
On repeated games with incomplete information played by non-Bayesian players
International Journal of Game Theory | 1980-01-01 | Paper |
Path Independent Choices
Econometrica | 1980-01-01 | Paper |
Combinatorial Optimization with Rational Objective Functions
Mathematics of Operations Research | 1979-01-01 | Paper |
On Fulkerson's Conjecture About Consistent Labeling Processes
Mathematics of Operations Research | 1979-01-01 | Paper |
A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
Journal of the ACM | 1979-01-01 | Paper |
Cyclic ordering is NP-complete
Theoretical Computer Science | 1978-01-01 | Paper |
An O(N \cdot \log N) Algorithm for a Class of Matching Problems
SIAM Journal on Computing | 1978-01-01 | Paper |
On the parametric nonlinear complementarity problem
Mathematical Programming Studies | 1978-01-01 | Paper |
