92 search results - page 16 / 19 » Fine hierarchies and m-reducibilities in theoretical compute... |
155
click to vote
ICTCS
2007
Springer
16 years 6 days ago
2007
Springer
The information flow property of Non-Interference was recently relaxed into Abstract NonInterference (ANI), a weakened version where attackers can only observe properties of data,...
163
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is...
141
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
We show the following results regarding complete sets. • NP-complete sets and PSPACE-complete sets are many-one autoreducible. • Complete sets of any level of PH, MODPH, or th...
136
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
149
Voted
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...