My Account Log in

1 option

Algorithms and Computation : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings / edited by Takao Asano, Shin-ichi Nakano, Yoshio Okamoto, Osamu Watanabe.

SpringerLink Books Computer Science (2011-2024) Available online

View online
Format:
Book
Contributor:
Asano, Takao., Editor.
Nakano, Shin-ichi, Editor.
Okamoto, Yoshio., Editor.
Watanabe, Osamu, Editor.
SpringerLink (Online service)
Series:
Computer Science (SpringerNature-11645)
LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 7074
Theoretical Computer Science and General Issues, 2512-2029 ; 7074
Language:
English
Subjects (All):
Algorithms.
Computer science-Mathematics.
Discrete mathematics.
Computer networks.
Computer graphics.
Artificial intelligence-Data processing.
Numerical analysis.
Discrete Mathematics in Computer Science.
Computer Communication Networks.
Computer Graphics.
Data Science.
Numerical Analysis.
Local Subjects:
Algorithms.
Discrete Mathematics in Computer Science.
Computer Communication Networks.
Computer Graphics.
Data Science.
Numerical Analysis.
Physical Description:
1 online resource (XVIII, 775 pages)
Edition:
1st ed. 2011.
Contained In:
Springer Nature eBook
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
System Details:
text file PDF
Summary:
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.
Other Format:
Printed edition:
ISBN:
978-3-642-25591-5
9783642255915
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.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account