Abstract is missing.
- Average-Case Analysis Using Kolgomorov Complexity (Abstract)Ming Li, Paul M. B. Vitányi. 1-4
- Application of Algorithm Theory to Data MiningTakeshi Tokuyama. 5-20
- Independent Spanning Trees with Small Depths in Iterated Line DigraphsToru Hasunuma, Hiroshi Nagamochi. 21-36
- Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3Weifa Liang, George Havas. 37-50
- Wormhole Routing on the Star Graph Interconnection NetworkChang-Biau Yang, Tung-Hsing Liu. 51-66
- Inferring Ordered Trees from Local ConstraintsLeszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin. 67-76
- A New Measure of Disorder in Sorting - EntropyTadao Takaoka. 77-86
- The Ultimate HeapsortJyrki Katajainen. 87-96
- Delayed Correction - Binary Search with Errors Made Very Simple but EfficientFrank Albers, Peter Damaschke. 97-106
- Default-Sensitive PreProcessings for Finding MaximaMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting. 107-120
- Filters for Graph MatchingSteve Callaghan, Gerard Ellis, James Harland. 121-136
- An Average Case Analysis of the Branching Algorithm for Solving k -Satisfiability ProblemsYing Teh Tsai, Chuan Yi Tang. 137-150
- Separating Weakening and Contraction in a Linear Lambda CalculusJohn Maraist. 151-166
- Optimisation NetsErnie Ong. 167-182
- A Classical Catch/Throw Calculus with Tag Abstractions and its Strong NormalizabilityYukiyoshi Kameyama, Masahiko Sato. 183-198
- On Quadratic Polynomials for the Number Field SieveBrian Murphy, Richard P. Brent. 199-214
- Alignment of Low Information SequencesDavid R. Powell, Lloyd Allison, Trevor I. Dix, David L. Dowe. 215-230
- On the Linear Independence of the Bivariate Discrete Convolution Blending FunctionsL. Yohanes Stefanus, Ronald N. Goldman. 231-244
- A Banach Space Based Semantics for Probabilistic Concurrent Constraint ProgrammingAlessandra Di Pierro, Herbert Wiklicky. 245-260
- Automatic Generation of Verifiable Cache Coherence Simulation Models from High-Level SpecificationsA. J. Field, Peter G. Harrison, K. Kanani. 261-276
- Computational Complementarity and Sofic ShiftsCristian S. Calude, Marjo Lipponen. 277-290
- Tree Models and Probabilistic Polynomial Time ComputationsA. Pgourtzis, K. Sharma, E. Zachos. 291-304