People frequently complain that it is too difficult to figure out how to get computers to do what they want. However, with a computer system that actually tries to understand what...
Our model of multi-party negotiations is a many parties, many issues model. The whole multi-party negotiation consists of a set of mutually influencing bilateral negotiations that...
By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of p...
: Like other latent evidence that cannot be directly perceived by people, bit sequences have to be presented through tools. Presentations of digital forensic evidence often involve...
A (k, )-robust combiner for collision-resistant hash-functions is a construction which from hash-functions constructs a hash-function which is collision-resistant if at least k of ...