1 option
Algorithms -- ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings / edited by Leah Epstein, Paolo Ferragina.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 7501.
- Theoretical Computer Science and General Issues ; 7501
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer networks.
- Computer science--Mathematics.
- Computer science.
- Computer graphics.
- Numerical analysis.
- Data structures (Computer science).
- Algorithm Analysis and Problem Complexity.
- Computer Communication Networks.
- Discrete Mathematics in Computer Science.
- Computer Graphics.
- Numeric Computing.
- Data Structures.
- Local Subjects:
- Algorithm Analysis and Problem Complexity.
- Computer Communication Networks.
- Discrete Mathematics in Computer Science.
- Computer Graphics.
- Numeric Computing.
- Data Structures.
- Physical Description:
- 1 online resource (XX, 839 pages) : 147 illustrations.
- Edition:
- First edition 2012.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
- System Details:
- text file PDF
- Summary:
- This book constitutes the refereed proceedings of the 20th Annual European Symposium on Algorithms, ESA 2012, held in Ljubljana, Slovenia, in September 2012 in the context of the combined conference ALGO 2012. The 69 revised full papers presented were carefully reviewed and selected from 285 initial submissions: 56 out of 231 in track design and analysis and 13 out of 54 in track engineering and applications. The papers are organized in topical sections such as 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-33090-2
- 9783642330902
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.