Carsten Lund (born July 1, 1963) is a Danish-born theoretical computer scientist, currently working at AT&T Labs in Bedminster, New Jersey, United States.[1]
Lund was born in Aarhus, Denmark, and received the
"kandidat" degree in 1988 from the University of Aarhus and his Ph.D.
from the University of Chicago in computer science. His thesis, entitled The
Power of Interaction, was chosen as an ACM 'Distinguished Dissertation'.
Lund was a co-author on two of five competing papers at the 1990 Symposium on Foundations of Computer Science characterizing complexity classes such as PSPACE and NEXPTIME in terms of interactive proof systems;[2][3][4]
this work became part of his 1991 Ph.D. thesis from the University of Chicago under the supervision of Lance Fortnow and László Babai,[5] for which he was a runner-up for the 1991 ACM Doctoral Dissertation Award.[6]
He is also known for his joint work with Sanjeev Arora, Madhu Sudan, Rajeev Motwani, and Mario Szegedy that discovered the existence of probabilistically checkable proofs for NP-hard problems and used them to prove hardness results for approximation problems;[7][8] in 2001 he and his co-authors received the Gödel Prize for their share in these discoveries.[9]
More recently he has published highly cited work on internet traffic engineering.[10][11]
He has been working for AT&T Laboratories since August 1991.[12]
^Lund's home page at AT&T.
^Kolata, Gina (June 26, 1990), "In a Frenzy, Math Enters Age of Electronic Mail", The New York Times.
^Lund, Carsten; Fortnow, Lance; Karloff, Howard J.; Nisan, Noam (1990), "Algebraic Methods for Interactive Proof Systems", Proc. 31st Annual Symposium on Foundations of Computer Science, pp. 2–10, doi:10.1109/FSCS.1990.89518, ISBN 978-0-8186-2082-9, S2CID 32614901. Later published in JACM, 1991, doi:10.1145/146585.146605.
^Babai, László; Fortnow, Lance; Lund, Carsten (1990), "Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols", Proc. 31st Annual Symposium on Foundations of Computer Science, pp. 16–25, CiteSeerX 10.1.1.130.9311, doi:10.1109/FSCS.1990.89520, ISBN 978-0-8186-2082-9, S2CID 38429596. Later published in Computational Complexity, 1991, doi:10.1007/BF01200056.
^Cartsten Lund at the Mathematics Genealogy Project.
^Koppes, Steve (May 11, 2000), "Ph.D. recipient receives top award in the field of computer science", University of Chicago Chronicle, 19 (16).
^Kolata, Gina (April 7, 1992), "New Short Cut Found For Long Math Proofs", The New York Times.
^Arora, Sanjeev; Lund, Carsten; Motwani, Rajeev; Sudan, Madhu; Szegedy, Mario (1998), "Proof verification and the hardness of approximation problems", Journal of the ACM, 45 (3): 501–555, doi:10.1145/278298.278306, S2CID 8561542. Originally presented at the 1992 Symposium on Foundations of Computer Science, doi:10.1109/SFCS.1992.267823.
^Parberry, Ian (2001), 2001 Gödel Prize, ACM SIGACT.
^Feldmann, A.; Greenberg, A.; Lund, C.; Reingold, N.; Rexford, J. (2000), "NetScope: traffic engineering for IP networks", IEEE Network, 14 (2): 11–19, CiteSeerX 10.1.1.42.2801, doi:10.1109/65.826367.
^Feldmann, A.; Greenberg, A.; Lund, C.; Reingold, N.; Rexford, J.; True, F. (2001), "Deriving traffic demands for operational IP networks: methodology and experience", IEEE/ACM Transactions on Networking, 9 (3): 265–279, CiteSeerX 10.1.1.43.3549, doi:10.1109/90.929850, S2CID 32689094.
^Keshav, S.; Lund, C.; Phillips, S.; Reingold, N.; Saran, H. (1995). "An empirical evaluation of virtual circuit holding time policies in IP-over-ATM networks". IEEE Journal on Selected Areas in Communications. 13 (8): 1371–1382. doi:10.1109/49.464709.
CarstenLund (born July 1, 1963) is a Danish-born theoretical computer scientist, currently working at AT&T Labs in Bedminster, New Jersey, United States...
was built in the romantic style of organ builder CarstenLund Organ Builders of Copenhagen (CarstenLund Orgelbyggeri). Sigrid Marie Christie, Håkon Christie...
showing that co-NP had multiple prover interactive proofs (MIP). With CarstenLund and Howard Karloff, he used this result to develop an algebraic technique...
(1880). "Lund, Johann". The Cyclopedia of Biblical, Theological, and Ecclesiastical Literature. New York: Harper & Brothers. Carstens, Carsten Erich (1884)...
Awards Home. Association for Computing Machinery. Retrieved 2021-01-23. "CarstenLund". Awards Home. Association for Computing Machinery. Retrieved 2021-01-23...
France Menno Van Delft 1999 harpsichord Hans Fagius 2000 organ (on the CarstenLund organ of the Garnisons Church, Copenhagen, Denmark) Delmé Quartet 2000...
integral and fractional covers", Discrete Math. 13:4(1975), p. 383-390. CarstenLund and Mihalis Yannakakis: "On the hardness of approximating minimization...
Independent Set problem, and the Travelling Salesman Problem. Yannakakis and CarstenLund presented a number of findings regarding the hardness of computing approximations...
science in 1983. Her students there included Danish computer scientist CarstenLund, jointly advised with Lance Fortnow and László Babai. From 1989 to 1992...
Carsten Peterson, born in 1945 and married to journalist Lotten Peterson, is a Swedish theoretical physicist and professor at Lund University. His current...
Copenhagen, Denmark. Entitled Melissa, the album was produced by Henrik Lund and released on October 30, 1983 through Roadrunner Records. The character...
in Germany. Armin Linke, Italian artist Bronisław Linke, Polish painter Carsten Linke, German football player Ed Linke, American baseball player Erika...
Carsten Mogensen (born 24 July 1983) is a former badminton player from Denmark. He was the gold medalist at the 2015 European Games, two time European...
Playware site Chile - the brand "playware" is also copyrighted by Playware E.I.R.L. in Chile Homepage of Carsten Jessen Homepage of Henrik Hautop Lund...
silver medal at the 2006 European Championships in men's doubles with Carsten Mogensen. In 2010, Mogensen and Boe won the titles at the Denmark and French...
The Lund University Cardiopulmonary Assist System (LUCAS) device provides mechanical chest compressions to patients in cardiac arrest. It is mostly used...
Thomas Haubro Lund (born 2 August 1968) is a retired badminton player from Denmark who affiliate with Kastrup Magleby club. Lund was one of the world's...
ics.uci.edu. Retrieved 2024-02-23. Condon, Anne; Feigenbaum, Joan; Lund, Carsten; Shor, Peter (1997). "Random debaters and the hardness of approximating...
Mauritz Stiller. Nils Ahrén as Charles von Barton Ivar Kåge as Carsten Berner Richard Lund as Berchtold Greta Pfeil as Lila Victor Sjöström as Otto Berner...
Global Information