The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
We revisit the SL synchronous programming model introduced by Boussinot and De Simone (IEEE, Trans. on Soft. Eng., 1996). We discuss an alternative design of the model including t...
Ubiquitous computing, as a subfield of computer science, has traditionally been associated with a set of principles expressed (loosely but tellingly) with terms like transparency,...
Michael Eisenberg, Ann Eisenberg, Leah Buechley, N...
This paper revisits the two-hop forwarding policy in delay tolerant networks (DTNs) using simple probabilistic arguments. Closed form expressions are derived for the main performan...
Abstract. We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose anoth...