„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs
  Halldórsson, Magnús M. ; Kortsarz, Guy ; Shachnai, Hadas
• Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems
  Remy, Jan ; Steger, Angelika
• Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions
  Khot, Subhash ; Lipton, Richard J. ; Markakis, Evangelos ; Mehta, Aranyak
• Adaptive Spatial Partitioning for Multidimensional Data Streams
  Hershberger, John ; Shrivastava, Nisheeth ; Suri, Subhash ; Toth, Csaba D.
• A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem
  Alves, Carlos E.R ; Caceres, Edson N. ; Song, Siang Wun
• The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
  Arkin, Esther M. ; Bender, Michael A. ; Fekete, Sandor P. ; Mitchell, Joseph S. B. ; Skutella, Martin
• Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs
  Hong, Seok-Hee ; Eades, Peter
• Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs
  Hong, Seok-Hee ; Eades, Peter
• Toward a Model for Backtracking and Dynamic Programming
  Alekhnovich, Michael ; Borodin, Allan ; Buresh-Oppenheim, Joshua ; Impagliazzo, Russell ; Magen, Avner ; Pitassi, Toniann
• Lower bounds for modular counting by circuits with modular gates
  Mix Barrington, D. A. ; Straubing, H.
• The average sensitivity of square-freeness
  Bernasconi, A. ; Damm, C. ; Shparlinski, I.
• Improved depth lower bounds for small distance connectivity
  Beame, P. ; Impagliazzo, R. ; Pitassi, T.
• Secure Overlay Network Design
  Li, Li (Erran) ; Mahdian, Mohammad ; Mirrokni, Vahab S.
• Algorithms for projecting points to give the most uniform distribution with applications to hashing
  Asano, Tetsuo ; Tokuyama, Takeshi
• Randomized Weighted Caching with Two Page Weights
  Irani
• A Pinwheel Scheduler for Three Distinct Numbers with a Tight Schedulability Bound
  Lin, Shun-Shii ; Lin, Kwei-Jay
• On the Hardness of Approximating Spanners
  Kortsarz, G.
• On Minimum-Area Hulls
  Arkin, E. M. ; -J. Chiang, Y. ; Held, M. ; Mitchell, J. S. B. ; Sacristan, V. ; Skiena, S. S. ; -C. Yang, T.
• Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology
  Henzinger, M. R. ; King, V. ; Warnow, T.
• Hexagonal Models for Channel Routing
  Brady, M. L. ; Brown, D. J. ; Powers, K. D.