ARC-ACO Lecture Series: featuring Robert E. Tarjan (Princeton)

*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************

Event Details
  • Dates/Times:
    • Thursday November 10, 2022
      11:00 am
    • Friday November 11, 2022
      11:00 am
  • Location: Pettit Microelectronics Building 102 A&B
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
No contact information submitted.
Summaries

Summary Sentence: Finding Connected Components in Massive Graphs

Full Summary: No summary paragraph submitted.

ARC - ACO Lecture Series

featuring Robert E. Tarjan (Princeton)

November 10 - Pettit Microelectronics Building 102 A&B - 11:00AM

November 11 - Skiles 005 - 1:00PM

 

Title:  Finding Connected Components in Massive Graphs

Abstract: Finding connected components is a fundamental problem in algorithmic graph theory.  Analysis of big data sets requires solving this problem on massive graphs.  On such graphs, sequential algorithms are much too slow.  We describe two classes of fast algorithms that rely on massive concurrency.  Though simple, verifying that these algorithms are both correct and efficient requires careful and subtle analysis.

Bio:  Robert Tarjan is the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University.  He has held academic positions at Cornell, Berkeley, Stanford, and NYU, and industrial research positions at Bell Labs, NEC, HP, Microsoft, and Intertrust Technologies.  He has invented or co-invented many of the most efficient known data structures and graph algorithms.  He was awarded the first Nevanlinna Prize from the International Mathematical Union in 1982 for “for outstanding contributions to mathematical aspects of information science,” the Turing Award in 1986 with John Hopcroft for “fundamental achievements in the design and analysis of algorithms and data structures,” and the Paris Kanellakis Award in Theory and Practice in 1999 with Daniel Sleator for the invention of splay trees.  He is a member of the U.S. National Academy of Sciences, the U. S. National Academy of Engineering, the American Academy of Arts and Sciences, and the American Philosophical Society. 

Robert E. Tarjan's Webpage

----------------------------------

Videos of recent talks are available at: https://smartech.gatech.edu/handle/1853/46836

Click here to subscribe to the seminar email list: arc-colloq@Klauscc.gatech.edu

Additional Information

In Campus Calendar
No
Groups

ARC

Invited Audience
Faculty/Staff, Postdoc, Graduate students, Undergraduate students
Categories
Seminar/Lecture/Colloquium
Keywords
No keywords were submitted.
Status
  • Created By: mb121
  • Workflow Status: Published
  • Created On: Sep 1, 2022 - 11:55am
  • Last Updated: Nov 3, 2022 - 8:15am