Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Englert, Burkhard
California State University Long Beach
Long Beach, California
   Featured Reviewer
   Reader Recommended
   Reviewer Selected
Follow this Reviewer

Burkhard Englert is an associate professor in the department of computer engineering and computer science at California State University Long Beach. He earned his PhD from the department of mathematics at the University of Connecticut in 2000. His doctoral research was in the area of computability theory (recursion theory) and dealt with lattice embeddings into the computably enumerable degrees. In 2000, he also received an MS degree in computer engineering and computer science at the same university. His research in computer science focused on distributed algorithms. In 1992, he received a BS degree in mathematics from the University of Tuebingen in Germany.

Burkhard's research interests are distributed computing, distributed algorithms, computer security, and transportation network modeling. Several of his more recent papers deal with uniform and adaptive distributed algorithms where a priori no upper bound on the number of participating processes is known (uniform) and the step complexity is a function of the number of actually participating processes (adaptive). He also began to work on an extension of the idea of adaptive algorithms, namely, so-called memory-adaptive algorithms for the shared memory model where any write must be to a register whose index is a function of the contention. He was able to show that a simple store/release protocol that is memory-adaptive to interval contention cannot be uniformly implemented using only read/write registers. Burkhard also serves as a reviewer and a member of program committees on a number of national and international conferences.

After finishing his PhD in 2000, Burkhard came to University of California, Los Angeles (UCLA) as an adjunct assistant professor in the program in computing. At UCLA, he worked with Eli Gafni and was able to expand on his research. At the same time, he had the opportunity to further develop and enhance his teaching skills. As a result, in 2002 he received the Sorgenfrey Distinguished Teaching Award for visiting faculty members for outstanding achievements in teaching by the department of mathematics. He also fell in love with the California sunshine and the city of LA, and, together with his family, decided to settle there permanently.

Currently, Burkhard teaches a broad range of graduate and undergraduate courses concentrating on computer security, net-centric computing, and distributed systems. In his free time, he likes to travel and is also an avid runner.

Date Reviewed  
- 10 of 54 reviews

  Once upon an algorithm: how stories explain computing
Erwig M., The MIT Press, Cambridge, MA, 2017. 336 pp.  Type: Book (978-0-262036-63-4)

Martin Erwig emphasizes the general nature of computation and the use of computer science (CS) in this book. He uses well-known stories to explain computing concepts to readers not familiar with the field....

Sep 21 2018  
   Advanced persistent security
Winkler I., Gomes A., Syngress Publishing, Cambridge, MA, 2017.  Type: Book (9780128093160)

Winkler and Gomes define “advanced persistent security” as “defense in depth” (multilayered attack protection) that is enhanced by a comprehensive methodology for integrating attack detection cap...

Oct 12 2017  
   Data analytics (2nd ed.)
Runkler T., Springer Vieweg, New York, NY, 2016. 150 pp.  Type: Book (978-3-658140-74-8)

Over the last few years, data analytics has emerged as one of the core areas of computer science. It provides us with powerful tools that allow us to process and understand the ever-increasing stream of information flowing from busines...

Jul 6 2017  
   Uncertain differential equations
Yao K., Springer International Publishing, New York, NY, 2016. 158 pp.  Type: Book (978-3-662527-27-6)

Yao begins his book by stating that “uncertain differential equations” are a concept proposed by Liu in 2008. It appears, however, that what he calls uncertain differential equations are also known as stochastic dif...

Jun 28 2017  
  Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
Libert B., Joye M., Yung M. Theoretical Computer Science 645(C): 1-24, 2016.  Type: Article

Libert et al. develop a fully distributed, non-interactive, adaptively secure threshold signature scheme with scalable share size....

Jan 13 2017  
   Distributed and sequential algorithms for bioinformatics
Erciyes K., Springer International Publishing, New York, NY, 2015. 367 pp.  Type: Book (978-3-319249-64-3)

The analysis of vast amounts of biological data has the potential to significantly impact and aid further development of bioengineering processes that can be used for medical purposes such as the treatment of diseases. Traditionally mo...

Sep 6 2016  
  A survey of the multiplier conjecture
Gordon D., Schmidt B. Designs, Codes and Cryptography 78(1): 221-236, 2016.  Type: Article

A multiplier in an abelian group is an integer power that acts in the same way as a single group element when applied to the elements of a difference set of the group. In this survey paper, the authors provide an overview of progress o...

May 6 2016  
   Introduction to cryptography: principles and applications (3rd ed.)
Delfs H., Knebl H., Springer Publishing Company, Incorporated, New York, NY, 2015. 508 pp.  Type: Book (978-3-662479-73-5)

Cryptography is the foundation of any secure communication. It is essential for and enables e-commerce, the digitization of information, cloud computing, and the list goes on. Cryptography uses mathematical functions to scramble messag...

Mar 16 2016  
  Distributed computing through combinatorial topology
Herlihy M., Kozlov D., Rajsbaum S., Morgan Kaufmann Publishers Inc., Waltham, MA, 2014. 336 pp.  Type: Book (978-0-124045-78-1), Reviews: (2 of 2)

Topological arguments have been used for 30 years to prove some of the most important fundamental results in distributed computing. In 1985, Fischer, Lynch, and Paterson [1] showed, using chains of uncertainties forming a connected gra...

Jan 13 2016  
   Comparative gene finding: models, algorithms and implementation (2nd ed.)
Axelson-Fisk M., Springer Publishing Company, Incorporated, New York, NY, 2015. 382 pp.  Type: Book (978-1-447166-92-4)

Gene finding is the process of identifying the regions of genomic DNA that encode genes. This is a notoriously difficult task and researchers have developed several different approaches to handle these difficulties. This book focuses o...

Dec 23 2015  
Display per column
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2023 ThinkLoud®
Terms of Use
| Privacy Policy