This is the proceedings of the SIGAL International Symposium on Algorithms held at CSK Information Education Center, Tokyo, Japan, August 16-18, 1990. SIGAL (Special Interest Group on Algorithms) was organized within the Information Processing Society of Japan in 1988 to encourage research in the field of discrete algorithms, and held 6-8 research meetings each year. This symposium is the first international symposium organized by SIGAL. In response to the call for papers, 88 papers were submitted from around the world. The program committee selected 34 for presentation at the symposium. The symposium also included 5 invited lectures and 10 invited presentations. The subjects of the papers range widely in the field of discrete algorithms in theoretical computer science. Keywords for these subjects are: computational geometry, graph algorithms, complexity theory, parallel algorithms, distributed computing, and computational algebra.
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 selection networks of which we speak are comparator networks (see Knuth [K]) that classify a set of n values into two classes, with each of the values in one class being at least as large as all of those in the other. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
optimal splitter, list prefix algorithm, maximal matching set, dear gadgets, random variable tree, epsilon box, spatial point location, polyhedral hierarchy, partial classifier, approximate classifiers, proper circular arc graphs, directional depth, tree contraction algorithm, bisecting curves, instance easiness, sieve phase, leader processor, persistent search tree, separator tree, combinatorial relaxation, threshold predicates, linked list algorithms, data dependence graph, cycle separator, universal vertex Key Phrases - Capitalized Phrases (CAPs): (learn more)
Theory of Computing, Foundations of Computer Science, Lecture Notes, Technical Report, Natural Merge Sort, New York, Parallel Processing, Academic Press, Systems Theory, Complexity Theory Conference, Information Processing Letters, Springer Verlag, Unbalance Lemma, National Science Foundation, Systems Research Center, Annual Symposium, Combinatorial Geometry, Computer Society Press, Faculty of Engineering, System Sci, University of California, Artificial Intelligence, Chaining Phase, Discrete Math, Equally Spaced Polynomial New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
The selection networks of which we speak are comparator networks (see Knuth [K]) that classify a set of n values into two classes, with each of the values in one class being at least as large as all of those in the other. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
optimal splitter, list prefix algorithm, maximal matching set, dear gadgets, random variable tree, epsilon box, spatial point location, polyhedral hierarchy, partial classifier, approximate classifiers, proper circular arc graphs, directional depth, tree contraction algorithm, bisecting curves, instance easiness, sieve phase, leader processor, persistent search tree, separator tree, combinatorial relaxation, threshold predicates, linked list algorithms, data dependence graph, cycle separator, universal vertex Key Phrases - Capitalized Phrases (CAPs): (learn more)
Theory of Computing, Foundations of Computer Science, Lecture Notes, Technical Report, Natural Merge Sort, New York, Parallel Processing, Academic Press, Systems Theory, Complexity Theory Conference, Information Processing Letters, Springer Verlag, Unbalance Lemma, National Science Foundation, Systems Research Center, Annual Symposium, Combinatorial Geometry, Computer Society Press, Faculty of Engineering, System Sci, University of California, Artificial Intelligence, Chaining Phase, Discrete Math, Equally Spaced Polynomial 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 56
books:
See all 56 books this book cites
- The Design and Analysis of Computer Algorithms by Alfred V. Aho on 6 pages
- Algorithms in Combinatorial Geometry (Eatcs Monographs on Theoretical Computer Science) by H. Edelsbrunner on 5 pages
- Structure in Complexity Theory (Lecture Notes in Computer Science) by Alan L. Selman on 4 pages
- Combinatorial Geometry by J?nos Pach on page 428, page 438, and page 446
- 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 38, page 230, and page 231
See all 56 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 > Business & Investing > Economics
- Books > Computers & Technology > Computer Science
- Books > Computers & Technology > Databases
- Books > Computers & Technology > Networking > Network Administration
- Books > Computers & Technology > Programming > Algorithms
- Books > New & Used Textbooks > Computer Science > Algorithms
- Books > New & Used Textbooks > Science & Mathematics > Mathematics > Statistics
- Books > Science & Math > Mathematics
