Sciweavers

492 search results - page 25 / 99
» Perfect Matching Preservers
Sort
View
ESWS
2008
Springer
15 years 1 months ago
Entity Identifiers for Lineage Preservation
Abstract. The generation of entity identifiers is a key issue in the context of semantic web technologies. Entity identifiers are needed when we perform any kind of operation (e.g....
Julien Gaugaz, Gianluca Demartini
CRYPTO
2011
Springer
232views Cryptology» more  CRYPTO 2011»
13 years 11 months ago
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
Masayuki Abe, Jens Groth, Kristiyan Haralambiev, M...
CTRSA
2007
Springer
102views Cryptology» more  CTRSA 2007»
15 years 3 months ago
Improved Efficiency for Private Stable Matching
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
JCT
2007
93views more  JCT 2007»
14 years 11 months ago
Generating bricks
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that...
Serguei Norine, Robin Thomas
EUROPAR
2007
Springer
15 years 6 months ago
Periodic Load Balancing on the N -Cycle: Analytical and Experimental Evaluation
Abstract. We investigate the following very simple load-balancing algorithm on the N-cycle (N even) which we call Odd-Even Transposition Balancing (OETB). The edges of the cycle ar...
Christian Rieß, Rolf Wanka