Sciweavers

438 search results - page 61 / 88
» On Perfect Switching Classes
Sort
View
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 8 months ago
Sequential Rationality in Cryptographic Protocols
Much of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationallybounded pl...
Ronen Gradwohl, Noam Livne, Alon Rosen
CORR
2010
Springer
145views Education» more  CORR 2010»
13 years 8 months ago
CAT-generation of ideals
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
Torsten Ueckerdt
DAM
2008
87views more  DAM 2008»
13 years 8 months ago
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...
Flavia Bonomo, Maria Chudnovsky, Guillermo Dur&aac...
JCT
2008
84views more  JCT 2008»
13 years 8 months ago
Minimally non-Pfaffian graphs
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
Serguei Norine, Robin Thomas
PAAPP
2006
141views more  PAAPP 2006»
13 years 8 months ago
Algorithmic optimizations of a conjugate gradient solver on shared memory architectures
OpenMP is an architecture-independent language for programming in the shared memory model. OpenMP is designed to be simple and in terms of programming abstractions. Unfortunately,...
Henrik Löf, Jarmo Rantakokko