From post

Exact Computation of Strongly Connected Reliability by Binary Decision Diagrams.

, , и . COCOA, том 11346 из Lecture Notes in Computer Science, стр. 281-295. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Implementation of sequence BDDs in Erlang., , и . Erlang Workshop, стр. 90-91. ACM, (2011)Recent Research Activities on Algorithmic Foundations for Social Advancement.. WALCOM, том 14549 из Lecture Notes in Computer Science, стр. 1-8. Springer, (2024)Second Workshop on Algorithms for Large-Scale Information Processing in Knowledge Discovery (ALSIP)., и . JSAI-isAI Workshops, том 7258 из Lecture Notes in Computer Science, стр. 184-185. Springer, (2011)Optimizing Network Reliability via Best-First Search over Decision Diagrams., , , , и . INFOCOM, стр. 1817-1825. IEEE, (2018)Exact Computation of Strongly Connected Reliability by Binary Decision Diagrams., , и . COCOA, том 11346 из Lecture Notes in Computer Science, стр. 281-295. Springer, (2018)Great east Japan earthquake viewed from a URL shortener., , , и . SWID@CoNEXT, стр. 8:1-8:8. ACM, (2011)Dancing with Decision Diagrams: A Combined Approach to Exact Cover., , , и . AAAI, стр. 868-874. AAAI Press, (2017)BDD-Constrained A* Search: A Fast Method for Solving Constrained DAG Shortest-Path Problems., , , , , и . AAAI Workshops, том WS-17 из AAAI Technical Report, AAAI Press, (2017)Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean function Manipulation., , и . DAC, стр. 52-57. IEEE Computer Society Press, (1990)Fast Regular Expression Matching Based On Dual Glushkov NFA., , , , и . Stringology, стр. 3-16. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2014)