Computer Aided Systems Theory – EUROCAST 2005

DOI10.1007/11556985zbMath1143.94346OpenAlexW2494556639MaRDI QIDQ5394433

Dieter Gollmann

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11556985

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs ⋮ Analyzing the 3-path vertex cover problem in planar bipartite graphs ⋮ Minimum \(k\)-path vertex cover ⋮ Formal analysis of security protocols for wireless sensor networks

This page was built for publication: Computer Aided Systems Theory – EUROCAST 2005