Retroactive Data Structures (extended abstract) Erik D. Demaine John Iacono

First Page		Document Content
Date: 2005-07-03 22:51:50 Software engineering Abstract data types Data types Persistent data structure Dynamization Priority queue Binary search tree Bin Linked list Computing Data management Data structures		Retroactive Data Structures (extended abstract) Erik D. Demaine John Iacono Add to Reading List Source URL: www.aladdin.cs.cmu.edu Download Document from Source Website File Size: 138,34 KB Share Document on Facebook

	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 DocID: 1tkGE - View Document
	The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology Jean-Daniel Boissonnat & Tamal Dey & Cl´ement Maria JGA 2013 DocID: 1sG7U - View Document
	SnapQueue: Lock-Free Queue with Constant Time Snapshots Aleksandar Prokopec École Polytechnique Fédérale de Lausanne, Switzerland Abstract DocID: 1qv6G - View Document
	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 DocID: 1qubA - View Document
	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 DocID: 1pqGe - View Document