The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
Accurate estimation of the tick length of a synchronous program is essential for efficient and predictable implementations that are devoid of timing faults. The techniques to dete...
Partha S. Roop, Sidharta Andalam, Reinhard von Han...
As multithreaded server applications and runtime systems prevail, garbage collection is becoming an essential feature to support high performance systems. The fundamental issue of...
Discovering and unlocking the full potential of complex pervasive environments is still approached in application-centric ways. A set of statically deployed applications often deï...
Geert Vanderhulst, Daniel Schreiber, Kris Luyten, ...
This paper proposes a dynamic trust establishment protocol that enables the nodes of an ad hoc network to establish security associations among each other in a distributed and pee...
Christos A. Papageorgiou, Konstantinos Birkos, Tas...