Burkhard Englert

According to our database1, Burkhard Englert authored at least 20 papers between 2000 and 2016.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Optimal Queue Length in Torus Networks with Traffic Signals.
CoRR, 2016

Multivalued and Deterministic Peer-to-Peer Polling in Social Networks with Reputation Conscious Participants.
Proceedings of the 12th IEEE International Conference on Trust, 2013

On Using Bittorrent for File Sharing in Mobile Ad-Hoc Networks.
Proceedings of the Internet and Distributed Computing Systems, 2013

Virtualization Technology and its Impact on Computer Hardware Architecture.
Proceedings of the Eighth International Conference on Information Technology: New Generations, 2011

Optimal Sorting Algorithms for a Simplified 2D Array with Reconfigurable Pipelined Bus System.
IEEE Trans. Parallel Distributed Syst., 2010

On the cost of uniform protocols whose memory consumption is adaptive to interval contention.
Theor. Comput. Sci., 2009

On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

On the design and implementation of a secure online password vault.
Proceedings of the 2009 International Conference on Hybrid Information Technology, 2009

OPODIS 2006 Report.
Bull. EATCS, 2007

Adaptive Algorithms Using Bounded Memory Are Inherently Non-uniform.
Proceedings of the Parallel and Distributed Processing and Applications, 2006

Implementing Overlapping Domain Decomposition Methods on a Virtual Parallel Machine.
Proceedings of the Frontiers of High Performance Computing and Networking, 2006

An Efficient Long-Lived Adaptive Collect Algorithm.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Can Memory Be Used Adaptively by Uniform Algorithms?
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Homomorphisms and quotients of degree structures.
Ann. Pure Appl. Log., 2003

Uniform Solvability with a Finite Number of MWMR Registers.
Proceedings of the Distributed Computing, 17th International Conference, 2003

On using network attached disks as shared memory.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Fast Collect in the absence of contention.
Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS'02), 2002

A necessary and sufficient condition for embedding principally decomposable finite lattices into the computable enumerable degrees preserving greatest element.
Ann. Pure Appl. Log., 2001

Developing and Refining an Adaptive Token-Passing Strategy.
Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), 2001

Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory.
Proceedings of the 20th International Conference on Distributed Computing Systems, 2000