Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	Juli 2015
Genre:	Schulbücher
	Algorithm Analysis and Problem Complexity / Algorithms / Algorithms & data structures / C / Computer Communication Networks / Computer communication systems / Computer Graphics / computer science / Computer science—Mathematics / Data Science / Data Structures / Data structures (Computer science) / Datenbanken / Discrete Mathematics / Discrete Mathematics in Computer Science / Diskrete Mathematik / Grafikprogrammierung / Graphics programming / Mathematical theory of computation / Mathematik für Informatiker / Maths for computer scientists / Network hardware / Netzwerk-Hardware / Numeric Computing / Numerical analysis / Numerische Mathematik mehr...
ISBN:	9783319218397
EAN-Code:	9783319218397
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#9214 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H 235 mm / B 155 mm / D
Gewicht:	9825 gr
Seiten:	646
Illustration:	XIII, 646 p. 125 illus., schwarz-weiss Illustrationen
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

This book constitutes the refereed proceedings of the 14th Algorithms and Data Structures Symposium, WADS 2015, held in Victoria, BC, Canada, August 2015. The 54 revised full papers presented in this volume were carefully reviewed and selected from 148 submissions. The Algorithms and Data Structures Symposium - WADS (formerly Workshop on Algorithms And Data Structures), which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. WADS includes papers presenting original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.