This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms and data structures, computational complexity, automata and formal languages, structural complexity, parallel and distributed systems, parallel algorithms, semantics, specification and verification, logic, computational geometry, cryptography, learning and inductive inference.
FREE Two-Day Shipping for students on millions of items. Learn more |
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
The exploding size and conceptual complexity of programs or, even more strikingly, distributed systems have led to the development of numerous descriptions methods typically aiming at rigorous structured and/or focussed system design. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
causal automata, evidence codewords, complete range assignment, symmetric fingerprinting scheme, acyclic orientation coverings, identification codewords, extensible pairs, multiplex select gate, common follow sets, follow sets automaton, standard rsr, valuation graph, small probability spaces, online multiplication, polynomial speedup, codeword phase, unit edge weights, projective characterization, instrumentation clocks, linear nondeterminism, register stack machine, blinding property, worst case constant time, probabilistic round, hybrid diagrams Key Phrases - Capitalized Phrases (CAPs): (learn more)
Las Vegas, Springer-Verlag Berlin Heidelberg, Monte Carlo, Springer Verlag, New York, Theory of Computing, Journal of Computing, Bias Equivalence Theorem, Discrete Mathematics, Information Processing Letters, Emde Boas, Acta Informatica, Discrete Algorithms, Germany Abstract, Mathematical Systems Theory, Department of Mathematics, Fachbereich Informatik, Martingale Dilation Theorem, Academic Press, Birgit Pfitzmann, Hilbert's Tenth Problem, Journal of Algorithms, System Sci, Cambridge University Press, Deutsche Forschungsgemeinschaft New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
The exploding size and conceptual complexity of programs or, even more strikingly, distributed systems have led to the development of numerous descriptions methods typically aiming at rigorous structured and/or focussed system design. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
causal automata, evidence codewords, complete range assignment, symmetric fingerprinting scheme, acyclic orientation coverings, identification codewords, extensible pairs, multiplex select gate, common follow sets, follow sets automaton, standard rsr, valuation graph, small probability spaces, online multiplication, polynomial speedup, codeword phase, unit edge weights, projective characterization, instrumentation clocks, linear nondeterminism, register stack machine, blinding property, worst case constant time, probabilistic round, hybrid diagrams Key Phrases - Capitalized Phrases (CAPs): (learn more)
Las Vegas, Springer-Verlag Berlin Heidelberg, Monte Carlo, Springer Verlag, New York, Theory of Computing, Journal of Computing, Bias Equivalence Theorem, Discrete Mathematics, Information Processing Letters, Emde Boas, Acta Informatica, Discrete Algorithms, Germany Abstract, Mathematical Systems Theory, Department of Mathematics, Fachbereich Informatik, Martingale Dilation Theorem, Academic Press, Birgit Pfitzmann, Hilbert's Tenth Problem, Journal of Algorithms, System Sci, Cambridge University Press, Deutsche Forschungsgemeinschaft New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Citations (learn more)
This book cites 72
books:
See all 72 books this book cites
- Theoretical Computer Science: Essays in Memory of Shimon Even (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues) by Oded Goldreich on 4 pages
- Structure in Complexity Theory (Lecture Notes in Computer Science) by Alan L. Selman on 4 pages
- Computational Complexity by Christos H. Papadimitriou on page 104, page 116, and page 386
- Introduction to Automata Theory, Languages, and Computation (2nd Edition) by John E. Hopcroft on page 66, page 306, and page 338
- Theory of Recursive Functions and Effective Computability by Hartley Rogers on page 236, and page 545
See all 72 books this book cites
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
