We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...
Query-load (forwarding and answering) balancing in structured overlays is one of the most critical and least studied problems. It has been assumed that caching heuristics can take...
We propose a load balancing heuristic for parallel adaptive finite element method (FEM) simulations. In contrast to most existing approaches, the heuristic focuses on good partit...
Henning Meyerhenke, Burkhard Monien, Stefan Schamb...
Large-scale individual-based simulations can benefit a lot from high performance computing environments. The benefit that can be hopped depends greatly on a good load distributi...
All Internet-accessible computing systems are currently faced with incessant threats ranging from simple scriptkiddies to highly sophisticated criminal enterprises. In response to...