2026 Carsten Lund: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	41	8581	8337	3674	3531	91	15914

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Computer Science

8581

8337

3674

3531

15914

Overview

Carsten Lund is affiliated with AT&T in the United States. Their research primarily focuses on the fields of medicine, with specific emphasis on public health, environmental and occupational health, as well as sociology and political science.

Their work spans multiple topics within medical and health sciences research and criminal law and policy. These areas illustrate a multidisciplinary approach combining health sciences with aspects of legal and social frameworks.

Recent publications by Carsten Lund include the following:

"Corona-Pandemie: Rechtsstaat - Sozialstaat" - 54. Richterwoche des Bundessozialgerichts, 2022, GesundheitsRecht
Anmerkung zu BSG, Urt. v. 26.1.2022 - B 6 KA 2/21 R (SG Magdeburg), 2022, Medizinrecht
Validation and comparative study of the Motus system for accurately identifying movement behaviours using different sampling frequencies, 2025, Scientific Reports

Carsten Lund frequently collaborates with other researchers in their field. Notable co-authors include:

Tonje Pedersen Ludvigsen
Jon Roslyng Larsen
Pasan Hettiarachchi
Mikkel Brandt
Nidhi Gupta

Their research has been published across several venues, including:

GesundheitsRecht
Medizinrecht
Scientific Reports

Best Publications

Proof verification and the hardness of approximation problems.

Sanjeev Arora;Carsten Lund;Rajeev Motwani;Madhu Sudan

3063
Citations
On the hardness of approximating minimization problems

Carsten Lund;Mihalis Yannakakis

1702
Citations
Proof verification and hardness of approximation problems

S. Arora;C. Lund;R. Motwani;M. Sudan

1064
Citations
Algebraic methods for interactive proof systems

Carsten Lund;Lance Fortnow;Howard Karloff;Noam Nisan

1049
Citations
Non-deterministic exponential time has two-prover interactive protocols

L. Babai;L. Babai;L. Fortnow;C. Lund

964
Citations
Estimating flow distributions from sampled flow statistics

Nick Duffield;Carsten Lund;Mikkel Thorup

641
Citations
Deriving traffic demands for operational IP networks: methodology and experience

Anja Feldmann;Albert Greenberg;Carsten Lund;Nick Reingold

535
Citations
Non-deterministic exponential time has two-prover interactive protocols

Unknown

530
Citations
Efficient probabilistically checkable proofs and applications to approximations

M. Bellare;S. Goldwasser;C. Lund;A. Russell

456
Citations
Hardness of approximations

Sanjeev Arora;Carsten Lund

438
Citations
An information-theoretic approach to traffic matrix estimation

Yin Zhang;Matthew Roughan;Carsten Lund;David Donoho

407
Citations
NetScope: traffic engineering for IP networks

A. Feldmann;A. Greenberg;C. Lund;N. Reingold

395
Citations
Properties and prediction of flow statistics from sampled packet streams

Nick Duffield;Carsten Lund;Mikkel Thorup

345
Citations
Nondeterministic exponential time has two-prover interactive protocols

L. Babai;L. Fortnow;C. Lund

290
Citations
Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications

Yin Zhang;Sumeet Singh;Subhabrata Sen;Nick Duffield

267
Citations
Charging from sampled network usage

Nick Duffield;Carsten Lund;Mikkel Thorup

266
Citations
The Approximation of Maximum Subgraph Problems

Carsten Lund;Mihalis Yannakakis

257
Citations
Algebraic methods for interactive proof systems

C. Lund;L. Fortnow;H. Karloff;N. Nisan

236
Citations
Learn more, sample less: control of volume and variance in network measurement

N. Duffield;C. Lund;M. Thorup

214
Citations
Traffic engineering system and method

Anja Feldmann;Albert Greenberg;Carsten Lund;Nicholas Reingold

194
Citations
Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach

Yin Zhang;Matthew Roughan;Carsten Lund;David L. Donoho

179
Citations

Frequent Co-Authors

Nick Duffield Texas A&M University

Mikkel Thorup University of Copenhagen

Alexandre Gerber AT&T (United States)

Subhabrata Sen AT&T (United States)

Edith Cohen Tel Aviv University

Haim Kaplan Tel Aviv University

Joan Feigenbaum Yale University

Lance Fortnow Illinois Institute of Technology

Yin Zhang The University of Texas at Austin

Anne Condon University of British Columbia

External Links

Wikipedia of Carsten Lund Personal website of Carsten Lund

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online degrees related to Computer Science can open up a wide range of career pathways. Many U.S. institutions now offer flexible options for students, including fastest computer science degree programs that let you complete your studies at an accelerated pace. These are ideal for motivated learners seeking to enter the workforce quickly.

If you’re concerned about past academic performance, there are also universities for low gpa applicants, making it possible for more students to access quality online education. This widens the pool of potential students interested in tech careers.

For those interested in the intersection of technology and environmental fields, consider an online environmental engineering degree science and engineering program. These degrees blend principles from both domains, preparing graduates for roles in sustainable tech and environmental protection.

Curious about broader career possibilities? Discover what can you do with an environmental science major to see how combining environmental awareness with tech skills can further enhance your employability.