Knowledge

Carsten Lund

Source đź“ť

719: 663:
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".
528: 196: 502:
Arora, Sanjeev; Lund, Carsten; Motwani, Rajeev; Sudan, Madhu; Szegedy, Mario (1998), "Proof verification and the hardness of approximation problems",
1146: 712: 409: 350: 1171: 556: 228: 189: 1156: 1110: 251: 1166: 705: 1151: 309: 382:
Babai, László; Fortnow, Lance; Lund, Carsten (1990), "Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols",
1161: 1062: 200: 482: 1034: 444: 878: 274: 158: 100: 259: 772: 212: 858: 1141: 974: 627: 586: 387: 166: 836: 958: 216: 185: 72: 1084: 618:; True, F. (2001), "Deriving traffic demands for operational IP networks: methodology and experience", 1136: 1114: 181: 110: 1100: 392: 1000: 632: 591: 263: 1074: 1014: 920: 645: 519: 487: 415: 356: 314: 740: 224: 130: 970: 886: 782: 405: 346: 68: 692: 295: 1038: 906: 828: 744: 672: 637: 615: 596: 574: 532: 511: 424: 397: 365: 338: 117: 1106: 1024: 978: 934: 874: 868: 756: 1078: 964: 762: 1048: 1028: 930: 840: 810: 798: 788: 728: 458: 267: 243: 82: 1130: 1056: 1044: 982: 954: 948: 940: 924: 900: 852: 820: 814: 768: 748: 247: 235: 220: 188:
in computer science. His thesis, entitled The Power of Interaction, was chosen as an
125: 649: 419: 360: 1052: 1010: 1004: 944: 914: 910: 896: 844: 752: 523: 162: 1096: 864: 848: 824: 792: 778: 239: 550: 1088: 1068: 990: 986: 882: 804: 330: 135: 536: 1018: 996: 892: 440: 401: 342: 515: 369: 208: 697: 1092: 428: 255: 177: 154: 49: 676: 641: 600: 559: 459:"Ph.D. recipient receives top award in the field of computer science" 204: 173: 45: 280:
He has been working for AT&T Laboratories since August 1991.
195:
Lund was a co-author on two of five competing papers at the 1990
701: 384:
Proc. 31st Annual Symposium on Foundations of Computer Science
335:
Proc. 31st Annual Symposium on Foundations of Computer Science
333:(1990), "Algebraic Methods for Interactive Proof Systems", 215:; this work became part of his 1991 Ph.D. thesis from the 577:(2000), "NetScope: traffic engineering for IP networks", 180:, and received the "kandidat" degree in 1988 from the 614:
Feldmann, A.; Greenberg, A.; Lund, C.; Reingold, N.;
573:
Feldmann, A.; Greenberg, A.; Lund, C.; Reingold, N.;
423:. Later published in Computational Complexity, 1991, 273:
More recently he has published highly cited work on
329:Lund, Carsten; Fortnow, Lance; Karloff, Howard J.; 116: 106: 96: 78: 64: 56: 28: 21: 310:"In a Frenzy, Math Enters Age of Electronic Mail" 665:IEEE Journal on Selected Areas in Communications 713: 266:; in 2001 he and his co-authors received the 8: 529:Symposium on Foundations of Computer Science 227:, for which he was a runner-up for the 1991 197:Symposium on Foundations of Computer Science 720: 706: 698: 483:"New Short Cut Found For Long Math Proofs" 18: 631: 590: 391: 234:He is also known for his joint work with 288: 270:for their share in these discoveries. 7: 620:IEEE/ACM Transactions on Networking 527:. Originally presented at the 1992 252:probabilistically checkable proofs 14: 364:. Later published in JACM, 1991, 250:that discovered the existence of 258:problems and used them to prove 1147:Theoretical computer scientists 463:University of Chicago Chronicle 481:Kolata, Gina (April 7, 1992), 457:Koppes, Steve (May 11, 2000), 308:Kolata, Gina (June 26, 1990), 192:'Distinguished Dissertation'. 159:theoretical computer scientist 1: 445:Mathematics Genealogy Project 231:Doctoral Dissertation Award. 296:Lund's home page at AT&T 275:internet traffic engineering 101:Theoretical computer science 1188: 1172:Danish computer scientists 736: 219:under the supervision of 213:interactive proof systems 153:(born July 1, 1963) is a 144: 89: 16:Danish computer scientist 1157:Aarhus University alumni 537:10.1109/SFCS.1992.267823 1152:Scientists at Bell Labs 402:10.1109/FSCS.1990.89520 343:10.1109/FSCS.1990.89518 184:and his Ph.D. from the 161:, currently working at 1162:People from New Jersey 693:AT&T Labs Homepage 549:Parberry, Ian (2001), 264:approximation problems 167:Bedminster, New Jersey 1167:Gödel Prize laureates 516:10.1145/278298.278306 370:10.1145/146585.146605 217:University of Chicago 186:University of Chicago 111:AT&T Laboratories 73:University of Chicago 182:University of Aarhus 504:Journal of the ACM 488:The New York Times 429:10.1007/BF01200056 386:, pp. 16–25, 315:The New York Times 201:complexity classes 1124: 1123: 677:10.1109/49.464709 642:10.1109/90.929850 601:10.1109/65.826367 411:978-0-8186-2082-9 352:978-0-8186-2082-9 337:, pp. 2–10, 172:Lund was born in 169:, United States. 148: 147: 91:Scientific career 69:Aarhus University 1179: 722: 715: 708: 699: 681: 680: 671:(8): 1371–1382. 660: 654: 652: 635: 611: 605: 603: 594: 570: 564: 562: 552:2001 Gödel Prize 546: 540: 526: 499: 493: 491: 478: 472: 470: 454: 448: 438: 432: 422: 395: 379: 373: 363: 326: 320: 318: 305: 299: 293: 260:hardness results 118:Doctoral advisor 42: 38: 36: 19: 1187: 1186: 1182: 1181: 1180: 1178: 1177: 1176: 1127: 1126: 1125: 1120: 732: 726: 689: 684: 662: 661: 657: 613: 612: 608: 572: 571: 567: 548: 547: 543: 501: 500: 496: 480: 479: 475: 456: 455: 451: 439: 435: 412: 393:10.1.1.130.9311 381: 380: 376: 353: 328: 327: 323: 307: 306: 302: 294: 290: 286: 199:characterizing 140: 71: 65:Alma mater 52: 43: 40: 34: 32: 24: 17: 12: 11: 5: 1185: 1183: 1175: 1174: 1169: 1164: 1159: 1154: 1149: 1144: 1139: 1129: 1128: 1122: 1121: 1119: 1118: 1115:Vaikuntanathan 1104: 1082: 1072: 1066: 1060: 1042: 1032: 1022: 1008: 994: 968: 962: 952: 938: 928: 918: 904: 890: 872: 862: 856: 818: 808: 802: 796: 786: 776: 766: 760: 737: 734: 733: 727: 725: 724: 717: 710: 702: 696: 695: 688: 687:External links 685: 683: 682: 655: 633:10.1.1.43.3549 626:(3): 265–279, 606: 592:10.1.1.42.2801 565: 541: 510:(3): 501–555, 494: 473: 449: 433: 410: 374: 351: 321: 300: 287: 285: 282: 244:Rajeev Motwani 146: 145: 142: 141: 139: 138: 133: 128: 122: 120: 114: 113: 108: 104: 103: 98: 94: 93: 87: 86: 80: 76: 75: 66: 62: 61: 58: 54: 53: 44: 30: 26: 25: 22: 15: 13: 10: 9: 6: 4: 3: 2: 1184: 1173: 1170: 1168: 1165: 1163: 1160: 1158: 1155: 1153: 1150: 1148: 1145: 1143: 1142:Living people 1140: 1138: 1135: 1134: 1132: 1116: 1112: 1108: 1105: 1102: 1098: 1094: 1090: 1086: 1083: 1080: 1076: 1073: 1070: 1067: 1064: 1061: 1058: 1054: 1050: 1046: 1043: 1040: 1036: 1033: 1030: 1026: 1023: 1020: 1016: 1012: 1009: 1006: 1002: 998: 995: 992: 988: 984: 980: 976: 975:Papadimitriou 972: 969: 966: 963: 960: 956: 953: 950: 946: 942: 939: 936: 932: 929: 926: 922: 919: 916: 912: 908: 905: 902: 898: 894: 891: 888: 884: 880: 876: 873: 870: 866: 863: 860: 857: 854: 850: 846: 842: 838: 834: 830: 826: 822: 819: 816: 812: 809: 806: 803: 800: 797: 794: 790: 787: 784: 780: 777: 774: 770: 767: 764: 761: 758: 754: 750: 746: 742: 739: 738: 735: 730: 723: 718: 716: 711: 709: 704: 703: 700: 694: 691: 690: 686: 678: 674: 670: 666: 659: 656: 651: 647: 643: 639: 634: 629: 625: 621: 617: 610: 607: 602: 598: 593: 588: 584: 580: 576: 569: 566: 561: 558: 554: 553: 545: 542: 538: 534: 530: 525: 521: 517: 513: 509: 505: 498: 495: 490: 489: 484: 477: 474: 468: 464: 460: 453: 450: 446: 442: 441:Cartsten Lund 437: 434: 430: 426: 421: 417: 413: 407: 403: 399: 394: 389: 385: 378: 375: 371: 367: 362: 358: 354: 348: 344: 340: 336: 332: 325: 322: 317: 316: 311: 304: 301: 297: 292: 289: 283: 281: 278: 276: 271: 269: 265: 261: 257: 253: 249: 248:Mario Szegedy 245: 241: 237: 236:Sanjeev Arora 232: 230: 226: 222: 221:Lance Fortnow 218: 214: 210: 206: 202: 198: 193: 191: 187: 183: 179: 175: 170: 168: 164: 163:AT&T Labs 160: 156: 152: 143: 137: 134: 132: 129: 127: 126:Lance Fortnow 124: 123: 121: 119: 115: 112: 109: 105: 102: 99: 95: 92: 88: 84: 81: 77: 74: 70: 67: 63: 59: 55: 51: 47: 41:(age 61) 31: 27: 20: 832: 773:SzelepcsĂ©nyi 668: 664: 658: 623: 619: 609: 585:(2): 11–19, 582: 579:IEEE Network 578: 568: 551: 544: 507: 503: 497: 486: 476: 466: 462: 452: 436: 383: 377: 334: 324: 313: 303: 291: 279: 272: 233: 225:LászlĂł Babai 211:in terms of 194: 171: 151:Carsten Lund 150: 149: 131:LászlĂł Babai 107:Institutions 90: 39:July 1, 1963 23:Carsten Lund 1137:1963 births 979:Roughgarden 971:Koutsoupias 859:SĂ©nizergues 729:Gödel Prize 616:Rexford, J. 575:Rexford, J. 331:Nisan, Noam 268:Gödel Prize 240:Madhu Sudan 83:Gödel Prize 57:Nationality 1131:Categories 887:Zaharoglou 829:Goldwasser 745:Goldwasser 284:References 136:Joan Boyar 35:1963-07-01 1107:Brakerski 1079:G. Tardos 983:É. Tardos 949:Wigderson 731:laureates 628:CiteSeerX 587:CiteSeerX 388:CiteSeerX 1101:Richerby 1049:McSherry 1025:Spielman 1001:Franklin 959:Mitchell 941:Reingold 935:Spielman 921:Razborov 869:Schapire 783:Sinclair 769:Immerman 650:32689094 420:38429596 361:32614901 209:NEXPTIME 203:such as 1085:Bulatov 1039:O'Hearn 1035:Brookes 907:Agrawal 901:Szegedy 875:Herlihy 853:Szegedy 841:Motwani 789:Halpern 757:Rackoff 524:8561542 443:at the 256:NP-hard 178:Denmark 50:Denmark 1117:(2022) 1111:Gentry 1103:(2021) 1081:(2020) 1071:(2019) 1065:(2018) 1059:(2017) 1053:Nissim 1041:(2016) 1031:(2015) 1021:(2014) 1007:(2013) 993:(2012) 967:(2011) 965:HĂĄstad 961:(2010) 951:(2009) 945:Vadhan 937:(2008) 927:(2007) 925:Rudich 917:(2006) 915:Saxena 903:(2005) 897:Matias 889:(2004) 883:Shavit 871:(2003) 865:Freund 861:(2002) 855:(2001) 837:Lovász 817:(2000) 815:Wolper 807:(1999) 801:(1998) 795:(1997) 785:(1996) 779:Jerrum 775:(1995) 765:(1994) 763:HĂĄstad 759:(1993) 749:Micali 648:  630:  589:  560:SIGACT 522:  418:  408:  390:  359:  349:  246:, and 205:PSPACE 174:Aarhus 157:-born 155:Danish 97:Fields 85:(2001) 79:Awards 60:Danish 46:Aarhus 1075:Moser 1069:Dinur 1063:Regev 1057:Smith 1045:Dwork 1015:Lotem 1011:Fagin 997:Boneh 991:Ronen 987:Nisan 955:Arora 911:Kayal 849:Sudan 845:Safra 825:Feige 821:Arora 811:Vardi 793:Moses 753:Moran 741:Babai 646:S2CID 520:S2CID 416:S2CID 357:S2CID 1097:Dyer 1093:Chen 1029:Teng 1019:Naor 1005:Joux 931:Teng 893:Alon 879:Saks 833:Lund 805:Shor 799:Toda 469:(16) 406:ISBN 347:ISBN 262:for 254:for 223:and 207:and 29:Born 1089:Cai 673:doi 638:doi 597:doi 557:ACM 533:doi 512:doi 425:doi 398:doi 366:doi 339:doi 229:ACM 190:ACM 165:in 1133:: 1113:/ 1109:/ 1099:/ 1095:/ 1091:/ 1087:/ 1077:/ 1055:/ 1051:/ 1047:/ 1037:/ 1027:/ 1017:/ 1013:/ 1003:/ 999:/ 989:/ 985:/ 981:/ 977:/ 973:/ 957:/ 947:/ 943:/ 933:/ 923:/ 913:/ 909:/ 899:/ 895:/ 885:/ 881:/ 877:/ 867:/ 851:/ 847:/ 843:/ 839:/ 835:/ 831:/ 827:/ 823:/ 813:/ 791:/ 781:/ 771:/ 755:/ 751:/ 747:/ 743:/ 669:13 667:. 644:, 636:, 622:, 595:, 583:14 581:, 555:, 531:, 518:, 508:45 506:, 485:, 467:19 465:, 461:, 414:, 404:, 396:, 355:, 345:, 312:, 277:. 242:, 238:, 176:, 48:, 37:) 721:e 714:t 707:v 679:. 675:: 653:. 640:: 624:9 604:. 599:: 563:. 539:. 535:: 514:: 492:. 471:. 447:. 431:. 427:: 400:: 372:. 368:: 341:: 319:. 298:. 33:(

Index

Aarhus
Denmark
Aarhus University
University of Chicago
Gödel Prize
Theoretical computer science
AT&T Laboratories
Doctoral advisor
Lance Fortnow
László Babai
Joan Boyar
Danish
theoretical computer scientist
AT&T Labs
Bedminster, New Jersey
Aarhus
Denmark
University of Aarhus
University of Chicago
ACM
Symposium on Foundations of Computer Science
complexity classes
PSPACE
NEXPTIME
interactive proof systems
University of Chicago
Lance Fortnow
László Babai
ACM
Sanjeev Arora

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑