Author Description

These papers embrace many topics of theoretical computer science, including algorithm problems on lattices, parallel computing, maze searching, NP-hard and NP-complete problems and some new approaches to characterize computational complexity. mmunication Complexity (F. Hossfeld). Tight Worst-Case Bounds for Bin-Packing Algorithms (A. Ivanyi). Hypergraph Planarity and the Complexity of Drawing Venn Diagrams (D.S. Johnson and H.O. Pollak). Convolutional Charaterization of Computability and Complexity of Computations (S. Jukna). Succinct Data Representations and the Complexity of Computations (S. Jukna). Lattices, Basis Reduction and the Shortest Vector Problem (R. Kannan). The Characterization of Some Complexity Classes by Recursion Schemata (M. Liskiewicz, K. Lorys and M. Piotrow). Some Algorithmic Problems on Lattices (L. Lovasz). Linear Proofs in the Non-Negative Cone (J. Moravek). Characterizing Some Low Arithmetic Classes (J.B. Paris, W.G. Handley and A.J. Wilkie). Constructing a Simplex Form of a Rational Matrix (A. Rycerz and J. Jegier). Computing N with a Few Number of Additions (I. Ruzsa and Zs. Tuza). A Hierarchy of Polynomial Time Basis Reduction Algorithms (C.P.