Algorithms and Computation: 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. ProceedingsKam W. Ng Springer Science & Business Media, 26.11.1993 - 542 Seiten This 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. |
Inhalt
I | xiii |
II | 9 |
III | 19 |
IV | 29 |
V | 36 |
VI | 46 |
VIII | 66 |
IX | 76 |
XXXIII | 275 |
XXXIV | 285 |
XXXV | 295 |
XXXVI | 301 |
XXXVII | 311 |
XXXIX | 321 |
XLI | 331 |
XLII | 341 |
X | 86 |
XII | 96 |
XIII | 106 |
XIV | 116 |
XV | 126 |
XVI | 136 |
XVII | 145 |
XIX | 155 |
XX | 165 |
XXI | 174 |
XXII | 183 |
XXIV | 189 |
XXV | 199 |
XXVI | 207 |
XXVII | 219 |
XXVIII | 228 |
XXIX | 238 |
XXX | 248 |
XXXI | 257 |
XXXII | 265 |
XLIII | 351 |
XLIV | 361 |
XLV | 367 |
XLVI | 377 |
XLVII | 397 |
XLVIII | 404 |
L | 414 |
LI | 424 |
LIII | 434 |
LIV | 444 |
LV | 454 |
LVII | 464 |
LVIII | 474 |
LX | 484 |
| 494 | |
LXII | 504 |
LXIII | 513 |
LXIV | 521 |
LXV | 531 |
Häufige Begriffe und Wortgruppen
approximation assume B₁ bd(P BDD's Boolean function boundary BPP path branching programs called cograph complexity Computational Geometry Computer Science connected consider constant constructed contains convex corresponding cost counterclockwise data structure defined degree sequence delete denote dynamic edge exists given gossiping graph G heap Hence hypercube input integer intersection interval interval graph Knapsack problem Lemma length linear longest wire lower bound matroid maximum merge minimal minimum node non-crossing paths NP-complete NP-hard O(log O(n² 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 V₁ variables vertex vertices watchman route problem weakly visible weight