Sciweavers

273 search results - page 46 / 55
» Mutually Independent Commitments
Sort
View
TON
2010
192views more  TON 2010»
13 years 2 months ago
Delay analysis for wireless networks with single hop traffic and general interference constraints
We consider a class of wireless networks with general interference constraints on the set of links that can be served simultaneously at any given time. We restrict the traffic to b...
Gagan Raj Gupta, Ness B. Shroff
INFOCOM
2011
IEEE
12 years 10 months ago
A real-time multicast routing scheme for multi-hop switched fieldbuses
—The rapid scaling up of Networked Control Systems (NCS) is forcing traditional single-hop shared medium industrial fieldbuses (a.k.a. fieldbuses) to evolve toward multi-hop sw...
Lixiong Chen, Xue Liu, Qixin Wang, Yufei Wang
ASIACRYPT
2009
Springer
14 years 2 months ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...
ASPLOS
2006
ACM
14 years 1 months ago
Tradeoffs in transactional memory virtualization
For transactional memory (TM) to achieve widespread acceptance, transactions should not be limited to the physical resources of any specific hardware implementation. TM systems s...
JaeWoong Chung, Chi Cao Minh, Austen McDonald, Tra...
BIRTHDAY
2004
Springer
14 years 24 days ago
A Trace Semantics for Long-Running Transactions
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
Michael J. Butler, C. A. R. Hoare, Carla Ferreira