Volume 11, Number 1, January 1994
Volume 11, Number 2, February 1994
: A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort.
: The Derivation of On-Line Algorithms, with an Application To Finding Palindromes.
Volume 11, Number 3, March 1994
Network Flow Algorithms
Harold N. Gabow
: Editor's Foreword: Special Issur on Network Flow Algorithms.
, Ron Shamir
: Efficient Algorithms for Minimum-Cost Flow Problems with Piecewise-Linear Convex Costs.
: Network Flow and 2-Satisfiability.
Volume 11, Number 4, April 1994
: On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems.
Volume 11, Number 5, May 1994
Thomas H. Spencer
: Provably Good Pattern Generators for a Random Pattern Test.
Volume 11, Number 6, June 1994
Mordecai J. Golin
: A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm.
Neal E. Young
: The k-Server Dual and Loose Competitiveness for Paging.