Sciweavers

61 search results - page 12 / 13
» ipl 2007
Sort
View
IPL
2007
143views more  IPL 2007»
13 years 5 months ago
The cycle roommates problem: a hard case of kidney exchange
Recently, a number of interesting algorithmic problems have arisen from the emergence, in a number of countries, of kidney exchange schemes, whereby live donors are matched with r...
Robert W. Irving
IPL
2007
72views more  IPL 2007»
13 years 5 months ago
How to safely close a discussion
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
Gildas Avoine, Serge Vaudenay
IPL
2007
99views more  IPL 2007»
13 years 5 months ago
Substitutions into propositional tautologies
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
Jan Krajícek
IPL
2006
141views more  IPL 2006»
13 years 5 months ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan
SIGMOD
2007
ACM
224views Database» more  SIGMOD 2007»
14 years 5 months ago
Design of flash-based DBMS: an in-page logging approach
The popularity of high-density flash memory as data storage media has increased steadily for a wide spectrum of computing devices such as PDA's, MP3 players, mobile phones an...
Sang-Won Lee, Bongki Moon