The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ted H. Szymanski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ted H. Szymanski
    A VLSI Comparison of Switch-Recursive Banyan and Crossbar Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    ICPP, 1986, pp:192-199 [Conf]
  2. Ted H. Szymanski
    On the Universality of Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    ICPP, 1986, pp:316-323 [Conf]
  3. Ted H. Szymanski
    On the Permutation Capability of a Circuit-Switched Hypercube. [Citation Graph (0, 0)][DBLP]
    ICPP (1), 1989, pp:103-110 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. Ted H. Szymanski, Chien Fang
    Randomized Routing of Virtual Connections in Extended Banyans. [Citation Graph (0, 0)][DBLP]
    ICPP (1), 1991, pp:451-455 [Conf]
  8. Stefan Thomas Obenaus, Ted H. Szymanski
    Placements Benchmarks for 3-D VLSI. [Citation Graph (0, 0)][DBLP]
    VLSI, 1999, pp:447-455 [Conf]
  9. Chien Fang, Ted H. Szymanski
    An Analysis of Deflection Routing in Multi-dimensional Regular Mesh Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1991, pp:859-868 [Conf]
  10. Salman Z. Shaikh, Mischa Schwartz, Ted H. Szymanski
    A Comparison of the Shufflenet and the Banyan Topologies for Broadband Packet Switches. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1990, pp:1260-1267 [Conf]
  11. 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]
  12. 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]
  13. Honglin Wu, Amir Gourgy, Ted H. Szymanski
    An Optoelectronic Multi-Terabit CMOS Switch Core for Local Area Networks. [Citation Graph (0, 0)][DBLP]
    LCN, 2003, pp:568-576 [Conf]
  14. 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]
  15. 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]
  16. 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]
  17. Ted H. Szymanski, Chien Fang
    Design and analysis of buffered crossbars and banyans with cut-through switching. [Citation Graph (0, 0)][DBLP]
    SC, 1990, pp:264-273 [Conf]
  18. Stefan Thomas Obenaus, Ted H. Szymanski
    Embeddings of Star Graphs into Optical Meshes without Bends. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1997, v:44, n:2, pp:97-106 [Journal]
  19. Ted H. Szymanski
    "Hypermeshes": Optical Intercomnnection Network for Parallel Computing. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:26, n:1, pp:1-23 [Journal]
  20. Ted H. Szymanski, V. Carl Hamacher
    On the Universality of Multipath Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1989, v:7, n:3, pp:541-569 [Journal]
  21. Ted H. Szymanski, H. Scott Hinton
    Architecture of a Terabit Free-Space Intelligent Optical Backplane. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:55, n:1, pp:1-31 [Journal]
  22. Ted H. Szymanski
    Design Principles for Practical Self-Routing Nonblocking Switching Networks with O(N log N) Bit-Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1997, v:46, n:10, pp:1057-1069 [Journal]
  23. Ted H. Szymanski, V. Carl Hamacher
    On the Permutation Capability of Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1987, v:36, n:7, pp:810-822 [Journal]
  24. Stefan Thomas Obenaus, Ted H. Szymanski
    Gravity: Fast placement for 3-D VLSI. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Design Autom. Electr. Syst., 2003, v:8, n:3, pp:298-315 [Journal]
  25. Ted H. Szymanski, Honglin Wu, Amir Gourgy
    Power complexity of multiplexer-based optoelectronic crossbar switches. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. VLSI Syst., 2005, v:13, n:5, pp:604-617 [Journal]
  26. Houman Homayoun, Ted H. Szymanski
    Reducing the Instruction Queue Leakage Power in Superscalar Processors. [Citation Graph (0, 0)][DBLP]
    CCECE, 2006, pp:1685-1689 [Conf]

  27. Power analysis of Input-Queued and Crosspoint-Queued crossbar switches. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002