Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Englert, Burkhard - Department of Computer Engineering and Computer Science, California State University, Long Beach
Adaptive Algorithms using Bounded Memory are Inherently Non-Uniform
Fast Collect in the absence of contention Burkhard Englert
On the Cost of Uniform Protocols whose Memory Consumption is Adaptive to Interval
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory
Can Memory be used Adaptively by Uniform Algorithms?
On using network attached disks as shared memory (Extended abstract)
Brief Announcement: An Efficient Long-Lived Adaptive Collect Algorithm
An Efficient Long-Lived Adaptive Collect Algorithm Burkhard Englert
Developing and Refining an Adaptive Token-Passing Strategy
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
Implementing overlapping domain decomposition methods on a virtual parallel
