„algorithm complexity“

Suchergebnisse

4.228 Treffer

• On Finding Randomly Planted Cliques in Arbitrary Graphs
  Agrimonti, Francesco ; Bressan, Marco ; d'Orsi, Tommaso 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quantum Catalytic Space
  Buhrman, Harry ; Folkertsma, Marten ; Mertz, Ian ; Speelman, Florian ; Strelchuk, Sergii ; Subramanian, Sathyawageeswar ; Tupker, Quinten 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quantum Search with In-Place Queries
  Holman, Blake ; Ramachandran, Ronak ; Yirka, Justin 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms and Models for the Web Graph – 14th International Workshop, WAW 2017, Toronto, ON, Canada, June 15–16, 2017, Revised Selected Papers
  2017 Springer Berlin Heidelberg
• Algorithms and Models for the Web-Graph – 6th International Workshop, WAW 2009, Barcelona, Spain, February 12-13, 2009. Proceedings
  Bonato, Anthony ; Chung Graham, Fan ; Pralat, Pawel 2009 Springer International Publishing
• Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group
  Mattes, Caroline ; Weiß, Armin 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Theory and Practice of Formal Methods – Essays Dedicated to Frank de Boer on the Occasion of His 60th Birthday
  Ábrahám, Erika ; Johnsen, Einar Broch ; Bonsangue, Marcello M. 2016 Springer International Publishing
• A Low-Complexity Sparse Reconstruction Algorithm of Polarization-Sensitive Arrays
  Wang, Xiaoting ; Lan, Xiang ; Wang, Xianpeng
• Approximation and Optimization – Algorithms, Complexity and Applications
  2019 Springer International Publishing
• The New Codebreakers – Essays Dedicated to David Kahn on the Occasion of His 85th Birthday
  Ryan, Peter ; Naccache, David ; Quisquater, Jean-Jacques 2016 Springer International Publishing
• The new codebreakers – essays dedicated to David Kahn on the occasion of His 85th birthday
  Ryan, Peter ; Kahn, David ; Naccache, David ; Quisquater, Jean-Jacques 2016 Springer
• Introductory Lectures on Convex Optimization – A Basic Course
  2004 Springer US
• Probabilistic Group Theory, Combinatorics, and Computing – Lectures from the Fifth de Brún Workshop
  Detinko, Alla ; Flannery, Dane ; O'Brien, Eamonn 2013 Springer London
• On the I/O Complexity of the Cocke-Younger-Kasami Algorithm and of a Family of Related Dynamic Programming Algorithms
  De Stefani, Lorenzo ; Gupta, Vedant 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Farthest-Point Voronoi Diagrams in the Hilbert Metric
  Song, Minju ; Jung, Mook Kwon ; Ahn, Hee-Kap 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Novel Complexity Results for Temporal Separators with Deadlines
  Dondi, Riccardo ; Lafond, Manuel 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Nichtsequentielle und Verteilte Programmierung mit Go – Synchronisation nebenläufiger Prozesse: Kommunikation – Kooperation – Konkurrenz
  Maurer, Christian 2025 Springer Vieweg
• Computational Logistics – 9th International Conference, ICCL 2018, Vietri sul Mare, Italy, October 1–3, 2018, Proceedings
  Cerulli, Raffaele 2018 Springer International Publishing
• The Steiner Tree Problem – A Tour through Graphs, Algorithms, and Complexity
  2002 Vieweg+Teubner Verlag
• Computer Science – theory and applications ; 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings
  Kulikov, Alexander S. ; Vereshchagin, Nikolay 2011 Springer Berlin Heidelberg