메뉴 건너뛰기




Volumn , Issue , 2012, Pages 709-716

Confidentiality preserving integer programming for global routing

Author keywords

global routing; integer programming; security

Indexed keywords

CONNECTIVITY INFORMATION; DESIGN INFORMATION; DISTRIBUTED NETWORKS; GLOBAL ROUTING; INDUSTRY BENCHMARKS; INTEGER LINEAR PROGRAMS; MULTIPLE TRANSFORMATION; PROBLEM INSTANCES; RUNTIME OVERHEADS; SECURITY;

EID: 84863541909     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2228360.2228487     Document Type: Conference Paper
Times cited : (7)

References (14)
  • 1
    • 77954695824 scopus 로고    scopus 로고
    • Top Threats to Cloud Computing, Cloud Security Alliance, 2010, https://cloudsecurityalliance.org/topthreats/csathreats.v1.0.pdf.
    • (2010) Top Threats to Cloud Computing
  • 2
    • 84863545311 scopus 로고    scopus 로고
    • What Cloud Computing Offers the Electronic Design Community
    • June
    • What Cloud Computing Offers the Electronic Design Community, EETimes, June 2011, https://eetimes.com/discussion/other/4217127/.
    • (2011) EETimes
  • 3
    • 65849350514 scopus 로고    scopus 로고
    • BoxRouter 2.0: A hybrid and robust global router with layer assignment for routability
    • M. Cho, K. Lu, K. Yuan, and D. Z. Pan. BoxRouter 2.0: A hybrid and robust global router with layer assignment for routability. ACM TODAES, 14(2), 2009.
    • (2009) ACM TODAES , vol.14 , Issue.2
    • Cho, M.1    Lu, K.2    Yuan, K.3    Pan, D.Z.4
  • 4
    • 73649127310 scopus 로고    scopus 로고
    • Improving practical performance on secure and private collaborative linear programming
    • R. Deitos and F. Kerschbaum. Improving practical performance on secure and private collaborative linear programming. In DEXA Workshops, pp. 122-126, 2009.
    • (2009) DEXA Workshops , pp. 122-126
    • Deitos, R.1    Kerschbaum, F.2
  • 5
    • 84856186159 scopus 로고    scopus 로고
    • Practical secure and efficient multiparty linear programming based on problem transformation
    • ePrint Archive
    • J. Dreier and F. Kerschbaum. Practical secure and efficient multiparty linear programming based on problem transformation. IACR Cryptology ePrint Archive, p. 108, 2011.
    • (2011) IACR Cryptology , pp. 108
    • Dreier, J.1    Kerschbaum, F.2
  • 6
    • 79960248419 scopus 로고    scopus 로고
    • Efficient distributed linear programming with limited disclosure
    • Y. Hong, J. Vaidya, and Haibing Lu. Efficient distributed linear programming with limited disclosure. In DBSec, pp. 170-185, 2011.
    • (2011) DBSec , pp. 170-185
    • Hong, Y.1    Vaidya, J.2    Lu, H.3
  • 7
  • 8
    • 0036054578 scopus 로고    scopus 로고
    • Watermarking integer linear programming solutions
    • S. Megerian, M. Drinic, and M. Potkonjak. Watermarking integer linear programming solutions. In DAC, pp. 8-13, 2002.
    • (2002) DAC , pp. 8-13
    • Megerian, S.1    Drinic, M.2    Potkonjak, M.3
  • 9
    • 84855803215 scopus 로고    scopus 로고
    • Congestion analysis for global routing via Integer Programming
    • H. Shojaei, A. Davoodi, and J. Linderoth. Congestion analysis for global routing via Integer Programming. In ICCAD, pp. 256-262, 2011.
    • (2011) ICCAD , pp. 256-262
    • Shojaei, H.1    Davoodi, A.2    Linderoth, J.3
  • 10
    • 47549100672 scopus 로고    scopus 로고
    • On routing in vlsi design and communication networks
    • Tamás Terlaky, Anthony Vannelli, and Hu Zhang. On routing in vlsi design and communication networks. Discrete Applied Mathematics, 156(11):2178-2194, 2008.
    • (2008) Discrete Applied Mathematics , vol.156 , Issue.11 , pp. 2178-2194
    • Terlaky, T.1    Vannelli, A.2    Zhang, H.3
  • 11
    • 0347761321 scopus 로고    scopus 로고
    • Optimization-intensive watermarking techniques for decision problems
    • J. L. Wong, G. Qu, and M. Potkonjak. Optimization-intensive watermarking techniques for decision problems. IEEE TCAD, 23(1):119-127, 2004.
    • (2004) IEEE TCAD , vol.23 , Issue.1 , pp. 119-127
    • Wong, J.L.1    Qu, G.2    Potkonjak, M.3
  • 12
    • 77956220102 scopus 로고    scopus 로고
    • A parallel integer programming technique to global routing
    • T.-H. Wu, A. Davoodi, and J. T. Linderoth. A parallel integer programming technique to global routing. In DAC, pp. 194-199, 2010.
    • (2010) DAC , pp. 194-199
    • Wu, T.-H.1    Davoodi, A.2    Linderoth, J.T.3
  • 13
    • 84863241649 scopus 로고    scopus 로고
    • GRIP: Global Routing via Integer Programming
    • T.-H. Wu, A. Davoodi, and J. T. Linderoth. GRIP: Global Routing via Integer Programming. IEEE TCAD, 30(1):72-84, 2011.
    • (2011) IEEE TCAD , vol.30 , Issue.1 , pp. 72-84
    • Wu, T.-H.1    Davoodi, A.2    Linderoth, J.T.3
  • 14
    • 64549091868 scopus 로고    scopus 로고
    • Fastroute 4.0: Global router with efficient via minimization
    • Y. Xu, Y. Zhang, and C. Chu. Fastroute 4.0: global router with efficient via minimization. In ASPDAC, pp. 576-581, 2009.
    • (2009) ASPDAC , pp. 576-581
    • Xu, Y.1    Zhang, Y.2    Chu, C.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.