We develop a general method for proving properties of contract-signing protocols using a specialized protocol logic. The method is applied to the Asokan-ShoupWaidner and the Garay...
Michael Backes, Anupam Datta, Ante Derek, John C. ...
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
—The Border Gateway Protocol (BGP) handles the task of establishing routes between the Autonomous Systems (ASes) that make up the Internet. It is known that it is possible for a ...
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...