Newsletter Downloads
The book review column
In this column we review the following books.
1. The Political Mapping of Cyberspace by Jeremy W. Crampton. Reviewed by Rajesh Natarajan.
2. Probability and Computing: Randomized Algorithms and Probabilitic Analysis by Michael Mitzenmacher and Eli ...
Introduction
Warmest thanks to Salil Vadhan for this issue's wonderful guest column on pseudorandomness. (His column begins in a few pages.) Future columns include Arnaud Durand, Clemens Lautemann, and Malika More on A Simple Proof of Polylog Counting Ability of ...
The unified theory of pseudorandomness: guest column
We survey the close connections between a variety of "pseudorandom objects," namely pseudorandom generators, expander graphs, list-decodable error-correcting codes, randomness extractors, averaging samplers, and hardness amplifiers.
Introduction
The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, ...
Delayed password disclosure
We present a new authentication protocol called Delayed Password Disclosure. Based on the traditional username and password paradigm, the protocol's goal is aimed at reducing the effectiveness of phishing/spoofing attacks that are becoming increasingly ...
Introduction
In this issue, Lomuscio and Penczek survey some of the recent work in verification of temporal-epistemic logic via symbolic model checking, focussing on OBDD-based and SAT-based approaches for epistemic logics built on discrete and real-time branching ...
Competitiveness via primal-dual
From the editor: So you are reading this paper on online algorithms. At first the paper reads well, and you get through the first few pages in no time -- until the authors pull a rabbit out of a hat: the online algorithm. Fine, you say to yourself, ...
Routing and network design with robustness to changing or uncertain traffic demands
A new class of network design problems were introduced by Fingerhut et al. [26], and independently by Duffield et al. [20], to address, among other things, the issue of uncertainty in the demand matrix. The so-called hose model (the term was coined in [...
Introduction
This issue's column is written by guest columnist, Chandra Chekuri. I am delighted that he agreed to write this column on a topic related to robust network design that has received considerable attention recently. His column introduces the reader to ...
