Fast Matrix Multiplication - Charles M. Fiduccia (STOC, 1971)

On Obtaining Upper Bounds on the Complexity of Matrix Multiplication. - Charles M. Fiduccia (Complexity of Computer Computations, 1972)

Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform Revisited - Charles M. Fiduccia (STOC, 1972)

Algebras Having Linear Multiplicative Complexities. - Charles M. Fiduccia; Yechezkel Zalcstein (J. ACM, 1977)

A linear-time heuristic for improving network partitions. - Charles M. Fiduccia; Robert M. Mattheyses (DAC, 1982)

A "greedy" channel router. - Ronald L. Rivest; Charles M. Fiduccia (DAC, 1982)

An Efficient Formula for Linear Recurrences. - Charles M. Fiduccia (SIAM J. Comput., 1985)

Bussed Interconnection Networks from Trees. - Charles M. Fiduccia (IPPS, 1992)

Bused Hypercubes and Other Pin-Optimal Networks. - Charles M. Fiduccia (IEEE Trans. Parallel Distributed Syst., 1992)

Pin-efficient networks for cubic neighborhoods. - Charles M. Fiduccia; Kevin J. Rappoport (SPDP, 1994)

Universality of Iterated Networks. - Robert F. Chamberlain; Charles M. Fiduccia (Math. Syst. Theory, 1994)

Perfect Shifters. - Charles M. Fiduccia; Kevin J. Rappoport (IEEE Trans. Computers, 1994)

Edge Congestion of Shortest Path Systems for All-to-All Communication. - Charles M. Fiduccia; Paul J. Hedrick (IEEE Trans. Parallel Distributed Syst., 1997)

Dot product representations of graphs. - Charles M. Fiduccia; Edward R. Scheinerman; Ann N. Trenk; Jennifer S. Zito (Discret. Math., 1998)

Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian Groups. - Charles M. Fiduccia; Rodney W. Forcade; Jennifer S. Zito (SIAM J. Discret. Math., 1998)