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

Russell Kao

dblp:05/3228 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2002
—ORCID · none

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

Systems, architecture and hardware · 6 · 4 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
3 papers
Electronic design automation · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design
0.012002
Shortest path search using tiles and piecewise linear costpropagation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2002
Electronic design automation › physical design
routing
0.012002
Shortest path search using tiles and piecewise linear costpropagation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2002
Graph algorithms and graph theory
graph algorithms
0.012002
Shortest path search using tiles and piecewise linear costpropagation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2002
Graph algorithms and graph theory
shortest path
0.012002
Shortest path search using tiles and piecewise linear costpropagation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2002
Electronic design automation
circuit simulation
0.021994
Timing analysis for piecewise linear Rsim · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Eliminating redundant DC equations for asymptotic waveform evaluation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Electronic design automation › circuit simulation
analog circuit simulation
0.011994
Eliminating redundant DC equations for asymptotic waveform evaluation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Electronic design automation › circuit simulation › model order reduction
asymptotic waveform evaluation
0.011994
Eliminating redundant DC equations for asymptotic waveform evaluation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Electronic design automation › interconnect modeling
moment computation
0.011994
Eliminating redundant DC equations for asymptotic waveform evaluation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Electronic design automation › circuit simulation › device and circuit simulation
MOS circuit simulation
0.011994
Timing analysis for piecewise linear Rsim · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Electronic design automation › circuit simulation
switch-level simulation
0.011994
Timing analysis for piecewise linear Rsim · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Electronic design automation
timing analysis
0.011994
Timing analysis for piecewise linear Rsim · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994

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

tile graph search · 0.1piecewise linear cost propagation · 0.1piecewise linear modeling · 0.0
YearPublicationVenuePosition
2002 Shortest path search using tiles and piecewise linear costpropagation
abstract
In this paper we propose a new algorithm for finding shortest paths in a tile connection graph. This algorithm uses an exact piecewise linear cost model to guide our search of the compact tile graph. Unlike previous tile search algorithms, this algorithm always rinds a shortest path. Unlike the grid graph algorithms (which do find shortest paths), this algorithm searches the tile graph which is much smaller than the grid graph. The efficiency of our new approach is confirmed by our experiments comparing our new algorithm with the grid graph algorithms.
Zhaoyun Xing, Russell Kao
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
2001 A minimum cost path search algorithm through tile obstacles
abstract
In this paper, based on tile connection graph, we propose an efficient minimum cost path search algorithm through tile obstacles. This search algorithm is faster than previous graph based algorithm and unlike previous tile based algorithms, this algorithm finds the minimum cost path.
Zhaoyun Xing, Russell Kao
ISPD2
1994 Eliminating redundant DC equations for asymptotic waveform evaluation
abstract
Asymptotic waveform evaluation (AWE) is a waveform estimation technique which involves the computation of moments from a linear circuit followed by the generation of waveform estimates based on those moments. During moment computation a special case arises if there are capacitor cutsets or inductor loops. Methods proposed for handling these cases involve identifying the cutsets and loops and replacing one of the capacitors (inductors) with a dependent source. This note describes a different formulation of the problem. The elimination of redundant equations in order to compute moments can be viewed as the dual of the problem of reducing circuit equations to normal form. This formulation has a couple of interesting theoretical properties: (1) it formally handles all circuit topologies, including circuits with dependent sources for which the redundancies may be undetectable from an inspection of the circuit topology; and (2) it predicts that even networks without independent sources may have "hidden" particular solutions consisting of polynomials in t.>
Russell Kao, Mark Horowitz
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1994 Timing analysis for piecewise linear Rsim
abstract
Rsim is a switch-level simulator that can simulate large digital MOS integrated circuits up to three orders of magnitude faster than SPICE. Unfortunately, Rsim's simplified circuit models and timing analysis prevent it from simulating "difficult" CMOS circuits and circuits containing bipolar transistors. We address this shortcoming by adapting Rsim to use more general piecewise linear models. We show that these modifications can be made in a way that preserves Rsim's efficiency for the simplest cases. The result is a simulator that can approach the efficiency of dedicated switch-level simulators when switch-level models are used. Alternatively, greater accuracy and flexibility can be obtained when more sophisticated models are used.>
Russell Kao, Mark Horowitz
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1993 Piecewise linear models for Rsim
abstract
Rsim is a switch-level simulator which can simulate large digital MOS integrated circuits with speedups of over three orders of magnitude over SPICE. Unfortunately, Rsim's simple switched-resistor model renders it incapable of simulating certain CMOS and most BiCMOS and ECL digital circuits. We observe that the switched-resistor model is just one particular piecewise linear model and that Rsim's simulation framework can accommodate more elaborate piecewise linear models. The resulting simulator, Mom, combines the efficiency of switch-level simulation with the ability to simulate a wider variety of circuits. We demonstrate Mom's efficiency and flexibility on a variety of circuits.
Russell Kao, Mark Horowitz
ICCAD1
1988 Bisim: a simulator for custom ECL circuits
abstract
Bisim is an event-driven, transistor-level, logic simulator that models both the logical and timing characteristics of custom emitter-coupled-logic/current-mode-logic circuits. Node voltages are represented by piecewise-linear waveforms, transistor currents are represented by piecewise-constant waveforms, and transistors are modeled as voltage-controlled current switches. Bisim's realistic circuit models enable it to simulate correctly a wide variety of circuit topologies while retaining much of the speed of higher level simulators.>
Russell Kao, Robert Alverson, Mark Horowitz, Don Stark 0001
ICCAD1