With the widespread adoption of multicore architectures, multiprocessors are now a
standard deployment platform for (soft) real-time applications. This dissertation addresses …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

The celebrated Lenstra-Lenstra-Lovász lattice basis reduction algorithm (LLL) can naturally
be viewed as an algorithmic version of Hermite's inequality on Hermite's constant. We …

Motivated by the widespread use of spin locks in embedded multiprocessor real-time
systems, the worst-case blocking in spin locks is analyzed using mixed-integer linear …

We use techniques from sample-complexity in machine learning to reduce problems of
incentive-compatible mechanism design to standard algorithmic questions, for a wide variety …

The proliferation of commercial shared-memory multiprocessor machines has brought about
significant changes in the art of concurrent programming. Given current trends towards low …

Mutex locks have traditionally been the most common mechanism for protecting shared data
structures in parallel programs. However, the robustness of such locks against process …

We systematically survey the literature on analytically sound multiprocessor real-time
locking protocols from 1988 until the end of 2017, covering the following topics: Progress …

We give an algorithm for ℓ 2/ℓ 2 sparse recovery from Fourier measurements using O (k log
N) samples, matching the lower bound of Do Ba-Indyk-Price-Woodruff'10 for non-adaptive …

Recoverable mutual exclusion (RME) is a variation on the classic mutual exclusion (ME)
problem that allows processes to crash and recover. The time complexity of RME algorithms …