Burkhard Englert's Home Page
- Research Interests:
- Distributed Systems and Algorithms and the Theory of Distributed Computing.
- Computer Security Education.
- Transportation Research and Modeling.
- Selected Publications:
- An
efficient long-lived adaptive collect algorithm (Brief Announcement)
Proceedings of the 19th International Symposium on Distributed Computing
(DISC 2005), pp.516-518.
- An
efficient long-lived adaptive collect algorithm Proceedings of
DPNA 2005 workshop (IEEE-ICPADS 2005, pp. 649-654) - updated version,
Fukuoka Japan 2005.
- Uniform
solvability with a finite number of MWMR registers (joint work
with M. Aguilera and E. Gafni), Proceedings of the 17th International
Symposium on Distributed Computing (DISC 2003), pp.16-29.
- On
using network attached disks as shared memory (joint
work with M. Aguilera and E. Gafni), Proceedings of the 22nd Annual ACM
Symposium on Principles of Distributed Computing (PODC 2003), pp. 315-324.
-
Homomorphisms and Quotients of degree structures (joint
work with M. Lerman and K. Wald, Annals of Pure and Applied Logic Vol
123 pp 193-233, 2003)
- Fast
Collect in the absence of contention (joint work with E.
Gafni, Proceedings of 22nd (IEEE) ICDCS, pp. 537-543 Vienna Austria 2002)
- Developing
and Refining an Adaptive Token-Passing Strategy (with L. Rudolph,
A. Shvartsman), Proceedings of 21. (IEEE) ICDCS 2001, pp. 597-605, Phoenix
AZ 2001.
- A
necessary and sufficient condition for embedding principally decomposable
finite lattices into the c.e. degrees preserving greatest element
Annals of Pure and Applied Logic, Vol 112/1, pp 1-26, 2001.
- Graceful
Quorum Reconfiguration in a Robust Emulation of Shared Memory
(with A. Shvartsman), Proceedings of 20. (IEEE) ICDCS 2000, pp. 454-463,
Taipei, Taiwan 2000.
Dr. Burkhard Englert
Professor
Department of Computer Engineering and Computer Science
California State University Long Beach
Long Beach, CA 90840
email: benglert at csulb.edu