Campus Event Calendar
Event Entry
What and Who
Pointer Jumping Requires Concurrent Read
Venkatesh Srinivasan
Max-Planck-Institut für Informatik - AG 1
AG1 Mittagsseminar (others' work)
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 15 January 2003
13:30
45 Minutes
46.1 - MPII
024
Saarbrücken
Abstract
We present the lower bound of Noam Nisan and Ziv Bar-Yossef that
shows that there is a Boolean function on n variables that can
be computed in O(log log n) time in CREW PRAM but needs
$\sqrt(log n)$ time in the EREW PRAM. This result appeared
in STOC 1997.
Contact
Venkatesh Srinivasan
--email hidden
passcode not visible
logged in users only