Algorithms and Computation [electronic resource] : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings / edited by Takao Asano, Shin-ichi Nakano, Yoshio Okamoto, Osamu Watanabe.
By: Asano, Takao [editor.].
Contributor(s): Nakano, Shin-ichi [editor.] | Okamoto, Yoshio [editor.] | Watanabe, Osamu [editor.] | SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 7074Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Description: XVIII, 775 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642255915.Subject(s): Computer science | Computer Communication Networks | Data structures (Computer science) | Computer software | Electronic data processing | Computational complexity | Computer graphics | Computer Science | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Computer Communication Networks | Computer Graphics | Data Structures | Numeric ComputingDDC classification: 005.1 Online resources: Click here to access online
In:
Springer eBooksSummary: This book constitutes the refereed proceedings of the 22nd International Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for inclusion in the book. This volume contains topics such as approximation algorithms; computational geometry; computational biology; computational complexity; data structures; distributed systems; graph algorithms; graph drawing and information visualization; optimization; online and streaming algorithms; parallel and external memory algorithms; parameterized algorithms; game theory and internet algorithms; randomized algorithms; and string algorithms.
This book constitutes the refereed proceedings of the 22nd International Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for inclusion in the book. This volume contains topics such as approximation algorithms; computational geometry; computational biology; computational complexity; data structures; distributed systems; graph algorithms; graph drawing and information visualization; optimization; online and streaming algorithms; parallel and external memory algorithms; parameterized algorithms; game theory and internet algorithms; randomized algorithms; and string algorithms.
There are no comments for this item.