메뉴 건너뛰기




Volumn 186, Issue 1-2, 1997, Pages 171-198

On devising Boolean Routing Schemes

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; MATHEMATICAL MODELS; PROGRAM PROCESSORS; TOPOLOGY;

EID: 0031248848     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)86543-7     Document Type: Article
Times cited : (8)

References (10)
  • 2
    • 0346410146 scopus 로고
    • Multi-dimensional Interval Routing Schemes
    • Proc. 9th Internat. Workshop on Distributed Algorithms (WDAG), Springer, Berlin
    • M. Flammini, G. Gambosi, U. Nanni and R.B. Tan, Multi-dimensional Interval Routing Schemes, in: Proc. 9th Internat. Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science, Vol. 972 (Springer, Berlin, 1995).
    • (1995) Lecture Notes in Computer Science , vol.972
    • Flammini, M.1    Gambosi, G.2    Nanni, U.3    Tan, R.B.4
  • 3
    • 0039356043 scopus 로고
    • Boolean routing
    • Proc. 7th Internat. Workshop on Distributed Algorithms (WDAG), Springer, Berlin
    • M. Flammini, G. Gambosi and S. Salomone, Boolean routing, in: Proc. 7th Internat. Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science, Vol. 725 (Springer, Berlin, 1993) 219-233.
    • (1993) Lecture Notes in Computer Science , vol.725 , pp. 219-233
    • Flammini, M.1    Gambosi, G.2    Salomone, S.3
  • 5
    • 3743052727 scopus 로고
    • Designing networks with compact routing tables
    • G.N. Frederickson and R. Janardan, Designing networks with compact routing tables, Algorithmica 3 (1988) 171-190.
    • (1988) Algorithmica , vol.3 , pp. 171-190
    • Frederickson, G.N.1    Janardan, R.2
  • 6
    • 0024716011 scopus 로고
    • Efficient message routing in planar networks
    • G.N. Frederickson and R. Janardan, Efficient message routing in planar networks, SIAM J. Comput. 18 (1989) 843-857.
    • (1989) SIAM J. Comput. , vol.18 , pp. 843-857
    • Frederickson, G.N.1    Janardan, R.2
  • 7
    • 84948131046 scopus 로고
    • On multi-label linear interval routing schemes
    • Proc. 19th Workshop on Graph Theoretic Concepts in Computer Science, Distributed Algorithms (WG), Springer, Berlin
    • E. Kranakis, D. Krizanc and S.S. Ravi, On multi-label linear interval routing schemes, in: Proc. 19th Workshop on Graph Theoretic Concepts in Computer Science, Distributed Algorithms (WG), Lecture Notes in Computer Science, Vol. 790 (Springer, Berlin, 1993) 338-349.
    • (1993) Lecture Notes in Computer Science , vol.790 , pp. 338-349
    • Kranakis, E.1    Krizanc, D.2    Ravi, S.S.3
  • 8
    • 0022013653 scopus 로고
    • Labelling and implicit routing in networks
    • M. Santoro and R. Khatib, Labelling and implicit routing in networks, Comput. J. 28 (1985) 5-8.
    • (1985) Comput. J. , vol.28 , pp. 5-8
    • Santoro, M.1    Khatib, R.2
  • 9
    • 0002804540 scopus 로고
    • Routing with compact routing tables
    • G. Rozemberg and A. Salomaa, eds., Springer, Berlin
    • J. van Leeuwen and R.B. Tan, Routing with compact routing tables, in: G. Rozemberg and A. Salomaa, eds., The Book of L (Springer, Berlin, 1986) 259-273.
    • (1986) The Book of L , pp. 259-273
    • Van Leeuwen, J.1    Tan, R.B.2


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