Carsten Lund

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Carsten Lund
Born (1963-07-01) July 1, 1963 (age 51)
Aarhus, Denmark
Residence New Jersey, USA
Nationality Danish
Fields Theoretical computer science
Institutions AT&T Laboratories
Alma mater Aarhus University
University of Chicago
Doctoral advisor Lance Fortnow
László Babai
Notable awards Gödel Prize (2001)

Carsten Lund (born July 1, 1963) is a Danish-born theoretical computer scientist, currently working at AT&T Labs in Florham Park, 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]

References[edit]

  1. ^ Lund's home page at AT&T.
  2. ^ Kolata, Gina (June 26, 1990), "In a Frenzy, Math Enters Age of Electronic Mail", New York Times .
  3. ^ 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 . Later published in JACM, 1991, doi:10.1145/146585.146605.
  4. ^ 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, doi:10.1109/FSCS.1990.89520 . Later published in Computational Complexity, 1991, doi:10.1007/BF01200056.
  5. ^ Cartsten Lund at the Mathematics Genealogy Project.
  6. ^ Koppes, Steve (May 11, 2000), "Ph.D. recipient receives top award in the field of computer science", University of Chicago Chronicle 19 (16) .
  7. ^ Kolata, Gina (April 7, 1992), "New Short Cut Found For Long Math Proofs", New York Times .
  8. ^ 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 . Originally presented at the 1992 Symposium on Foundations of Computer Science, doi:10.1109/SFCS.1992.267823.
  9. ^ Parberry, Ian (2001), 2001 Gödel Prize, ACM SIGACT .
  10. ^ Feldmann, A.; Greenberg, A.; Lund, C.; Reingold, N.; Rexford, J. (2000), "NetScope: traffic engineering for IP networks", IEEE Network 14 (2): 11–19, doi:10.1109/65.826367 .
  11. ^ 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, doi:10.1109/90.929850 .
  12. ^ http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.50.6215&rep=rep1&type=pdf IEEE Journal on Selected Areas in Communications, Vol. 13, No. 8, October 1995

External links[edit]