Routing (electronic design automation) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Routing (electronic design automation)" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
1st place
1st place
11th place
8th place
14th place
14th place
1,185th place
840th place
5th place
5th place
70th place
63rd place
120th place
125th place
3rd place
3rd place
low place
6,473rd place
652nd place
515th place
low place
low place
low place
low place
low place
low place
7,670th place
5,196th place
low place
low place
low place
low place
low place
6,771st place
low place
low place
low place
low place
1,131st place
850th place

acm.org

portal.acm.org

dl.acm.org

archive.today

books.google.com

computerwoche.de

doi.org

  • Garey, M. R.; Johnson, D. S. (1977). "The Rectilinear Steiner Tree Problem is NP-Complete". SIAM Journal on Applied Mathematics. 32 (4): 826–834. doi:10.1137/0132071. ISSN 0036-1399.
  • Szymanski, Thomas G. (1985). "Dogleg Channel Routing is NP-Complete". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 4 (1): 31–41. doi:10.1109/tcad.1985.1270096. S2CID 17511882.
  • Lee, Chester Y. (September 1961). "An algorithm for path connections and its applications". IRE Transactions on Electronic Computers. EC-10 (3): 346–365. doi:10.1109/TEC.1961.5219222. S2CID 40700386.
  • Hadlock, Frank O. (1977-12-01). "A shortest path algorithm for grid graphs". Networks. 7 (4): 323–334. doi:10.1002/net.3230070404.
  • Hightower, David W. (1969). "A solution to line-routing problems on the continuous plane". DAC'69: Proceedings of the 6th Annual Conference on Design Automation. ACM Press. pp. 1–24. doi:10.1145/800260.809014. (NB. This contains one of the first descriptions of a "line probe router".)
  • Reed, James B.; Sangiovanni-Vincentelli, Alberto; Santamauro, Mauro (1985). "A new symbolic channel router: YACR2". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 4 (3): 203–219. doi:10.1109/TCAD.1985.1270117. S2CID 17065773. [1]
  • Finch, Alan C.; Mackenzie, Ken J.; Balsdon, G. J.; Symonds, G. (1985-06-23). "A Method for Gridless Routing of Printed Circuit Boards". 22nd ACM/IEEE Design Automation Conference (PDF). Newtown, Tewkesbury, Gloucestershire, UK: Racal-Redac Ltd. pp. 509–515. doi:10.1109/DAC.1985.1585990. ISBN 0-8186-0635-5. ISSN 0738-100X. Archived (PDF) from the original on 2018-10-22. Retrieved 2018-10-22.
  • Linsker, Ralph (1984). "An iterative-improvement penalty-function-driven wire routing system" (PDF). IBM Journal of Research and Development. 28 (5): 613–624. doi:10.1147/rd.285.0613.

downloadmienphi.net

s1.downloadmienphi.net

eah-jena.de

web.eah-jena.de

edn.com

ibm.com

research.ibm.com

ieee.org

ieeexplore.ieee.org

loc.gov

lccn.loc.gov

researchgate.net

semanticscholar.org

api.semanticscholar.org

pdfs.semanticscholar.org

semiwiki.com

siam.org

epubs.siam.org

  • Garey, M. R.; Johnson, D. S. (1977). "The Rectilinear Steiner Tree Problem is NP-Complete". SIAM Journal on Applied Mathematics. 32 (4): 826–834. doi:10.1137/0132071. ISSN 0036-1399.

simplifyda.com

speedingedge.com

web.archive.org

worldcat.org

search.worldcat.org

  • Garey, M. R.; Johnson, D. S. (1977). "The Rectilinear Steiner Tree Problem is NP-Complete". SIAM Journal on Applied Mathematics. 32 (4): 826–834. doi:10.1137/0132071. ISSN 0036-1399.
  • Finch, Alan C.; Mackenzie, Ken J.; Balsdon, G. J.; Symonds, G. (1985-06-23). "A Method for Gridless Routing of Printed Circuit Boards". 22nd ACM/IEEE Design Automation Conference (PDF). Newtown, Tewkesbury, Gloucestershire, UK: Racal-Redac Ltd. pp. 509–515. doi:10.1109/DAC.1985.1585990. ISBN 0-8186-0635-5. ISSN 0738-100X. Archived (PDF) from the original on 2018-10-22. Retrieved 2018-10-22.

york.ac.uk

cs.york.ac.uk

zuken.com

blog.zuken.com