BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:FSPM2-Kolloquium- The cost of cyclic permutations
DTSTART:20250425T140000Z
DTEND:20250425T160000Z
DTSTAMP:20260520T191600Z
UID:indico-event-248@indico.physik.uni-bielefeld.de
DESCRIPTION:Speakers: Kai-Uwe Bux (Universität Bielefeld)\n\nlnplace rota
 tion of an array involves nothing but moving data around in computer memor
 y. As modern computer architectures involve several layers of caching\, it
  is a surprisingly non­trivial problem. We describe a competitively fast 
 algorithm (as indicated by measurements) and asymptotically count the numb
 er of data moves in the best\, warst\, and average case. lt turns out that
  this task is equivalent to determining the expected sum of remainders enc
 oun­tered in a run of the Euclidean algorithm\, which in turn can be esti
 mated using tools from analytic number theory. 1 shall motivate\, describ
 e and discuss this algorithm in detail an also compare it to several other
  reasonable choices. (Joint werk with Valentin Blomer) gez. G. Akemann\,
  E. Baake\, M. Wahl \n\nhttps://indico.physik.uni-bielefeld.de/event/248/
LOCATION:H 10 (UHG)
URL:https://indico.physik.uni-bielefeld.de/event/248/
END:VEVENT
END:VCALENDAR