The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper...
Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...
Maxim Binshtok, Ronen I. Brafman, Solomon Eyal Shi...
Starting in the fall of 2005 our department began a large-scale effort to incorporate hands-on robotics in many of our courses, including our introductory computer science sequenc...
Debra T. Burhans, R. Mark Meyer, Patricia VanVerth...
The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in a paper from 1995. This framework does not allow for joint attacks on arguments...