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

E. Bibelnieks

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

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

Computer networks · 1

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
Electronic design automation · 50% Embedded and real-time systems · 50%

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

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › control systems
multi-mode systems		 0.011990
Algorithms for Approximating the Performance of Multimode Systems · INFOCOM 1990
Electronic design automation
state space enumeration		 0.011990
Algorithms for Approximating the Performance of Multimode Systems · INFOCOM 1990

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

state enumeration · 0.0approximation algorithm · 0.0
YearPublicationVenuePosition
1990 Algorithms for Approximating the Performance of Multimode Systems
abstract
The empirical performance of state enumeration methods proposed by several authors are examined, and refinements which result in significant computational improvements are presented. Two methods for state enumeration which compare favorably with the most efficient of current methods are introduced. They are based respectively on the work of S.-N. Chiou and V.O.K. Li (1986) and R.F. Gaebler and R.J. Chen (1987). It is shown that every algorithm discussed except that of C.L. Yang and P. Kubar (1989) can be executed significantly faster when the state enumeration problem is somewhat relaxed.>
Douglas R. Shier, E. Bibelnieks, James P. Jarvis, Richard J. Lakin
 INFOCOM2