Search Books
Object-Oriented Technology:… Algorithms and Complexity: …

STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science Lille, France, February 17-19, 2000 Proceedings (Lecture Notes in Computer Science)

Publisher Springer
Category Computers
📄 Viewing lite version Full site ›
🌎 Shop on Amazon — choose country
169.00 USD
🛒 Buy New on Amazon 🇺🇸 🏷 Buy Used — $4.24

✓ Usually ships in 24 hours

Share:
Book Details
PublisherSpringer
ISBN / ASIN3540671412
ISBN-139783540671411
AvailabilityUsually ships in 24 hours
Sales Rank16,369,336
CategoryComputers
MarketplaceUnited States 🇺🇸

Description

This book constitutes the refereed proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, held in Lille, France in February 2000.
The 51 revised full papers presented together with the three invited papers were carefully reviewed and selected from a total of 146 submissions on the basis of some 700 reviewers' reports. The papers address fundamental issues from all current areas of theoretical computer science including algorithms, data structures, automata, formal languages, complexity, verification, logic, cryptography, graph theory, optimization, etc.
The Good Web Site Guide 2006: The Completely Revised, …
View
The Pentium Microprocessor
View
Advanced Intel Microprocessors: 80286, 80386, And 80486
View
Differential Equations: Matrices and Models
View
Digital Experiments: Emphasizing Troubleshooting (Merr…
View
Data Structures for Computer Information Systems
View
The Little LISPer, Third Edition
View
Inside Networks
View
Computer Graphics Using Open GL (2nd Edition)
View