| Publication | Date of Publication | Type |
|---|
| Remarks on Utility in Repeated Bets | 2023-06-06 | Paper |
| Fast algorithms for finding randomized strategies in game trees | 2016-09-01 | Paper |
| Strategic classification | 2016-04-15 | Paper |
| Combining expert advice in reactive environments | 2015-12-04 | Paper |
| Constructing small sample spaces satisfying given constraints | 2015-05-07 | Paper |
| Combinatorial optimization with rational objective functions | 2014-03-14 | Paper |
| Equilibrium in prediction markets with buyers and sellers | 2010-12-20 | Paper |
| Online Learning with Prior Knowledge | 2008-01-03 | Paper |
| Maximizing concave functions in fixed dimension | 2001-09-18 | Paper |
| Improved algorithms and analysis for secretary problems and generalizations | 2001-03-19 | Paper |
| A sublinear parallel algorithm for stable matching | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252732 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705458 | 1999-12-20 | Paper |
| A modified layered-step interior-point algorithm for linear programming | 1999-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401028 | 1999-01-19 | Paper |
| Using fast matrix multiplication to find basic solutions | 1999-01-12 | Paper |
| A conjugate direction method for approximating the analytic center of a polytope | 1998-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128926 | 1997-04-23 | Paper |
| Efficient computation of equilibria for extensive two-person games | 1997-04-10 | Paper |
| Finding mixed strategies with small supports in extensive form games | 1997-02-27 | Paper |
| A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension | 1997-02-06 | Paper |
| A linear programming instance with many crossover events | 1997-02-04 | Paper |
| On the geometric separability of Boolean functions | 1997-01-13 | Paper |
| Improved Algorithms For Linear Inequalities with Two Variables Per Inequality | 1995-04-06 | Paper |
| Parallel linear programming in fixed dimension almost surely in constant time | 1995-03-01 | Paper |
| Constructing Small Sample Spaces Satisfying Given Constraints | 1994-10-10 | Paper |
| New algorithms for generalized network flows | 1994-10-10 | Paper |
| Algorithms and complexity analysis for some flow problems | 1994-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4296864 | 1994-07-13 | Paper |
| A General Framework of Continuation Methods for Complementarity Problems | 1994-04-12 | Paper |
| A primal-dual infeasible-interior-point algorithm for linear programming | 1994-03-10 | Paper |
| Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs | 1994-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279733 | 1994-02-22 | Paper |
| Linear time algorithms for some separable quadratic programming problems | 1993-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138946 | 1993-10-20 | Paper |
| Theoretical convergence of large-step primal-dual interior point algorithms for linear programming | 1993-08-30 | Paper |
| On Finding Primal- and Dual-Optimal Bases | 1993-02-18 | Paper |
| A unified approach to interior point algorithms for linear complementary problems | 1993-01-23 | Paper |
| A note on approximate linear programming | 1993-01-16 | Paper |
| An interior point potential reduction algorithm for the linear complementarity problem | 1993-01-16 | Paper |
| The complexity of two-person zero-sum games in extensive form | 1993-01-12 | Paper |
| Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality | 1993-01-01 | Paper |
| On computable beliefs of rational machines | 1992-09-27 | Paper |
| Homotopy Continuation Methods for Nonlinear Complementarity Problems | 1992-06-28 | Paper |
| A unified approach to interior point algorithms for linear complementarity problems: A summary | 1992-06-27 | Paper |
| Exact Computation of Optimal Inventory Policies Over an Unbounded Horizon | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976517 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974963 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3973277 | 1992-06-26 | Paper |
| A logic for reasoning about probabilities | 1992-06-25 | Paper |
| Approximation algorithms for hitting objects with straight lines | 1992-06-25 | Paper |
| On total functions, existence theorems and computational complexity | 1991-01-01 | Paper |
| The relation between the path of centers and Smale's regularization of the linear programming problem | 1991-01-01 | Paper |
| On the complexity of some geometric problems in unbounded dimension | 1990-01-01 | Paper |
| Linear Programming with Two Variables Per Inequality in Poly-Log Time | 1990-01-01 | Paper |
| On orientations and shortest paths | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206561 | 1989-01-01 | Paper |
| On the ball spanned by balls | 1989-01-01 | Paper |
| On the \(\epsilon\)-perturbation method for avoiding degeneracy | 1989-01-01 | Paper |
| Boundary Behavior of Interior Point Algorithms in Linear Programming | 1989-01-01 | Paper |
| Extending NC and RNC algorithms | 1989-01-01 | Paper |
| On the complexity of polyhedral separability | 1988-01-01 | Paper |
| The complexity of searching a graph | 1988-01-01 | Paper |
| On finding a minimum dominating set in a tournament | 1988-01-01 | Paper |
| Computing circular separability | 1986-01-01 | Paper |
| An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem | 1986-01-01 | Paper |
| A note on degeneracy in linear programming | 1986-01-01 | Paper |
| Introduction: New approaches to linear programming | 1986-01-01 | Paper |
| Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm | 1986-01-01 | Paper |
| On the expected number of linear complementarity cones intersected by random and semi-random rays | 1986-01-01 | Paper |
| Optimal precision in the presence of uncertainty | 1985-01-01 | Paper |
| Partitioning with two lines in the plane | 1985-01-01 | Paper |
| A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension | 1985-01-01 | Paper |
| An optimal algorithm for finding all the jumps of a monotone step-function | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5187071 | 1985-01-01 | Paper |
| A Two-Resource Allocation Problem Solvable in Linear Time | 1985-01-01 | Paper |
| Linear Programming in Linear Time When the Dimension Is Fixed | 1984-01-01 | Paper |
| On the Complexity of Some Common Geometric Location Problems | 1984-01-01 | Paper |
| New results on the average behavior of simplex algorithms | 1984-01-01 | Paper |
| The Weighted Euclidean 1-Center Problem | 1983-01-01 | Paper |
| The Maximum Coverage Location Problem | 1983-01-01 | Paper |
| Applying Parallel Computation Algorithms in the Design of Serial Algorithms | 1983-01-01 | Paper |
| Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems | 1983-01-01 | Paper |
| New Results on the Complexity of p-Centre Problems | 1983-01-01 | Paper |
| Finding Least-Distances Lines | 1983-01-01 | Paper |
| Towards a Genuinely Polynomial Algorithm for Linear Programming | 1983-01-01 | Paper |
| On the complexity of locating linear facilities in the plane | 1982-01-01 | Paper |
| Is binary encoding appropriate for the problem-language relationship? | 1982-01-01 | Paper |
| On the complexity of the one-terminal network design problem | 1982-01-01 | Paper |
| An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3908461 | 1981-01-01 | Paper |
| On repeated games with incomplete information played by non-Bayesian players | 1980-01-01 | Paper |
| Path Independent Choices | 1980-01-01 | Paper |
| Combinatorial Optimization with Rational Objective Functions | 1979-01-01 | Paper |
| A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort | 1979-01-01 | Paper |
| On Fulkerson's Conjecture About Consistent Labeling Processes | 1979-01-01 | Paper |
| An $O(N \cdot \log N)$ Algorithm for a Class of Matching Problems | 1978-01-01 | Paper |
| Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree | 1978-01-01 | Paper |
| Cost allocation for steiner trees | 1978-01-01 | Paper |
| On the parametric nonlinear complementarity problem | 1978-01-01 | Paper |
| Cyclic ordering is NP-complete | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195965 | 1977-01-01 | Paper |
| On monotonicity in parametric linear complementarity problems | 1977-01-01 | Paper |
| On the existence and uniqueness of solutions in nonlinear complementarity theory | 1977-01-01 | Paper |
| A good algorithm for lexicographically optimal flows in multi-terminal networks | 1977-01-01 | Paper |
| A monotone complementarity problem with feasible solutions but no complementary solutions | 1977-01-01 | Paper |
| Mixtures of order matrices and generalized order matrices | 1977-01-01 | Paper |
| Partial and complete cyclic orders | 1976-01-01 | Paper |
| Tensor Decomposition of Cooperative Games | 1975-01-01 | Paper |
| Optimal flows in networks with multiple sources and sinks | 1974-01-01 | Paper |
| Nucleoluses of Compound Simple Games | 1974-01-01 | Paper |
| The kernel and the nucleolus of a product of simple games | 1971-01-01 | Paper |
