Sciweavers

3122 search results - page 115 / 625
» A Theory of Network Equivalence
Sort
View
POPL
2007
ACM
16 years 6 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
IACR
2011
106views more  IACR 2011»
14 years 6 months ago
Hash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Bart Mennink, Bart Preneel
TWC
2008
105views more  TWC 2008»
15 years 6 months ago
Joint medium access control, routing and energy distribution in multi-hop wireless networks
It is a challenging task for multi-hop wireless networks to support multimedia applications with quality-ofservice (QoS) requirements. This letter presents a joint crosslayer optim...
Khoa T. Phan, Hai Jiang, Chintha Tellambura, Sergi...
FGCS
2008
144views more  FGCS 2008»
15 years 6 months ago
Distributed strategic interleaving with load balancing
In a previous paper, we developed an algebraic theory of threads, interleaving of threads, and interaction of threads with services. In the current paper, we assume that the thread...
Jan A. Bergstra, C. A. Middelburg
PODS
2010
ACM
197views Database» more  PODS 2010»
15 years 6 months ago
When data dependencies over SQL tables meet the logics of paradox and S-3
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
Sven Hartmann, Sebastian Link