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.
EDBT 2026 Demo / reviewers in the wild / expert

Avinoam Bilgory

dblp:78/7023 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1986
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 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
2 papers
Electronic design automation · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
logic synthesis		 0.021986
A Heuristic for Suffix Solutions · IEEE Trans. Computers 1986
Automatic generation of cells for recurrence structures · DAC 1981
Algorithms and data structures › parallel algorithms
parallel prefix computation		 0.011986
A Heuristic for Suffix Solutions · IEEE Trans. Computers 1986
Electronic design automation › physical design › module generation
cell generation		 0.011981
Automatic generation of cells for recurrence structures · DAC 1981

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

heuristic cost minimization · 0.0automatic cell generation · 0.0
YearPublicationVenuePosition
1986 A Heuristic for Suffix Solutions
abstract
The suffix problem has appeared in solutions of recurrence systems for parallel and pipelined machines and more recently in the design of gate and silicon compilers. In this paper we present two algorithms. The first algorithm generates parallel suffix solutions with minimum cost for a given length, time delay, availability of initial values, and fanout. This algorithm generates a minimal solution for any length n and depth range from log2 n to n. The second algorithm reduces the size of the solutions generated by the first algorithm.
Avinoam Bilgory, Daniel Gajski
 IEEE Trans. Computers1
1981 Automatic generation of cells for recurrence structures
Avinoam Bilgory, Daniel Gajski
 DAC1