„Persistent Data Structures“

Suchergebnisse

1.000+ Treffer

• A decomposition theorem for finite persistent transition systems
  Best, Eike ; Darondeau, Philippe
• A unified spectral-persistent homology framework for stable and generalizable topological deep learning
  Alwaeli, Saif Hameed Abbood ; Abdulsaeed, Ali A. ; Fayyadh, Shams Jamal ; Khan, Muhammad I. ; Yousif, Abdallah ; Saba, Tanzila ; Bahaj, Saeed Ali
• NapFS: A High-Performance Persistent Memory File System for Non-Uniform Memory Access Architectures
  Jia, Wen-Qing ; Jiang, De-Jun ; Xiong, Jin
• Banana Trees for the Persistence in Time Series Experimentally
  Ost, Lara ; Cultrera di Montesano, Sebastiano ; Edelsbrunner, Herbert 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Recoverable Computing (Invited Talk)
  Fatourou, Panagiota 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fast Nonblocking Persistence for Concurrent Data Structures
  Cai, Wentao ; Wen, Haosen ; Maksimovski, Vladimir ; Du, Mingzhe ; Sanna, Rafaello ; Abdallah, Shreif ; Scott, Michael L. 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Ranked Enumeration of MSO Logic on Words
  Bourhis, Pierre ; Grez, Alejandro ; Jachiet, Louis ; Riveros, Cristian 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Random Access in Persistent Strings
  Bille, Philip ; Gørtz, Inge Li 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Brief Announcement: Building Fast Recoverable Persistent Data Structures with Montage
  Wen, Haosen ; Cai, Wentao ; Du, Mingzhe ; Valpey, Benjamin ; Scott, Michael L. 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory
  Friedman, Michal ; Herlihy, Maurice ; Marathe, Virendra ; Petrank, Erez 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Shortest Path to a Segment and Quickest Visibility Queries
  Arkin, Esther M. ; Efrat, Alon ; Knauer, Christian ; Mitchell, Joseph S. B. ; Polishchuk, Valentin ; Rote, Günter ; Schlipf, Lena ; Talvitie, Topi 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Data Structures for Modern Memory and Storage Hierarchies (Dagstuhl Seminar 21283)
  Idreos, Stratos ; Leis, Viktor ; Sattler, Kai-Uwe ; Seltzer, Margo
• Cost optimization in persistent virtual world design
  Shen, Bingqing ; Guo, Jingzhi ; Li, Ling
• Implementation Schemes for the Factorized Quantum Lattice-Gas Algorithm for the One Dimensional Diffusion Equation using Persistent-Current Qubits
  Berns, David M. ; Orlando, T. P.
• Persistent Reusable Java Virtual Machine unter z/OS und Linux
  Beyerle, Marc ; Franz, Joachim ; Spruth, Wilhelm G.
• Deep round key recovery attacks and countermeasure in persistent fault model: a case study on GIFT and KLEIN
  Joshi, Priyanka ; Mazumdar, Bodhisatwa
• Selective caching – a persistent memory approach for multi-dimensional index structures
  Jibril, Muhammad Attahir ; Götze, Philipp ; Broneske, David ; Sattler, Kai-Uwe 2021 TU Ilmenau
• Selective caching: a persistent memory approach for multi-dimensional index structures
  Jibril, Muhammad Attahir ; Götze, Philipp ; Broneske, David ; Sattler, Kai-Uwe
• Verifying correctness of persistent concurrent data structures: a sound and complete method
  Derrick, John ; Doherty, Simon ; Dongol, Brijesh ; Schellhorn, Gerhard ; Wehrheim, Heike
• Index-Based Persistent Document Identifiers
  Spinellis, Diomidis