Ted H. Szymanski - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 51 from 51

2022

The "Cyber Security via Determinism" Paradigm for a Quantum Safe Zero Trust Deterministic Internet of Things (IoT)Ted H. Szymanski. access, 10:45893-45930, 2022. [doi]

2017

Security and Privacy for a Green Internet of ThingsTed H. Szymanski. itpro, 19(5):34-41, 2017. [doi]

2016

2015

An Analysis of Hypermesh NoCs in FPGAsMohammadreza Binesh Marvasti, Ted H. Szymanski. tpds, 26(10):2643-2656, 2015. [doi]

Demonstration of an FPGA controller for guaranteed-rate optical packet switchingMaryam Rezaee, Ted H. Szymanski. im 2015: 1139-1140 [doi]

An FPGA controller for deterministic guaranteed-rate optical packet switchingTed H. Szymanski, Maryam Rezaee. im 2015: 1177-1183 [doi]

2013

Max-Flow Min-Cost Routing in a Future-Internet with Improved QoS GuaranteesTed H. Szymanski. tcom, 61(4):1485-1497, 2013. [doi]

2012

2011

Video Multicasting in an Autonomic Future Internet with Essentially-Perfect Throughput and QoS GuaranteesTed H. Szymanski. new2an 2011: 608-619 [doi]

2010

Design of an IPTV Multicast System for Internet Backbone NetworksTed H. Szymanski, Dave Gilbert. ijdmbc, 2010, 2010. [doi]

2009

2006

Reducing the Instruction Queue Leakage Power in Superscalar ProcessorsHouman Homayoun, Ted H. Szymanski. ccece 2006: 1685-1689 [doi]

QNA Reloaded - A Tool for Traffic Engineering in Medical Grade NetworksTed H. Szymanski, Dave Gilbert. pdcn 2006: 157-167

2005

Power complexity of multiplexer-based optoelectronic crossbar switchesTed H. Szymanski, Honglin Wu, Amir Gourgy. tvlsi, 13(5):604-617, 2005. [doi]

2004

Credit-based fair scheduling for input-queued switchesAmir Gourgy, Honglin Wu, Ted H. Szymanski. icc 2004: 1973-1978 [doi]

2003

Gravity: Fast placement for 3-D VLSIStefan Thomas Obenaus, Ted H. Szymanski. todaes, 8(3):298-315, 2003. [doi]

An Optoelectronic Multi-Terabit CMOS Switch Core for Local Area NetworksHonglin Wu, Amir Gourgy, Ted H. Szymanski. lcn 2003: 568-576 [doi]

Low power high speed I/O interfaces in 0.18 μm CMOSYing Yan, Ted H. Szymanski. icecsys 2003: 826-829 [doi]

1999

Fast computational techniques for indoor radio channel estimationMarc Kimpe, Harry Leib, Olivier Maquelin, Ted H. Szymanski. cse, 1(1):31-41, 1999. [doi]

Placements Benchmarks for 3-D VLSIStefan Thomas Obenaus, Ted H. Szymanski. ifip10-5 2000: 447-455

1998

Architecture of a Terabit Free-Space Intelligent Optical BackplaneTed H. Szymanski, H. Scott Hinton. jpdc, 55(1):1-31, 1998.

1997

Embeddings of Star Graphs into Optical Meshes without BendsStefan Thomas Obenaus, Ted H. Szymanski. jpdc, 44(2):97-106, 1997.

Design Principles for Practical Self-Routing Nonblocking Switching Networks with O(N log N) Bit-ComplexityTed H. Szymanski. TC, 46(10):1057-1069, 1997.

1995

Hypermeshes : Optical Intercomnnection Network for Parallel ComputingTed H. Szymanski. jpdc, 26(1):1-23, 1995.

Randomized routing of virtual connections in essentially nonblocking log N-depth networksTed H. Szymanski, Chien Fang. tcom, 43(9):2521-2531, 1995. [doi]

1992

The Complexity of FFT and Related Butterfly Algorithms on Meshes and HypermeshesTed H. Szymanski. icpp 1992: 77-81

1991

An Analysis of Deflection Routing in Multi-dimensional Regular Mesh NetworksChien Fang, Ted H. Szymanski. infocom 1991: 859-868

O (log N / log log N) Randomized Routing in Degree-log N Hypermeshes Ted H. Szymanski. icpp 1991: 443-450

Randomized Routing of Virtual Connections in Extended BanyansTed H. Szymanski, Chien Fang. icpp 1991: 451-455

1990

A Comparison of the Shufflenet and the Banyan Topologies for Broadband Packet SwitchesSalman Z. Shaikh, Mischa Schwartz, Ted H. Szymanski. infocom 1990: 1260-1267

A Comparison of Circuit and Packet Switching in a Fiber-Optic HypercubeTed H. Szymanski. icpp 1990: 296-300

An Analysis of Hot-Potato Routing in a Fiber Optic Packet Switched HypercubeTed H. Szymanski. infocom 1990: 918-925

Design and analysis of buffered crossbars and banyans with cut-through switchingTed H. Szymanski, Chien Fang. sc 1990: 264-273 [doi]

1989

On the Permutation Capability of a Circuit-Switched HypercubeTed H. Szymanski. icpp 1989: 103-110

On the Universality of Multipath Multistage Interconnection NetworksTed H. Szymanski, V. Carl Hamacher. jpdc, 7(3):541-569, 1989.

Markov Chain Analysis of Packet-Switched Banyans with Arbitrary Switch Sizes, Queue Sizes, Link Multiplicities and SpeedupsTed H. Szymanski, Salman Z. Shaikh. infocom 1989: 960-971

1987

On the Permutation Capability of Multistage Interconnection NetworksTed H. Szymanski, V. Carl Hamacher. TC, 36(7):810-822, 1987.

Interconnection Network Modelling Using Monte Carlo Methods, Markov Chains and Performance Petri NetsTed H. Szymanski. mcpr 1988: 259-274

Tree Network Performance Analysis Using Monte Carlo Simulation of Performance Petri NetsTed H. Szymanski. pnpm 1987: 126-135

1986

A VLSI Comparison of Switch-Recursive Banyan and Crossbar Interconnection NetworksTed H. Szymanski. icpp 1986: 192-199

On the Universality of Multistage Interconnection NetworksTed H. Szymanski. icpp 1986: 316-323

Sign in or sign up to see more results.

runs on WebDSL