Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	Juni 1988
Genre:	Schulbücher
ISBN:	9783540194873
EAN-Code:	9783540194873
Verlag:	Springer Berlin Heidelberg
Einband:	Kartoniert
Sprache:	English
Dimensionen:	H 235 mm / B 155 mm / D 15 mm
Gewicht:	417 gr
Seiten:	272
Zus. Info:	Paperback
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

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. TOC: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.