In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
This paper deals with various kinds of mental representations available for linguistic instruction in spatial humanrobot interaction. After a survey of the literature on spatial r...
This paper addresses the following question: Is it possible to migrate TCP/IP flows between different networks on modern mobile devices, without infrastructure support or protocol...
Ahmad Rahmati, Clayton Shepard, Chad Tossell, Ange...