• Publications
  • Influence
An Analysis of Several Heuristics for the Traveling Salesman Problem
Several polynomial time algorithms finding “good,” but not necessarily optimal, tours for the traveling salesman problem are considered. We measure the closeness of a tour by the ratio of the
Syntax-Directed Transduction
TLDR
Some special conditions are investigated under which syntax-directed translations can be performed on (deterministic) pushdown machines and some time bounds for translations on Turing machines are derived.
An analysis of several heuristics for the traveling salesman problem
Several polynomial time algorithms finding “good,” but not necessarily optimal, tours for the traveling salesman problem are considered. We measure the closeness of a tour by the ratio of the
Hierarchies of memory limited computations
This paper investigates the computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines. A "translational" method which escapes some of
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
TLDR
The approximation schemes for hierarchically specified unit disk graphs presented in this paper are among the first approximation schemes in the literature for natural PSPACE-hard optimization problems.
System level concurrency control for distributed database systems
TLDR
This paper presents designs for several distributed concurrency controls and demonstrates that they work correctly and investigates some of the implications of global consistency of a distributed database and discusses phenomena that can prevent termination of application programs.
Convergent transfer schemes for $N$-person games
Introduction. The object of this paper is to describe a transfer scheme that converges to the kernel of a game and another scheme that converges to the bargaining set. Both the bargaining set and the
Two-Tape Simulation of Multitape Turing Machines
TLDR
The trade-off relation between number of tapes and speed of computation can be used in a diagonalization argument to show that, if a given function requires computation time T for a k-tape realization, then it requires at most computation time log T log log log for a two-Tape realization.
...
1
2
3
4
5
...