Burkhard Englert

23 papers A* 1A 5B 3C 1Journal 6Unranked 7
YearRankTypeTitle / Venue / Authors
2021 — conf
Computing the Optimal Longest Queue Length in Torus Networks.
TPNC
Mehrdad Aliasgari, Burkhard Englert, Oscar Morales-Ponce
2016 J jnl
Optimal Queue Length in Torus Networks with Traffic Signals.
CoRR
Oscar Morales-Ponce, Burkhard Englert, Mehrdad Aliasgari
2013 — conf
Multivalued and Deterministic Peer-to-Peer Polling in Social Networks with Reputation Conscious Participants.
TrustCom/ISPA/IUCC
Burkhard Englert, Reza Gheissari
2013 — conf
On Using Bittorrent for File Sharing in Mobile Ad-Hoc Networks.
IDCS
Burkhard Englert, Souroush Pourezza
2011 — conf
Virtualization Technology and its Impact on Computer Hardware Architecture.
ITNG
Amir Ali Semnanian, Jeffrey Pham, Burkhard Englert, Xiaolong Wu
2010 J jnl
Optimal Sorting Algorithms for a Simplified 2D Array with Reconfigurable Pipelined Bus System.
IEEE Trans. Parallel Distributed Syst.
Min He, Xiaolong Wu, Si-Qing Zheng, Burkhard Englert
2009 B conf
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory.
OPODIS
Burkhard Englert, Chryssis Georgiou, Peter M. Musial, Nicolas C. Nicolaou, Alexander A. Shvartsman
2009 J jnl
On the cost of uniform protocols whose memory consumption is adaptive to interval contention.
Theor. Comput. Sci.
Burkhard Englert
2009 — conf
On the design and implementation of a secure online password vault.
ICHIT
Burkhard Englert, Pritesh Shah
2007 J jnl
OPODIS 2006 Report.
Bull. EATCS
Burkhard Englert
2006 C conf
Adaptive Algorithms Using Bounded Memory Are Inherently Non-uniform.
ISPA
Burkhard Englert
2006 — conf
Implementing Overlapping Domain Decomposition Methods on a Virtual Parallel Machine.
ISPA Workshops
David Darjany, Burkhard Englert, Eun Heui Kim
2006 B conf
On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention.
OPODIS
Burkhard Englert
2005 A conf
An Efficient Long-Lived Adaptive Collect Algorithm.
DISC
Burkhard Englert
2005 — conf
An efficient long-lived adaptive collect algorithm.
ICPADS (2)
Burkhard Englert
2005 B conf
Can Memory Be Used Adaptively by Uniform Algorithms?
OPODIS
Burkhard Englert, Darin Goldstein
2003 J jnl
Homomorphisms and quotients of degree structures.
Ann. Pure Appl. Log.
Burkhard Englert, Manuel Lerman, Kevin Wald
2003 A* conf
On using network attached disks as shared memory.
PODC
Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni
2003 A conf
Uniform Solvability with a Finite Number of MWMR Registers.
DISC
Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni
2002 A conf
Fast Collect in the absence of contention.
ICDCS
Burkhard Englert, Eli Gafni
2001 J jnl
A necessary and sufficient condition for embedding principally decomposable finite lattices into the computable enumerable degrees preserving greatest element.
Ann. Pure Appl. Log.
Burkhard Englert
2001 A conf
Developing and Refining an Adaptive Token-Passing Strategy.
ICDCS
Burkhard Englert, Larry Rudolph, Alexander A. Shvartsman
2000 A conf
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory.
ICDCS
Burkhard Englert, Alexander A. Shvartsman