Charles M. Fiduccia

16 papers A* 4B 1Journal 8Unranked 3
YearRankTypeTitle / Venue / Authors
1998 J jnl
Dot product representations of graphs.
Discret. Math.
Charles M. Fiduccia, Edward R. Scheinerman, Ann N. Trenk, Jennifer S. Zito
1998 J jnl
Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian Groups.
SIAM J. Discret. Math.
Charles M. Fiduccia, Rodney W. Forcade, Jennifer S. Zito
1997 J jnl
Edge Congestion of Shortest Path Systems for All-to-All Communication.
IEEE Trans. Parallel Distributed Syst.
Charles M. Fiduccia, Paul J. Hedrick
1994 J jnl
Perfect Shifters.
IEEE Trans. Computers
Charles M. Fiduccia, Kevin J. Rappoport
1994 — conf
Pin-efficient networks for cubic neighborhoods.
SPDP
Charles M. Fiduccia, Kevin J. Rappoport
1994 J jnl
Universality of Iterated Networks.
Math. Syst. Theory
Robert F. Chamberlain, Charles M. Fiduccia
1992 J jnl
Bused Hypercubes and Other Pin-Optimal Networks.
IEEE Trans. Parallel Distributed Syst.
Charles M. Fiduccia
1992 — conf
Bussed Interconnection Networks from Trees.
IPPS
Charles M. Fiduccia
1992 B conf
Universality of Iterated Networks.
SPAA
Robert F. Chamberlain, Charles M. Fiduccia
1985 J jnl
An Efficient Formula for Linear Recurrences.
SIAM J. Comput.
Charles M. Fiduccia
1982 A* conf
A "greedy" channel router.
DAC
Ronald L. Rivest, Charles M. Fiduccia
1982 A* conf
A linear-time heuristic for improving network partitions.
DAC
Charles M. Fiduccia, Robert M. Mattheyses
1977 J jnl
Algebras Having Linear Multiplicative Complexities.
J. ACM
Charles M. Fiduccia, Yechezkel Zalcstein
1972 — conf
On Obtaining Upper Bounds on the Complexity of Matrix Multiplication.
Complexity of Computer Computations
Charles M. Fiduccia
1972 A* conf
Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform Revisited
STOC
Charles M. Fiduccia
1971 A* conf
Fast Matrix Multiplication
STOC
Charles M. Fiduccia