Advances in Algorithms, Languages, and Complexity - Image 1

£138.86

Springer Advances in Algorithms, Languages, and Complexity

Name: Advances in Algorithms, Languages, and Complexity
Brand: Springer
Price: 138.86 GBP
Availability: InStock

Algorithms

This is the most expensive it has ever been. Walk away.

£139 today · previous high £139 · all-time low £139

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 36 days · 36 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 36 days • 1 price levels

Days at Price

Price Analysis

Most common price: £139 (36 days, 100.0%)

Price range: £139 - £139

Price levels: 1 different prices over 36 days

Description

This book contains a collection of sixteen survey papers on recent developments in algorithms, formal languages, and computational complexity. These are the three areas in which Professor Ronald V. Book has made significant contributions, and the objective of the editors and the contributors is to honor Professor Book on his sixtieth birthday. Audience: Researchers and graduate students with interests in design and analysis of algorithms, in language theory, and in computational complexity.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 1461333962
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Publication Date: 12 October 2011
Listed Since: 12 July 2012

Barcode

No barcode data available

Springer Advances in Algorithms, Languages, and Complexity

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Computer Science – Theory and Applications: 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, ... (Lecture Notes in Computer Science, 10846)

Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I: 9134 (Lecture Notes in Computer Science, 9134)

Mathematical Foundations of Computer Science 1998: 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998: 1450 (Lecture Notes in Computer Science, 1450)

Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings: 11485 (Lecture Notes in Computer Science, 11485)

Algorithms and Computation: 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings: 4288 (Lecture Notes in Computer Science, 4288)

Theory and Applications of Models of Computation: 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings: 4484 (Lecture Notes in Computer Science, 4484)

Automata, Languages and Programming: 13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings: 226 (Lecture Notes in Computer Science, 226)

LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings: 10807 (Lecture Notes in Computer Science, 10807)

Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000: 4 (De Gruyter Series in Logic & its Applications, 4)

Algorithms and Computation: 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings: 2906 (Lecture Notes in Computer Science, 2906)

Algorithms and Computation: 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings: 5878 (Lecture Notes in Computer Science, 5878)

Computability and Complexity Theory (Texts in Computer Science)

Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings: 2747 (Lecture Notes in Computer Science, 2747)

Automata, Languages and Programming: 15th International Colloquium, Tampere, Finland, July 11-15, 1988. Proceedings: 317 (Lecture Notes in Computer Science, 317)

Automata, Languages and Programming: 19th International Colloquium, Wien, Austria, July 13-17, 1992. Proceedings: 623 (Lecture Notes in Computer Science, 623)

Springer Automata, Languages and Programming ICALP 2002

Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz