Learn More
In a recent paper, Jaggi et al., presented a distributed polynomial-time rate-optimal network-coding scheme that works in the presence of Byzantine faults.We revisit their adversarial models and augment them with three, arguably realistic, models. In each of the models, we present a distributed scheme that demonstrates the usefulness of the model. In(More)
These notes are based on a short course offered at the Weizmann Institute of Science in Rehovot, Israel, in November 2006. The notes include an introduction to impartial games, starting from the beginning; the basic misère quotient construction; a proof of the Guy–Smith–Plambeck Periodicity Theorem; and statements of some recent results and open problems in(More)
  • 1