Switchbox routing in VLSI design: Closing the complexity gap

Author： Hartmann S. Schaffter M.W. Schulz A.S.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.203, Iss.1, 1998-08, pp. : 31-49

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

EXPIDER: A Channel Routing Expert for VLSI Design

By Shen D.-L. Wu C.-H. Lee S.-J.

Expert Systems with Applications, Vol. 12, Iss. 2, 1997-01 ,pp. : 209-223

Elsevier

Access to resources Recommend Favorite

VLSI implementation of greedy-based distributed routing schemes for ad hoc networks

By Aloisio Alberto Izzo Vincenzo Rampone Salvatore

Soft Computing, Vol. 11, Iss. 9, 2007-07 ,pp. : 865-872

Springer Publishing Company

Access to resources Recommend Favorite

Foundations for Applications of Gibbs Derivatives in Logic Design and VLSI

By Stanković Radomir S. Stanković Milena

VLSI Design, Vol. 14, Iss. 1, 2002-01 ,pp. : 65-81

Taylor & Francis Ltd

Access to resources Recommend Favorite

VLSI Design Special Issue on Semiconductor Device Modeling

By Gardner C.L.

VLSI Design, Vol. 15, Iss. 4, 2002-01 ,pp. : 679-679

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the complexity of multi-dimensional interval routing schemes

By Ruzicka P. Stefankovic D.

Theoretical Computer Science, Vol. 245, Iss. 2, 2000-08 ,pp. : 255-280

Elsevier

Access to resources Recommend Favorite