This book presents the proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS 95), held in Munich, Germany in March 1995. Besides three invited talks, the book contains revised versions of 53 research papers selected from a total of 180 submissions. The contributions address all current aspects of theoretical computer science; they are organized in sections on complexity theory, automata theory, algorithms, logic, theory of parallel computing, communication theory, graph theory and databases, and computational geometry.
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 usual tournament used for finding , the best of n players assumes that each game played is won by the better of the two players involved. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
edge cost modification, prokaryotic protein coding genes, systolic run, bounded counting type, paperfolding word, malign distributions, morphic words, causal bisimulation, location bisimulation, monic refinement, systolic automaton, paperfolding sequences, coding morphism, dynamic shortest path problem, minimum overall number, visual event surfaces, average case measure, embeddable tree, hammock decomposition, outerplanar digraphs, bitonic merge sort, second pushdown store, secure pseudorandom generators, slender languages, trace monoids Key Phrases - Capitalized Phrases (CAPs): (learn more)
Theory of Computing, New York, Springer Verlag, Vertex Cover, Academic Press, Chinese Remaindering, Small Span Theorem, Information Processing Letters, Journal of Algorithms, Journal of Computing, Germany Abstract, K-Global Multiple, Proceedings Structure, Proposition Let, Addison Wesley, Codon Amino, Infinite Objects, International Symposium, K-Balanced Overall, K-Global Overall, Projection Lemma, University of Rochester, Acta Informatica, Cambridge University Press, Computer Technology Institute New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
The usual tournament used for finding , the best of n players assumes that each game played is won by the better of the two players involved. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
edge cost modification, prokaryotic protein coding genes, systolic run, bounded counting type, paperfolding word, malign distributions, morphic words, causal bisimulation, location bisimulation, monic refinement, systolic automaton, paperfolding sequences, coding morphism, dynamic shortest path problem, minimum overall number, visual event surfaces, average case measure, embeddable tree, hammock decomposition, outerplanar digraphs, bitonic merge sort, second pushdown store, secure pseudorandom generators, slender languages, trace monoids Key Phrases - Capitalized Phrases (CAPs): (learn more)
Theory of Computing, New York, Springer Verlag, Vertex Cover, Academic Press, Chinese Remaindering, Small Span Theorem, Information Processing Letters, Journal of Algorithms, Journal of Computing, Germany Abstract, K-Global Multiple, Proceedings Structure, Proposition Let, Addison Wesley, Codon Amino, Infinite Objects, International Symposium, K-Balanced Overall, K-Global Overall, Projection Lemma, University of Rochester, Acta Informatica, Cambridge University Press, Computer Technology Institute 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 64
books:
See all 64 books this book cites
- Introduction to Automata Theory, Languages, and Computation (2nd Edition) by John E. Hopcroft on 4 pages
- Structure in Complexity Theory (Lecture Notes in Computer Science) by Alan L. Selman on 4 pages
- 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
- Computer Science: A Breadth-First Approach with C by John Impagliazzo on page 59, and page 626
- Combinatorics on Traces (Lecture Notes in Computer Science) by Volker Diekert on page 396, and page 477
See all 64 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
|
Listmania!
So You'd Like to...
Look for Similar Items by Category
- Books > Computers & Technology > Computer Science
- Books > Computers & Technology > Programming > Algorithms
- Books > Computers & Technology > Programming > Languages & Tools
- Books > New & Used Textbooks > Computer Science > Algorithms
- Books > New & Used Textbooks > Computer Science > Programming Languages
- Books > New & Used Textbooks > Science & Mathematics > Mathematics
- Books > Science & Math > Mathematics
