The SCEAS System
Navigation Menu

Search the dblp DataBase


Burkhard Englert: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Burkhard Englert, Eli Gafni
    Fast Collect in the absence of contention. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2002, pp:537-543 [Conf]
  2. Burkhard Englert, Larry Rudolph, Alexander A. Shvartsman
    Developing and Refining an Adaptive Token-Passing Strategy. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2001, pp:597-605 [Conf]
  3. Burkhard Englert, Alexander A. Shvartsman
    Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2000, pp:454-463 [Conf]
  4. Burkhard Englert
    An efficient long-lived adaptive collect algorithm. [Citation Graph (0, 0)][DBLP]
    ICPADS (2), 2005, pp:649-653 [Conf]
  5. David Darjany, Burkhard Englert, Eun Heui Kim
    Implementing Overlapping Domain Decomposition Methods on a Virtual Parallel Machine. [Citation Graph (0, 0)][DBLP]
    ISPA Workshops, 2006, pp:717-727 [Conf]
  6. Burkhard Englert
    Adaptive Algorithms Using Bounded Memory Are Inherently Non-uniform. [Citation Graph (0, 0)][DBLP]
    ISPA, 2006, pp:394-405 [Conf]
  7. Burkhard Englert
    On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2006, pp:64-80 [Conf]
  8. Burkhard Englert, Darin Goldstein
    Can Memory Be Used Adaptively by Uniform Algorithms? [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:32-46 [Conf]
  9. Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni
    On using network attached disks as shared memory. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:315-324 [Conf]
  10. Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni
    Uniform Solvability with a Finite Number of MWMR Registers. [Citation Graph (0, 0)][DBLP]
    DISC, 2003, pp:16-29 [Conf]
  11. Burkhard Englert
    An Efficient Long-Lived Adaptive Collect Algorithm. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:516-518 [Conf]
  12. Burkhard Englert
    A necessary and sufficient condition for embedding principally decomposable finite lattices into the computable enumerable degrees preserving greatest element. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:112, n:1, pp:1-26 [Journal]
  13. Burkhard Englert, Manuel Lerman, Kevin Wald
    Homomorphisms and quotients of degree structures. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2003, v:123, n:1-3, pp:193-233 [Journal]

  14. On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory. [Citation Graph (, )][DBLP]

  15. On the design and implementation of a secure online password vault. [Citation Graph (, )][DBLP]

Search in 0.004secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002