1 option
Algorithms and Computation : 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings / edited by Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee.
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, 7676.
- Theoretical Computer Science and General Issues ; 7676
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Computer networks.
- Computer graphics.
- Data structures (Computer science).
- Numerical analysis.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Computer Communication Networks.
- Computer Graphics.
- Data Structures.
- Numeric Computing.
- Local Subjects:
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Computer Communication Networks.
- Computer Graphics.
- Data Structures.
- Numeric Computing.
- Physical Description:
- 1 online resource (XVII, 702 pages) : 117 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 23rd International Symposium on Algorithms and Computation, ISAAC 2012, held in Taipei, Taiwan, in December 2012. The 68 revised full papers presented together with three invited talks were carefully reviewed and selected from 174 submissions for inclusion in the book. This volume contains topics such as graph algorithms; online and streaming algorithms; combinatorial optimization; computational complexity; computational geometry; string algorithms; approximation algorithms; graph drawing; data structures; randomized algorithms; and algorithmic game theory.
- Contents:
- Graph algorithms
- online and streaming algorithms
- combinatorial optimization
- computational complexity
- computational geometry
- string algorithms
- approximation algorithms
- graph drawing
- data structures
- randomized algorithms
- algorithmic game theory.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-35261-4
- 9783642352614
- 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.