Ted H. Szymanski A Comparison of Circuit and Packet Switching in a Fiber-Optic Hypercube. [Citation Graph (0, 0)][DBLP] ICPP (1), 1990, pp:296-300 [Conf]
Ted H. Szymanski O (log N / log log N) Randomized Routing in Degree-log N "Hypermeshes". [Citation Graph (0, 0)][DBLP] ICPP (1), 1991, pp:443-450 [Conf]
Ted H. Szymanski The Complexity of FFT and Related Butterfly Algorithms on Meshes and Hypermeshes. [Citation Graph (0, 0)][DBLP] ICPP (3), 1992, pp:77-81 [Conf]
Ted H. Szymanski An Analysis of "Hot-Potato" Routing in a Fiber Optic Packet Switched Hypercube. [Citation Graph (0, 0)][DBLP] INFOCOM, 1990, pp:918-925 [Conf]
Ted H. Szymanski, Salman Z. Shaikh Markov Chain Analysis of Packet-Switched Banyans with Arbitrary Switch Sizes, Queue Sizes, Link Multiplicities and Speedups. [Citation Graph (0, 0)][DBLP] INFOCOM, 1989, pp:960-971 [Conf]
Ted H. Szymanski Interconnection Network Modelling Using Monte Carlo Methods, Markov Chains and Performance Petri Nets. [Citation Graph (0, 0)][DBLP] Computer Performance and Reliability, 1987, pp:259-274 [Conf]
Ted H. Szymanski, Dave Gilbert 'QNA Reloaded' - A Tool for Traffic Engineering in Medical Grade Networks. [Citation Graph (0, 0)][DBLP] Parallel and Distributed Computing and Networks, 2006, pp:157-167 [Conf]
Ted H. Szymanski Tree Network Performance Analysis Using Monte Carlo Simulation of Performance Petri Nets. [Citation Graph (0, 0)][DBLP] PNPM, 1987, pp:126-135 [Conf]