SIGAL International Symposium on Algorithms

Keyphrases

Publications

1990

Yijie Han, Yoshihide Igarashi
Derandomization by Exploiting Redundancy and Mutual Independence. SIGAL International Symposium on Algorithms (1990)
Kazumiti Numata, Takeshi Tokuyama
Splitting a Configuration in a Simplex. SIGAL International Symposium on Algorithms (1990)
Hiroshi Imai, Kazuo Iwano
Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow. SIGAL International Symposium on Algorithms (1990)
Kazuo Murota
Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation. SIGAL International Symposium on Algorithms (1990)
Borivoje Djokic, Masahiro Miyakawa, Satoshi Sekiguchi, Ichiro Semba, Ivan Stojmenovic
Parallel Algorithms for Generating Subsets and Set Partitions. SIGAL International Symposium on Algorithms (1990)
Bernard Chazelle
Searching in Higher Dimension. SIGAL International Symposium on Algorithms (1990)
Nicola Santoro, Peter Widmayer
Distributed Function Evaluation in the Presence of Transmission Faults. SIGAL International Symposium on Algorithms (1990)
Wim Pijls, Arie de Bruin
Algorithm. SIGAL International Symposium on Algorithms (1990)
Tung-Hsin Su, Ruei-Chuan Chang
The K-Gabriel Graphs and Their Applications. SIGAL International Symposium on Algorithms (1990)
Eric Allender
Oracles versus Proof Techniques that Do Not Relativize. SIGAL International Symposium on Algorithms (1990)
Andrzej Lingas
Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs. SIGAL International Symposium on Algorithms (1990)
David G. Kirkpatrick, Feng Gao
Finding Extrema with Unary Predicates. SIGAL International Symposium on Algorithms (1990)
Michel Cosnard, Jean-Laurent Philippe
Distributed Algorithms for Deciphering. SIGAL International Symposium on Algorithms (1990)
Svante Carlsson, Christos Levcopoulos, Ola Petersson
Sublinear Merging and Natural Merge Sort. SIGAL International Symposium on Algorithms (1990)
Efthymios Anagnostou, Vassilios G. Polimenis, Leonidas J. Guibas
Topological Sweeping in Three Dimensions. SIGAL International Symposium on Algorithms (1990)
Tetsuo Asano, Takeshi Tokuyama
Algorithms for Projecting Points to Give the Most Uniform Distribution with Applications to Hashing. SIGAL International Symposium on Algorithms (1990)
David Avis
On the Complexity of Isometric Embedding in the Hypercube. SIGAL International Symposium on Algorithms (1990)
Hitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki
Parallel Algorithms for Finding Steiner Forests in Planar Graphs. SIGAL International Symposium on Algorithms (1990)
Toshimasa Watanabe, Yasuhiko Higashi, Akira Nakamura
Graph Augmentation Problems for a Specified Set of Vertices. SIGAL International Symposium on Algorithms (1990)
Hussein M. Alnuweiri, Viktor K. Prasanna
Parallel Convexity Algorithms for Digitized Images on a Linear Array of Processors. SIGAL International Symposium on Algorithms (1990)
Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
Randomized Broadcast in Networks. SIGAL International Symposium on Algorithms (1990)
Hiroshi Nagamochi, Toshihide Ibaraki
Computing Edge-Connectivity in Multiple and Capacitated Graphs. SIGAL International Symposium on Algorithms (1990)
Hillel Gazit, Gary L. Miller
Planar Separators and the Euclidean Norm. SIGAL International Symposium on Algorithms (1990)
Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
Two Probabilistic Results on Merging. SIGAL International Symposium on Algorithms (1990)
Herbert Edelsbrunner, Micha Sharir
A Hyperplane Incidence Problem with Applications to Counting Distances. SIGAL International Symposium on Algorithms (1990)
Kwong-fai Chan, Tak Wah Lam
Finding Least-Weight Subsequences with Fewer Processors. SIGAL International Symposium on Algorithms (1990)
Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
Spatial Point Location and Its Applications. SIGAL International Symposium on Algorithms (1990)
Toshiya Itoh
Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynominals. SIGAL International Symposium on Algorithms (1990)
Kuo-Hui Tsai, Wen-Lian Hsu
Fast Algorithms for the Dominating Set Problem on Permutation Graphs. SIGAL International Symposium on Algorithms (1990)
János Pach, Richard Pollack, Emo Welzl
Weaving Patterns of Lines and Segments in Space. SIGAL International Symposium on Algorithms (1990)
Sara Bitan, Shmuel Zaks
Optimal Linear Broadcast. SIGAL International Symposium on Algorithms (1990)
Nicholas Pippenger
Selection Networks. SIGAL International Symposium on Algorithms (1990)
Pavol Hell, Jørgen Bang-Jensen, Jing Huang
Local Tournaments and Proper Circular Arc Gaphs. SIGAL International Symposium on Algorithms (1990)
Maria M. Klawe, Frank Thomson Leighton
A Tight Lower Bound on the Size of Planar Permutation Networks. SIGAL International Symposium on Algorithms (1990)
Yijie Han
Parallel Algorithms for Linked List and Beyond. SIGAL International Symposium on Algorithms (1990)
Vassilis J. Tsotras, B. Gopinath, George W. Hart
Optimally Managing the History of an Evolving Forest. SIGAL International Symposium on Algorithms (1990)
Wen-Jing Hsu, Xiaola Lin
Parallel Algorithms for Labeling Image Components. SIGAL International Symposium on Algorithms (1990)
Leonidas J. Guibas, David Salesin, Jorge Stolfi
Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives. SIGAL International Symposium on Algorithms (1990)
Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee
20-Relative Neighborhood Graphs Are Hamiltonian. SIGAL International Symposium on Algorithms (1990)
Zvi Galil
Recent Progress in String Algorithms. SIGAL International Symposium on Algorithms (1990)
Osamu Watanabe, Seinosuke Toda
Structural Analyses on the Complexity of Inverting Functions. SIGAL International Symposium on Algorithms (1990)
Kazuo Iwano, Susan Yeh
An Efficient Algorithm for Optimal Loop Parallelization. SIGAL International Symposium on Algorithms (1990)
Uwe Schöning
Complexity Cores and Hard Problem Instances. SIGAL International Symposium on Algorithms (1990)
Qingzhou Wang, Kam-Hoi Cheng
A Heuristic Algorithm for the k-Center Problem with Vertex Weight. SIGAL International Symposium on Algorithms (1990)
Refael Hassin
Simultaneous Solution of Families of Problems. SIGAL International Symposium on Algorithms (1990)
Lane A. Hemachandra
Algorithms from Complexity Theory: Polynominal-Time Operations for Complex Sets. SIGAL International Symposium on Algorithms (1990)
David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri
Implicitly Searching Convolutions and Computing Depth of Collision. SIGAL International Symposium on Algorithms (1990)
Rolf Klein, Kurt Mehlhorn, Stefan Meiser
On the Construction of Abstract Voronoi Diagrams, II. SIGAL International Symposium on Algorithms (1990)

volume 450, 1990

Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings SIGAL International Symposium on Algorithms 450 (1990)