„Algorithms & Data Structures“

Suchergebnisse

3.154 Treffer

• Algorithms for parallel memory, II: Hierarchical multilevel memories
  Vitter, J. S. ; Shriver, E. A. M.
• Algorithms for parallel memory, I: Two-level memories
  Vitter, J. S. ; Shriver, E. A. M.
• Upward drawings of triconnected digraphs
  Bertolazzi, P. ; Battista, G. Di ; Liotta, G. ; Mannino, C.
• Heuristic sampling on DAGs
  Chen, Pang -Chieh
• Polynomial algorithms for linear programming over the algebraic numbers
  Adler, I. ; Beling, P. A.
• Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
  Wee, Y. C. ; Chaiken, S. ; Ravi, S. S.
• Landmark-Based Robot Navigation
  Lazanas, A. ; Latombe, J. -C
• Asymptotic speed-ups in constructive solid geometry
  Eppstein, D.
• Super-pattern matching
  Knight, J. R. ; Myers, E. W.
• Using geometry to solve the transportation problem in the plane
  Atkinson, D. S. ; Vaidya, P. M.
• A faster parallel algorithm for a matrix searching problem
  Atallah, Mikhail J.
• Duality of constrained Voronoi diagrams and Delaunay triangulations
  Joe, Barry ; Wang, Cao An
• Optimal edge ranking of trees in polynomial time
  Torre, P. de la ; Greenlaw, R. ; Schäffer, A. A.
• A linear algorithm to decompose inheritance graphs into modules
  Habib, M. ; Huchard, M. ; Spinrad, J.
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
  Kececioglu, J. ; Sankoff, D.
• Asymptotic component densities in Programmable Gate Arrays realizing all circuits of a given size
  Berger, T. ; Hekstra, A. ; Orlitsky, A.
• An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
  He, Xin
• A robust model for finding optimal evolutionary trees
  Farach, M. ; Kannan, S. ; Warnow, T.
• Assembly sequences for polyhedra
  Schweikard, A. ; Wilson, R. H.
• Fully dynamic biconnectivity in graphs
  Henzinger, M. R.