Nicht aus der Schweiz? Besuchen Sie lehmanns.de

Algorithms – ESA 2013

21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings
Buch | Softcover
XVIII, 829 Seiten
2013 | 2013
Springer Berlin (Verlag)
978-3-642-40449-8 (ISBN)
CHF 74,85 inkl. MwSt
This book constitutes the refereed proceedings of the 21st Annual European Symposium on Algorithms, ESA 2013, held in Sophia Antipolis, France, in September 2013 in the context of the combined conference ALGO 2013. The 69 revised full papers presented were carefully reviewed and selected from 303 initial submissions: 53 out of 229 in track "Design and Analysis" and 16 out of 74 in track "Engineering and Applications". The papers in this book present original research in all areas of algorithmic research, including but not limited to: algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching; quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms.

Algorithm engineering.- Algorithmic aspects of networks.- Algorithmic game theory.- Aproximation algorithms.- Computational biology.- Computational finance.- Computational geometry.- Combinatorial optimization.- Data compression.- Data structures.- Databases and information retrieval.- Distributed and parallel computing.- Graph algorithms.- Hierarchical memories.- Heuristics and meta-heuristics.- Mathematical programming.- Mobile computing.- On-line algorithms.- Parameterized complexity.- Pattern matching.- Quantum computing.- Randomized algorithms.- Scheduling and resource allocation problems.- Streaming algorithms.

Erscheint lt. Verlag 13.8.2013
Reihe/Serie Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Zusatzinfo XVIII, 829 p. 134 illus.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Gewicht 1257 g
Themenwelt Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
Schlagworte Algorithm analysis and problem complexity • data structures • experimental algorithms • mobile computing • online algorithms • parallel string sorting • technology diffusion
ISBN-10 3-642-40449-9 / 3642404499
ISBN-13 978-3-642-40449-8 / 9783642404498
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15