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 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 his current research he focuses on distributed algorithms, computer security, and transportation network modeling.
Before joining the College of Engineering at CSULB in 2003, he spent three years as an adjunct assistant professor in the Program in Computing at UCLA. In 2002 he received the UCLA Department of Mathematics Sorgenfrey Distinguished Teaching Award for visiting faculty members. Currently he teaches a broad range of graduate and undergraduate courses concentrating on computer security, net-centric computing, and distributed systems.
