MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Heaps Simplified" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

12 documents found, showing 1 through 10. Next 10 →

ATOM

Memory Subsystem Performance of Programs Using Copying Garbage Collection
by Amer Diwan , David Tarditi, Eliot Moss — 1994 — IN TWENTY-FIRST ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES
… to store most activation records [24]. However, using only a heap simplifies the compiler, the run…
Cited by 36 (2 self) – Add To MetaCart

Memory Subsystem Performance of Programs with Intensive Heap Allocation
by Amer Diwan, David Tarditi, Eliot Moss — 1994 — IN 21ST ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES
… a heap simplifies the compiler, the run-time system [3], and the implementation of first…
Cited by 27 (8 self) – Add To MetaCart

Memory System Performance of Programs with Intensive Heap Allocation
by Amer Diwan, David Tarditi, Eliot Moss — 1995 — ACM Transactions on Computer Systems
… to store most activation records [Kranz et al. 1986]. However, using only a heap simplifies the compiler…
Cited by 19 (3 self) – Add To MetaCart

Memory-System Performance of Programs with Intensive Heap Allocation
by Amer Diwan, David Tarditi, Eliot Moss — 1995 — Transactions on Computer Systems
…]. However, using only a heap simplifies the compiler, the run-time system [Appel 1990…
Cited by 14 (1 self) – Add To MetaCart

Aggregate Nearest Neighbor Queries in Spatial Databases
by Dimitris Papadias, Yufei Tao, Kyriakos Mouratidis, Chun Kit Hui — 2005 — TODS
…. This is a simplified version because the original algorithm [Roussopoulos et al. 1995] includes some…
Cited by 12 (3 self) – Add To MetaCart

Interval Heaps
by D. Wood, Vakgreep Informatica, Budapestlean Cd H, J. Van Leeuwen, J. Van Leeuwen — 1987 — The Computer Journal
… will use the binary tree representation of heaps to simplify our discussion below, but note that all our…
Cited by 2 (0 self) – Add To MetaCart

A Continuation-Passing Style for Prolog
by Thomas Lindgren, Thomas Lindgren — 1994
… environments on the heap simplifies the execution machinery while being competitive in execution speed to a…
Cited by 4 (2 self) – Add To MetaCart

Correctness-preserving derivation of concurrent garbage collection algorithms
by Martin T. Vechev — 2006 — Available at http://www.worldbank.org/en_breve Jalan, Jyotsna and Martin Ravallion. 2001. “Does piped water reduce diarrhea for children in Rural India.” Policy Research Working Paper
… in many domains. This is true both at the high end, where the collection of multi-gigabyte heaps causes…
Cited by 6 (2 self) – Add To MetaCart

Towards a High-Level Implementation of Execution Primitives for Non-restricted, Independent And-parallelism
by Amadeo Casas, Manuel Carro, Manuel V. Hermenegildo — 2007
… are allocated in the heap, to simplify the memory management. 3 UPM — Department of Computer Science 4 a(X,Z) b…
Cited by 2 (2 self) – Add To MetaCart

Practical object-oriented back-in-time debugging
by Adrian Lienhard, Tudor Gîrba, Oscar Nierstrasz — 2008 — In 22nd European Conference on Object-Oriented Programming (ECOOP’08), volume 5142 of LNCS
….4). Representing aliases directly as conventional objects allocated on the heap simplifies the internal object…
Cited by 3 (2 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB