„merge sort“

Suchergebnisse

1.000+ Treffer

• On the average running time of odd even merge sort
  Rüb, Christine 1995 Max-Planck-Inst. für Informatik, Bibliothek & Dokumentation
• Correction: Galloping in Fast-Growth Natural Merge Sorts
  Ghasemi, Elahe ; Jugé, Vincent ; Khalighinejad, Ghazal ; Yazdanyar, Helia
• Ex-post merger evaluation in the UK retail market for books
  Aguzzoni, Luca ; Argentesi, Elena ; Ciari, Lorenzo ; Duso, Tomaso ; Tognoni, Massimo 2013 Deutsches Institut für Wirtschaftsforschung (DIW)
• Ex-post Merger Evaluation in the UK Retail Market for Books
  Aguzzoni, Luca ; Argentesi, Elena ; Ciari, Lorenzo ; Duso, Tomaso ; Tognoni, Massimo 2013 Düsseldorf Institute for Competition Economics (DICE)
• Linear-Time Secure Merge in O(loglog n) Rounds
  Blunk, Mark ; Bunn, Paul ; Dittmer, Samuel ; Lu, Steve ; Ostrovsky, Rafail 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Ex-post Merger Evaluation in the U.K. Retail Market for Books
  Aguzzoni, Luca ; Argentesi, Elena ; Ciari, Lorenzo ; Duso, Tomaso ; Tognoni, Massimo 2018 ZBW – Leibniz Information Centre for Economics
• Galloping in Fast-Growth Natural Merge Sorts
  Ghasemi, Elahe ; Jugé, Vincent ; Khalighinejad, Ghazal 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Secure Merge with O(n log log n) Secure Operations
  Falk, Brett Hemenway ; Ostrovsky, Rafail 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs
  Munro, J. Ian ; Wild, Sebastian 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Worst-Case Complexity of TimSort
  Auger, Nicolas ; Jugé, Vincent ; Nicaud, Cyril ; Pivoteau, Carine 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Optimality of Tape Merge of Two Lists with Similar Size
  Li, Qian ; Sun, Xiaoming ; Zhang, Jialin 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fine-grained vectorized merge sorting on RISC-V: from register to cache
  Zhang, Jin ; Zhou, Jincheng ; Zhang, Xiang ; Ma, Di ; Gong, Chunye
• Galloping in Fast-Growth Natural Merge Sorts
  Ghasemi, Elahe ; Jugé, Vincent ; Khalighinejad, Ghazal ; Yazdanyar, Helia
• Ex-post merger evaluation in the UK retail market for books
  Aguzzoni, Luca 2013 DICE
• Parallel Merge Sort with Load Balancing
  Jeon, Minsoo ; Kim, Dongseung
• On how to merge sorted lists coming from different web search tools
  Yager, R. R. ; Kreinovich, V.
• On Batcher's merge sorts as parallel sorting algorithms
  Rüb, Christine 1997 MPI Informatik, Bibliothek & Dokumentation
• Adaptive Isoflächenextraktion aus großen Volumendaten
  Helbig, Andreas ; Brunnett, Guido ; Kienel, Enrico 2007 Universitätsbibliothek Chemnitz
• Programming for Problem Solving (Using C)
  Sinha, Vijay Kumar ; Jeet, Rubal ; Jaiswal, Meenakshi 2019 LAP LAMBERT Academic Publishing
• Stochastic analysis of simultaneous merge sort
  Cramer, Michael 1996 Albert-Ludwigs-Univ., Math. Fak.