1![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 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](https://www.pdfsearch.io/img/8c882cab35cd272a29add78242fca9c9.jpg) | Add to Reading ListSource URL: www.blackhat.com- Date: 2015-05-28 15:51:43
|
---|
2![The 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](https://www.pdfsearch.io/img/b7b4d4d21a9151a541dbce64333fbeab.jpg) | Add to Reading ListSource URL: quentin.mrgt.fr- Date: 2014-01-09 09:41:45
|
---|
3![SnapQueue: 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](https://www.pdfsearch.io/img/4024c5fa3a6e4f5d7d4040f04e717f80.jpg) | Add to Reading ListSource URL: axel22.github.ioLanguage: English - Date: 2016-08-13 13:11:44
|
---|
4![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 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](https://www.pdfsearch.io/img/d9061453bc81aa5614b752e4414084ae.jpg) | Add to Reading ListSource URL: www1.maths.leeds.ac.ukLanguage: English - Date: 2016-01-18 16:52:42
|
---|
5![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 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](https://www.pdfsearch.io/img/cd4e791fd338069a887cae069c4e79a4.jpg) | Add to Reading ListSource URL: www.bioinf.uni-leipzig.deLanguage: English - Date: 2013-05-14 07:18:32
|
---|
6![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 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](https://www.pdfsearch.io/img/de2bef77b4476c8d453b9b840f2bc184.jpg) | Add to Reading ListSource URL: www.cs.swarthmore.eduLanguage: English - Date: 2004-01-23 10:39:23
|
---|
7![I/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](https://www.pdfsearch.io/img/94624735d07937afaf106e34b4cce4ef.jpg) | Add to Reading ListSource URL: www.cs.swarthmore.eduLanguage: English - Date: 2003-01-06 11:49:03
|
---|
8![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 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](https://www.pdfsearch.io/img/cdff178b8792f5bc9062945d556d98ea.jpg) | Add to Reading ListSource URL: www.blackhat.comLanguage: English - Date: 2014-12-16 19:06:38
|
---|
9![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 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](https://www.pdfsearch.io/img/ee3841aa32fc2cb12ec671ff69ad746a.jpg) | Add to Reading ListSource URL: www.blackhat.comLanguage: English - Date: 2014-12-16 19:06:38
|
---|
10![Erbium: 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](https://www.pdfsearch.io/img/191452ac0024dc32955635a894b537f2.jpg) | Add to Reading ListSource URL: www.cri.ensmp.frLanguage: English - Date: 2010-09-24 08:26:00
|
---|