Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Musaev, Saidgani"'
Autor:
Musaev, Saidgani, Fetzer, Christof
Recent years have brought microarchitectural security intothe spotlight, proving that modern CPUs are vulnerable toseveral classes of microarchitectural attacks. These attacksbypass the basic isolation primitives provided by the CPUs:process isolatio
Externí odkaz:
http://arxiv.org/abs/2108.10771
Publikováno v:
Musaev, S & Fokkink, W 2022, A Note on the Message Complexity of Cidon’s Distributed Depth-First Search Algorithm . in N Jansen, M Stoelinga & P van den Bos (eds), A Journey from Process Algebra via Timed Automata to Model Learning : Essays Dedicated to Frits Vaandrager on the Occasion of His 60th Birthday . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13560 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 467-471 . https://doi.org/10.1007/978-3-031-15629-8_24
A Journey from Process Algebra via Timed Automata to Model Learning: Essays Dedicated to Frits Vaandrager on the Occasion of His 60th Birthday, 467-471
STARTPAGE=467;ENDPAGE=471;TITLE=A Journey from Process Algebra via Timed Automata to Model Learning
Lecture Notes in Computer Science ISBN: 9783031156281
A Journey from Process Algebra via Timed Automata to Model Learning: Essays Dedicated to Frits Vaandrager on the Occasion of His 60th Birthday, 467-471
STARTPAGE=467;ENDPAGE=471;TITLE=A Journey from Process Algebra via Timed Automata to Model Learning
Lecture Notes in Computer Science ISBN: 9783031156281
The same distributed depth-first search algorithm was proposed independently by Lakshmanan, Meenakshi, and Thulasiraman, who gave 4 E- N as upper bound on the worst-case message complexity of the algorithm, and by Cidon, who gave 3E as upper bound. W
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.