• Corpus ID: 29599075

The Design and Analysis of Computer Algorithms

@inproceedings{Aho1974TheDA,
  title={The Design and Analysis of Computer Algorithms},
  author={Alfred V. Aho and John E. Hopcroft and Jeffrey D. Ullman},
  year={1974}
}
From the Publisher: With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matching algorithms, and the Schonhage-Strassen integer-multiplication algorithm. Provides numerous graded… 

The Design and Analysis of Algorithms

  • D. Kozen
  • Computer Science
    Texts and Monographs in Computer Science
  • 1992
TLDR
Dexter Kozen, a researcher and professor at Cornell University, has written a text for graduate study of algorithms, an important reference book as well as being a useful graduate-level textbook.

Data Structures and Algorithms

TLDR
The concept of abstract data type is introduced, along with some useful data types such as lists, queues, stacks, trees, and graphs, and more advanced data structures are also mentioned along with applications where they occur.

A survey of analysis techniques for combinatorial algorithms

TLDR
This survey includes an introduction to the concepts of problem complexity, analysis of algorithms to find bounds on complexity, average-case behavior, and approximation algorithms, and examples of the use of these methods are explained.

Polynomial root-finding: analysis and computational investigation of a parallel algorithm

TLDR
A practical parallel algorithm that approximates the roots of a polynomial whose roots are all real is developed and its run-time behaviour is compared with the analytical predictions.

Efficient string algorithmics

TLDR
This work considers several problems from a theoretical perspective and provides efficient algorithms and lower bounds for these problems in sequential and parallel models of computation for the string matching problem.

Parallel Algorithmic Techniques for Combinatorial Computation

We have described a number of algorithmic tools that have been found useful in the construction of parallel algorithms; among these are prefix computation, ranking, Euler tours, ear decomposition,

Data structures and algorithm analysis in C

TLDR
This book provides a proven approach to algorithms and data structures using the exciting Java programming language as the implementation tool and highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time.

The Complexity of Combinatorial Computations: An Introduction

  • L. Valiant
  • Computer Science, Mathematics
    GI Jahrestagung
  • 1978
TLDR
The search for mechanizable procedures or algorithms for solving problems has been an integral part of mathematics from the beginning, and such algorithms as Gaussian elimination for solving linear equations, Newton's iteration for algebraic equations, and Euclid's algorithm for greatest common divisors appear very efficient even now after centuries of further investigation.

Index Sort

TLDR
This paper presents a new sorting algorithm (Index Sort) which runs based on the previously sorted elements which was analyzed, implemented and tested and the results are promising for a random data.
...

References

SHOWING 1-10 OF 129 REFERENCES

An improved equivalence algorithm

TLDR
An algorithm for assigning storage on the basis of EQUIVALENCE, DIMENSION and COMMON declarations is presented, and has reduced computation time by 40 percent over a previously published algorithm.

Efficiency of Equivalence Algorithms

  • M. Fischer
  • Mathematics
    Complexity of Computer Computations
  • 1972
The equivalence problem is to determine the finest partition on a set that is consistent with a sequence of assertions of the form “x ≡ y”. A strategy for doing this on a computer processes the

Analysis and Synthesis of Sorting Algorithms

  • C. Liu
  • Computer Science
    SIAM J. Comput.
  • 1972
TLDR
The problem of analyzing and synthesizing sorting algorithms is studied to investigate how it works in a step-by-step manner and consequently to assert that it indeed arranges the objects according to a certain ordering relationship.

A sorting problem and its complexity

A technique for proving min-max norms of sorting algorithms is given. One new algorithm for finding the minimum and maximum elements of a set with fewest comparisons is proved optimal with this

Determining graph properties from matrix representations

TLDR
This paper investigates three matrix representations of graphs; the (vertex) adjacency matrix, the edge-adjacency Matrix, and the incidence matrix, which determine an unlabelled graph up to isomorphism.

AN IMPROVED OVERLAP ARGUMENT FOR ON-LINE MULTIPLICATION

TLDR
A lower bound of cNlogN is proved for the mean time complexity of an on-line multitape with known upper bounds of the form cN(logN)k sub K, and for some classes the upper and lower bounds coincide.

ON THE ALGEBRAIC COMPLEXITY OF FUNCTIONS

TLDR
This paper surveys the recent results in matrix and vector operations and describes the extension of the results to matrix andvector operations shown in [5].

A Phenomenon in the Theory of Sorting

TLDR
A unified treatment of this order-preservation phenomenon is given and a number of results about sorting networks and other sorting methods are immediate consequences of the theorems.

Testing flow graph reducibility

  • R. Tarjan
  • Computer Science
    J. Comput. Syst. Sci.
  • 1974
TLDR
An algorithm for testing whether a flow graph is reducible is described, which uses depth-first search to reveal the structure of the flow graph and a good method for computing disjoint set unions to determine reducibility from the search information.

Finding Dominators in Directed Graphs

  • R. Tarjan
  • Computer Science, Mathematics
    SIAM J. Comput.
  • 1974
This paper describes an algorithm for finding dominators in an arbitrary directed graph. The algorithm uses depth-first search and efficient algorithms for computing disjoint set unions and
...