BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Connecting Computational Models Through Combinatorial Structure [L
 ecture]
DTSTART:20261103T083000Z
DTEND:20261103T091500Z
DTSTAMP:20261031T102500Z
UID:indico-event-1706@math-events.uni-bonn.de
DESCRIPTION:Speakers: Peter Kiss\n\nTechniques developed for one computati
 onal model can reveal new ways to approach a problem in another. The talk 
 will explore this interplay through dynamic graph matching and its connect
 ions to sublinear algorithms\, streaming computation\, and extremal combin
 atorics.\nThe main focus will be recent frameworks for dynamic matching\, 
 whose update times are governed by the density of Ruzsa–Szemerédi graph
 s. The talk explores how these frameworks combine sublinear algorithmic te
 chniques with combinatorial structure to obtain improved dynamic algorithm
 s. These connections suggest a broader research direction: identifying the
  structures that govern algorithmic complexity and using them to transfer 
 insights between computational models. \n\nhttps://math-events.uni-bonn.d
 e/event/1706/
LOCATION:Endenicher Allee 60/1-016 - Lipschitzsaal (Mathezentrum)
URL:https://math-events.uni-bonn.de/event/1706/
END:VEVENT
END:VCALENDAR