This paper proves “tight security in the random-oracle model relative to factorization” for the lowest-cost signature systems available today: every hash-generic signature-forging attack can be converted, with negligible loss of efficiency and effectiveness, into an algorithm to factor the public key. The most surprising system is the “fixed unstructured B = 0 Rabin/Williams” system, which has ...

We present a survey of results in the field of graph algorithms. We begin with an All Pairs Shortest Path algorithm with some constraints that runs in O(n) by Peres. We continue with a Replacement Paths algorithm by Williams and conclude with a smoothed analysis of a Single Source Shortest Paths algorithm by Banderier. Each of these problems has connections to randomization in graph algorithms.

This paper reports experimental measurements of productivity and quality in pair programming. The work complements Laurie Williams’ work on collaborative programming, in which Pair Programming and Solo Programming student groups wrote the same programs and then their activities were measured to investigate productivity, quality, etc. In this paper, Pair and Solo industrial programmer groups are...

The two well known learning algorithms of recurrent neural networks are the back-propagation (Rumelhart & el al., Werbos) and the forward propagation (Williams and Zipser). The main drawback of back-propagation is its off-line backward path in time for error cumulation. This violates the on-line requirement in many practical applications. Although the forward propagation algorithm can be used i...