Atomic snapshots in O(log3 n) steps using randomized helping James Aspnes∗ Keren Censor-Hillel† - Sethi–Ullman algorithm - Document - PDFSEARCH.IO

First Page	Meta Content
	Atomic snapshots in O(log3 n) steps using randomized helping James Aspnes∗ Keren Censor-Hillel† Add to Reading List Document Date: 2015-04-30 10:33:59 Open Document File Size: 478,92 KB Share Result on Facebook Event Product Issues / / Facility Yale University / / IndustryTerm deterministic algorithms / snapshot algorithm / / Organization National Science Foundation / Department of Computer Science / Yale University / Technion / / Person Keren Censor-Hillel / James Aspnes∗ Keren / / Position scheduler / / Product process / / Technology snapshot algorithm / m0 Algorithm / / SocialTag Computing Tree B-tree Tango tree Sethi–Ullman algorithm Binary trees Graph theory Data management

Atomic snapshots in O(log3 n) steps using randomized helping James Aspnes∗ Keren Censor-Hillel†Add to Reading List