Burkhard Englert is a 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. He also worked on distributed algorithms. In 1992, he received a BS degree in mathematics from the University of Tuebingen in Germany. 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 received the Sorgenfrey Distinguished Teaching Award for visiting faculty members for outstanding achievements in teaching by the department of Mathematics. Currently, Burkhard teaches a broad range of graduate and undergraduate courses concentrating on computer security, net-centric computing, and distributed systems.

Burkhard's research interests are distributed computing, distributed algorithms, computer security, and transportation network modeling and optimization.