2365 search results - page 379 / 473 » All things are connected |
152
click to vote
IMC
2003
ACM
15 years 11 months ago
2003
ACM
Border Gateway Protocol allows Autonomous Systems (ASs) to apply diverse routing policies for selecting routes and for propagating reachability information to other ASs. Although ...
191
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
215
click to vote
EUROCRYPT
2010
Springer
15 years 11 months ago
2010
Springer
This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, whi...
177
click to vote
ASIACRYPT
2001
Springer
15 years 11 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
163
click to vote
ISSTA
2000
ACM
15 years 10 months ago
2000
ACM
A number of different concepts have been proposed that, loosely speaking, revolve around the notion of software testability. Indeed, the concept of testability itself has been int...