„Algorithms & Data Structures“

Suchergebnisse

3.154 Treffer

• A nearly optimal deterministic parallel Voronoi diagram algorithm
  Cole, R. ; Goodrich, M. T. ; Dúnlaing, C. Ó
• Interval routing schemes
  Flammini, M. ; Gambosi, G. ; Salomone, S.
• Preconditioning index set transformations for time-optimal affine scheduling
  Lisper, B.
• Parallel construction of binary trees with near optimal weighted path length
  Kirkpatrick, D. G. ; Przytycka, T.
• Optimal cooperative search in fractional cascaded data structures
  Tamassia, R. ; Vitter, J. S.
• Sweep methods for parallel computational geometry
  Goodrich, M. T. ; Ghouse, M. R. ; Bright, J.
• Parallel algorithms for arrangements
  Anderson, R. ; Beanie, P. ; Brisson, E.
• Guest editor's foreword special issue on parallel computing
  Snir, M.
• Simulating BPP using a general weak random source
  Zuckerman, D.
• Introduction to special issue on randomized and derandomized algorithms
  Luby, M.
• A method for obtaining randomized algorithms with small tail probabilities
  Alt, H. ; Guibas, L. ; Mehlhorn, K. ; Karp, R. ; Wigderson, A.
• Efficient PRAM simulation on a distributed memory machine
  Karp, R. M. ; Luby, M. ; Meyer auf der Heide, F.
• A subexponential bound for linear programming
  Matoušek, J. ; Sharir, M. ; Welzl, E.
• Randomized search trees
  Seidel, R. ; Aragon, C. R.
• Randomized geometric algorithms and pseudorandom generators
  Mulmuley, K.
• Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
  Alon, N. ; Naor, M.
• On deterministic approximation of DNF
  Luby, M. ; Veličković, B.
• On the number of Eulerian orientations of a graph
  Mihail, M. ; Winkler, P.
• A mildly exponential approximation algorithm for the permanent
  Jerrum, M. ; Vazirani, U.
• Connected component and simple polygon intersection searching
  Agarwal, P. K. ; Kreveld, M. van