Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
Abstract. We describe a weakness in the High Bandwidth Digital Content Protection (HDCP) scheme which may lead to practical attacks. HDCP is a proposed identity-based cryptosystem ...
Scott Crosby, Ian Goldberg, Robert Johnson, Dawn X...
Interpretation from a Topological Perspective David A. Schmidt Kansas State University, Manhattan, Kansas, USA Abstract. Topology is the study of property sets (open sets) and cont...
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
d abstract) Dominique Unruh 1 Institut f¨ur Algorithmen und Kognitive Systeme, Universit¨at Karlsruhe Am Fasanengarten 5, 76131 Karlsruhe, Germany We show how to model the seman...