„Algorithms & Data Structures“

Suchergebnisse

3.154 Treffer

• Efficient parallel recognition of some circular arc graphs, I
  Chen, Lin
• A linear algorithm for the all-bidirectional-edges problem on planar graphs
  Ramprasad, P. B. ; Pandu Rangan, C.
• String layouts for a redundant array of inexpensive disks
  Newberg, L. ; Wolfe, D.
• Dynamic expression trees
  Cohen, R. F. ; Tamassia, R.
• Seven fingers allow force-torque closure grasps on any convex polyhedron
  Meyer, Walter
• Packings in two dimensions: Asymptotic average-case analysis of algorithms
  Coffman, E. G. ; Shor, P. W.
• Clocked adversaries for hashing
  Lipton, Richard J. ; Naughton, Jeffrey F.
• Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity
  Lenhof, H. -P ; Smid, M.
• A lower bound on the probability of conflict under nonuniform access in database systems
  Humenik, K. ; Matthews, P. ; Stephens, A. B. ; Yesha, Y.
• The complexity of induced minors and related problems
  Fellows, M. R. ; Kratochvil, J. ; Middendorf, M. ; Pfeiffer, F.
• Visibility with a moving point of view
  Bern, Marshall ; Dobkin, David ; Eppstein, David ; Grossman, Robert
• On the complexity of preflow-push algorithms for maximum-flow problems
  Tunçel, Levent
• A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
  Booth, Heather ; Westbrook, Jeffery
• Edge crossings in drawings of bipartite graphs
  Eades, Peter ; Wormald, Nicholas C.
• Single-layer cylindrical compaction
  Anderson, Richard ; Kahan, Simon ; Schlag, Martine
• The uniform memory hierarchy model of computation
  Alpern, B. ; Carter, L. ; Feig, E. ; Selker, T.
• Coding techniques for handling failures in large disk arrays
  Hellerstein, L. ; Gibson, G. A. ; Karp, R. M. ; Katz, R. H. ; Patterson, D. A.
• The joint distribution of the three types of nodes in uniform binary trees
  Mahmoud, H. M.
• Locality-preserving hash functions for general purpose parallel computation
  Chin, A.
• Guest editor's introduction
  Vitter, J. S.