Carsten Lund

Carsten Lund
Name	Carsten Lund
Birth date	1963
Birth place	Denmark
Fields	Computer science, Algorithms, Cryptography, Complexity theory
Institutions	Aarhus University, DIMACS, AT&T Labs Research
Alma mater	University of Copenhagen, University of Aarhus
Doctoral advisor	Peter Bro Miltersen
Known for	Randomized algorithms, Approximation algorithms, Flow algorithms, Online algorithms

Carsten Lund Carsten Lund is a Danish computer scientist noted for contributions to randomized algorithms, approximation algorithms, and computational complexity. His work spans theoretical foundations and practical methods developed during appointments at European and North American research centers and industrial laboratories. Lund has collaborated with leading researchers across institutions, influencing algorithm design for network flow, combinatorial optimization, and cryptographic protocol analysis.

Early life and education

Lund was born in Denmark and completed undergraduate and graduate studies in computer science at the University of Copenhagen and the University of Aarhus. He studied under advisors including Peter Bro Miltersen and engaged with research communities around the European Association for Theoretical Computer Science. During his doctoral training he interacted with scholars from Princeton University, Massachusetts Institute of Technology, and the California Institute of Technology, attending workshops at DIMACS and conferences such as STOC and FOCS. His early academic influences included work by Richard Karp, Leslie Valiant, Michael Rabin, and Donald Knuth.

Research and contributions

Lund's research focuses on randomized algorithms, approximation schemes, streaming and online algorithms, and applications to cryptography and network optimization. He contributed to probabilistic method advances influenced by Paul Erdős and Alfréd Rényi traditions, and to complexity-class separations related to work by Leonid Levin and Stephen Cook. Lund produced foundational results in randomized rounding and approximation techniques that build on frameworks developed by Ravi Kannan, David Shmoys, and Éva Tardos. His analyses of network flow and multicommodity flow problems relate to classical results by Jack Edmonds and Richard M. Karp, and intersect with later developments by Michel Goemans and David Williamson.

In streaming and sublinear algorithms, Lund explored space- and time-efficient techniques inspired by Moses Charikar and Piotr Indyk, contributing methods applicable to large-scale data processing on infrastructures pioneered by Google and Amazon Web Services. His work in cryptographic protocol analysis connects with theoretical foundations established by Adi Shamir, Ronald Rivest, and Whitfield Diffie, applying algorithmic thinking to protocol verification and efficiency trade-offs. Collaborative publications with researchers from AT&T Labs Research and Bell Labs reflect interdisciplinary approaches tying theory to systems.

Academic and professional career

Lund held faculty and research positions at institutions including the University of Aarhus and visiting appointments at research centers such as DIMACS and Institute for Advanced Study. He spent time at industrial research laboratories including AT&T Labs Research where he worked alongside investigators in algorithms and cryptography. He participated in program committees for flagship conferences STOC, FOCS, SODA, ICALP, and EUROCRYPT, and served as a reviewer for journals like the Journal of the ACM and SIAM Journal on Computing. Lund collaborated with scholars from University of California, Berkeley, Stanford University, Carnegie Mellon University, and University of Toronto, contributing to multi-institutional grants and EU-funded projects alongside teams from Max Planck Institute for Informatics and ETH Zurich.

His teaching and mentorship included graduate seminars on randomized algorithms, approximation algorithms, and computational complexity, influencing students who later held positions at Microsoft Research, Google Research, IBM Research, and various European universities. Lund also lectured at summer schools organized by CERC, CRA, and European Summer School in Logic, Language and Information.

Awards and honors

Lund received recognition for his research through invitations to speak at major conferences such as STOC and FOCS and through awards or distinctions from academic societies. He was awarded fellowships and visiting scholar appointments at centers including DIMACS and research residencies tied to programs at the Institute for Advanced Study. His collaborative papers received best-paper nominations at conferences like SODA and ICALP, and his contributions have been cited in surveys and textbooks by authors such as Jon Kleinberg and Éva Tardos.

Selected publications and works

- Lund authored and coauthored peer-reviewed articles in venues including Journal of the ACM, SIAM Journal on Computing, and conferences STOC, FOCS, SODA, ICALP, and ICALP. - Notable collaborative papers addressed randomized approximation schemes for combinatorial optimization, algorithmic aspects of multicommodity flow, and space-efficient streaming algorithms. Coauthors included researchers affiliated with AT&T Labs Research, Princeton University, MIT, and CNRS. - He contributed chapters to edited volumes on algorithmic techniques and cryptographic protocol analysis appearing alongside works by Oded Goldreich and Shafi Goldwasser.

Category:Danish computer scientists Category:Theoretical computer scientists