The Gödel Prize, jointly awarded by ACM SIGACT and the European Association for Theoretical Computer Science, celebrates outstanding research in theoretical computer science. Named after logician Kurt ...

Abstract: An algorithm with worst case time complexity O(log/sup 2/N) in two dimensions and O(m/sup 1/2/log N) in three dimensions with N input points and m as the number of tetrahedra in ...

The amortized time complexity of the proposed parallel scheduling algorithm, in terms of the time to compute a matching in a timeslot, is O(log N), where N is the switch size. As for the scalability ...