Carsten Lund

10.0k total citations · 2 hit papers
84 papers, 5.9k citations indexed

About

Carsten Lund is a scholar working on Computer Networks and Communications, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, Carsten Lund has authored 84 papers receiving a total of 5.9k indexed citations (citations by other indexed papers that have themselves been cited), including 53 papers in Computer Networks and Communications, 49 papers in Artificial Intelligence and 34 papers in Computational Theory and Mathematics. Recurrent topics in Carsten Lund's work include Complexity and Algorithms in Graphs (31 papers), Network Traffic and Congestion Control (26 papers) and Software-Defined Networks and 5G (16 papers). Carsten Lund is often cited by papers focused on Complexity and Algorithms in Graphs (31 papers), Network Traffic and Congestion Control (26 papers) and Software-Defined Networks and 5G (16 papers). Carsten Lund collaborates with scholars based in United States, Israel and Hungary. Carsten Lund's co-authors include Nick Duffield, Mikkel Thorup, Mihalis Yannakakis, Lance Fortnow, Sanjeev Arora, Madhu Sudan, Márió Szegedy, László Babai, Rajeev Motwani and Nick Reingold and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Journal on Selected Areas in Communications and Journal of the ACM.

In The Last Decade

Carsten Lund

83 papers receiving 5.3k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Proof verification and the hardness of approximation problems

1998 766 citations Sanjeev Arora, Carsten Lund et al. profile →
On the hardness of approximating minimization problems

1994 512 citations Carsten Lund et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Carsten Lund United States	30	3.2k	3.0k	2.7k	613	395	84	5.9k
Mikkel Thorup United States	42	2.3k 0.7×	3.7k 1.2×	2.2k 0.8×	995 1.6×	468 1.2×	232	6.3k
Don Coppersmith United States	36	2.4k 0.8×	1.6k 0.5×	2.2k 0.8×	891 1.5×	337 0.9×	106	5.5k
Stephen Cook Canada	34	4.3k 1.4×	1.6k 0.5×	5.2k 1.9×	519 0.8×	461 1.2×	133	7.7k
David Peleg Israel	51	1.6k 0.5×	5.9k 1.9×	4.1k 1.5×	876 1.4×	348 0.9×	305	8.5k
Zvi Galil United States	40	2.7k 0.8×	1.6k 0.5×	2.8k 1.0×	523 0.9×	800 2.0×	191	5.6k
Johan Håstad Sweden	30	2.4k 0.7×	1.2k 0.4×	2.7k 1.0×	519 0.8×	134 0.3×	111	4.6k
Larry Stockmeyer United States	24	1.4k 0.4×	2.4k 0.8×	2.0k 0.7×	770 1.3×	633 1.6×	49	4.7k
Uri Zwick Israel	33	1.2k 0.4×	1.7k 0.5×	2.5k 0.9×	730 1.2×	185 0.5×	151	4.7k
Michael L. Fredman United States	26	1.7k 0.5×	1.6k 0.5×	2.0k 0.7×	475 0.8×	419 1.1×	56	4.9k
Alon Itai Israel	34	1.4k 0.4×	2.1k 0.7×	1.6k 0.6×	752 1.2×	163 0.4×	70	4.4k

Countries citing papers authored by Carsten Lund

Since Specialization

Citations

This map shows the geographic impact of Carsten Lund's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Carsten Lund with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Carsten Lund more than expected).

Fields of papers citing papers by Carsten Lund

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Carsten Lund. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Carsten Lund. The network helps show where Carsten Lund may publish in the future.

Co-authorship network of co-authors of Carsten Lund

This figure shows the co-authorship network connecting the top 25 collaborators of Carsten Lund. A scholar is included among the top collaborators of Carsten Lund based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Carsten Lund. Carsten Lund is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Cohen, Edith, Graham Cormode, Nick Duffield, & Carsten Lund. (2016). On the Tradeoff between Stability and Fit. ACM Transactions on Algorithms. 13(1). 1–24. 3 indexed citations

2.

Cohen, Edith, Nick Duffield, Haim Kaplan, Carsten Lund, & Mikkel Thorup. (2011). Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. SIAM Journal on Computing. 40(5). 1402–1431. 15 indexed citations

3.

Cohen, Edith, Nick Duffield, Haim Kaplan, Carsten Lund, & Mikkel Thorup. (2009). Stream sampling for variance-optimal estimation of subset sums. Symposium on Discrete Algorithms. 1255–1264. 17 indexed citations

4.

Cohen, Edith, Nick Duffield, Haim Kaplan, Carsten Lund, & Mikkel Thorup. (2009). Stream sampling for variance-optimal estimation of subset sums. 1255–1264. 7 indexed citations

5.

Sung, Yu-Wei Eric, et al.. (2009). Modeling and understanding end-to-end class of service policies in operational networks. ACM SIGCOMM Computer Communication Review. 39(4). 219–230. 5 indexed citations

6.

Sung, Yu-Wei Eric, et al.. (2009). Modeling and understanding end-to-end class of service policies in operational networks. 219–230. 29 indexed citations

7.

Kalmanek, Charles, et al.. (2009). Darkstar: Using exploratory data mining to raise the bar on network reliability and performance. 28. 1–10. 24 indexed citations

8.

Duffield, Nick, Carsten Lund, & Mikkel Thorup. (2005). Optimal combination of sampled network measurements. 8–8. 12 indexed citations

9.

Zhang, Yin, Matthew Roughan, Carsten Lund, & David L. Donoho. (2003). An information-theoretic approach to traffic matrix estimation. 301–312. 215 indexed citations

10.

Feldmann, Anja, et al.. (2000). Deriving traffic demands for operational IP networks. ACM SIGCOMM Computer Communication Review. 30(4). 257–270. 74 indexed citations

11.

Lund, Carsten, Steven Phillips, & Nick Reingold. (1999). Paging against a Distribution and IP Networking. Journal of Computer and System Sciences. 58(1). 222–231. 4 indexed citations

12.

Arora, Sanjeev, Carsten Lund, Rajeev Motwani, Madhu Sudan, & Márió Szegedy. (1998). Proof verification and the hardness of approximation problems.. Electronic colloquium on computational complexity. 5. 14 indexed citations

13.

Arora, Sanjeev & Carsten Lund. (1996). Hardness of approximations. 399–446. 115 indexed citations

14.

Condon, Anne, Joan Feigenbaum, Carsten Lund, & Peter W. Shor. (1995). Probabilistically Checkable Debate Systems and Nonapproximabilityof PSPACE-Hard Functions. 1995. 11 indexed citations

15.

Lund, Carsten & Nick Reingold. (1994). Linear programs for randomized on-line algorithms. Symposium on Discrete Algorithms. 382–391. 8 indexed citations

16.

Goldwasser, S., et al.. (1994). Efficient probabilistic checkable proofs and applications to approximation. 820–820. 14 indexed citations

17.

Boyar, Joan, Carsten Lund, & René Peralta. (1993). On the communication complexity of zero-knowledge proofs. Journal of Cryptology. 6(2). 65–85. 5 indexed citations

18.

Fortnow, Lance & Carsten Lund. (1993). Interactive proof systems and alternating time—space complexity. Theoretical Computer Science. 113(1). 55–73. 21 indexed citations

19.

Bellare, Mihir, et al.. (1993). Efficient probabilistically checkable proofs and applications to approximations. 294–304. 192 indexed citations

20.

Lund, Carsten, et al.. (1980). Relationships between degree-days and computer simulated events within a population of the European red mite, Panonychus ulmi (Acarina: Tetranychidae).. 111. 33–37. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact