Space Overhead Bounds for Dynamic Memory Management With Partial Compaction

doi 10.1145/1926385.1926441
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Lower Bounds for Dynamic Connectivity

2004English

Improved Upper Bounds for Partial Vertex Cover

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Low-Overhead Decision Support for Dynamic Buffer Reallocation

Computer Science - Research and Development
2011English

Low-Overhead Dynamic Sampling for Redundant Traffic Elimination

Journal of Communications
Electronic EngineeringElectrical
2012English

LOWER BOUNDS FOR $Pi$-$Pi$ PARTIAL-WAVE AMPLITUDES.

1972English

Space Lower Bounds for Itemset Frequency Sketches

2016English

Dynamic Frontotemporal Systems Process Space and Time in Working Memory

PLoS Biology
ImmunologyMolecular BiologyGeneticsBiochemistryMicrobiology Biological SciencesAgriculturalNeuroscience
2018English

Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds

2020English

Secure and Dynamic Memory Management Architecture for Virtualization Technologies in IoT Devices

Future Internet
Computer NetworksCommunications
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy