default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBurkhard Englert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c17]Mehrdad Aliasgari
, Burkhard Englert, Oscar Morales-Ponce:
Computing the Optimal Longest Queue Length in Torus Networks. TPNC 2021: 3-14
2010 – 2019
- 2016
- [i1]Oscar Morales-Ponce, Burkhard Englert, Mehrdad Aliasgari:
Optimal Queue Length in Torus Networks with Traffic Signals. CoRR abs/1606.03800 (2016) - 2013
- [c16]Burkhard Englert, Souroush Pourezza:
On Using Bittorrent for File Sharing in Mobile Ad-Hoc Networks. IDCS 2013: 78-91 - [c15]Burkhard Englert, Reza Gheissari:
Multivalued and Deterministic Peer-to-Peer Polling in Social Networks with Reputation Conscious Participants. TrustCom/ISPA/IUCC 2013: 895-902 - 2011
- [c14]Amir Ali Semnanian, Jeffrey Pham, Burkhard Englert, Xiaolong Wu:
Virtualization Technology and its Impact on Computer Hardware Architecture. ITNG 2011: 719-724 - 2010
- [j5]Min He, Xiaolong Wu, Si-Qing Zheng, Burkhard Englert:
Optimal Sorting Algorithms for a Simplified 2D Array with Reconfigurable Pipelined Bus System. IEEE Trans. Parallel Distributed Syst. 21(3): 303-312 (2010)
2000 – 2009
- 2009
- [j4]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) - [c13]Burkhard Englert, Pritesh Shah:
On the design and implementation of a secure online password vault. ICHIT 2009: 375-382 - [c12]Burkhard Englert, Chryssis Georgiou, Peter M. Musial, Nicolas C. Nicolaou, Alexander A. Shvartsman:
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory. OPODIS 2009: 240-254 - 2007
- [j3]Burkhard Englert:
OPODIS 2006 Report. Bull. EATCS 91: 76-95 (2007) - 2006
- [c11]Burkhard Englert:
Adaptive Algorithms Using Bounded Memory Are Inherently Non-uniform. ISPA 2006: 394-405 - [c10]David Darjany, Burkhard Englert, Eun Heui Kim:
Implementing Overlapping Domain Decomposition Methods on a Virtual Parallel Machine. ISPA Workshops 2006: 717-727 - [c9]Burkhard Englert:
On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention. OPODIS 2006: 64-80 - 2005
- [c8]Burkhard Englert:
An efficient long-lived adaptive collect algorithm. ICPADS (2) 2005: 649-653 - [c7]Burkhard Englert, Darin Goldstein:
Can Memory Be Used Adaptively by Uniform Algorithms? OPODIS 2005: 32-46 - [c6]Burkhard Englert:
An Efficient Long-Lived Adaptive Collect Algorithm. DISC 2005: 516-518 - 2003
- [j2]Burkhard Englert, Manuel Lerman, Kevin Wald:
Homomorphisms and quotients of degree structures. Ann. Pure Appl. Log. 123(1-3): 193-233 (2003) - [c5]Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni:
On using network attached disks as shared memory. PODC 2003: 315-324 - [c4]Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni:
Uniform Solvability with a Finite Number of MWMR Registers. DISC 2003: 16-29 - 2002
- [c3]Burkhard Englert, Eli Gafni:
Fast Collect in the absence of contention. ICDCS 2002: 537-543 - 2001
- [j1]Burkhard Englert:
A necessary and sufficient condition for embedding principally decomposable finite lattices into the computable enumerable degrees preserving greatest element. Ann. Pure Appl. Log. 112(1): 1-26 (2001) - [c2]Burkhard Englert, Larry Rudolph, Alexander A. Shvartsman:
Developing and Refining an Adaptive Token-Passing Strategy. ICDCS 2001: 597-605 - 2000
- [c1]Burkhard Englert, Alexander A. Shvartsman:
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory. ICDCS 2000: 454-463
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
