BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20250626T233629Z
LOCATION:B302-B305
DTSTART;TZID=America/New_York:20241119T120000
DTEND;TZID=America/New_York:20241119T170000
UID:submissions.supercomputing.org_SC24_sess487_post138@linklings.com
SUMMARY:On the Accuracy and Efficiency of Approximate Triangle Counting vi
 a Randomized Numerical Linear Algebra
DESCRIPTION:Irene Simó Muñoz, Koby Hayashi, and Richard Vuduc (Georgia Ins
 titute of Technology)\n\nWe study two algorithmic approaches to approximat
 e triangle counting and compare their accuracy and efficiency. The first o
 ne is based on randomized matrix-matrix multiplication, which can be faste
 r, simpler, and more parallelizable on modern processors. The second is ba
 sed on trace estimation, which produces estimates with lower variance and 
 greater accuracy.\n\nRegistration Category: Tech Program Reg Pass, Exhibit
 s Reg Pass\n\nSession Chairs: Ayesha Afzal (Friedrich-Alexander University
 , Erlangen-Nuremberg; Erlangen National High Performance Computing Center)
 ; Sally Ellingson (University of Kentucky); and Alan Sussman (University o
 f Maryland)\n\n
END:VEVENT
END:VCALENDAR