Persistent data structure - PDFSEARCH.IO - Document Search Engine

Persistent data structure
Results: 28

#	Item
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 Add to Reading List Source 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 Add to Reading List Source 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 Add to Reading List Source URL: axel22.github.io Language: English - Date: 2016-08-13 13:11:44 Abstract data types Computing Data structures Software engineering Computer science Queue Double-ended queue Amortized analysis Persistent data structure Rope Conc-Tree list
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 Add to Reading List Source URL: www1.maths.leeds.ac.uk Language: English - Date: 2016-01-18 16:52:42 Algebra Mathematics Abstract algebra Category theory Linear algebra Homological algebra Topological data analysis Sheaf Adjoint functors Universal property Ring Cokernel
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 Add to Reading List Source URL: www.bioinf.uni-leipzig.de Language: English - Date: 2013-05-14 07:18:32 Data management Database management systems Database theory Datomic NoSQL Datalog Database Triplestore Online analytical processing Persistent data structure Document-oriented database Relational database
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 Add to Reading List Source URL: www.cs.swarthmore.edu Language: English - Date: 2004-01-23 10:39:23 Graph theory Data management Computing R-tree Persistent data structure FO B+ tree Tango tree B-tree Binary trees Data structures
7	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 B-tree Data structures Computing R-tree Rope Persistent data structure Trie Segment tree B+ tree Binary trees Graph theory Data management
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 Add to Reading List Source URL: www.blackhat.com Language: English - Date: 2014-12-16 19:06:38 C++ C programming language C Standard Library C dynamic memory allocation Memory management Pointer New C Dangling pointer Computing Computer programming Software engineering
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 Add to Reading List Source URL: www.blackhat.com Language: English - Date: 2014-12-16 19:06:38 Memory management C Standard Library C dynamic memory allocation C++ Pointer C Heap Computing Computer programming Software engineering
10	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 Parallel computing Compiler optimizations Concurrency control Programming paradigms Concurrent data structure Cilk Scalable parallelism Multi-core processor OpenMP Computing Concurrent computing Computer programming

UPDATE