Internet voting is unachievable for the foreseeable future and therefore not inevitable. View a video of Barbara Simons entitled "Internet Voting: An Idea Whose Time Has Not Come."
Douglas W. Jones
Advertisement
Author Archives
Exploiting the redundancy in election records to conduct useful audits and improve the system design process.
Concurrent operations on priority queues
Among the fastest priority queue implementations, skew heaps have properties that make them particularly suited to concurrent manipulation of shared queues. A concurrent version of the top down implementation of skew heaps can be produced from previously published sequential versions using almost mechanical transformations. This implementation requires O(log n) time to enqueue or dequeue an item, but it allows new operations to begin after only O(1) time on a MIMD machine. Thus, there is potential for significant concurrency when multiple processes share a queue. Applications to problems in graph theory and simulation are discussed in this article.
An empirical comparison of priority-queue and event-set implementations
Execution times for a variety of priority-queue implementations are compared under the hold model, showing many to be faster than implicit heaps.
Improved interpretation of UNIX-like file names embedded in data
When the data processed by a program span several files, the common practice of including file names as data in some of the files leads to difficulties in moving or sharing that data. In systems using tree structured directories, this problem can be solved by making a syntactic distinction between absolute and relative file names.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved