This book constitutes the strictly refereed proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, STACS 98, held in Paris, France, in February 1998. The volume presents three invited surveys together with 52 revised full papers selected from a total of 155 submissions. The papers are organized in topical sections on algorithms and data structures, logic, complexity, and automata and formal languages.
FREE Two-Day Shipping for students on millions of items. Learn more |
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
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:
Cellular data and communication networks are usually modeled as planar graphs with each node representing a base station (sometimes called a cell) in the network. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
ranking dictionary, optimal proof systems, systolic languages, deletion heuristic, aperiodic trace languages, least fixed point rule, planar convex subdivision, sparse bit strings, unary automata, expressivity bounds, associative closure, neighbor dictionary, practical parallel algorithms, wreath product principle, constant approximable, decorrelated ciphers, planted partition, temporal height, valid number system, bitonic merge sort, iteration algebras, randomized branching programs, transcript operation, subword complexity, local computation time Key Phrases - Capitalized Phrases (CAPs): (learn more)
Lecture Notes, Theory of Computing, New York, Global Step, Lectures Notes, Perfect Cipher, Springer Verlag, Leaf Rank, Discrete Mathematics, System Sci, Discrete Algorithms, Rutgers University, Emde Boas, Random Structures, Santa Barbara, Acta Informatica, Annual Symposium, International Conference, International Workshop, Leaf Pos, North Holland, Prentice Hall, Two-Way Merging, World Scientific, Academic Press New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Cellular data and communication networks are usually modeled as planar graphs with each node representing a base station (sometimes called a cell) in the network. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
ranking dictionary, optimal proof systems, systolic languages, deletion heuristic, aperiodic trace languages, least fixed point rule, planar convex subdivision, sparse bit strings, unary automata, expressivity bounds, associative closure, neighbor dictionary, practical parallel algorithms, wreath product principle, constant approximable, decorrelated ciphers, planted partition, temporal height, valid number system, bitonic merge sort, iteration algebras, randomized branching programs, transcript operation, subword complexity, local computation time Key Phrases - Capitalized Phrases (CAPs): (learn more)
Lecture Notes, Theory of Computing, New York, Global Step, Lectures Notes, Perfect Cipher, Springer Verlag, Leaf Rank, Discrete Mathematics, System Sci, Discrete Algorithms, Rutgers University, Emde Boas, Random Structures, Santa Barbara, Acta Informatica, Annual Symposium, International Conference, International Workshop, Leaf Pos, North Holland, Prentice Hall, Two-Way Merging, World Scientific, Academic Press New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 86
books:
See all 86 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 page 60, page 616, and page 617
- Computational Complexity by Christos H. Papadimitriou on page 115, page 204, and page 617
- Finite Model Theory (Springer Monographs in Mathematics) by Heinz-Dieter Ebbinghaus on page 104, page 193, and page 454
- Formal Languages (Computer science classics) by Arto Salomaa on page 160, page 331, and page 465
- Varieties of Formal Languages (Foundations of Computer Science) by J.E. Pin on page 83, and page 343
See all 86 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 > Programming > Algorithms
- Books > Computers & Technology > Programming > Graphics & Multimedia
- Books > Computers & Technology > Security & Encryption
- Books > New & Used Textbooks > Computer Science > Algorithms
- Books > New & Used Textbooks > Computer Science > Graphics & Visualization
- Books > New & Used Textbooks > Computer Science > Programming Languages
- Books > New & Used Textbooks > Science & Mathematics > Mathematics
- Books > Science & Math > Mathematics
