Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Bender, Michael A. Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 2 of 2 reviews    
  B-trees and cache-oblivious B-trees with different-sized atomic keys
Bender M., Ebrahimi R., Hu H., Kuszmaul B. ACM Transactions on Database Systems 41(3): 1-33, 2016.  Type: Article

The problem of creating B-tree-like dictionaries with small atomic keys from a system containing large, variable-size records is the subject of this paper. These kinds of dictionaries provide guaranteed performance, enhancing the searc...
...
Sep 13 2016  
  The freeze-tag problem: how to wake up a swarm of robots
Arkin E., Bender M., Fekete S., Mitchell J., Skutella M. Algorithmica 46(2): 193-221, 2006.  Type: Article

A swarm of robots can mimic the behavior of biological swarms, like a swarm of social insects. In the freeze tag problem, there is one member of the swarm, a sentinel, whose task is to awaken the sleeping members of the swarm to respon...
...
Dec 19 2007  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy