Carsten Lund
Impact in
- Computational Theory and Mathematics top 0.05%
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- Computer Networks and Communications top 0.2%
- Network Traffic and Congestion Control
- Network Security and Intrusion Detection
- Optimization and Search Problems
- Software-Defined Networks and 5G
Papers in
-
- Network Traffic and Congestion Control 26
- Software-Defined Networks and 5G 16
- Optimization and Search Problems 15
- Network Security and Intrusion Detection 14
-
- Cryptography and Data Security 17
- Internet Traffic Analysis and Secure E-voting 15
- Logic, Reasoning, and Knowledge 11
- Co-authors
- Mihalis Yannakakis (3 shared papers)Nick Duffield (26 shared papers)Lance Fortnow (9 shared papers)Sanjeev Arora (3 shared papers)Mikkel Thorup (22 shared papers)Márió Szegedy (3 shared papers)Madhu Sudan (3 shared papers)László Babai (3 shared papers)
- Journals
- Computational Complexity (5 papers)ACM SIGMETRICS Performance Evaluation Review (4 papers)Journal of the ACM (4 papers)SIAM Journal on Computing (4 papers)IEEE/ACM Transactions on Networking (3 papers)
- Partner nations
- United StatesIsraelHungary
In The Last Decade
Carsten Lund
89 papers receiving 6.8k citations
Carsten Lund's Hit Papers
Peers
Comparison fields: 5 of 98
- Computational Theory and Mathematics 3.8k
- Computer Networks and Communications 3.6k
- Computer Graphics and Computer-Aided Design 496
- Artificial Intelligence 4.0k
- Hardware and Architecture 434
Countries citing papers authored by Carsten Lund
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
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-authors
The 25 scholars most cited alongside Carsten Lund, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 90 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Proof verification and the hardness of approximation problems Hit paper breakdown → | 1998 | 996 |
| 2 | On the hardness of approximating minimization problems Hit paper breakdown → | 1994 | 658 |
| 3 | Proof verification and hardness of approximation problems Hit paper breakdown → | 1992 | 616 |
| 4 | 1992 | 435 | |
| 5 | 1992 | 362 | |
| 6 | 2001 | 355 | |
| 7 | 1991 | 354 | |
| 8 | 1993 | 244 | |
| 9 | 2003 | 233 | |
| 10 | 2003 | 189 | |
| 11 | 1993 | 185 | |
| 12 | 2000 | 176 | |
| 13 | 2002 | 175 | |
| 14 | 2004 | 173 | |
| 15 | Hardness of approximations | 1996 | 160 |
| 16 | 2005 | 147 | |
| 17 | 2001 | 142 | |
| 18 | 2005 | 134 | |
| 19 | 1993 | 131 | |
| 20 | 2005 | 126 |
About Carsten Lund
Carsten Lund is a scholar working on Computer Networks and Communications, Artificial Intelligence, Computational Theory and Mathematics, Hardware and Architecture and Electrical and Electronic Engineering, having authored 90 papers that have together received 7.4k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (34 papers), Network Traffic and Congestion Control (26 papers), Cryptography and Data Security (17 papers), Software-Defined Networks and 5G (16 papers), Optimization and Search Problems (15 papers), Internet Traffic Analysis and Secure E-voting (15 papers), Network Security and Intrusion Detection (14 papers) and Logic, Reasoning, and Knowledge (11 papers). The work is most often cited by research in Computational Theory and Mathematics (3.8k citations), Computer Networks and Communications (3.6k citations), Computer Graphics and Computer-Aided Design (496 citations), Artificial Intelligence (4.0k citations) and Hardware and Architecture (434 citations). Carsten Lund has collaborated with scholars based in United States, Israel and Hungary. Frequent co-authors include Mihalis Yannakakis, Nick Duffield, Lance Fortnow, Sanjeev Arora, Mikkel Thorup, Márió Szegedy, Madhu Sudan, László Babai, Rajeev Motwani and Nick Reingold. Their work appears in journals such as Computational Complexity, ACM SIGMETRICS Performance Evaluation Review, Journal of the ACM, SIAM Journal on Computing and IEEE/ACM Transactions on Networking.
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.