2009 |
27 | EE | Amir Gourgy,
Ted H. Szymanski:
Cooperative Token-Ring Scheduling For Input-Queued Switches.
IEEE Trans. Computers 58(3): 351-364 (2009) |
2006 |
26 | EE | Houman Homayoun,
Ted H. Szymanski:
Reducing the Instruction Queue Leakage Power in Superscalar Processors.
CCECE 2006: 1685-1689 |
25 | | Ted H. Szymanski,
Dave Gilbert:
'QNA Reloaded' - A Tool for Traffic Engineering in Medical Grade Networks.
Parallel and Distributed Computing and Networks 2006: 157-167 |
2005 |
24 | EE | Ted H. Szymanski,
Honglin Wu,
Amir Gourgy:
Power complexity of multiplexer-based optoelectronic crossbar switches.
IEEE Trans. VLSI Syst. 13(5): 604-617 (2005) |
2003 |
23 | EE | Honglin Wu,
Amir Gourgy,
Ted H. Szymanski:
An Optoelectronic Multi-Terabit CMOS Switch Core for Local Area Networks.
LCN 2003: 568-576 |
22 | EE | Stefan Thomas Obenaus,
Ted H. Szymanski:
Gravity: Fast placement for 3-D VLSI.
ACM Trans. Design Autom. Electr. Syst. 8(3): 298-315 (2003) |
1999 |
21 | | Stefan Thomas Obenaus,
Ted H. Szymanski:
Placements Benchmarks for 3-D VLSI.
VLSI 1999: 447-455 |
1998 |
20 | | Ted H. Szymanski,
H. Scott Hinton:
Architecture of a Terabit Free-Space Intelligent Optical Backplane.
J. Parallel Distrib. Comput. 55(1): 1-31 (1998) |
1997 |
19 | | Ted H. Szymanski:
Design Principles for Practical Self-Routing Nonblocking Switching Networks with O(N log N) Bit-Complexity.
IEEE Trans. Computers 46(10): 1057-1069 (1997) |
18 | | Stefan Thomas Obenaus,
Ted H. Szymanski:
Embeddings of Star Graphs into Optical Meshes without Bends.
J. Parallel Distrib. Comput. 44(2): 97-106 (1997) |
1995 |
17 | | Ted H. Szymanski:
"Hypermeshes": Optical Intercomnnection Network for Parallel Computing.
J. Parallel Distrib. Comput. 26(1): 1-23 (1995) |
1992 |
16 | | Ted H. Szymanski:
The Complexity of FFT and Related Butterfly Algorithms on Meshes and Hypermeshes.
ICPP (3) 1992: 77-81 |
1991 |
15 | | Ted H. Szymanski:
O (log N / log log N) Randomized Routing in Degree-log N "Hypermeshes".
ICPP (1) 1991: 443-450 |
14 | | Ted H. Szymanski,
Chien Fang:
Randomized Routing of Virtual Connections in Extended Banyans.
ICPP (1) 1991: 451-455 |
13 | | Chien Fang,
Ted H. Szymanski:
An Analysis of Deflection Routing in Multi-dimensional Regular Mesh Networks.
INFOCOM 1991: 859-868 |
1990 |
12 | | Ted H. Szymanski:
A Comparison of Circuit and Packet Switching in a Fiber-Optic Hypercube.
ICPP (1) 1990: 296-300 |
11 | | Salman Z. Shaikh,
Mischa Schwartz,
Ted H. Szymanski:
A Comparison of the Shufflenet and the Banyan Topologies for Broadband Packet Switches.
INFOCOM 1990: 1260-1267 |
10 | | Ted H. Szymanski:
An Analysis of "Hot-Potato" Routing in a Fiber Optic Packet Switched Hypercube.
INFOCOM 1990: 918-925 |
9 | EE | Ted H. Szymanski,
Chien Fang:
Design and analysis of buffered crossbars and banyans with cut-through switching.
SC 1990: 264-273 |
1989 |
8 | | Ted H. Szymanski:
On the Permutation Capability of a Circuit-Switched Hypercube.
ICPP (1) 1989: 103-110 |
7 | | Ted H. Szymanski,
Salman Z. Shaikh:
Markov Chain Analysis of Packet-Switched Banyans with Arbitrary Switch Sizes, Queue Sizes, Link Multiplicities and Speedups.
INFOCOM 1989: 960-971 |
6 | | Ted H. Szymanski,
V. Carl Hamacher:
On the Universality of Multipath Multistage Interconnection Networks.
J. Parallel Distrib. Comput. 7(3): 541-569 (1989) |
1987 |
5 | | Ted H. Szymanski:
Interconnection Network Modelling Using Monte Carlo Methods, Markov Chains and Performance Petri Nets.
Computer Performance and Reliability 1987: 259-274 |
4 | | Ted H. Szymanski:
Tree Network Performance Analysis Using Monte Carlo Simulation of Performance Petri Nets.
PNPM 1987: 126-135 |
3 | | Ted H. Szymanski,
V. Carl Hamacher:
On the Permutation Capability of Multistage Interconnection Networks.
IEEE Trans. Computers 36(7): 810-822 (1987) |
1986 |
2 | | Ted H. Szymanski:
A VLSI Comparison of Switch-Recursive Banyan and Crossbar Interconnection Networks.
ICPP 1986: 192-199 |
1 | | Ted H. Szymanski:
On the Universality of Multistage Interconnection Networks.
ICPP 1986: 316-323 |