On finding non-intersecting paths in grids and its application in reconfiguring VLSI/WSI arrays

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1990, Pages 454-464

  Roychowdhury, Vwani P ^a   Bruck, Jehoshua ^b  

^a STANFORD UNIVERSITY   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

ALGORITHM FOR SOLVING; GEOMETRICAL PROBLEMS; ITS APPLICATIONS; LINE START; POLYNOMIAL-TIME ALGORITHMS; RECONFIGURABLE PROCESSORS; TIME COMPLEXITY;

VLSI CIRCUITS;

EID: 0345750456     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. J. W. Greene and A. El Gamal. Configuration of VLSI Arrays in the presence of defects. JACM, 31, No. 4:694-717, October 1984.
2. H. Imai and T. Asano. Efficient Algorithms for Geometric Graph Search Problems. SIAM Journal on Computing, 15, No. 2:478-494, May 1986.
3. S. N. Jean and S. Y. Kung. Necessary and Sufficient Conditions for Reconfigurability in Singletrack switch WSI Arrays. Appeared in Proc. of Int. Conf. on Wafer Scale Integration, January 1989.
4. S. Y. Kung, S. N. Jean, and C. W. Chang. Fault-Tolerant Array Processors Using Singletrack Switches. IEEE Trans, on Computers, 38, No. 4:501-514, April 1989.
5. T. Leighton and C. E. Leiserson. Wafer-Scale Integration of Systolic arrays. IEEE Trans, on Computers, C-34, No. 5:448-461, May 1985.
6. M. Sami and R. Stefanelli. Reconfigurable architectures for VLSI processing arrays. Proc. of the IEEE, pages 712-722, May 1986.
7. D. P. Siewiorek and R. S. Swarz. The Theory and Practice of Reliable System Design. Digital Press, 1982.