Goldreich (ECCC 2000) suggested a simple construction of a candidate one-way function f : {0, 1}n → {0, 1}m where each bit of output is a fixed predicate P of a constant number ...
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
The interest in pair programming (PP) has increased recently, e.g. by the popularization of agile software development. However, many practicalities of PP are poorly understood. W...
The possible variability of project delay is useful information to understand and mitigate the project delay risk. However, it is not sufficiently considered in the literature con...
Makoto Nonaka, Liming Zhu, Muhammad Ali Babar, Mar...
P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necess...
Vijay Gopalakrishnan, Ruggero Morselli, Bobby Bhat...