BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260522T150127Z
LOCATION:C140/142
DTSTART;TZID=America/Chicago:20181115T103000
DTEND;TZID=America/Chicago:20181115T120000
UID:submissions.supercomputing.org_SC18_sess208@linklings.com
SUMMARY:Graph Algorithms and Systems
DESCRIPTION:faimGraph: High Performance Management of Fully-Dynamic Graphs
  Under Tight Memory Constraints on the GPU\n\nIn this paper, we present a 
 fully-dynamic graph data structure for the Graphics Processing Unit (GPU).
  It delivers high update rates while keeping a low memory footprint using 
 autonomous memory management directly on the GPU. The data structure is fu
 lly-dynamic, allowing not only for edge but also v...\n\n\nMartin Winter a
 nd Daniel Mlakar (Graz University of Technology); Rhaleb Zayer and Hans-Pe
 ter Seidel (Max Planck Institute for Informatics); and Markus Steinberger 
 (Graz University of Technology, Max Planck Institute for Informatics)\n---
 ------------------\nAdaptive Anonymization of Data with b-Edge Covers\n\nW
 e explore the problem of sharing data that pertains to individuals with an
 onymity guarantees, where each user requires a desired level of privacy.  
 We propose the first shared-memory as well as distributed memory parallel 
 algorithms for the adaptive anonymity problem that achieves this goal, and
  pr...\n\n\nArif Khan (Pacific Northwest National Laboratory), Krzysztof C
 horomanski (Google LLC), Alex Pothen and S M Ferdous (Purdue University), 
 and Mahantesh Halappanavar and Antonino Tumeo (Pacific Northwest National 
 Laboratory)\n---------------------\niSpan: Parallel Identification of Stro
 ngly Connected Components with Spanning Trees\n\nDetecting strongly connec
 ted components (SCCs) in a directed graph is crucial for understanding the
  structure of graphs. Most real-world graphs have one large SCC that conta
 ins the majority of the vertices, and many small SCCs whose sizes are reve
 rsely proportional to the frequency of their occurren...\n\n\nYuede Ji (Ge
 orge Washington University); Hang Liu (University of Massachusetts, Lowell
 ); and H. Howie Huang (George Washington University)\n\nTag: Applications,
  Graph Algorithms, Security\n\nRegistration Category: Tech Program Reg Pas
 s\n\nSession Chair: Mostofa Patwary (NVIDIA Corporation)
END:VEVENT
END:VCALENDAR