Back to search

Parallel Computer Models and Combinatorial Algorithms

Data up to Jan 2025

Published1987
Citations14
References164

Total Citations Per Year

Abstract

References (164)

Computers and Intractability: A Guide to the Theory of NP-Completeness

1979 • 45,565 citations

A note on two problems in connexion with graphs

1959 • 22,492 citations

The Design and Analysis of Computer Algorithms

1974 • 9,688 citations

Shortest Connection Networks And Some Generalizations

1957 • 4,371 citations

Combinatorial optimization:Algorithms and complexity

1984 • 3,523 citations

Introduction to V.L.S.I. Systems

1981 • 2,495 citations

Sorting networks and their applications

1968 • 2,385 citations

Why systolic architectures?

1982 • 2,252 citations

A Study of Non-Blocking Switching Networks

1953 • 1,694 citations

Some Computer Organizations and Their Effectiveness

1972 • 1,661 citations

Relationships between nondeterministic and deterministic tape complexities

1970 • 1,361 citations

Parallel Processing with the Perfect Shuffle

1971 • 1,265 citations

The cosmic cube

1985 • 1,187 citations

Computer architecture and parallel processing

1985 • 1,174 citations

Alternation

1981 • 1,166 citations

A Distributed Algorithm for Minimum-Weight Spanning Trees

1983 • 1,162 citations

The cube-connected cycles: a versatile network for parallel computation

1981 • 995 citations

Very high-speed computing systems

1966 • 943 citations

The Art of Computer Programming, Vol. 3: Sorting and Searching

1974 • 932 citations

Parallelism in random access machines

1978 • 902 citations

Traveling Salesman Problem

1986 • 805 citations

The CRAY-1 computer system

1978 • 672 citations

An 0(n log n) sorting network

1983 • 656 citations

Applying Parallel Computation Algorithms in the Design of Serial Algorithms

1983 • 653 citations

A Scheme for Fast Parallel Communication

1982 • 646 citations

Universal schemes for parallel communication

1981 • 644 citations

An O(logn) parallel connectivity algorithm

1982 • 601 citations

The Architecture of Pipelined Computers

1981 • 547 citations

An Efficient Parallel Biconnectivity Algorithm

1985 • 531 citations

The ILLIAC IV Computer

1968 • 530 citations

Area-time complexity for VLSI

1979 • 485 citations

Sorting on a mesh-connected parallel computer

1977 • 473 citations

Parallelism in Comparison Problems

1975 • 407 citations

Computability of Recursive Functions

1963 • 407 citations

Tight Bounds on the Complexity of Parallel Sorting

1985 • 377 citations

Parallel Matrix and Graph Algorithms

1981 • 358 citations

Data-Driven and Demand-Driven Computer Architecture

1982 • 345 citations

Mathematical Theory of Connecting Networks and Telephone Traffic.

1966 • 325 citations

The circuit value problem is log space complete for P

1975 • 314 citations

On the optimal detection of curves in noisy pictures

1971 • 303 citations

Ultracomputers

1980 • 287 citations

Complete problems for deterministic polynomial time

1976 • 278 citations

Computing connected components on parallel computers

1979 • 275 citations

Data broadcasting in SIMD computers

1981 • 270 citations

A fast parallel algorithm for routing in permutation networks

1981 • 265 citations

Bitonic Sort on a Mesh-Connected Parallel Computer

1979 • 252 citations

Anomalies in parallel branch-and-bound algorithms

1984 • 251 citations

Area-Efficient VLSI Computation

1983 • 244 citations

Finding the maximum, merging, and sorting in a parallel computation model

1981 • 240 citations

Finding the maximum, merging and sorting in a parallel computation model

2007 • 239 citations

The monotone and planar circuit value problems are log space complete for P

1977 • 225 citations

An O(n2log n) parallel max-flow algorithm

1982 • 223 citations

Distributed dynamic programming

1982 • 215 citations

Efficient parallel algorithms for some graph problems

1982 • 209 citations

An observation on time-storage trade off

1974 • 205 citations

The Complexity of Parallel Computations

1979 • 204 citations

Parallel permutation and sorting algorithms and a new generalized connection network

1982 • 202 citations

A Computer Oriented toward Spatial Problems

1958 • 200 citations

Distributed computation on graphs

1982 • 189 citations

Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer

1980 • 189 citations

A computer oriented toward spatial problems

1958 • 178 citations

A taxonomy of parallel sorting

1984 • 175 citations

An overview of computational complexity

1983 • 173 citations

New Parallel-Sorting Schemes

1978 • 166 citations

A universal interconnection pattern for parallel computers

1982 • 165 citations

Parallel graph algorithms

1984 • 158 citations

Optimal Sorting Algorithms for Parallel Computers

1978 • 158 citations

Bounds to Complexities of Networks for Sorting and for Switching

1975 • 157 citations

Combinatorial Optimization

2013 • 148 citations

A Model of SIMD Machines and a Comparison of Various Interconnection Networks

1979 • 141 citations

Parallel Computations

1982 • 136 citations

The maximum flow problem is log space complete for P

1982 • 135 citations

Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks

2003 • 135 citations

An optimal routing algorithm for mesh-connected Parallel computers

1980 • 134 citations

Parallel computation and conflicts in memory access

1982 • 133 citations

Routing, merging and sorting on parallel models of computation

1982 • 133 citations

A survey of highly parallel computing

1982 • 126 citations

Probabilistic Parallel Algorithms for Sorting and Selection

1985 • 123 citations

Linear programming is log-space hard for P

1979 • 120 citations

Fast, Efficient Parallel Algorithms for Some Graph Problems

1981 • 116 citations

Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems

1987 • 111 citations

Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees

1983 • 109 citations

Fast parallel sorting algorithms

1978 • 101 citations

A Distributed Algorithm for Minimum Weight Directed Spanning Trees

1983 • 99 citations

Parallel Algorithms for Shortest Path Problems.

1985 • 93 citations

Parallel Algorithms in Graph Theory: Planarity Testing

1982 • 92 citations

Associative and Parallel Processors

1975 • 90 citations

MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems

1984 • 85 citations

The TI ASC

1972 • 85 citations

Communication Issues in the Design and Analysis of Parallel Algorithms

1981 • 84 citations

Parallel Computations in Graph Theory

1978 • 83 citations

Efficient Parallel Algorithms for a Class of Graph Theoretic Problems

1984 • 82 citations

An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes

1983 • 82 citations

Parallel algorithms for the connected components and minimal spanning tree problems

1982 • 81 citations

Binary Trees and Parallel Scheduling Algorithms

1983 • 75 citations

A parallel branch and bound algorithm for the quadratic assignment problem

1987 • 73 citations

A parallel algorithm for constructing minimum spanning trees

1980 • 72 citations

Distributed Enumeration on Between Computers

1980 • 70 citations

Parallel Scheduling Algorithms

1983 • 69 citations

On efficient parallel strong orientation

1985 • 66 citations

Parallel algorithms for the transitive closure and the connected component problems

1976 • 65 citations

A distributed asynchronous relaxation algorithm for the assignment problem

1985 • 63 citations

A parallel matching algorithm for convex bipartite graphs and applications to scheduling

1984 • 61 citations

New Connectivity and MSF Algorithms for Ultracomputer and PRAM.

1983 • 61 citations

Algorithm and Hardware for a Merge Sort Using Multiple Processors

1978 • 58 citations

Parallelism and Array Processing

1984 • 57 citations

A logarithmic time sort for linear size networks

1983 • 57 citations

Dynamic programming and parallel computers

1973 • 57 citations

Trade-Offs between Depth and Width in Parallel Computation

1985 • 56 citations

A fast probabilistic parallel sorting algorithm

1981 • 56 citations

Cellular arrays for the solution of graph problems

1972 • 50 citations

Synchronous parallel computation.

1978 • 49 citations

A Minimum Area VLSI Network for O(log n) Time Sorting

1985 • 49 citations

Programming and design considerations of a highly parallel computer

1963 • 47 citations

Some parallel algorithms on interval graphs

1987 • 45 citations

Performance of data communication systems and their applications

1981 • 44 citations

A parallel median algorithm

1985 • 44 citations

Implementation of Permutation Functions in Illiac IV-Type Computers

1976 • 42 citations

An optimal algorithm for parallel selection

1984 • 42 citations

Experience with Two Parallel Programs Solving the Traveling Salesman Problem.

1983 • 41 citations

Parallel Algorithms for Graph Theoretic Problems

1977 • 39 citations

Complexity Results for Permuting Data and Other Computations on Parallel Processors

1984 • 37 citations

MIMD computing in the USA—1984

1985 • 37 citations

A fully distributed (minimal) spanning tree algorithm

1986 • 36 citations

Merging with parallel processors

1975 • 36 citations

VLSI: Algorithms and Architectures

1986 • 35 citations

VLSI Algorithms for the Connected Component Problem

1983 • 34 citations

Decomposition of linear programs using parallel computation

1988 • 32 citations

The Parallel Recognition of Classes of Graphs

1980 • 32 citations

The NP-completeness column: An ongoing guide

1983 • 27 citations

On the message complexity of distributed problems

1984 • 24 citations

Parallelism in tape-sorting

1974 • 24 citations

The VLSI Complexity of Selected Graph Problems

1984 • 23 citations

Vector Processing on the CYBER 200.

1980 • 22 citations

Minimum Storage Sorting Networks

1985 • 21 citations

A Fully Implicit, Factored Code for Computing Three-Dimensional Flows on the ILLIAC IV

1982 • 20 citations

Parallel strong orientation of an undirected graph

1984 • 20 citations

Parallel algorithms for the single source shortest path problem

1982 • 16 citations

A minimum area VLSI network for O(logn) time sorting

1984 • 16 citations

On Parallel Computation for the Knapsack Problem

1982 • 15 citations

The second machine class: models of parallelism

1985 • 13 citations

Graph problems on a mesh-connected processor array (Preliminary Version)

1982 • 13 citations

FACOM VP-100/200: Supercomputers with ease of use

1985 • 11 citations

Parallel computers and computations

1986 • 11 citations

Parallel algorithms for minimum cuts and maximum flows in planar networks

1982 • 11 citations

Path Finding with Associative Memory

1968 • 11 citations

A Systolic Design for Connectivity Problems

1984 • 11 citations

Two methods for the solution of the dynamic programming algorithm on a multiprocessor cluster

1980 • 10 citations

Parallel complexity of sorting problems

1982 • 9 citations

A note on the ‘parallel computation thesis’

1983 • 7 citations

A parallel matching algorithm for convex bipartite graphs.

1982 • 6 citations

Parallel computations on graphs

1985 • 6 citations

An optimal parallel processor bound in strong orientation of an undirected graph

1985 • 6 citations

On the application of parallel architectures to a class of operations research problems

1983 • 5 citations

Performance evaluation of vector implementations of combinatorial algorithms

1984 • 5 citations

A note on finding minimum cuts in directed planar networks by parallel computations

1985 • 5 citations

Algorithms, software and hardware of parallel computers

1985 • 4 citations

A parallel algorithm for the enumeration of the spanning trees of a graph

1984 • 4 citations

A parallel merging algorithm

1981 • 4 citations

Parallel Algorithms for Network Routing Problems and Recurrences

1982 • 3 citations

Speeding up the primal simplex algorithm on parallel computer

1982 • 3 citations

Results in parallel searching, merging, and sorting.

1982 • 2 citations

Bridge-Connectivity and Biconnectivity Algorithms for Parallel Computer Models.

1983 • 1 citations

Data flow computer architecture

1984 • 1 citations

Cited By (0)

Loading...