BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Denver
X-LIC-LOCATION:America/Denver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0700
TZOFFSETTO:-0600
TZNAME:MDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0600
TZOFFSETTO:-0700
TZNAME:MST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260422T000711Z
LOCATION:401-402
DTSTART;TZID=America/Denver:20231117T093000
DTEND;TZID=America/Denver:20231117T100000
UID:submissions.supercomputing.org_SC23_sess460_misc342@linklings.com
SUMMARY:Consider Studying All-Pairs Shortest Paths
DESCRIPTION:Richard Vuduc (Georgia Institute of Technology)\n\nThere is a 
 well-known connection between the all-pairs shortest paths (APSP) problem 
 and Gaussian elimination. In the context of this workshop, that makes APSP
  a good candidate to study because, for an input graph that is sparse but 
 fully connected, the computation lies at the boundary between "sparse" and
  "dense" and between "regular" and "irregular" parallelism. It may, theref
 ore, be an illuminating prototype or analogue for trends we might foresee 
 in algorithms, programming, and system design as "dense" problems like dee
 p learning become "sparse."\n\nTag: Graph Algorithms and Frameworks, Linea
 r Algebra, Programming Frameworks and System Software, State of the Practi
 ce\n\nRegistration Category: Workshop Reg Pass\n\nSession Chairs: Xing Cai
  (University of Oslo, Norway; Simula Research Laboratory/University of Osl
 o); Aleksandar Ilic (INESC-ID, IST, University of Lisbon; University of Li
 sbon, Portugal); Kamer Kaya (Sabancı University, Turkey); and Didem Unat (
 Koç University, Turkey)\n\n
END:VEVENT
END:VCALENDAR