Sciweavers

2181 search results - page 215 / 437
» The restriction scaffold problem
Sort
View
JAPLL
2010
133views more  JAPLL 2010»
15 years 5 months ago
Complexity of modal logics with Presburger constraints
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
Stéphane Demri, Denis Lugiez
JPDC
2010
123views more  JPDC 2010»
15 years 5 months ago
Maintaining the Ranch topology
Topology maintenance, or how to handle the possibly concurrent joining and leaving of nodes, is a central problem for structured peer-to-peer networks. A good topology maintenance...
Xiaozhou Li, Jayadev Misra, C. Greg Plaxton
LATINCRYPT
2010
15 years 5 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...
MFCS
2010
Springer
15 years 5 months ago
A dexptime-Complete Dolev-Yao Theory with Distributive Encryption
In the context of modelling cryptographic tools like blind signatures and homomorphic encryption, the DolevYao model is typically extended with an operator over which encryption i...
Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh
RECOMB
2010
Springer
15 years 5 months ago
Consistency of Sequence-Based Gene Clusters
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
Roland Wittler, Jens Stoye