Sciweavers

352 search results - page 57 / 71
» Proofs as Polynomials
Sort
View
175
Voted
VMCAI
2005
Springer
16 years 29 days ago
Checking Herbrand Equalities and Beyond
A Herbrand equality between expressions in a program is an equality which holds relative to the Herbrand interpretation of operators. We show that the problem of checking validity ...
Markus Müller-Olm, Oliver Rüthing, Helmu...
EUROCRYPT
2004
Springer
16 years 26 days ago
Practical Large-Scale Distributed Key Generation
Generating a distributed key, where a constant fraction of the players can reconstruct the key, is an essential component of many largescale distributed computing tasks such as ful...
John F. Canny, Stephen Sorkin
STACS
2004
Springer
16 years 25 days ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
INFOCOM
2003
IEEE
16 years 23 days ago
The Impact of Correlated Link Weights on QoS Routing
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
Fernando A. Kuipers, Piet Van Mieghem
212
Voted
CALC
2001
Springer
171views Cryptology» more  CALC 2001»
16 years 2 hour ago
Approximate Integer Common Divisors
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
Nick Howgrave-Graham