Weak heap

#	Item
1	Algorithms and Data Structures Winter TermExercises for Unit 16 & 17 1. Show the following simple facts about a binomial tree of rank k. a) The tree has 2k nodes. Add to Reading List Source URL: www-tcs.cs.uni-sb.de Language: English - Date: 2016-03-09 08:07:30 Abstract data types Binomial heap Fibonacci heap Heap Amortized analysis Queue Data structures Priority queues Weak heap Shadow heap
2	Parallel Generational-Copying Garbage Collection with a Block-Structured Heap Simon Marlow Tim Harris Add to Reading List Source URL: community.haskell.org Language: English - Date: 2008-05-07 11:37:38 Memory management Automatic memory management Data types C++ Garbage collection Software design patterns Pointer C dynamic memory allocation Region-based memory management Weak reference Garbage Fragmentation
3	Weak Heaps and Friends: Show Me Your Bits Stefan Edelkamp Universit¨ at Bremen Add to Reading List Source URL: iwoca2013.colloques.univ-rouen.fr Language: English - Date: 2013-10-01 05:32:46 Binary heap Heap Nim ALGOL 68 Algorithm D-ary heap Binomial heap Mathematics Computing Computer programming
4	Robert Haken [MVP ASP.NET/IIS, MCT] software architect, HAVIT, s.r.o. [removed], @RobertHaken Heap, Garbage Collector .NET Internals 1/2 Add to Reading List Source URL: havitknowledgebase.files.wordpress.com Language: English - Date: 2014-12-01 19:24:00 .NET Framework Weak reference Finalizer Garbage Computing Memory management Garbage collection