„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Transactions on Large-Scale Data- and Knowledge-Centered Systems XXVI – Special Issue on Data Warehousing and Knowledge Discovery
  Hameurlain, Abdelkader ; Küng, Josef ; Wagner, Roland ; Bellatreche, Ladjel ; Mohania, Mukesh 2016 Springer International Publishing
• Parameterized Algorithms and Kernels for Rainbow Matching
  Gupta, Sushmita ; Roy, Sanjukta ; Saurabh, Saket ; Zehavi, Meirav
• Advanced Concepts for Intelligent Vision Systems – 18th International Conference, ACIVS 2017, Antwerp, Belgium, September 18-21, 2017, Proceedings
  Blanc-Talon, Jacques ; Penne, Rudi ; Philips, Wilfried ; Popescu, Dan ; Scheunders, Paul 2017 Springer International Publishing
• Automata, Languages, and Programming – 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II
  Esparza, Javier ; Fraigniaud, Pierre ; Husfeldt, Thore ; Koutsoupias, Elias 2014 Springer Berlin Heidelberg
• Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
  Akitaya, Hugo A. ; Arkin, Esther M. ; Damian, Mirela ; Demaine, Erik D. ; Dujmović, Vida ; Flatland, Robin ; Korman, Matias ; Palop, Belen ; Parada, Irene ; Renssen, André van ; Sacristán, Vera
• Query Maintenance Under Batch Changes with Small-Depth Circuits
  Datta, Samir ; Khan, Asif ; Mukherjee, Anish ; Tschirbs, Felix ; Vortmeier, Nils ; Zeume, Thomas 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions
  Bulteau, Laurent ; Jones, Mark ; Niedermeier, Rolf ; Tantau, Till 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Delay-Robust Routes in Temporal Graphs
  Füchsle, Eugen ; Molter, Hendrik ; Niedermeier, Rolf ; Renken, Malte 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Binary Matrix Completion Under Diameter Constraints
  Koana, Tomohiro ; Froese, Vincent ; Niedermeier, Rolf 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Few Cuts Meet Many Point Sets
  Har-Peled, Sariel ; Jones, Mitchell
• Facility Reallocation on the Line
  Keijzer, Bart ˜deœ ; Wojtczak, Dominik
• Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk)
  Glomb, Lukas ; Hoch, Benno ; Liers, Frauke ; Rösel, Florian 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Improved Approximation Algorithm for Knapsack Median Using Sparsification
  Byrka, Jarosław ; Pensyl, Thomas ; Rybicki, Bartosz ; Spoerhase, Joachim ; Srinivasan, Aravind ; Trinh, Khoa
• Convergence to Equilibrium of Logit Dynamics for Strategic Games
  Auletta, Vincenzo ; Ferraioli, Diodato ; Pasquale, Francesco ; Penna, Paolo ; Persiano, Giuseppe
• Computational Thinking – First Algorithms, Then Code
  Ferragina, Paolo ; Luccio, Fabrizio 2024 Springer International Publishing, Imprint: Springer
• Guide to Competitive Programming – Learning and Improving Algorithms Through Contests
  Laaksonen, Antti 2024 Springer International Publishing, Imprint: Springer
• Data Structures and Algorithms with Python – With an Introduction to Multiprocessing
  2024 Springer International Publishing
• Vorkurs Informatik – Der Einstieg ins Informatikstudium
  Müller, Heinrich ; Weichert, Frank 2023 Springer Fachmedien Wiesbaden
• Complexity Theory – Exploring the Limits of Efficient Algorithms
  Wegener, Ingo 2005 Springer Berlin Heidelberg
• Algorithmen und Datenstrukturen – Grundlagen und probabilistische Methoden für den Entwurf und die Analyse
  Knebl, Helmut 2021 Springer Fachmedien Wiesbaden