
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Stephan Olariu, Albert Y. Zomaya, "A Time and CostOptimal Algorithm for Interlocking SetsWith Applications," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 10, pp. 10091025, October, 1996.  
BibTex  x  
@article{ 10.1109/71.539733, author = {Stephan Olariu and Albert Y. Zomaya}, title = {A Time and CostOptimal Algorithm for Interlocking SetsWith Applications}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {10}, issn = {10459219}, year = {1996}, pages = {10091025}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.539733}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A Time and CostOptimal Algorithm for Interlocking SetsWith Applications IS  10 SN  10459219 SP1009 EP1025 EPD  10091025 A1  Stephan Olariu, A1  Albert Y. Zomaya, PY  1996 KW  Circuit design KW  routing KW  CAD KW  VLSI KW  parallel algorithms KW  lower bounds KW  timeoptimal algorithms. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Given a family
[1] M. Ajtai, J. Komlos, and E. Szemeredi, "Sorting in c log n Parallel Steps," Combinatorica, vol. 3, pp. 119, 1983.
[2] S.G. Akl, The Design and Analysis of Parallel Algorithms. Orlando, Fl.: Academic Press, 1989.
[3] R.J. Anderson and G.L. Miller, "Deterministic Parallel List Ranking," Algorithmica, vol. 6, pp. 859868, 1991.
[4] M. Barbehenn and S. Hutchinson, “Efficient Search and Hierarchical Motion Planning by Dynamically Maintaining SingleSource Shortest Path Trees,” IEEE Trans. Robotics and Automation, vol. 11, no. 2, pp. 198214, 1995.
[5] R. Cole, "Parallel Merge Sort," SIAM J. Computing, vol. 17, pp. 770785, 1988.
[6] R. Cole and U. Vishkin, "Approximate Parallel Scheduling. Part 1: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time," SIAM J. Computing, vol. 18, pp. 128142, 1988.
[7] S.A. Cook, C. Dwork, and R. Reischuk, "Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes," SIAM J. Computing, vol. 15, pp. 8797, 1986.
[8] D. Dobkin and R. Lipton, "On the Complexity of Computations Under Varying Set of Primitives," J. Computer and Information Sciences, vol. 18, pp. 8691, 1979.
[9] E. Dekel and S. Sahni, "Parallel Scheduling Algorithms," Operations Research, vol. 31, pp. 2449, 1983.
[10] S. Ghosal and R. Mehrotra, "Segmentation of Range Images: An Orthogonal MomentBased Integrated Approach," IEEE Trans. Robotics and Automation, vol. 9, pp. 385389, 1993.
[11] U.I. Gupta, D.T. Lee, and J.Y.T. Leung, "An Optimal Solution for the Channel Assignment Problem," IEEE Trans. Computers, vol. 28, pp. 807810, 1979.
[12] J. JáJá, An Introduction to Parallel Algorithms.Reading, Mass.: AddisonWesley, 1991.
[13] S.K. Kim, "Optimal Parallel Algorithms on Sorted Intervals," Proc. 27th Ann. Allerton Conf. Comm., Control, and Computing, pp. 766774, 1988.
[14] J.C. Latombe, Robot Motion Planning, Kluwer Academic Publishers, Boston, 1991.
[15] E.L. Lloyd, "A Fast Algorithm for Finding Interlocking Sets," Information Processing Letters, vol. 32, pp. 4750, 1989.
[16] E. Lodi and L. Pagli, "A VLSI Solution to the Vertical Segment Visibility Problem," IEEE Trans. Computers, vol. 35, pp. 923928, 1986.
[17] C. Mead and L. Conway, Introduction to VLSI Systems, AddisonWesley, Reading, Mass., 1980.
[18] S. Olariu, J.L. Schwing, and J. Zhang, "Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals," IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 364373, 1992.
[19] F.P. Preparata and M.I. Shamos, Computational Geometry. SpringerVerlag, 1985.
[20] Physical Design Automation of VLSI Systems, B.T. Preas and M.J. Lorenzetti, eds. Menlo Park, Calif.: BenjaminCummings, 1988.
[21] M.J. Quinn, Parallel Computing: Theory and Practice.New York: McGrawHill, 1994.
[22] R. Raghavan and S. Sahni, "Single Row Routing," IEEE Trans. Computers, vol. 32, pp. 209220, 1983.
[23] R. Raghavan and S. Sahni, "On the Complexity of Single Row Routing," IEEE Trans. Circuits and Systems, vol. 31, pp. 462472, 1984.
[24] N.S.V. Rao, W. Wu, and C.W. Glover, "Algorithms for Recognizing Planar Polygonal Configurations Using Perspective Images," IEEE Trans. Robotics and Automation, vol. 8, pp. 480486, 1992.
[25] S. Saxena and V.C. Prasad, "On Single Row Routing," IEEE Trans. Circuits and Systems, vol. 36, pp. 1,0291,032, 1989.
[26] H.C. So, "Some Theoretical Results on the Routing of Multilayer Printed Circuit Boards," Proc. IEEE Int'l Symp. Circuits and Systems, pp. 296303,San Francisco, 1974.
[27] F. Springsteel and I. Stojmenovic, "Parallel General Prefix Computations with Geometric, Algebraic, and Other Applications," Proc. Int'l Conf. Fundamentals of Computation Theory, pp. 424433,Szeged, Hungary, SpringerVerlag, Aug. 1989.
[28] B.S. Ting, E.S. Kuh, and I. Shirakawa, "The Multilayer Routing Problem: Algorithms and Necessary and Sufficient Conditions for Single Row Single Layer Case," IEEE Trans. Circuits and Systems, vol. 23, pp. 768778, 1976.
[29] S. Tsukiyama, E.S. Kuh, and I. Shirakawa, "An Algorithm for SingleRow Routing with Prescribed Street Congestions," IEEE Trans. Circuits and Systems, vol. 27, pp. 765771, 1980.