Sciweavers

248 search results - page 40 / 50
» A Simple Optimal Randomized Algorithm for Sorting on the PDM
Sort
View
ISAAC
2009
Springer
114views Algorithms» more  ISAAC 2009»
15 years 9 months ago
Good Programming in Transactional Memory
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...
Raphael Eidenbenz, Roger Wattenhofer
87
Voted
ICDCS
2005
IEEE
15 years 8 months ago
On Cooperative Content Distribution and the Price of Barter
We study how a server may disseminate a large volume of data to a set of clients in the shortest possible time. We first consider a cooperative scenario where clients are willing...
Prasanna Ganesan, Mukund Seshadri
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 3 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
115
Voted
GLOBECOM
2009
IEEE
15 years 6 months ago
Experimental Validation of Periodic Codes for PON Monitoring
In this paper we investigate both experimentally and via simulation the monitoring of fiber link quality in a PON using optical coding technology. We use a new, simple and costeffe...
Mohammad M. Rad, Habib Fathallah, Sophie LaRochell...
SPAA
1997
ACM
15 years 6 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...