Sciweavers

IPL
2006
87views more  IPL 2006»
13 years 5 months ago
Vertex rankings of chordal graphs and weighted trees
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
Dariusz Dereniowski, Adam Nadolski
IPL
2006
118views more  IPL 2006»
13 years 5 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
IPL
2006
65views more  IPL 2006»
13 years 5 months ago
Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme
We propose cryptanalysis of the First Domingo-Ferrer's algebraic privacy homomorphism E : Zn (Zp
Jung Hee Cheon, Woo-Hwan Kim, Hyun Soo Nam
IPL
2006
108views more  IPL 2006»
13 years 5 months ago
Robustness of k-gon Voronoi diagram construction
In this paper, we present a plane sweep algorithm for constructing the Voronoi diagram of a set of non-crossing line segments in 2D space using a distance metric induced by a regu...
Zhenming Chen, Evanthia Papadopoulou, Jinhui Xu
IPL
2006
93views more  IPL 2006»
13 years 5 months ago
A decidable characterization of the classes between lintime and exptime
A language is defined by closure under safe iteration and under a new form of safe diagonalization that, unlike other forms of diagonalization used in literature to define sub-recu...
Salvatore Caporaso
IPL
2006
85views more  IPL 2006»
13 years 5 months ago
A flaw in the electronic commerce protocol SET
The Secure Electronic Transaction (SET) protocol has been developed by the major credit card companies in association with some of the top software corporations to secure e-commer...
Srecko Brlek, Sardaouna Hamadou, John Mullins
IPL
2006
72views more  IPL 2006»
13 years 5 months ago
Structure and linear time recognition of 3-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
Andreas Brandstädt, Van Bang Le
IPL
2006
83views more  IPL 2006»
13 years 5 months ago
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two ...
Claudson F. Bornstein, Celina M. Herrera de Figuei...
IPL
2006
86views more  IPL 2006»
13 years 5 months ago
Monotone circuits for monotone weighted threshold functions
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of ...
Amos Beimel, Enav Weinreb