Algorithms and Computation: ... International Symposium, ISAAC ... : ProceedingsSpringer-Verlag, 1999 - Computer algorithms |
Contents
Invited Talk | 1 |
Static Dictionaries Supporting Rank | 18 |
Asynchronous Random Polling Dynamic Load Balancing | 37 |
Copyright | |
21 other sections not shown
Other editions - View all
Common terms and phrases
approximation algorithm assignment AT-free graph Berlin Heidelberg 1999 binary tree bipartite bipartite graph bits Boolean C₁ called checker 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 function given graph G input integer intersection intervals label leaf sector Lemma length LexBFS linear literal LNCS lower bound minimum multiset node NP-complete NP-hard O(log O(n log O(n² OBDD obtained optimal solution pair Pandu Pandu Rangan Eds parallel permutation permutation graphs pigeonhole principle player points polygon polynomial prefix sums problem Proc Proof protocol query query complexity random robots satisfies scheduling sector(i shortest path slots solved station Step subgraph subproblem subset subtree suffix tree t₁ Theorem trapezoid trapezoid graphs triangulation umbrella v₁ variable vertex vertices Voronoi