„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Checking the correctness of memories
  Blum, M. ; Evans, W. ; Gemmell, P. ; Kannan, S. ; Naor, M.
• A Distributed Algorithm for Computing the Node Search Number in Trees
  Coudert, David ; Huc, Florian ; Mazauric, Dorian
• A comparative analysis of two algorithms for the simulation of fractional differential equations
  Maamri, Nezha ; Trigeassou, Jean-Claude
• Approximation Resistant Predicates from Pairwise Independence
  Austrin, Per ; Mossel, Elchanan
• Algoritmo híbrido para recomendaciones de itinerarios turísticos – Fusión de 2 técnicas de inteligencia artificial
  Erazo, Juan 2019 Editorial Académica Española
• Computing euclidean maximum spanning trees
  Monma, Clyde ; Paterson, Michael ; Suri, Subhash ; Yao, Frances
• An optimal algorithm for the boundary of a cell in a union of rays
  Alevizos, Panagiotis ; Boissonnat, Jean-Daniel ; Preparata, Franco P.
• Approximation Algorithms for Quickest Spanning Tree Problems
  Hassin, Refael ; Levin, Asaf
• A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency
  Edahiro, Masato ; Tanaka, Katsuhiko ; Hoshino, Takashi ; Asano, Takao
• Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
  Könemann, Jochen ; Levin, Asaf ; Sinha, Amitabh
• Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts
  Brubach, Brian ; Sankararaman, Karthik A. ; Srinivasan, Aravind ; Xu, Pan
• Maximum Metric Spanning Tree Made Byzantine Tolerant
  Dubois, Swan ; Masuzawa, Toshimitsu ; Tixeuil, Sébastien
• Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks
  D’Angelo, Gianlorenzo ; Di Stefano, Gabriele ; Navarra, Alfredo ; Nisse, Nicolas ; Suchan, Karol
• Space-Efficient Estimation of Statistics Over Sub-Sampled Streams
  McGregor, Andrew ; Pavan, A. ; Tirthapura, Srikanta ; Woodruff, David P.
• Rank-one quantum games
  Cooney, T. ; Junge, M. ; Palazuelos, C. ; Pérez-García, D.
• On Subexponential and FPT-Time Inapproximability
  Bonnet, Edouard ; Escoffier, Bruno ; Kim, Eun Jung ; Paschos, Vangelis Th
• k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth
  Kosowski, A. ; Li, B. ; Nisse, N. ; Suchan, K.
• Algorithmic complexity of a Schwartzschild black hole
  Dzhunushaliev, V. D.
• Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks
  Ferreira, A. ; Pérennes, S. ; Rivano, H. ; Richa, A.W ; Moses, N. Stier
• Distributed Similarity Queries in Metric Spaces
  Yang, Keyu ; Ding, Xin ; Zhang, Yuanliang ; Chen, Lu ; Zheng, Baihua ; Gao, Yunjun