首页> 外文OA文献 >A Loop-Free Path-Finding Algorithm: Specification, Verification and Complexity

【2h】

A Loop-Free Path-Finding Algorithm: Specification, Verification and Complexity

机译：无环路径查找算法：规范，验证和复杂性

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
J. J. Garcia-luna-aceves; Shree Murthy;
展开▼
作者单位

展开▼
年度 1995
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. A path-finding algorithm for loop-free routing [J] . Garcia-Luna-Aceves J.J., Shree Murthy IEEE/ACM Transactions on Networking . 1997,第1期

机译：一种无环路由的寻路算法
2. The Complexity of Verifying Loop-Free Programs as Differentially Private [J] . Marco Gaboardi, Kobbi Nissim, David Purser LIPIcs : Leibniz International Proceedings in Informatics . 2020,第30期

机译：验证无循环程序的复杂性，如差异私密
3. Development Modules for Specification of Requirements for a System of Verification of Parallel Algorithms [J] . Vasiliy Yu. Meltsov, Gennadiy A. Chistyakov European Researcher. Series A . 2012,第5a1期

机译：规范并行算法验证系统要求的开发模块
4. A loop-free path-finding algorithm: specification, verification and complexity [C] . Garcia-Luna-Aceves, J.J., Murthy, . 1995

机译：无环寻路算法：规范，验证和复杂性
5. Formal specification and verification of a JVM and its bytecode verifier. [D] . Liu, Hanbing. 2006

机译：JVM及其字节码验证程序的正式规范和验证。
6. Statistical Complexity Analysis of Turing Machine tapes with Fixed Algorithmic Complexity Using the Best-Order Markov Model [O] . Jorge M. Silva, Eduardo Pinho, Sérgio Matos, 2020

机译：使用最佳阶Markov模型的固定算法复杂度的图灵机带的统计复杂性分析
7. A Loop-free Path-Finding Algorithm: Specification, Verification and Complexity [O] . J.J. Garcia-Luna-Aceves, Shree Murthy 1995

机译：无环路寻路算法：规范，验证和复杂性
8. Loop-Free Path-Finding Algorithm: Specification, Verification and Complexity. [R] . Garcia-Luna-Aceves, J. J., Murthy, S. 1995

机译：无环路径寻找算法：规范，验证和复杂性。

A Loop-Free Path-Finding Algorithm: Specification, Verification and Complexity

著录项

引文网络

相似文献

相关主题

期刊订阅