BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Sydney Mathematical Research Institute - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://mathematical-research-institute.sydney.edu.au
X-WR-CALDESC:Events for Sydney Mathematical Research Institute
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Australia/Sydney
BEGIN:STANDARD
TZOFFSETFROM:+1100
TZOFFSETTO:+1000
TZNAME:AEST
DTSTART:20240406T160000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+1000
TZOFFSETTO:+1100
TZNAME:AEDT
DTSTART:20241005T160000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+1100
TZOFFSETTO:+1000
TZNAME:AEST
DTSTART:20250405T160000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+1000
TZOFFSETTO:+1100
TZNAME:AEDT
DTSTART:20251004T160000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+1100
TZOFFSETTO:+1000
TZNAME:AEST
DTSTART:20260404T160000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+1000
TZOFFSETTO:+1100
TZNAME:AEDT
DTSTART:20261003T160000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20251201T140000
DTEND;TZID=Australia/Sydney:20251201T160000
DTSTAMP:20260414T103245
CREATED:20251117T005730Z
LAST-MODIFIED:20251118T001803Z
UID:8271-1764597600-1764604800@mathematical-research-institute.sydney.edu.au
SUMMARY:'Is Dijkstra's Algorithm Optimal?' - A Basser-SMRI Joint Seminar by Robert Tarjan
DESCRIPTION:Dijkstra’s algorithm is a classic algorithm for doing route planning. Given a starting location it finds shortest paths from to all other reachable locations using the greedy method. Not only does it find shortest paths\, it finds these in increasing order by length. A natural question is whether this algorithm is best possible. The answer depends on exactly how one poses the question. The talk will cover recent work by the speaker and his colleagues that gives the answer “yes” and briefly examine work by others that gives the answer “no.” \n\n\n\nJoin us for the first Basser-SMRI Joint Seminar\, to be given by Robert Tarjan (Princeton). Basser Seminars highlight the best of computer science research. Feel free to distribute to others that may be interested. After the seminar\, please join us for a special afternoon tea\, held at 3 pm. \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nRobert Tarjan\, Princeton University\n\n\n\n\n\nRobert 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. \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nKey event details\n\n\n\n\n\nDate & time:  \n\n\n\nMonday 1 December 2025 \n\n\n\nSeminar: 2 — 3 pm \n\n\n\nAfternoon tea 3 pm — 4 pm \n\n\n\n\n\n\n\nCost:  \n\n\n\nThis is a free event \n\n\n\n\n\nLocation: \n\n\n\nThe Quad General Lecture Theatre K2.05 \n\n\n\nUniversity of Sydney\, Camperdown Campus
URL:https://mathematical-research-institute.sydney.edu.au/event/is-dijkstras-algorithm-optimal-a-basser-smri-joint-seminar-by-robert-tarjan/
ATTACH;FMTTYPE=image/jpeg:https://mathematical-research-institute.sydney.edu.au/wp-content/uploads/2025/11/Bob-photo-2-scaled.jpg
END:VEVENT
END:VCALENDAR