| 
|
QuoteRef: carlS2_1991
topics >
all references >
ThesaHelp:
references c-d
Topic:
memory management by garbage collection
Topic:
sort algorithms
Topic:
probability
Reference
Carlsson, S., Mattsson, C., Poblete, P.V., Bengtsson, M., "A new compacting garbage-collection algorithm with a good average-case performance", STACS 91. 8th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, February 1991. Google
Other Reference
Lecture Notes in Computer Science
297 ;;Quote: garbage collection by collecting addresses during mark, sort and compact; expected linear time
299 ;;Quote: linear probing sort for uniformly distributed elements; hash into range and shift as needed
ThesaHelp: references c-d (337 items)
Topic: memory management by garbage collection (113 items)
Topic: sort algorithms (24 items)
Topic: probability (21 items)