Distributed stabilizing data structures
Published in Digital Scholarship - UNLV (University of Nevada Reno) • May 29, 2019
NobleIDNI5P89W69R98S54
Authors:
Doina Bein
Abstract
Distributed algorithms aim to achieve better performance than sequential algorithms in terms of time complexity (or asymptotic time complexity) while keeping or lowering the memory requirement (space complexity) in a node. (In sequential algorithms, the memory requirement is the memory requirement o...
Subject
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!