Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.
VLDB 2026 Research / reviewers in the wild / expert

Bernard A. Galler

dblp:g/BernardAGaller · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 1989
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 4 · 1 first-authorSoftware engineering, systems software and programming languages · 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.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Computing education · 89% Computational science and engineering · 11%
Software engineering, system software, and programming languages
2 papers
Operating systems · 69% Compilers and program optimization · 31%
Theoretical computer science
3 papers
Mathematical optimization · 55% Algorithms and data structures · 45%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 100%

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

TopicWeightPapersLastEvidence papers
Computing education
software engineering education		 0.011989
Thoughts on Software Engineering · ICSE 1989
Operating systems › resource management › process management › multiprogramming
time-sharing systems		 0.011966
Program and Addressing Structure in a Time-Sharing Environment · J. ACM 1966
Computational science and engineering
numerical analysis		 0.011960
A Generalization of a Theorem of Carr on Error Bounds for Rung-Kutta Procedures · J. ACM 1960
Computational science and engineering › numerical solution of differential equations
runge-kutta methods		 0.011960
A Generalization of a Theorem of Carr on Error Bounds for Rung-Kutta Procedures · J. ACM 1960
Compilers and program optimization
code generation		 0.011962
An Algorithm for Translating Boolean Expressions · J. ACM 1962
Algorithms and data structures › algebraic computation
expression evaluation		 0.011962
An Algorithm for Translating Boolean Expressions · J. ACM 1962
Mathematical optimization
linear programming		 0.011957
The Method of Reduced Matrices for a General Transportation Problem · J. ACM 1957
Mathematical optimization › combinatorial optimization › network optimization
transportation problem		 0.011957
The Method of Reduced Matrices for a General Transportation Problem · J. ACM 1957

Methods — techniques the papers use, named apart from their topics

reduced matrices · 0.0error propagation analysis · 0.0
YearPublicationVenuePosition
1989 Thoughts on Software Engineering
abstract
No abstract available.
Bernard A. Galler
 ICSE1
1966 Program and Addressing Structure in a Time-Sharing Environment
abstract
The problem studied is the effect of a time-sharing environment on the structure of programs and on the addressing strategies which may be employed in the hardware. An account is given of some very recent developments toward reduction in the system overhead needed to facilitate time-sharing. One hardware-software scheme designed to implement this reduction is described in some detail.
Bruce W. Arden, Bernard A. Galler, T. C. O'Brien, F. H. Westervelt
 J. ACM2
1962 An Algorithm for Translating Boolean Expressions
abstract
This paper describes an algorithm for scanning Boolean expressions.Such an algorithm takes a complex, relational expression and transforms it into an optimal set of computing steps.The result is optimal in the sense that no redundant evaluations are made.The particular algorithm described is advantageous in that, as a variant of a well-known *
Bruce W. Arden, Bernard A. Galler, Robert M. Graham
 J. ACM2
1960 A Generalization of a Theorem of Carr on Error Bounds for Rung-Kutta Procedures
abstract
In [1] Carr established propagation error bounds for a particular Runge-Kutta (RK) procedure, and suggested that similar bounds could be established for other RK procedures obtained by choosing the parameters differently.
Bernard A. Galler, D. P. Rozenberg
 J. ACM1
1957 The Method of Reduced Matrices for a General Transportation Problem
abstract
In the usual statement of the transportation problem [1], one has N items to send from shipping points A1, ... , Ap to receiving points B1 , "'" , Bq .The amounts available for shipment from A1, • • • , Ap are a~, • • • , ap, respectively, and the amounts needed at B~, • • • , Bq are bl, • • • , bq, respectively, where p q ~a, = ~b~ = N. i=l 5=i
Paul S. Dwyer, Bernard A. Galler
 J. ACM2