• 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
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.
Database Systems : An Application-Oriented Approach
TLDR
This chapter discusses the design and implementation of the Software Engineering Methodology for Relational Databases, as well as some of the techniques used in the development of these systems.
The characteristic selection problem in recognition systems
  • P. M. Lewis
  • Computer Science
    IRE Trans. Inf. Theory
  • 1 February 1962
TLDR
This paper examines the notion of a single number statistic for each characteristic which would have certain desirable properties related to the "goodness" of the characteristic, and shows that, in general, no such statistic exists.
Attributed Translations
Approximate Algorithms for the Traveling Salesperson Problem
TLDR
Several polynomial time algorithms finding "good," but not necessarily optimal, tours for the traveling salesman problem are considered, and the worst case ratio of the obtained tour to the optimal tour is shown to increase logarithmically with the number of cities.
...
1
2
3
4
5
...