„Algorithms & Data Structures“

Suchergebnisse

3.154 Treffer

• Algorithms and data structures – 9th international workshop ; proceedings
  Dehne, Frank 2005 Springer
• Algorithms and data structures – 8th international workshop ; proceedings
  Dehne, Frank 2003 Springer
• Algorithms and data structures – 6th international workshop ; proceedings
  Dehne, Frank 2002 Springer
• Algorithms and data structures – 7th international workshop ; proceedings
  Dehne, Frank 2001 Springer
• Topology-aware optimization of big sparse matrices and matrix multiplications on main-memory systems
  Lehner, Wolfgang ; Kernert, David ; Köhler, Frank 2023 Technische Universität Dresden
• Memory-Efficient Frequent-Itemset Mining
  Schlegel, Benjamin ; Gemulla, Rainer ; Lehner, Wolfgang 2022 Technische Universität Dresden
• k-ary search on modern processors
  Schlegel, Benjamin ; Gemulla, Rainer ; Lehner, Wolfgang 2022 Technische Universität Dresden
• Advances and applications of automata on words and trees – abstracts collection
  Glaßer, Christian ; Pin, Jean Éric ; Schweikardt, Nicole ; Selivanov, Victor ; Thomas, Wolfgang 2011 Universitätsbibliothek Johann Christian Senckenberg
• New Approximate Distance Oracles and Their Applications
  Kadria, Avi ; Roditty, Liam 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Disk Intersection Graphs: Models, Data Structures, and Algorithms
  Seiferth, Paul 2016 Freie Universität Berlin
• Approximation Techniques for Facility Location and Their Applications in Metric Embeddings
  Lammersen, Christiane ; Sohler, Christian ; Meyer auf der Heide, Friedhelm 2011 Universitätsbibliothek Dortmund
• Efficient algorithms to calculate the Hausdorff distance on point sets represented by a $$k^2\text {-tree}$$
  Domínguez, Fernando ; Gutiérrez, Gilberto ; Penabad, Miguel R. ; Romero, Miguel ; Santolaya, Fernando
• Guest Editorial: Selected Papers from WG 2014
  Kratsch, Dieter ; Todinca, Ioan
• Guest Editorial: Theory of Evolutionary Computation
  Doerr, Benjamin ; Witt, Carsten
• On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
  Blažej, Václav ; Jana, Satyabrata ; Ramanujan, M. S. ; Strulo, Peter
• ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
  Lehmann, Hans-Peter ; Sanders, Peter ; Walzer, Stefan
• Achieving Tight $$O(4^k)$$ Runtime Bounds on Jump k by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
  Opris, Andre ; Lengler, Johannes ; Sudholt, Dirk
• Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian Noise
  Künnemann, Marvin ; Manthey, Bodo ; Veenstra, Rianne
• Algorithmen – eine Einführung : Band 1
  Cormen, Thomas H. ; Leiserson, Charles Eric ; Rivest, Ronald Linn ; Stein, Clifford 2025 De Gruyter Oldenbourg
• Correction: Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms
  Chimani, Markus ; Ilsen, Max