P. A. Gilmore

dblp:35/931 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1968
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallelization strategies
algorithm transformation
0.011968
Structuring of Parallel Algorithms · J. ACM 1968
Parallel and multicore computing › parallel algorithms
parallel algorithm design
0.011968
Structuring of Parallel Algorithms · J. ACM 1968
Compilers and program optimization › parsing
parallel parsing
0.011968
Structuring of Parallel Algorithms · J. ACM 1968
Algorithms and data structures
dynamic programming
0.011968
Structuring of Parallel Algorithms · J. ACM 1968
Algorithms and data structures › dynamic programming
parallel dynamic programming
0.011968
Structuring of Parallel Algorithms · J. ACM 1968
YearPublicationVenuePosition
1968 Structuring of Parallel Algorithms
abstract
The structuring of algorithms suitable for execution on parallel processors is discussed. Two examples of such algorithms are given. The first example exhibits a restructuring of Bellman's dynamic programming technique; the second presents a method of parsing MAD-type statements in parallel.
P. A. Gilmore
J. ACM1