„algorithm complexity“

Suchergebnisse

4.228 Treffer

• A variant of the large sieve inequality with explicit constants
  Grześkowiak, Maciej
• Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071)
  Abramsky, Samson ; Kontinen, Juha ; Väänanen, Jouko ; Vollmer, Heribert
• Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391)
  Keller, Alexander ; Kuo, Frances ; Neuenkirch, Andreas ; Traub, Joseph F.
• Computability, Complexity and Randomness (Dagstuhl Seminar 12021)
  Becher, Veronica ; Bienvenu, Laurent ; Downey, Rodney ; Mayordomo, Elvira
• Coding Theory (Dagstuhl Seminar 11461)
  Rosenthal, Joachim ; Shokrollahi, M. Amin ; Walker, Judy L.
• Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182)
  Brandstädt, Andreas ; Golumbic, Martin Charles ; Heggernes, Pinar ; McConnell, Ross
• Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121)
  Grohe, Martin ; Koucky, Michal ; Reischik, Rüdiger ; van Melkebeek, Dieter
• Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091)
  Jansen, Klaus ; Matieu, Claire ; Shachnai, Hadas ; Young, Neal E.
• Algorithms and Data Structures
  Sina, Lucien 2025 epubli
• A Parallel Algorithm for Wavelet Transform-Based Color Image Compression
  Singh, Piyush Kumar ; Singh, Ravi Shankar ; Rai, Kabindra Nath
• Testing the Deterministic Component of the Time Series of Wolf Numbers by Methods of Algorithmic Complexity
  Makarenko, N. G. ; Volobuev, D. M. ; Rybintsev, A. S.
• On the Fine-Grained Query Complexity of Symmetric Functions
  Podder, Supartha ; Yao, Penghui ; Ye, Zekun
• Complexity-Preserving Transposition of Summing Algorithms: A Data Flow Graph Approach
  Polevoy, D. V. ; Kazimirov, D. D. ; Chukalina, M. V. ; Nikolaev, D. P.
• Analysis and Efficiency of Randomized Optimization Heuristics
  Lässig, Jörg
• Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung Computational Aspects of Combinatorial Pricing Problems
  Briest, Patrick
• Parametrisierte Ansätze für schwere Graphprobleme: Algorithmen und Experimente Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems
  Hüffner, Falk
• Information Technology and Applied Mathematics – ICITAM 2017
  Chandra, Peeyush ; Giri, Debasis ; Li, Fagen ; Kar, Samarjit ; Jana, Dipak Kumar 2019 Springer Singapore
• Shortest Path Solvers. From Software to Wetware
  Adamatzky, Andrew 2018 Springer International Publishing
• Design and Implementation of Practical Schedulers for M2M Uplink Networks – Using MATLAB
  Kumar, Akshay ; Abdelhadi, Ahmed ; Clancy, T. Charles 2018 Springer International Publishing
• The loader problem: formulation, complexity and algorithms
  Tang, G. ; Chen, F. ; Cheng, T. C. E. ; Ng, C T. ; Chen, Zhi-long