Automata, Languages and Programming

DOI10.1007/B99859MaRDI QIDQ5466448zbMATH OpenOpenAlexFDO

Authors Robert Harper

Publication date 24 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99859

zbMATH Keywords

dynamization of static algorithmsQuickSort

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• Non-monotonic self-adjusting computation
• Imperative self-adjusting computation
• A cost semantics for self-adjusting computation
• Compiling self-adjusting programs with continuations
• Kinetic Algorithms Via Self-adjusting Computation

Cited in

(10)

• Computing with continuous change
• Selftuning and its footprints
• Incremental computing with abstract data structures
• Non-monotonic self-adjusting computation
• Data linkage dynamics with shedding
• Imperative self-adjusting computation
• Adaptive functional programming
• Sorting and selection on dynamic data
• Kinetic Algorithms Via Self-adjusting Computation
• A Consistent Semantics of Self-adjusting Computation

This page was built for publication: Automata, Languages and Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466448)