BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.com//juliacon-2025//speaker//9NNRE7
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-S9HMM9@pretalx.com
DTSTART;TZID=EST:20250725T103000
DTEND;TZID=EST:20250725T110000
DESCRIPTION:When you write a float range like 0.1:0.2:0.7 it seems obvious 
 that you want the elements to be 1/10\, 3/10\, 5/10\, 7/10. But the floati
 ng-point numbers 0.1\, 0.2 and 0.7 are not exactly 1/10\, 2/10 and 7/10—
 they are approximations of the form m/2^p. Guessing what any given float r
 ange was intended to mean turns out to be shockingly hard. Julia currently
  uses a heuristic that mostly works but still has some rather unfortunate 
 failures. This talk explores how to solve this problem once and for all.
DTSTAMP:20260309T235346Z
LOCATION:Lawrence Room 104 - Function Room
SUMMARY:Why are float ranges so hard\, and can we do better? - Stefan Karpi
 nski
URL:https://pretalx.com/juliacon-2025/talk/S9HMM9/
END:VEVENT
BEGIN:VEVENT
UID:pretalx-juliacon-2025-ZNBEAN@pretalx.com
DTSTART;TZID=EST:20250725T140000
DTEND;TZID=EST:20250725T143000
DESCRIPTION:Each task in Julia has its own PRNG. When a task is forked it n
 eeds to seed the child task's RNG. This talk is about the evolution of how
  we've done this and the novel technique we now use that solves the annoya
 nces and bugs that plagued our previous approaches. We've generalized the 
 DotMix algorithm designed by Leiserson et al. for the Cilk parallel runtim
 e system\, simplifying and strengthening it while retaining provable colli
 sion resistance.
DTSTAMP:20260309T235346Z
LOCATION:Lawrence Room 120 - REPL Main Stage
SUMMARY:Fixing Julia's task-local RNG: a bother\, a bug\, a breakthrough - 
 Stefan Karpinski
URL:https://pretalx.com/juliacon-2025/talk/ZNBEAN/
END:VEVENT
BEGIN:VEVENT
UID:pretalx-juliacon-2025-Y7NPFM@pretalx.com
DTSTART;TZID=EST:20250725T150000
DTEND;TZID=EST:20250725T153000
DESCRIPTION:This talk introduces Julia’s new SAT-based version resolver\,
  which overcomes various issues with the old resolver while being faster\,
  more scalable\, more flexible\, and guaranteeing optimal solutions. Since
  it constructs a SAT instance encoding all dependencies and conflicts betw
 een versions\, it also provides a powerful tool for solving related resolu
 tion-like problems. We'll cover how this approach works and explore additi
 onal use cases beyond version resolution.
DTSTAMP:20260309T235346Z
LOCATION:Lawrence Room 120 - REPL Main Stage
SUMMARY:Pkg's new SAT-based version resolver - Stefan Karpinski
URL:https://pretalx.com/juliacon-2025/talk/Y7NPFM/
END:VEVENT
END:VCALENDAR