„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Graphs, Networks and Algorithms
  Jungnickel, Dieter 2013 Springer Berlin
• Monte Carlo and Quasi-Monte Carlo Methods 2008
  L' Ecuyer, Pierre 2009 Springer Berlin
• Fixed-point quantum continuous search algorithm with optimal query complexity
  Jin, Shan ; Huang, Yuhan ; Wu, Shaojun ; Zhou, Guanyu ; Zou, Chang-Ling ; Sun, Luyan ; Wang, Xiaoting
• Exploring quantum control landscape and solution space complexity through optimization algorithms and dimensionality reduction
  Fentaw, Haftu W. ; Campbell, Steve ; Caton, Simon
• A Practical Algorithm for Knot Factorisation
  He, Alexander ; Sedgwick, Eric ; Spreer, Jonathan 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths
  Kociumaka, Tomasz ; Polak, Adam 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Internal Dictionary Matching
  Charalampopoulos, Panagiotis ; Kociumaka, Tomasz ; Mohamed, Manal ; Radoszewski, Jakub ; Rytter, Wojciech ; Waleń, Tomasz
• Longest Common Substring with Approximately k Mismatches
  Kociumaka, Tomasz ; Radoszewski, Jakub ; Starikovskaya, Tatiana
• Linear Search by a Pair of Distinct-Speed Robots
  Bampas, Evangelos ; Czyzowicz, Jurek ; Gąsieniec, Leszek ; Ilcinkas, David ; Klasing, Ralf ; Kociumaka, Tomasz ; Pająk, Dominik
• Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet
  Kociumaka, Tomasz ; Radoszewski, Jakub ; Rytter, Wojciech
• String Powers in Trees
  Kociumaka, Tomasz ; Radoszewski, Jakub ; Rytter, Wojciech ; Waleń, Tomasz
• Deleting Vertices to Graphs of Bounded Genus
  Kociumaka, Tomasz ; Pilipczuk, Marcin
• Efficient Computation of Sequence Mappability
  Charalampopoulos, Panagiotis ; Iliopoulos, Costas S. ; Kociumaka, Tomasz ; Pissis, Solon P. ; Radoszewski, Jakub ; Straszyński, Juliusz
• Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
  Anstreicher, Kurt M.
• Significance of gender, brain region and EEG band complexity analysis for Parkinson’s disease classification using recurrence plots and machine learning algorithms
  Sasidharan, Divya ; Sowmya, V. ; Gopalakrishnan, E. A.
• On the Complexity of Matching Cut in Graphs of Fixed Diameter
  Le, Hoang-Oanh ; Le, Van Bang 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms and Insights for RaceTrack
  Bekos, Michael A. ; Bruckdorfer, Till ; Förster, Henry ; Kaufmann, Michael ; Poschenrieder, Simon ; Stüber, Thomas 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Abstracts Collection -- 25th International Symposium on Theoretical Aspects of Computer Science
  Albers, Susanne ; Weil, Pascal 2008 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
  Lokshtanov, Daniel ; Mouawad, Amer E. ; Panolan, Fahad ; Siebertz, Sebastian
• Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
  Bilò, Davide ; Gualà, Luciano ; Leucci, Stefano ; Proietti, Guido