Overview

Editors:

Tetsuo Asano,
Toshihide Ibaraki,
Hiroshi Imai,
…
Takao Nishizeki

Tetsuo Asano

View editor publications

You can also search for this editor in PubMed Google Scholar
Toshihide Ibaraki

View editor publications

You can also search for this editor in PubMed Google Scholar
Hiroshi Imai

View editor publications

You can also search for this editor in PubMed Google Scholar
Takao Nishizeki

View editor publications

You can also search for this editor in PubMed Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 450)

Included in the following conference series:

SIGAL: International Symposium on Algorithms

Conference proceedings info: SIGAL 1990.

9816 Accesses
216 Citations
3 Altmetric

Buy print copy

Softcover Book USD 54.99

Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Table of contents (48 papers)

Front Matter

Download chapter PDF
Recent progress in string algorithms
- Zvi Galil
Pages 1-1
Download chapter PDF
Selection networks
- Nicholas Pippenger
Pages 2-11
Download chapter PDF
Computing edge-connectivity in multiple and capacitated graphs
- Hiroshi Nagamochi, Toshihide Ibaraki
Pages 12-20
Download chapter PDF
Efficient sequential and parallel algorithms for planar minimum cost flow
- Hiroshi Imai, Kazuo Iwano
Pages 21-30
Download chapter PDF
Structural analyses on the complexity of inverting functions
- Osamu Watanabe, Seinosuke Toda
Pages 31-38
Download chapter PDF
Oracles versus proof techniques that do not relativize
- Eric Allender
Pages 39-52
Download chapter PDF
20-Relative neighborhood graphs are Hamiltonian
- Maw Shang Chang, C. Y. Tang, R. C. T. Lee
Pages 53-65
Download chapter PDF
The K-Gabriel graphs and their applications
- Tung-Hsin Su, Ruei-Chuan Chang
Pages 66-75
Download chapter PDF
Parallel algorithms for generating subsets and set partitions
- Borivoje Djokić, Masahiro Miyakawa, Satoshi Sekiguchi, Ichiro Semba, Ivan Stojmenović
Pages 76-85
Download chapter PDF
Parallel algorithms for linked list and beyond
- Yijie Han
Pages 86-100
Download chapter PDF
Local tournaments and proper circular arc graphs
- Pavol Hell, Jørgen Bang-Jensen, Jing Huang
Pages 101-108
Download chapter PDF
Fast algorithms for the dominating set problem on permutation graphs
- Kuo-Hui Tsai, Wen-Lian Hsu
Pages 109-117
Download chapter PDF
Two probabilistic results on merging
- Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
Pages 118-127
Download chapter PDF
Randomized broadcast in networks
- Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
Pages 128-137
Download chapter PDF
On the construction of abstract voronoi diagrams, II
- R. Klein, K. Mehlhorn, S. Meiser
Pages 138-154
Download chapter PDF
Searching in higher dimension
- Bernard Chazelle
Pages 155-155
Download chapter PDF
Finding extrema with unary predicates
- David G. Kirkpatrick, Feng Gao
Pages 156-164
Download chapter PDF
Implicitly searching convolutions and computing depth of collision
- David Dobkin, John Hershberger, David Kirkpatrick, Subhash Suri
Pages 165-180
Download chapter PDF
Characterization for a family of infinitely many irreducible Equally Spaced Polynomials
- Toshiya Itoh
Pages 181-190
Download chapter PDF

Other volumes

Algorithms

Keywords

About this book

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.

Bibliographic Information

Book Title: Algorithms
Book Subtitle: International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990. Proceedings
Editors: Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-52921-7
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1990
Softcover ISBN: 978-3-540-52921-7Published: 02 August 1990
eBook ISBN: 978-3-540-47177-6Published: 15 July 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 482
Topics: Theory of Computation, Electrical Engineering, Operations Research/Decision Theory, Algorithm Analysis and Problem Complexity, Computation by Abstract Devices, Combinatorics

Publish with us

Policies and ethics

Algorithms