Abstract is missing.
- Methods in Parallel Algorithmics and Who May Need to Know Them?Uzi Vishkin. 1-5
- Rectilinear Paths among Rectilinear ObstaclesD. T. Lee. 5-20
- Linear Time Algorithms for k-cutwidth ProblemMaw-Hwa Chen, Sing-Ling Lee. 21-30
- The k-Edge-Connectivity Augmentation Problem of Weighted GraphsToshimasa Watanabe, Toshiya Mashima, Satoshi Taoka. 31-40
- Principal Lattice of Partition of submodular functions on Graphs: Fast algorithms for Principal Partition and Generic RigiditySachin B. Patkar, H. Narayanan. 41-50
- The Application of the Searching over Separators Strategy to Solve Some NP-Complete Problems on Planar GraphsR. Z. Hwang, Richard C. T. Lee. 51-60
- Parallel and On-line Graph Coloring AlgorithmsMagnús M. Halldórsson. 61-70
- Competitive Analysis of the Round Robin AlgorithmTsuyoshi Matsumoto. 71-77
- Competitive Analysis of the On-line Algorithms for Multiple Stacks SysytemsBeen-Chian Chien, Rong-Jaye Chen, Wei-Pang Yang. 78-87
- Self-Adjusting Augmented Search TreesTony W. Lau. 88-96
- Alhorithms for a Class of Min-Cut and Max-Cut ProblemTeofilo F. Gonzalez, Toshio Murayama. 97-105
- Algorithms for Rectilinear Optimal Multicast Tree ProblemJan-Ming Ho, Ming-Tat Ko, Tze-Heng Ma, Ting-Yi Sung. 106-115
- Approximating Treewidth and Pathwidth of some Classes of Perfect GraphsTon Kloks, Hans L. Bodlaender. 116-125
- Graph Spanners and ConnectivityShuichi Ueno, Michihiro Yamazaki. 126-134
- Randomized Range-Maxima inNearly-Constant Parallel TimeOmer Berkman, Yossi Matias, Uzi Vishkin. 135-144
- Fault-Tolerant Broadcasting in Binary Jumping NetworksYijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura. 145-154
- Routing Problems on the Mesh of BusesKazuo Iwama, Eiji Miyano. 155-164
- Selection Networks with 8::::n:::: log::2::::::n:::: Size and ::::O::::(log ::::n::::) DepthShuji Jimbo, Akira Maruoka. 165-174
- Relativizations of the ::::P =?NP:::: and other Problems: Some Developments in Structural Complexity TheoryRonald V. Book. 175-186
- Boolean Circuit ComplexityMike Paterson. 187
- Searching a Solid Pseudo 3-Sided Orthoconvex GridAntonios Symvonis, Spyros Tragoudas. 188-197
- An Efficient Parallel Algorithm for Geometrically Characterising Drawings of a Class of 3-D ObjectsNick D. Dendris, Iannis A. Kalafatis, Lefteris M. Kirousis. 198-208
- Topologically Consistent Algorithms Realted to Convex PolyhedraKokichi Sugihara. 209-218
- Characterizing and Recognizing Visibility Graphs of Funnel-Shaped PolygonsSeung-Hak Choi, Sung Yong Shin, Kyung-Yong Chwa. 219-228
- On the Complexity of Composite NumbersToshiya Itoh, Kenji Horikawa. 229-238
- On Malign Input Distributions for AlgorithmsKojiro Kobayashi. 239-248
- Lowness and the Complexity of Sparse and Tally DescriptionsVikraman Arvind, Johannes Köbler, Martin Mundhenk. 249-258
- Honest Iteration Schemes of Randomizing AlgorithmsJie Wang, Jay Belanger. 259-268
- Approximating Vertices of a Convex Polygon with Grid Points in the PolygonH. S. Lee, R. C. Chang. 269-278
- Algorithms for Determining the Geometrical Congruity in Two and Three DimensionsTatsuya Akutsu. 279-288
- On the Relationship among Constrained Geometric StructuresEsther Jennings, Andrzej Lingas. 289-298
- Generating Small Convergent Systems Can Be Extremely HardKlaus Madlener, Friedrich Otto, Andrea Sattler-Klein. 299-308
- Chew s Theorem Revisited -Uniquely Normalizing Property of Nonlinear Term Rewriting Systems-Mizuhito Ogawa. 309-318
- Higher Order Communication Processes with Value-Passing, Assignment and Return of ResultsDominique Bolignano, Mourad Debbabi. 319-331
- Searching Informed Game TreesWim Pijls, Arie de Bruin. 332-341
- How to Generate Realistic Sample Problems for Network OptimizationMasao Iri. 342-350
- Generalized Assignment ProblemsSilvano Martello, Paolo Toth. 351-369
- Recognizing an Envelope of Lines in Linear TimeEric Guévremont, Jack Snoeyink. 370-377
- Approximation of Polygonal Curves with Minimum Number of Line SegmentsW. S. Chan, F. Chin. 378-387
- Wiring Knock-Knee Layouts: A Global AppoachMajid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe. 388-399
- Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane GraphsJun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki. 400-409
- On Symmetry of Information and Polynomial Time InvertibilityLuc Longpré, Osamu Watanabe. 410-419
- On Probabilistic ACC Circuits with an Exact-Threshold Output GateRichard Beigel, Jun Tarui, Seinosuke Toda. 420-429
- Computational and Statistical IndistinguishabilitiesKaoru Kurosawa, Osamu Watanabe. 430-438
- On Symmetric Differences of NP-hard Sets with Weakly-P-Selective SetsBin Fu, Hong-Zhou Li. 439-448
- Rstricted Track Assignment with ApplicationsMajid Sarrafzadeh, D. T. Lee. 449-458
- A Simple Test for the Consecutive Ones PropertyWen-Lian Hsu. 459-468
- The Longest Common Subsequence Problem for Small Alphabet Size Between Many StringsKoji Hakata, Hiroshi Imai. 469-478
- The Implicit Dictionary Problem RevisitedTak Wah Lam, Ka Hing Lee. 479-488
- Sorting ::::In-Place:::: with a ::::Worst Case:::: Complexity of ::::n:::: log ::::n::::-1.3::::n:::: + ::::O::::(log::::n::::) Comparisons and epsilon ::::n:::: log ::::n:::: + ::::O::::(1) TransportsKlaus Reinhardt. 489-498
- Sorting and/by Merging Finger TreesAlistair Moffat, Ola Petersson, Nicholas C. Wormald. 499-508