ENGLISH

Algorithms and Computation: 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21–23, 2002 Proceedings

By Amitabha Bagchi , Adam L. Buchsbaum , Michael T. Goodrich (auth.) , Prosenjit Bose , Pat Morin (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2002
ISBN
3540001425, 9783540001423
DOI
10.1007/3-540-36136-7
Open Library ID
OL18180536M
Language
english
Format
PDF
Filesize
7 MB (6893024 bytes)
Series
Lecture Notes in Computer Science 2518
Edition
1
Pages
662\667
Library
Kolxo3
Time added
2009-12-04 00:34:26
Algorithm Analysis and Problem Complexity; Compute

Description

This book constitutes the refereed proceedings of the 13th Annual International Symposium on Algorithms and Computation, ISAAC 2002, held in Vancouver, BC, Canada in November 2002. The 54 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from close to 160 submissions. The papers cover all relevant topics in algorithmics and computation, in particular computational geometry, algorithms and data structures, approximation algorithms, randomized algorithms, graph drawing and graph algorithms, combinatorial optimization, computational biology, computational finance, cryptography, and parallel and distributedd algorithms.

Similar books