Sciweavers

142 search results - page 8 / 29
» A Private Stable Matching Algorithm
Sort
View
STACS
2012
Springer
12 years 4 months ago
On Computing Pareto Stable Assignments
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
Ning Chen
JDA
2008
101views more  JDA 2008»
13 years 8 months ago
Student-Project Allocation with preferences over Projects
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
David Manlove, Gregg O'Malley
SIAMDM
2010
99views more  SIAMDM 2010»
13 years 3 months ago
On the Stable Paths Problem
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
CRYPTO
2009
Springer
87views Cryptology» more  CRYPTO 2009»
14 years 3 months ago
Reconstructing RSA Private Keys from Random Key Bits
sion of an extended abstract published in Proceedings of Crypto 2009, Springer-Verlag, 2009. Available from the IACR Cryptology ePrint Archive as Report 2008/510. We show that an ...
Nadia Heninger, Hovav Shacham
TCOM
2008
74views more  TCOM 2008»
13 years 8 months ago
Stability of a frame-based oldest-cell-first maximal weight matching algorithm
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...
Xike Li, Itamar Elhanany