#### Filter Results:

- Full text PDF available (69)

#### Publication Year

1976

2017

- This year (1)
- Last 5 years (11)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Prabhakar Raghavan, Clark D. Thomborson
- Combinatorica
- 1987

The relation of an integer program to its rational relaxation has been the subject of considerable interest [l], [5], [11]. Such efforts fall into two categories: (1) Showing existence results for feasible solutions to an integer program in terms of the solution to its rational relaxation, and (2) Using the information derived from the solution of the… (More)

It has become more and more common to distribute software in forms that retain most or all of the information present in the original source code. An important example is Java bytecode. Since such codes are easy to decompile, they increase the risk of malicious reverse engineering attacks. In this paper we review several techniques for technical protection… (More)

It has become common to distribute software in forms that are isomorphic to the original source code. An important example is Java bytecode. Since such codes are easy to decompile, they increase the risk of malicious reverse engineering attacks.In this paper we describe the design of a Java code obfuscator, a tool which - through the application of code… (More)

- Christian S. Collberg, Clark D. Thomborson
- POPL
- 1999

Watermarking embeds a secret message into a cover message. In media watermarking the secret is usually a copyright notice and the cover a digital image. Watermarking an object discourages intellectual property theft, or when such theft has occurred, allows us to prove ownership.The Software Watermarking problem can be described as follows. Embed a structure… (More)

- Clark D. Thomborson, H. T. Kung
- STOC
- 1976

Two algorithms for sorting n<supscrpt>2</supscrpt> elements on an n×n mesh-connected processor array that require 0(n) routing and comparison steps are presented. The best previous algorithms take time 0(n log n). Our algorithms are shown to be optimal in time within small constant factors.

We examine the problem of routing wires of a VLSI chip, where the pins to be connected are arranged in a regular rectangular array. We obtain tight bounds for the worst-case “channel-width” needed to route ann×n array, and develop provably good heuristics for the general case. Single-turn routings are proved to be near-optimal in the worst-case. A central… (More)

- Prabhakar Raghavan, Clark D. Thomborson
- STOC
- 1985

We examine the problem of routing wires on a VLSI chip where the nodes to be connected are arranged in a two-dimensional array. We develop provably good algorithms that find a solution close to the optimal one with high probability. Our approximation algorithms solve the relevant 0-1 integer optimization problems by solving their relaxed versions and then… (More)

To ensure platform independence, mobile programs are distributed in forms that are isomorphic to the original source code. Such codes are easy to decompile, and hence they increase the risk of malicious reverse engineering attacks. Code obfuscation is one of several techniques which has been proposed to alleviate this situation. An obfuscator is a tool… (More)

- Christian S. Collberg, Clark D. Thomborson
- IEEE Trans. Software Eng.
- 2002

We identify three types of attack on the intellectual property contained in software, and three corresponding technical defenses. A potent defense against reverse engineering is obfuscation, a process that renders software unintelligible but still functional. A defense against software piracy is watermarking, a process that makes it possible to determine… (More)

- Christos Kaklamanis, Anna R. Karlin, +5 authors A. Tsantilas
- FOCS
- 1990

In the paper, we analyze the computational power of 2 and 3-dimensional processor arrays that contain a potentially large number of faults. We consider both a random a and worst-case fault model, and we prove that in either scenario, low-dimensional arrays are surprisingly fault-tolerant. For example, we show how to emulate an n e x n m fault-free array on… (More)