612 search results - page 115 / 123 » Hardness assumptions in the foundations of theoretical compu... |
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
A prerequisite for secure communications between two sensor nodes is that these nodes exclusively share a pairwise key. Although numerous pairwise key establishment (PKE) schemes ...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
ITICSE
2004
ACM
14 years 1 months ago
2004
ACM
SQL (Structured Query Language) is one of the essential topics in foundation databases courses in higher education. Due to its apparent simple syntax, learning to use the full pow...
SIGCOMM
2000
ACM
14 years 1 days ago
2000
ACM
This paper examines the latency in Internet path failure, failover and repair due to the convergence properties of interdomain routing. Unlike switches in the public telephony net...
MFPS
1989
13 years 11 months ago
1989
We define a simple collection of operations for creating and manipulating record structures, where records are intended as finite associations of values to labels. A second-order ...