15251 search results - page 210 / 3051 » Network Science - Theory and Application |
119
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
98
Voted
RTA
2007
Springer
15 years 9 months ago
2007
Springer
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...
136
Voted
RANDOM
1997
Springer
15 years 7 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
157
Voted
IFIPTCS
2010
15 years 1 months ago
2010
Abstract. We propose a framework for reasoning about program security building on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from...
132
Voted
GI
2009
Springer
15 years 1 months ago
2009
Springer
: The performance potential of multistatic sonar operations has been investigated by several research institutes and proven in numerous international sea trials during the last yea...