Algorithms: International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990. Proceedings

Introduction

In the ever-evolving world of theoretical computer science, few resources capture the intellectual ferment of an era quite like a well-curated symposium proceedings. Algorithms: International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990. Proceedings is one such treasure. Edited by the distinguished Tetsuo Asano and published by Springer, this hardbound volume offers a rare window into the foundational research that shaped modern discrete algorithms. For Indian students, researchers, and professionals who value depth over trend, this book stands as a timeless reference—a snapshot of global algorithmic thinking at the dawn of the 1990s.

Book Overview

This volume presents the complete proceedings of the first international symposium organized by SIGAL (Special Interest Group on Algorithms) of the Information Processing Society of Japan. Held at the CSK Information Education Center in Tokyo, the symposium brought together leading minds from around the world. Out of 88 submitted papers, only 34 were selected for presentation, ensuring a high standard of scholarship. The book also includes five invited lectures and ten invited presentations, covering a broad spectrum of discrete algorithms. From computational geometry to parallel computing, each paper reflects rigorous peer review and enduring relevance.

Key Highlights

• First International SIGAL Symposium: Marks a historic milestone in Japanese algorithmic research, establishing a global platform for exchange.
• Curated Excellence: Only 34 of 88 submissions were accepted, guaranteeing quality and originality.
• Invited Contributions: Features five invited lectures and ten invited presentations from leading researchers of the time.
• Diverse Scope: Covers computational geometry, graph algorithms, complexity theory, parallel algorithms, distributed computing, and computational algebra.
• Hardcover Durability: A sturdy Springer edition built to withstand years of reference use in libraries and personal collections.

Inside the Book

Open the cover and you will find a meticulously organized collection of research papers, each accompanied by abstracts, references, and detailed mathematical formulations. The proceedings are arranged thematically, allowing readers to trace the evolution of ideas across multiple domains. The invited lectures offer broader perspectives, while the contributed papers dive deep into specific problems—such as efficient geometric searching, parallel graph algorithms, and algebraic complexity. The language is formal yet accessible to anyone with a solid foundation in computer science theory. Every page reflects the intellectual rigor of the late 1980s and early 1990s, a period when algorithms were being redefined for emerging parallel and distributed systems.

Key Topics

• Computational Geometry: Algorithms for geometric problems like convex hulls, Voronoi diagrams, and range searching.
• Graph Algorithms: Novel approaches to shortest paths, network flows, and graph colouring.
• Complexity Theory: Lower bounds, NP-completeness results, and structural complexity.
• Parallel Algorithms: Designs for PRAM models and interconnection networks.
• Distributed Computing: Consensus, synchronization, and fault-tolerant protocols.
• Computational Algebra: Polynomial manipulation, Gröbner bases, and symbolic computation.

Reader Benefits

For Indian readers, this book offers a unique opportunity to engage with foundational research that still influences modern algorithms. It helps build a strong theoretical base for competitive programming, academic research, and advanced studies. The hardcover format ensures longevity, making it a worthy addition to any serious computer science library. By studying these proceedings, readers gain insight into the problem-solving mindset of leading researchers—an invaluable asset for those preparing for GATE, NET, or international fellowships. Moreover, the international perspective broadens one's understanding of how algorithmic challenges were tackled across different cultures and institutions.

Learning Outcomes

• Understand the state-of-the-art in discrete algorithms as of 1990, including open problems that later shaped the field.
• Analyze classic papers on computational geometry and graph theory that remain cited in contemporary research.
• Grasp the early foundations of parallel and distributed algorithms, crucial for modern multi-core and cloud systems.
• Develop the ability to read and critique formal research papers—a skill essential for academic growth.
• Identify enduring techniques such as divide-and-conquer, amortized analysis, and randomized algorithms in their original contexts.

Who Should Read

This volume is ideal for advanced undergraduate and postgraduate students in computer science, especially those specializing in algorithms and theoretical computing. Research scholars working on computational geometry, graph theory, or complexity will find direct relevance. Faculty members designing courses on algorithm design can use selected papers as case studies. Industry professionals in R&D roles—particularly those involved in algorithm optimization or system design—will appreciate the historical depth. Finally, libraries at Indian universities and research institutes should consider this a core acquisition for their computer science collections.

About the Author

Tetsuo Asano is a renowned Japanese computer scientist, widely recognized for his contributions to computational geometry and algorithms. He has been a professor at the Japan Advanced Institute of Science and Technology (JAIST) and has served on editorial boards of top journals. His work on geometric data structures and optimization algorithms has earned international acclaim. As the editor of this proceedings, he brought together a diverse set of high-quality papers that reflect the global state of algorithmic research at the time.

About the Publisher

Springer is one of the world's leading academic publishers, known for its rigorous peer-review process and high-quality scientific books. Founded in 1842, the Springer-Verlag has published groundbreaking works across mathematics, computer science, engineering, and medicine. This volume is part of Springer's prestigious Lecture Notes in Computer Science series, which has become a trusted resource for researchers worldwide. Indian readers can rely on Springer's reputation for accuracy, durability, and scholarly excellence.

Conclusion

Algorithms: International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990. Proceedings is more than a historical artifact—it is a living document of algorithmic thought. For anyone serious about understanding the roots of modern computing, this hardcover edition offers unparalleled depth. Whether you are a student aiming for academic excellence, a researcher seeking inspiration, or a professional building robust systems, the ideas within these pages will sharpen your thinking. Order your copy today from Bookshops.in and own a piece of algorithmic history that continues to inform the future.