Corpus ID: 29599075

The Design and Analysis of Computer Algorithms

@inproceedings{Aho1974TheDA,
  title={The Design and Analysis of Computer Algorithms},
  author={A. Aho and J. Hopcroft and J. 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… Expand
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. Expand
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. Expand
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. Expand
A parallel algorithm for the enumeration of the spanning trees of a graph
TLDR
A parallel algorithm for solving the problem of enumerating the spanning trees of a graph arises in several contexts such as computer-aided design and computer networks and is based on the principle of the inclusion and exclusion of sets, and not directly on the partitioning of the graph itself. Expand
Efficient string algorithmics
Problems involving strings arise in many areas of computer science and have numerous practical applications. We consider several problems from a theoretical perspective and provide efficientExpand
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,Expand
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,Expand
Complexity lower bounds for machine computing models
The article is the text of a survey report on methods of obtaining lower bounds on the computational complexity for abstract computers. Besides the methods for obtaining the lower bounds, relatedExpand
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. Expand
The Complexity of Combinatorial Computations: An Introduction
  • L. Valiant
  • Mathematics, Computer Science
  • 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. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 138 REFERENCES
Symposium on complexity of sequential and parallel numerical algorithms : program and abstracts.
TLDR
In this paper, ordering is examined as a mechanism to permit simultaneous (parallel) operations on many rows and columns of a sparse matrix arising from a mechanical engineering simulation problem. Expand
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. Expand
Efficiency of Equivalence Algorithms
  • M. Fischer
  • Mathematics, Computer Science
  • 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 theExpand
Analysis and Synthesis of Sorting Algorithms
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. Expand
A sorting problem and its complexity
  • I. Pohl
  • Mathematics, Computer Science
  • CACM
  • 1972
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 thisExpand
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. Expand
AN IMPROVED OVERLAP ARGUMENT FOR ON-LINE MULTIPLICATION
Abstract : A lower bound of cNlogN is proved for the mean time complexity of an on-line multitape. Turing machine performing the multiplication of N-digit binary integers. For a more general class ofExpand
ON THE ALGEBRAIC COMPLEXITY OF FUNCTIONS
nof the co-efficients. He showed that if, in the course of evaluating Pn(x) = £ atxl9 /=o operations which depend only on the A,'s are not counted, then the minimum number of multiplicatio nsExpand
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. Expand
Testing flow graph reducibility
  • R. Tarjan
  • Mathematics, Computer Science
  • STOC
  • 1973
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. Expand
...
1
2
3
4
5
...