BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.adass.org//adass2026//talk//33MGVM
BEGIN:VTIMEZONE
TZID:AWST
BEGIN:STANDARD
DTSTART:20000101T000000
RRULE:FREQ=YEARLY;BYMONTH=1;UNTIL=20051231T160000Z
TZNAME:AWST
TZOFFSETFROM:+0800
TZOFFSETTO:+0800
END:STANDARD
BEGIN:STANDARD
DTSTART:20070325T040000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:AWST
TZOFFSETFROM:+0900
TZOFFSETTO:+0800
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20071028T030000
RRULE:FREQ=YEARLY;BYDAY=4SU;BYMONTH=10;UNTIL=20081025T190000Z
TZNAME:AWDT
TZOFFSETFROM:+0800
TZOFFSETTO:+0900
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-adass2026-33MGVM@pretalx.adass.org
DTSTART;TZID=AWST:20261105T094500
DTEND;TZID=AWST:20261105T100000
DESCRIPTION:The friends-of-friends (FoF) algorithm has been used for over 4
 0 years in extragalactic astronomy to identify galaxy-groups in redshift s
 urveys. Whilst this simple percolation algorithm was sufficient in the era
  of 100s of thousands of galaxies\, the next generation of redshift survey
 s (DESI\, WAVES\, 4HS) promise to take us well into the 10s of millions. A
 nd\, since FoF scales quadratically\, we have reached a point where the cl
 assic implementation is entirely impractical.\n\n**Nessie** is a group fin
 der with the explicit goal of modernizing the FoF algorithm for this next 
 generation of redshift surveys. In this talk I will explain how Nessie imp
 lements tree data structures to reduce the complexity of the FoF algorithm
 \; why this is different to other group finders and other FoF implementati
 ons\; and finally\, talk about how the rust ecosystem made Nessie possible
 \, and attempt to convince other astronomers to adopt it for their next pr
 oject.
DTSTAMP:20261001T111332Z
LOCATION:Banquet Hall
SUMMARY:Nessie: The fastest group-finder in the world\; or why rust is the 
 best *high-level* language - Trystan Lambert
URL:https://pretalx.adass.org/adass2026/talk/33MGVM/
END:VEVENT
END:VCALENDAR