Persistent data structure

Results: 28



#Item
1Understanding the heap by breaking it A case study of the heap as a persistent data structure through nontraditional exploitation techniques Abstract: Traditional exploitation techniques of overwriting heap metadata has

Understanding the heap by breaking it A case study of the heap as a persistent data structure through nontraditional exploitation techniques Abstract: Traditional exploitation techniques of overwriting heap metadata has

Add to Reading List

Source URL: www.blackhat.com

- Date: 2015-05-28 15:51:43
    2The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology Jean-Daniel Boissonnat & Tamal Dey & Cl´ement Maria JGA 2013

    The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology Jean-Daniel Boissonnat & Tamal Dey & Cl´ement Maria JGA 2013

    Add to Reading List

    Source URL: quentin.mrgt.fr

    - Date: 2014-01-09 09:41:45
      3SnapQueue: Lock-Free Queue with Constant Time Snapshots Aleksandar Prokopec École Polytechnique Fédérale de Lausanne, Switzerland Abstract

      SnapQueue: Lock-Free Queue with Constant Time Snapshots Aleksandar Prokopec École Polytechnique Fédérale de Lausanne, Switzerland Abstract

      Add to Reading List

      Source URL: axel22.github.io

      Language: English - Date: 2016-08-13 13:11:44
      4THE OBSERVABLE STRUCTURE OF PERSISTENCE MODULES ´ ERIC ´ FRED CHAZAL, WILLIAM CRAWLEY-BOEVEY, AND VIN DE SILVA Abstract. In persistent topology, q-tame modules appear as a natural and large class

      THE OBSERVABLE STRUCTURE OF PERSISTENCE MODULES ´ ERIC ´ FRED CHAZAL, WILLIAM CRAWLEY-BOEVEY, AND VIN DE SILVA Abstract. In persistent topology, q-tame modules appear as a natural and large class

      Add to Reading List

      Source URL: www1.maths.leeds.ac.uk

      Language: English - Date: 2016-01-18 16:52:42
      5Alexander Kiel University Leipzig HAL8 PaperD AT O M I C - A F U N C T I O N A L D ATA B A S E

      Alexander Kiel University Leipzig HAL8 PaperD AT O M I C - A F U N C T I O N A L D ATA B A S E

      Add to Reading List

      Source URL: www.bioinf.uni-leipzig.de

      Language: English - Date: 2013-05-14 07:18:32
      6I/O-efficient Point Location using Persistent B-Trees Lars Arge, Andrew Danner, and Sha-Mayn Teh Department of Computer Science, Duke University We present an external planar point location data structure that is I/O-eff

      I/O-efficient Point Location using Persistent B-Trees Lars Arge, Andrew Danner, and Sha-Mayn Teh Department of Computer Science, Duke University We present an external planar point location data structure that is I/O-eff

      Add to Reading List

      Source URL: www.cs.swarthmore.edu

      Language: English - Date: 2004-01-23 10:39:23
      7I/O-efficient Point Location using Persistent B-Trees Lars Arge∗ Andrew Danner† Sha-Mayn Teh

      I/O-efficient Point Location using Persistent B-Trees Lars Arge∗ Andrew Danner† Sha-Mayn Teh

      Add to Reading List

      Source URL: www.cs.swarthmore.edu

      Language: English - Date: 2003-01-06 11:49:03
      8Understanding the heap by breaking it A case study of the heap as a persistent data structure through nontraditional exploitation techniques Abstract: Traditional exploitation techniques of overwriting heap metadata has

      Understanding the heap by breaking it A case study of the heap as a persistent data structure through nontraditional exploitation techniques Abstract: Traditional exploitation techniques of overwriting heap metadata has

      Add to Reading List

      Source URL: www.blackhat.com

      Language: English - Date: 2014-12-16 19:06:38
      9Understanding the heap by breaking it A case study of the heap as a persistent data structure through non-traditional exploitation techniques Justin N. Ferguson // BH2007

      Understanding the heap by breaking it A case study of the heap as a persistent data structure through non-traditional exploitation techniques Justin N. Ferguson // BH2007

      Add to Reading List

      Source URL: www.blackhat.com

      Language: English - Date: 2014-12-16 19:06:38
      10Erbium: A Deterministic, Concurrent Intermediate Representation to Map Data-Flow Tasks to Scalable, Persistent Streaming Processes Cupertino Miranda Antoniu Pop

      Erbium: A Deterministic, Concurrent Intermediate Representation to Map Data-Flow Tasks to Scalable, Persistent Streaming Processes Cupertino Miranda Antoniu Pop

      Add to Reading List

      Source URL: www.cri.ensmp.fr

      Language: English - Date: 2010-09-24 08:26:00