90 search results - page 13 / 18 » Schemes for deterministic polynomial factoring |
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
ASIACRYPT
2003
Springer
14 years 22 days ago
2003
Springer
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...
ICC
2009
IEEE
13 years 5 months ago
2009
IEEE
Abstract--We introduce multi-hop aggregate information efficiency (MIEA), a comprehensive metric that captures several performance-affecting factors of wireless ad hoc networks in ...
SIAMCOMP
2002
13 years 7 months ago
2002
abstract Alain Mayer Yoram Ofeky Rafail Ostrovskyz Moti Yungx We investigate the problem of self-stabilizing round-robin token management scheme on an anonymous bidirectional ring...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...