Charles M. Fiduccia

According to our database, Charles M. Fiduccia authored at least 15 papers between 1971 and 1998.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

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

Dot product representations of graphs.

Charles M. Fiduccia, Edward R. Scheinerman, Ann N. Trenk, Jennifer S. Zito

Discret. Math., 1998

1997

Edge Congestion of Shortest Path Systems for All-to-All Communication.

Charles M. Fiduccia, Paul J. Hedrick

IEEE Trans. Parallel Distributed Syst., 1997

1994

Perfect Shifters.

Charles M. Fiduccia, Kevin J. Rappoport

IEEE Trans. Computers, 1994

Pin-efficient networks for cubic neighborhoods.

Charles M. Fiduccia, Kevin J. Rappoport

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

1992

Bused Hypercubes and Other Pin-Optimal Networks.

Charles M. Fiduccia

IEEE Trans. Parallel Distributed Syst., 1992

Universality of Iterated Networks.

Robert F. Chamberlain, Charles M. Fiduccia

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

Bussed Interconnection Networks from Trees.

Charles M. Fiduccia

Proceedings of the 6th International Parallel Processing Symposium, 1992

1985

An Efficient Formula for Linear Recurrences.

Charles M. Fiduccia

SIAM J. Comput., 1985

1982

A "greedy" channel router.

Ronald L. Rivest, Charles M. Fiduccia

Proceedings of the 19th Design Automation Conference, 1982

A linear-time heuristic for improving network partitions.

Charles M. Fiduccia, Robert M. Mattheyses

Proceedings of the 19th Design Automation Conference, 1982

1977

Algebras Having Linear Multiplicative Complexities.

Charles M. Fiduccia, Yechezkel Zalcstein

J. ACM, 1977

1972

Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform Revisited

Charles M. Fiduccia

Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

On Obtaining Upper Bounds on the Complexity of Matrix Multiplication.

Charles M. Fiduccia

Proceedings of a symposium on the Complexity of Computer Computations, 1972

1971

Fast Matrix Multiplication

Charles M. Fiduccia

Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971