„Algorithms & Data Structures“

Suchergebnisse

3.154 Treffer

• Proportionate progress: A notion of fairness in resource allocation
  Baruah, S. K. ; Cohen, N. K. ; Plaxton, C. G. ; Varvel, D. A.
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
  Cai, Yang ; Kong, M. C.
• Area minimization for hierarchical floorplans
  Pan, Peichen ; Shi, Weiping ; Liu, C. L.
• Algorithms for dense graphs and networks on the random access computer
  Cheriyan, J. ; Mehlhorn, K.
• Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
  Dillencourt, M. B. ; Samet, H.
• Fast algorithms for minimum matrix norm with application in computer graphics
  Tang, Shouwen ; Zhang, Kaizhong ; Wu, Xiaolin
• A subquadratic algorithm for approximate limited expression matching
  Wu, Sun ; Manber, U. ; Myers, G.
• The optimal control approach to generalized multiprocessor scheduling
  Srinivasa Prasanna, G. N. ; Musicus, B. R.
• Testing homotopic routability under polygonal wiring rules
  Maley, F. M.
• Algorithms and data structures – proceedings
  Dehne, Frank 1989 Springer
• Extracting maximal information about sets of minimum cuts
  Gusfield, Dan ; Naor, Dalit
• Planning a time-minimal motion among moving obstacles
  Fujimura, Kikuo ; Samet, Hanan
• Optimal algorithms for dissemination of information in some interconnection networks
  Hromkovič, Juraj ; Jeschke, Claus -Dieter ; Monien, Burkhard
• An efficient algorithm for finding the CSG representation of a simple polygon
  Dobkin, David ; Guibas, Leonidas ; Hershberger, John ; Snoeyink, Jack
• Effective Routing and Scheduling in Adversarial Queueing Networks
  Sethuraman, Jay ; Teo, Chung-Piaw
• Improved Competitive Guarantees for QoS Buffering
  Kesselman, Alex ; Mansour, Yishay ; Stee, Rob van
• Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication
  Harris, David G.
• Approximation Algorithms for a k-Line Center
  Agarwal, Pankaj K. ; Procopiuc, Cecilia M. ; Varadarajan, Kasturi R.
• Numerical stability of a convex hull algorithm for simple polygons
  Jaromczyk, J. W. ; Wasilkowski, G. W.
• Shortest paths for line segments
  Icking, Christian ; Rote, Günter ; Welzl, Emo ; Yap, Chee