LOOP-FREE THRESHOLD ELEMENT STRUCTURES

被引：0
|
作者：
MOW, CW
FU, KS
机构：
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1969年 / C 18卷 / 03期
关键词：
D O I：
10.1109/T-C.1969.222639
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：257 / +
页数：1
相关论文
共 50 条
  • [1] Synthesis of Loop-free Programs
    Gulwani, Sumit
    Jha, Susmit
    Tiwari, Ashish
    Venkatesan, Ramarathnam
    [J]. PLDI 11: PROCEEDINGS OF THE 2011 ACM CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION, 2011, : 62 - 73
  • [2] Synthesis of Loop-free Programs
    Gulwani, Sumit
    Jha, Susmit
    Tiwari, Ashish
    Venkatesan, Ramarathnam
    [J]. ACM SIGPLAN NOTICES, 2011, 46 (06) : 62 - 73
  • [3] Nerves and cones of free loop-free ?-categories
    Gagna, Andrea
    Ozornova, Viktoriya
    Rovelli, Martina
    [J]. TUNISIAN JOURNAL OF MATHEMATICS, 2023, 5 (02) : 273 - 326
  • [4] Stabilization of loop-free redundant routing
    Cobb, Jorge A.
    [J]. STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2007, 4838 : 154 - 172
  • [5] LOOP-FREE STRUCTURE OF SEQUENTIAL MACHINES
    HARTMANIS, J
    [J]. INFORMATION AND CONTROL, 1962, 5 (01): : 25 - &
  • [6] Efficient computation of loop-free alternates
    Geng, Haijun
    Zhang, Han
    Shi, Xingang
    Wang, Zhiliang
    Yin, Xia
    [J]. JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2020, 151
  • [7] Stabilization of general loop-free routing
    Cobb, JA
    Gouda, MG
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2002, 62 (05) : 922 - 944
  • [8] Loop-Free Convergence With Unordered Updates
    Robertson, Glenn
    Roy, Nirupam
    Penumarthi, Phani Krishna
    Nelakuditi, Srihari
    O'Kane, Jason M.
    [J]. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2017, 14 (02): : 373 - 385
  • [9] A scalable and loop-free multicast Internet protocol
    Parsa, M
    GarciaLunaAceves, JJ
    [J]. MULTIMEDIA COMPUTING AND NETWORKING 1997, 1997, 3020 : 2 - 16
  • [10] Loop-free calculus for modal logic . II
    Andrikonis, Julius
    [J]. LITHUANIAN MATHEMATICAL JOURNAL, 2012, 52 (02) : 123 - 133
12345