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