Showing papers by "Robert E. Tarjan published in 2001"
05 Nov 2001
TL;DR: In this paper, the authors describe a software self-checking mechanism designed to improve the tamper resistance of large programs, which consists of a number of testers that redundantly test for changes in the executable code as it is running and report modifications.
Abstract: We describe a software self-checking mechanism designed to improve the tamper resistance of large programs. The mechanism consists of a number of testers that redundantly test for changes in the executable code as it is running and report modifications. The mechanism is built to be compatible with copy-specific static watermarking and other tamper-resistance techniques. The mechanism includes several innovations to make it stealthy and more robust.
166 citations
TL;DR: This work considers the problem of testing the uniqueness of maximum matchings, both in the unweighted and in the weighted case, and gives a modification of the first algorithm that tests whether a given graph has a unique f-factor, and finds it if it exists.
55 citations
09 Jan 2001
TL;DR: Several implementations of the kinetic heap, a heap (priority queue) in which the key of each item, instead of being fixed, is a linear function of time, are described.
Abstract: We describe several implementations of the kinetic heap, a heap (priority queue) in which the key of each item, instead of being fixed, is a linear function of time. The kinetic heap is a simple example of a kinetic data structure of the kind considered by Basch, Guibas, and Hershberger. Kinetic heaps have many applications in computational geometry, and previous implementations were designed to address these applications. We describe an additional application, to broadcast scheduling. Each of our kinetic heap implementations improves on previous implementations by being simpler or asymptotically faster for some or all applications.
28 citations