Event Entry
What and Who
On the Hardness Hierarchy for the O(n√log n) Complexity in the Word RAM
Tomasz Kociumaka
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 5 June 2025
13:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
Based on the speaker's STOC'25 paper.
Contact
Nidhi Rathi
+49 681 9325 1134
--email hidden
Virtual Meeting Details
Zoom
649 2184 1396
passcode not visible
logged in users only
Nidhi Rathi, 05/19/2025 18:58
Nidhi Rathi, 05/19/2025 08:08 -- Created document.
Nidhi Rathi, 05/19/2025 08:08 -- Created document.