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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Judith O. Berkey

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

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

Systems, architecture and hardware · 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 · 50% Cloud and datacenter computing · 50%
Theoretical computer science
1 paper
Mathematical optimization · 50% Approximation and online algorithms · 50%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
bin packing		 0.011994
A Systolic-Based Parallel Bin Packing Algorithm · IEEE Trans. Parallel Distributed Syst. 1994
Parallel and multicore computing › parallel algorithms › parallel algorithm design
parallel approximation algorithm		 0.011994
A Systolic-Based Parallel Bin Packing Algorithm · IEEE Trans. Parallel Distributed Syst. 1994
Approximation and online algorithms
bin packing		 0.011994
A Systolic-Based Parallel Bin Packing Algorithm · IEEE Trans. Parallel Distributed Syst. 1994
Mathematical optimization
combinatorial optimization		 0.011994
A Systolic-Based Parallel Bin Packing Algorithm · IEEE Trans. Parallel Distributed Syst. 1994

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

systolic algorithm · 0.0
YearPublicationVenuePosition
1994 A Systolic-Based Parallel Bin Packing Algorithm
abstract
A systolic based parallel approximation algorithm that obtains solutions to the I-D bin packing problem is presented. The algorithm has an asymptotic error bound of 1.5 and time complexity O(n). An experimental study demonstrates that the heuristic offers improved packing and execution performance over parallelizations of two well-known serial algorithms.>
Judith O. Berkey, Pearl Y. Wang
 IEEE Trans. Parallel Distributed Syst.1