Oliver Alfred Gross

Skin Friction and Stability of a Laminar Binary Boundary Layer on a Flat Plate.

1963
A linear program of Prager's: notes on linear programming and extensions-part 60.

1962
Minimal Weight Design for a Built-In Beam.

1962
Minimum-weight design for moving loads.

1962
The rendezvous value of a metric space.

1961
A Note on Polynomial and Separable Games

1960
A mechanical proof of the min-max theorem.

1959
On the Computational Solution of Dynamic-Programming Processes-XIV: Missile-Allocation Problems

1959
Additive generation of pseudorandom numbers [by] O. Gross and S.M. Johnson.

1958
A class of function-space games.

1958
A note on polynomial and separable games.

1958
An optimal-inventory model.

1958
Some aspects of the mathematical theory of control processes

1958
The maximization of an integral subject to constraints.

1955
Notes on Linear Programming — Part XXVIII: A Simple Linear Programming Problem Explicitly Solvable in Integers

1955
On the Optimal Inventory Equation.

1955
A Search Problem Due to Bellman

1955
The derivatives of the value of a game.

1954
On the minimization of <>.

1954
On the Optimal Inventory Equation.

1954
A Rational Game on the Square

1954
The Theory of Dynamic Programming as Applied to a Smoothing Problem.

1954
On Some Variational Problems Occurring in the Theory of Dynamic Programming

1953
A Production-Line Assignment Problem

1953
Some Combinatorial Problems Arising in the Theory of Multistage Processes

1953
On some variational problems occurring in the theory of dynamic programming--II.

1952
On some variational problems occurring in the theory of dynamic programming--III.

1952
On some variational problems occurring in the theory of dynamic programming--IV.

1952
On some variational problems occurring in the theory of dynamic programming--VI.

1952
Optimal Sets for Games Over the Square

1952
Reduction of certain games over function space.

1952
Solution Sets for Games on the Square

1952
Some Functional Equations Related to Dynamic Programming Problems Involving Non-Commutative Operations

1952
A Class of Games with Unique Solutions

1951
Continuous Games with Given Unique Solutions.

1951
Games Concave on Each Side of the Unit Square Diagonal

1951
A Game Value Characterization of Algebraic Numbers

1951
An Infinite-Dimensional Extension of a Symmetric Blotto Game

1951
A Note on Payoffs Which Vanish Almost Everywhere

1951
The Pathological Nature of Certain Games with Rational Payoff.

1951
The Pathological Nature of Certain Games with Rational Payoff : II.

1951
A Class of Games with Unique Density Function Solutions

1950
A Continuous Colonel Blotto Game

1950
n targets of differing vulnerability with attack stronger than defense.

1950
On Certain Games with Transcendental Values

1950
On functions of the form <>.

1950
On measurable functions K which satisfy <>.

1950
On the number of eigenvalues of a certain symmetric kernel.

1950
The Symmetric Blotto Game

1950
A Slide-Rule Inequality

1949
Some Notes on the Slide-Rule Problem

1949
Representation by Sums of Separable Functions

1948
Representation by Sums of Separable Functions in n Dimensions

1948

Federally Funded Research Divisions

Social and Economic Policy Divisions

International

Oliver Alfred Gross

Skin Friction and Stability of a Laminar Binary Boundary Layer on a Flat Plate.

A linear program of Prager's: notes on linear programming and extensions-part 60.

Minimal Weight Design for a Built-In Beam.

Minimum-weight design for moving loads.

The rendezvous value of a metric space.

A Note on Polynomial and Separable Games

A mechanical proof of the min-max theorem.

On the Computational Solution of Dynamic-Programming Processes-XIV: Missile-Allocation Problems

Additive generation of pseudorandom numbers [by] O. Gross and S.M. Johnson.

A class of function-space games.

A note on polynomial and separable games.

An optimal-inventory model.

Some aspects of the mathematical theory of control processes

The maximization of an integral subject to constraints.

Notes on Linear Programming — Part XXVIII: A Simple Linear Programming Problem Explicitly Solvable in Integers

On the Optimal Inventory Equation.

A Search Problem Due to Bellman

The derivatives of the value of a game.

On the minimization of <>.

On the Optimal Inventory Equation.

A Rational Game on the Square

The Theory of Dynamic Programming as Applied to a Smoothing Problem.

On Some Variational Problems Occurring in the Theory of Dynamic Programming

A Production-Line Assignment Problem

Some Combinatorial Problems Arising in the Theory of Multistage Processes

On some variational problems occurring in the theory of dynamic programming--II.

On some variational problems occurring in the theory of dynamic programming--III.

On some variational problems occurring in the theory of dynamic programming--IV.

On some variational problems occurring in the theory of dynamic programming--VI.

Optimal Sets for Games Over the Square

Reduction of certain games over function space.

Solution Sets for Games on the Square

Some Functional Equations Related to Dynamic Programming Problems Involving Non-Commutative Operations

A Class of Games with Unique Solutions

Continuous Games with Given Unique Solutions.

Games Concave on Each Side of the Unit Square Diagonal

A Game Value Characterization of Algebraic Numbers

An Infinite-Dimensional Extension of a Symmetric Blotto Game

A Note on Payoffs Which Vanish Almost Everywhere

The Pathological Nature of Certain Games with Rational Payoff.

The Pathological Nature of Certain Games with Rational Payoff : II.

A Class of Games with Unique Density Function Solutions

A Continuous Colonel Blotto Game

n targets of differing vulnerability with attack stronger than defense.

On Certain Games with Transcendental Values

On functions of the form <>.

On measurable functions K which satisfy <>.

On the number of eigenvalues of a certain symmetric kernel.

The Symmetric Blotto Game

A Slide-Rule Inequality

Some Notes on the Slide-Rule Problem

Representation by Sums of Separable Functions

Representation by Sums of Separable Functions in n Dimensions