Charles M. Fiduccia - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 16 from 16

1998

Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian GroupsCharles M. Fiduccia, Rodney W. Forcade, Jennifer S. Zito. siamdm, 11(1):157-167, 1998. [doi]

Dot product representations of graphsCharles M. Fiduccia, Edward R. Scheinerman, Ann N. Trenk, Jennifer S. Zito. DM, 181(1-3):113-138, 1998. [doi]

1997

Edge Congestion of Shortest Path Systems for All-to-All CommunicationCharles M. Fiduccia, Paul J. Hedrick. tpds, 8(10):1043-1054, 1997. [doi]

1994

Universality of Iterated NetworksRobert F. Chamberlain, Charles M. Fiduccia. mst, 27(5):381-430, 1994.

Perfect ShiftersCharles M. Fiduccia, Kevin J. Rappoport. TC, 43(3):340-349, 1994.

Pin-efficient networks for cubic neighborhoodsCharles M. Fiduccia, Kevin J. Rappoport. spdp 1994: 402-408 [doi]

1992

Universality of Iterated NetworksRobert F. Chamberlain, Charles M. Fiduccia. spaa 1992: 80-89 [doi]

Bussed Interconnection Networks from TreesCharles M. Fiduccia. ipps 1992: 380-389

Bused Hypercubes and Other Pin-Optimal NetworksCharles M. Fiduccia. tpds, 3(1):14-24, 1992. [doi]

1985

An Efficient Formula for Linear RecurrencesCharles M. Fiduccia. SICOMP, 14(1):106-112, 1985.

1982

A linear-time heuristic for improving network partitionsCharles M. Fiduccia, Robert M. Mattheyses. dac 1982: 175-181 [doi]

A "greedy" channel routerRonald L. Rivest, Charles M. Fiduccia. dac 1982: 418-424 [doi]

1977

Algebras Having Linear Multiplicative ComplexitiesCharles M. Fiduccia, Yechezkel Zalcstein. JACM, 24(2):311-331, 1977. [doi]

1972

Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform RevisitedCharles M. Fiduccia. stoc 1972: 88-93

On Obtaining Upper Bounds on the Complexity of Matrix MultiplicationCharles M. Fiduccia. coco 1972: 31-40

1971

Fast Matrix MultiplicationCharles M. Fiduccia. stoc 1971: 45-49

Sign in or sign up to see more results.

runs on WebDSL