## Algorithms and Computation: 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. ProceedingsThis volume presents the proceedings of the fourth annual International Symposium on Algorithms and Computation, held in Hong Kong in December 1993.Numerous selected papers present original research in such areas as design and analysis of algorithms, computational complexity, and theory of computation. Topics covered include: - automata, languages, and computability, - combinatorial, graph, geometric, and randomized algorithms, - networks and distributed algorithms, - VLSIand parallel algorithms, - theory of learning and robotics, - number theory and robotics. Three invited papers are also included. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

I | 1 |

II | 11 |

III | 21 |

IV | 31 |

V | 38 |

VI | 48 |

VII | 68 |

VIII | 78 |

XXIX | 277 |

XXX | 287 |

XXXI | 297 |

XXXII | 303 |

XXXIII | 313 |

XXXIV | 323 |

XXXV | 333 |

XXXVI | 343 |

IX | 88 |

X | 98 |

XI | 108 |

XII | 118 |

XIII | 128 |

XIV | 138 |

XV | 147 |

XVI | 157 |

XVII | 167 |

XVIII | 176 |

XIX | 185 |

XX | 191 |

XXI | 201 |

XXII | 209 |

XXIII | 221 |

XXIV | 230 |

XXV | 240 |

XXVI | 250 |

XXVII | 259 |

XXVIII | 267 |

XXXVII | 353 |

XXXVIII | 363 |

XXXIX | 369 |

XL | 379 |

XLI | 399 |

XLII | 406 |

XLIII | 416 |

XLIV | 426 |

XLV | 436 |

XLVI | 446 |

XLVII | 456 |

XLVIII | 466 |

XLIX | 476 |

L | 486 |

LI | 496 |

LII | 506 |

LIII | 515 |

LIV | 523 |

LV | 533 |

### Common terms and phrases

approximation assume bd(P BDD's Boolean function boundary BPPpath branching programs butterfly network called cell cograph complexity Computational Geometry Computer Science connected consider constant constructed contains convex corresponding cost counterclockwise data structure defined degree sequence delete denote dynamic edge elements embedded exists given gossiping graph G heap Hence hypercube input insertion integer intersection interval interval graph Knapsack problem Lemma length linear logn longest wire lower bound matroid maximum merge minimal minimum node non-crossing paths NP-complete O(logn obtained optimal packets pair paper parallel partition phase planar graphs polynomial polynomial-time probabilistic problem Proc processor Proof query random randomized algorithm rectilinear recursive region request resp schedule shortest path shortest watchman route simple polygon solved spanner step subheap subset Subset Sum problem terminals Theorem treewidth update variables vertex vertices watchman route problem weakly visible weight