„Algorithms & Data Structures“

Suchergebnisse

3.154 Treffer

• Interleaved Prefetching
  Kimbrel
• Reconstructing a Minimum Spanning Tree after Deletion of Any Node
  Das ; Loui
• Exact Algorithms for Linear Programming over Algebraic Extensions
  Beling
• Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
  Ravi, R. ; Marathe, M. V. ; Ravi, S. S. ; Rosenkrantz, D. J. ; Hunt III, H. B.
• Parallel Implementation of a Class of Adaptive Signal Processing Applications
  Lee, M. ; Liu, W. ; Prasanna, V. K.
• Coordinated Manipulation of Objects in a Plane
  Rus, D.
• Visualization of Three-Dimensional Delaunay Meshes
  Karasick, M. S. ; Lieber, D. ; Nackman, L. R. ; Rajan, V. T.
• A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic Errors
  Imielińska, C. ; Kalantari, B.
• Equivalence of Binary and Ternary Algebraic Decision Trees
  Beals, R.
• Wait-Free Clock Synchronization
  Dolev, S. ; Welch, J. L.
• An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem
  Ramachandran, Vijaya ; Yang, Honghua
• Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint
  Sviridenko, M. I.
• On Nonlinear Parametric Search
  Fernández-Baca, D.
• A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion
  Steven Chen, H. ; Lee, D. T.
• Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks
  Kalyanasundaram, B. ; Pruhs, K. R. ; Torng, E.
• Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input
  Reif, J. H.
• Finding the k Shortest Paths in Parallel
  Ruppert, E.
• Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications
  Djidjev, H. N.
• Approximating Satisfiable Satisfiability Problems
  Trevisan, L.
• Fault-Tolerant Real-Time Scheduling
  Kalyanasundaram, B. ; Pruhs, K.