„amortized complexity“

Suchergebnisse

17 Treffer

• On the Amortized Complexity of Approximate Counting
  Aden-Ali, Ishaq ; Han, Yanjun ; Nelson, Jelani ; Yu, Huacheng 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Amortized Complexity Verified
  Nipkow, Tobias ; Brinkop, Hauke
• External-Memory Priority Queues with Optimal Insertions
  Brodal, Gerth Stølting ; Goodrich, Michael T. ; Iacono, John ; Lo, Jared ; Meyer, Ulrich ; Pagan, Victor ; Sitchinava, Nodari ; Svenning, Rolf 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
  Conte, Alessio ; Grossi, Roberto ; Kobayashi, Yasuaki ; Kurita, Kazuhiro ; Rucci, Davide ; Uno, Takeaki ; Wasa, Kunihiro
• Oracular Byzantine Reliable Broadcast
  Camaioni, Martina ; Guerraoui, Rachid ; Monti, Matteo ; Vidigueira, Manuel 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Trading Time and Space in Catalytic Branching Programs
  Cook, James ; Mertz, Ian 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Long-Lived Counters with Polylogarithmic Amortized Step Complexity
  Baig, Mirza Ahad ; Hendler, Danny ; Milani, Alessia ; Travers, Corentin 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Lower Bounds on the Amortized Time Complexity of Shared Objects
  Attiya, Hagit ; Fouren, Arie 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Candidate for a Strong Separation of Information and Communication
  Braverman, Mark ; Ganor, Anat ; Kol, Gillat ; Raz, Ran 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Note on Amortized Branching Program Complexity
  Potechin, Aaron 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Non-Blocking Doubly-Linked Lists with Good Amortized Complexity
  Shafiei, Niloufar 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• PltcRB: a practical distributed randomness beacon with optimal amortized communication complexity
  Wu, Zheyi ; Liu, Haolin ; Wang, Lei
• Lower Bounds on the Amortized Time Complexity of Shared Objects
  Attiya, Hagit ; Fouren, Arie ; Ko, Jeremy
• The amortized complexity of Henriksen's algorithm
  Kingston, Jeffrey H.
• Long-lived counters with polylogarithmic amortized step complexity
  Baig, Mirza Ahad ; Hendler, Danny ; Milani, Alessia ; Travers, Corentin
• On the Amortized Complexity of Zero-Knowledge Protocols
  Cramer, Ronald ; Damgård, Ivan ; Keller, Marcel
• Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits
  Charguéraud, Arthur ; Pottier, François