Charles M. Fiduccia

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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1998
Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian Groups.
SIAM J. Discret. Math., 1998

Dot product representations of graphs.
Discret. Math., 1998

1997
Edge Congestion of Shortest Path Systems for All-to-All Communication.
IEEE Trans. Parallel Distributed Syst., 1997

1994
Perfect Shifters.
IEEE Trans. Computers, 1994

Universality of Iterated Networks.
Math. Syst. Theory, 1994

Pin-efficient networks for cubic neighborhoods.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

1992
Bused Hypercubes and Other Pin-Optimal Networks.
IEEE Trans. Parallel Distributed Syst., 1992

Bussed Interconnection Networks from Trees.
Proceedings of the 6th International Parallel Processing Symposium, 1992

1985
An Efficient Formula for Linear Recurrences.
SIAM J. Comput., 1985

1982
A "greedy" channel router.
Proceedings of the 19th Design Automation Conference, 1982

A linear-time heuristic for improving network partitions.
Proceedings of the 19th Design Automation Conference, 1982

1977
Algebras Having Linear Multiplicative Complexities.
J. ACM, 1977

1972
Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform Revisited
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

On Obtaining Upper Bounds on the Complexity of Matrix Multiplication.
Proceedings of a symposium on the Complexity of Computer Computations, 1972

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


  Loading...