BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.com//juliacon-2025//speaker//MLZY9D
BEGIN:VTIMEZONE
TZID:EST
BEGIN:STANDARD
DTSTART:20001029T030000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10;UNTIL=20061029T070000Z
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
END:STANDARD
BEGIN:STANDARD
DTSTART:20071104T030000
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20000402T030000
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=4;UNTIL=20060402T080000Z
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20070311T030000
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-juliacon-2025-WMZ3FC@pretalx.com
DTSTART;TZID=EST:20250724T133000
DTEND;TZID=EST:20250724T140000
DESCRIPTION:Julia's dynamism\, extensive specialization\, and metaprogrammi
 ng make it uniquely suited to express sparse and graph algorithms. In this
  talk\, we will cover a few graph algorithms implemented in Julia\, showca
 sing the suitability of Julia for graph algorithms. We will particularly f
 ocus on a fun dataset of the package dependency graph in the Julia ecosyst
 em. We will use graph algorithms implemented in Julia... to better underst
 and the Julia ecosystem.
DTSTAMP:20260305T201927Z
LOCATION:Lawrence Room 104 - Function Room
SUMMARY:The graph of Julia - Huda
URL:https://pretalx.com/juliacon-2025/talk/WMZ3FC/
END:VEVENT
END:VCALENDAR