11573/1634797 - 2022 -
Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography Galesi, N.; Ranjbar, F. - 01a Articolo in rivista
rivista: THEORETICAL COMPUTER SCIENCE (Elsevier BV:PO Box 211, 1000 AE Amsterdam Netherlands:011 31 20 4853757, 011 31 20 4853642, 011 31 20 4853641, EMAIL: nlinfo-f@elsevier.nl, INTERNET: http://www.elsevier.nl, Fax: 011 31 20 4853598) pp. 103-117 - issn: 0304-3975 - wos: WOS:000830148200009 (1) - scopus: 2-s2.0-85127464721 (1)
11573/1350776 - 2019 -
Vertex-connectivity for node failure identification in boolean network tomography Galesi, N.; Ranjbar, F.; Zito, M. - 04b Atto di convegno in volume
congresso: 15th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2019 (Munich; Germany)
libro: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - (978-3-030-34404-7; 978-3-030-34405-4)
11573/1264316 - 2018 -
Tight bounds for maximal identifiability of failure nodes in boolean network tomography Galesi, Nicola; Ranjbar, Fariba - 04b Atto di convegno in volume
congresso: 38th IEEE International Conference on Distributed Computing Systems, ICDCS 2018 (Vienna University of Technology (TU Wien), aut)
libro: Proceedings - International Conference on Distributed Computing Systems - (9781538668719)