„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Correction to: Guiding the Training of Distributed Text Representation with Supervised Weighting Scheme for Sentiment Analysis
  Zhao, Zhe ; Liu, Tao ; Li, Shen ; Li, Bofang ; Du, Xiaoyong
• Correction to: Query Optimal k-Plex Based Community in Graphs
  Wang, Yue ; Jian, Xun ; Yang, Zhenhua ; Li, Jia
• Correction to: A Low Complexity Correlation Algorithm for Compressive Channel Estimation in Massive MIMO System
  Zhang, Ruoyu ; Zhao, Honglin ; Shan, Chengzhao ; Jia, Shaobo
• Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems
  Saettler, Aline ; Laber, Eduardo ; Cicalese, Ferdinando
• Brief Announcement: Optimal Dispersion Under Asynchrony
  Pattanayak, Debasish ; Kshemkalyani, Ajay D. ; Kumar, Manish ; Molla, Anisur Rahaman ; Sharma, Gokarna 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Complexity Landscape of Dynamic Distributed Subgraph Finding
  Chang, Yi-Jun ; Chen, Lyuting ; Chen, Yanyu ; Mishra, Gopinath ; Yang, Mingyang 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Complexity Landscape for Local Certification
  Bousquet, Nicolas ; Feuilloley, Laurent ; Zeitoun, Sébastien 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Deterministic Synchronous Self-Stabilizing BFS Construction with Constant Space Complexity
  Blin, Lélia ; Petit, Franck ; Tixeuil, Sébastien 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Cut-Query Algorithms with Few Rounds
  Kenneth-Mordoch, Yotam ; Krauthgamer, Robert 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fine-Grained Classification of Detecting Dominating Patterns
  Dransfeld, Jonathan ; Künnemann, Marvin ; Redzic, Mirza 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Recognizing and Realizing Temporal Reachability Graphs
  Erlebach, Thomas ; Michail, Othon ; Morawietz, Nils 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Approximability for Modular Linear Equations
  Dabrowski, Konrad K. ; Jonsson, Peter ; Ordyniak, Sebastian ; Osipov, George ; Wahlström, Magnus 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Tensorized Pauli decomposition algorithm
  Hantzko, Lukas ; Binkowski, Lennart ; Gupta, Sabhyata 2024 Gottfried Wilhelm Leibniz Universität Hannover
• Complexity Theory
  Sina, Lucien 2025 BoD - Books on Demand
• Complexity Theory
  Sina, Lucien 2025 epubli
• Erratum to: Greedy Matching: Guarantees and Limitations
  Besser, Bert ; Poloczek, Matthias
• Erratum to: A Grouping Approach for Succinct Dynamic Dictionary Matching
  Feigenblat, Guy ; Porat, Ely ; Shiftan, Ariel
• Erratum to: Foreword: Special Issue on IPEC 2014
  Cygan, Marek ; Heggernes, Pinar
• Erratum to: Signature Theory in Holographic Algorithms
  Cai, Jin-Yi ; Lu, Pinyan
• An Optimal Complexity Spectral Solver for the Poisson Equation
  Qin, Ouyuan