Algorithms and Computations: 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 Proceedings
Alok Aggarwal, C. Pandu Rangan
Springer, Jan 14, 2000 - Computer algorithms - 448 pages
This book constitutes the refereed proceedings of the 10th International Symposium on Algorithms and Computation, ISAAC'99, held in Chennai, India, in December 1999. The 40 revised full papers presented together with four invited contributions were carefully reviewed and selected from 71 submissions. Among the topics covered are data structures, parallel and distributed computing, approximation algorithms, computational intelligence, online algorithms, complexity theory, graph algorithms, computational geometry, and algorithms in practice.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Static Dictionaries Supporting Rank
Asynchronous Random Polling Dynamic Load Balancing
21 other sections not shown
Other editions - View all
AC0 checker approximation algorithm arbitrary assignment AT-free graph Berlin Heidelberg 1999 binary tree bipartite bipartite graph bits called chords circle graphs clauses containing compacted trie competitive ratio Computer Science connected consider constant construct corresponding CS-tree data structure define Delaunay triangulations denote dominating set problem edge endpoint given graph G input integer intersection intervals label leaf sector Lemma length LexBFS linear literal LNCS load balancing lower bound machine Maximum Hidden minimum multiset node NP-complete NP-hard OBDD obtained on-line optimal solution pair Pandu Pandu Rangan Eds paper parallel permutation permutation graphs pigeonhole principle player points polygon polynomial prefix sums problem Proc Proof protocol query query complexity random robots satisfies scheduling self-spanner shortest path slots solved station Step subgraph subproblem subset subtree suffix tree Theorem threads trapezoid trapezoid graphs triangulation umbrella variable vertex vertices Voronoi