#### Submissions from 1983

On Determinism Versus Non-Determinism And Related Problems, Wolfgang J. Paul, Nicholas Pippenger, Endre Szemeredi, and William T. Trotter

#### Submissions from 1982

Some Properties of Positive Derivations on f-Rings, Melvin Henriksen and Frank A. Smith

Sums of z-Ideals and Semiprime Ideals, Melvin Henriksen and Frank A. Smith

Superconcentrators of Depth 2, Nicholas Pippenger

Advances in Pebbling, Nicholas J. Pippenger

Probabilistic Simulations, Nicholas J. Pippenger

Rearrangeable Networks with Limited Depth, Nicholas Pippenger and Andrew C.-C. Yao

#### Submissions from 1981

A Fast Parallel Algorithm for Routing in Permutation Networks, Gavriela Freund Lev, Nicholas Pippenger, and Leslie G. Valiant

Algebraic Complexity Theory, Nicholas Pippenger

Bounds on the Performance of Protocols for a Multiple-Access Broadcast Channel, Nicholas Pippenger

Computational Complexity of Algebraic Functions, Nicholas Pippenger

Pebbling with an Auxiliary Pushdown, Nicholas Pippenger

#### Submissions from 1980

Existence and Uniqueness for a Variational Hyperbolic System without Resonance, Peter W. Bates and Alfonso Castro

Two Point Boundary Value Problem with Jumping Nonlinearities, Alfonso Castro

Order-Cauchy Completions of Rings and Vector Lattices of Continuous Functions, F. Dashiell, A. Hager, and Melvin Henriksen

On Nearly Pseudocompact Spaces, Melvin Henriksen and Marlon C. Rayburn

A New Lower Bound for the Number of Switches in Rearrangeable Networks, Nicholas Pippenger

On Another Boolean Matrix, Nicholas Pippenger

On the Evaluation of Powers and Monomials, Nicholas Pippenger

#### Submissions from 1979

A Semilinear Dirichlet Problem, Alfonso Castro

Critical Point Theory and the Number of Solutions of a Nonlinear Dirichlet Problem, Alfonso Castro and A. C. Lazer

Extendible Hashing—A Fast Access Method For Dynamic Files, Ronald Fagin, Jurg Nievergelt, Nicholas Pippenger, and H. Raymond Strong

A Summary of Results on Order-Cauchy Completions of Rings and Vector Lattices of Continuous Functions, Melvin Henriksen

On the Application of Coding Theory to Hashing, Nicholas Pippenger

Relations Among Complexity Measures, Nicholas Pippenger and Michael J. Fischer

Computational Complexity in Algebraic Function Fields, Nicholas J. Pippenger

On Simultaneous Resource Bounds, Nicholas J. Pippenger

Optimal 2,3-Trees, Nicholas J. Pippenger, Raymond E. Miller, Arnold L. Rosenberg, and Lawrence Snyder

#### Submissions from 1978

Hammerstein Integral Equations with Indefinite Kernel, Alfonso Castro

An Explicit Construction of Short Monotone Formulae for the Monotone Symmetric Functions, Mark Kleiman and Nicholas Pippenger

A Time-Space Trade-Off, Nicholas Pippenger

Generalized Connectors, Nicholas Pippenger

On Rearrangeable and Non-Blocking Switching Networks, Nicholas Pippenger

The Minimum Number of Edges in Graphs with Prescribed Paths, Nicholas Pippenger

#### Submissions from 1977

An Algebraic Characterization of the Freudenthal Compactification for a Class of Rimcompact Spaces, Melvin Henriksen

Applying Mathematics Without a License, Melvin Henriksen

Conditions that Guarantee that all Nilpotents Commute with Every Element of an Alternative Ring, Melvin Henriksen

Some Sufficient Conditions for the Jacobson Radical of a Commutative Ring with Identity to Contain a Prime Ideal, Melvin Henriksen

Tychonoff Spaces That Have a Compactification with Countable Remainder, Melvin Henriksen

An Information-Theoretic Method in Combinatorial Theory, Nicholas Pippenger

Superconcentrators, Nicholas Pippenger

The Complexity of Monotone Boolean Functions, Nicholas Pippenger

#### Submissions from 1976

On Graphs Which Contain All Small Trees, II, F. R. K. Chang, R. L. Graham, and Nicholas Pippenger

Multiplicatively Periodic Rings, Ted Chinburg and Melvin Henriksen

Sums of k-th powers in the Ring of Polynomials with Integer Coefficients, Ted Chinburg '75 and Melvin Henriksen

On the Juror Utilization Problem, Melvin Henriksen and George H. Orland

Information Theory and the Complexity of Boolean Functions, Nicholas Pippenger

On the Evaluation of Powers and Related Problems, Nicholas J. Pippenger

The Realization of Monotone Boolean Functions, Nicholas J. Pippenger

Shifting Graphs and Their Applications, Nicholas Pippenger and Leslie G. Valiant

Finding the Median, Arnold Schönhage, Mike Paterson, and Nicholas Pippenger

#### Submissions from 1975

Sums of kth Powers in the Ring of Polynomials With Integer Coefficients, Ted Chinburg and Melvin Henriksen

A Simple Characterization of Commutative Rings Without Maximal Ideals, Melvin Henriksen

On Crossbar Switching Networks, Nicholas Pippenger

The Inducibility of Graphs, Nicholas Pippenger and Martin Charles Golumbic

Information Theory and the Complexity of Switching Networks, Nicholas J. Pippenger

#### Submissions from 1974

Two Classes of Rings Generated by Their Units, Melvin Henriksen

On the Complexity of Strictly Nonblocking Concentration Networks, Nicholas Pippenger

Fields Medals and Nevanlinna Prize Presented at ICM-94 in Zurich, Nicholas Pippenger, J. Lindenstrauss, L.C. Evans, A. Douady, and A. Shalev

#### Submissions from 1973

On a Class of Regular Rings That Are Elementary Divisor Rings, Melvin Henriksen

#### Submissions from 1972

On Difficulties in Embedding Lattice-Ordered Integral Domains In Lattice-Ordered Fields, Melvin Henriksen

#### Submissions from 1971

Toeplitz Operators on Locally Compact Abelian Groups, Henry A. Krieger and C.A. Schaffner

The Global Optimization of Incoherent-Phase Signals, Henry A. Krieger and Charles Albert Schaffner

#### Submissions from 1970

Calculus and the Computer: A Conservative Approach, Melvin Henriksen

#### Submissions from 1965

Minimal Projective Extensions of Compact Spaces, Melvin Henriksen and Meyer Jerison

The Space of Minimal Prime Ideals of a Commutative Ring, Melvin Henriksen and Meyer Jerison

Toeplitz Operators on Locally Compact Abelian Groups, Henry A. Krieger

#### Submissions from 1964

Averages of Continuous Functions on Countable Spaces, Melvin Henriksen and John R. Isbell

#### Submissions from 1962

Lattice-Ordered Rings and Function Rings, Melvin Henriksen and John R. Isbell

On the Structure of a Class of Archimedean Lattice-Ordered Algebras, Melvin Henriksen and D. G. Johnson

#### Submissions from 1959

Multiplicative Summability Methods and the Stone-Čech Compacification, Melvin Henriksen

#### Submissions from 1958

Some Properties of Compactifications, Melvin Henriksen and John R. Isbell

#### Submissions from 1957

On Minimal Completely Regular Spaces Associated With a Given Ring of Continuous Functions, Melvin Henriksen

Some Remarks on a Paper of Aronszajn and Panitchpakdi, Melvin Henriksen

Local Connectedness in the Stone-Cech Compactification, Melvin Henriksen and John R. Isbell

#### Submissions from 1956

On Rings of Bounded Continuous Functions with Values in a Division Ring, Ellen Correl and Melvin Henriksen

Rings of Continuous Functions in Which Every Finitely Generated Ideal is Principal, Leonard Gillman and Melvin Henriksen

Some Remarks About Elementary Divisor Rings, Leonard Gillman and Melvin Henriksen

On the Equivalence of the Ring, Lattice, and Semigroup of Continuous Functions, Melvin Henriksen

#### Submissions from 1955

An Isomorphism Theorem for Real-Closed Fields, P. Erdös, L. Gillman, and Melvin Henriksen

Some Remarks on Elementary Divisor Rings II, Melvin Henriksen

#### Submissions from 1954

Concerning Rings of Continuous Functions, Leonard Gillman and Melvin Henriksen

On a Theorem of Gelfand and Kolmogoroff Concerning Maximal Ideals in Rings of Continuous Functions, Leonard Gillman, Melvin Henriksen, and Meyer Jerison

#### Submissions from 1953

On Rings of Entire Functions of Finite Order, Melvin Henriksen

On the Prime Ideals of the Ring of Entire Functions, Melvin Henriksen

On the Continuity of the Real Roots of an Algebraic Equation, Melvin Henriksen and John R. Isbell

#### Submissions from 1952

On the Ideal Structure of the Ring of Entire Functions, Melvin Henriksen