We consider the possibility of basing one-way functions on NP-Hardness; that is, we study possible reductions from a worst-case decision problem to the task of average-case invert...
Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana...
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
Many modern massively distributed systems deploy thousands of nodes to cooperate on a computation task. Network congestions occur in these systems. Most applications rely on conge...
—Joint synchronization and localization using time of arrival (TOA) measurements is a very important research topic for many wireless ad hoc sensor network applications. For such...