Amazon cover image
Image from Amazon.com

SWAT 88 : 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5-8, 1988 Proceedings / edited by Rolf Karlsson, Andrzej Lingas.

By: (1st : SWAT 88 (1st : 1988 : Halmstad, Sweden)Contributor(s): Karlsson, R. (Rolf), 1950- | Lingas, AndrzejMaterial type: TextTextSeries: Serienbezeichnung | Lecture notes in computer science ; 318.Publication details: Berlin, Heidelberg : Springer-Verlag, 1988. Description: 1 online resource : v.: digitalContent type: text Media type: computer Carrier type: online resourceISBN: 9783540392880; 3540392882Subject(s): Computer science | Computer software | Computer science | Computer softwareGenre/Form: Electronic books. Additional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA9.58 | .S28 1988Online resources: Click here to access online
Contents:
From the contents: Invited papers: S. Carlsson, J.I. Munro, P.V. Poblete: An Implicit Binomial Queue with Constant Insertion Time -- D. Wood: Extremal Cost Tree Data Structures -- M.H. Overmars: Connectability Problems -- M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert: Upper and Lower Bounds for the Dictionary Problem.
Summary: The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas related to algorithm theory, including data structures, computational geometry, and computational complexity. In addition to the selected papers the proceedings include invited papers from I. Munro, K. Mehlhorn, M. Overmars, and D. Wood.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

From the contents: Invited papers: S. Carlsson, J.I. Munro, P.V. Poblete: An Implicit Binomial Queue with Constant Insertion Time -- D. Wood: Extremal Cost Tree Data Structures -- M.H. Overmars: Connectability Problems -- M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert: Upper and Lower Bounds for the Dictionary Problem.

Includes bibliographical references.

The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas related to algorithm theory, including data structures, computational geometry, and computational complexity. In addition to the selected papers the proceedings include invited papers from I. Munro, K. Mehlhorn, M. Overmars, and D. Wood.

Powered by Koha