Carsten Lund (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Carsten Lund" in English language version.

refsWebsite

Global rank English rank

6doi.org

2^nd place

4semanticscholar.org

11^th place

8^th place

3psu.edu

207^th place

136^th place

2nytimes.com

7^th place

1att.com

6,123^rd place

4,716^th place

1mathgenealogy.org

4,501^st place

3,002^nd place

1uchicago.edu

230^th place

214^th place

1acm.org

1,185^th place

840^th place

acm.org

sigact.acm.org

Parberry, Ian (2001), 2001 Gödel Prize, ACM SIGACT.

att.com

research.att.com

Lund's home page at AT&T.

doi.org

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.
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.
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.

mathgenealogy.org

Cartsten Lund at the Mathematics Genealogy Project.

nytimes.com

Kolata, Gina (June 26, 1990), "In a Frenzy, Math Enters Age of Electronic Mail", The New York Times.
Kolata, Gina (April 7, 1992), "New Short Cut Found For Long Math Proofs", The New York Times.

psu.edu

citeseerx.ist.psu.edu

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.
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.

semanticscholar.org

api.semanticscholar.org

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.
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.
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.

uchicago.edu

chronicle.uchicago.edu

Koppes, Steve (May 11, 2000), "Ph.D. recipient receives top award in the field of computer science", University of Chicago Chronicle, 19 (16).