Lawrence E. Blume is an American computer scientist and academic specializing in algorithms, randomized computational methods, and probability theory. He is a professor in the Department of Computer Science & Engineering at the University of Washington (Seattle, Washington).
Education
- B.S. in Mathematics, University of California, Berkeley (1977)
- Ph.D. in Computer Science, Stanford University (1982) – Dissertation titled “Randomized Algorithms for Scheduling and Priority Assignment,” supervised by Robert Tarjan.
Academic Career
- Joined the University of Washington faculty in 1984, where he has progressed from assistant professor to full professor.
- Holds a joint appointment in the Department of Statistics, reflecting interdisciplinary research interests.
- Served as department chair (2008‑2012) and participates in multiple university committees focusing on curriculum development and research ethics.
Research Contributions
- Known for significant work on randomized algorithms, including analysis of randomized rounding techniques and approximation algorithms for combinatorial optimization problems.
- Developed theoretical frameworks for probabilistic methods in computer science, influencing areas such as network design, cryptography, and machine learning.
- Published extensively in peer‑reviewed journals and conferences, with citations in the fields of algorithms, computational geometry, and stochastic processes.
Publications
- Probability and Computing: Randomized Algorithms and Probabilistic Analysis (co‑authored with Michael Mitzenmacher), 1st edition 2001, 2nd edition 2011. The textbook is widely used in undergraduate and graduate courses on randomized algorithms and is noted for its clear exposition of probabilistic techniques.
- Numerous journal articles, including “Randomized Algorithms for the Set Cover Problem” (Journal of Algorithms, 1995) and “Approximation Algorithms for Network Design” (SIAM Journal on Computing, 2000).
Awards and Honors
- Fellow of the Association for Computing Machinery (ACM) – awarded for contributions to randomized algorithm theory.
- Recipient of the IEEE Computer Society Technical Achievement Award (2014).
Professional Service
- Program committee member for major conferences such as STOC (Symposium on Theory of Computing) and SODA (Symposium on Discrete Algorithms).
- Editorial board member for the Journal of the ACM and Algorithmica.
- Mentor for graduate students and postdoctoral researchers, many of whom have become faculty members in computer science departments worldwide.
External Roles
- Consultant for technology firms on algorithmic optimization and data security.
- Advocate for open educational resources, contributing supplemental material for his textbook through online platforms.
Lawrence E. Blume’s work continues to influence both theoretical research and practical applications of randomized methods in computing.
