Sciweavers

107 search results - page 13 / 22
» Some Applications of Bounds for Designs to the Cryptography
Sort
View
ENTCS
2010
101views more  ENTCS 2010»
13 years 4 months ago
Strengthening the Zipper
The zipper is a well known design pattern for providing a cursor-like interface to a data structure. However, the classic treatise by Huet only scratches the surface of some of it...
Tristan O. R. Allwood, Susan Eisenbach
WEA
2007
Springer
95views Algorithms» more  WEA 2007»
14 years 25 days ago
Experimental Evaluation of Parametric Max-Flow Algorithms
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
Maxim A. Babenko, Jonathan Derryberry, Andrew V. G...
ACSAC
2007
IEEE
13 years 10 months ago
Distributed Secure Systems: Then and Now
The early 1980s saw the development of some rather sophisticated distributed systems. These were not merely networked file systems: rather, using remote procedure calls, hierarchi...
Brian Randell, John M. Rushby
OSDI
1996
ACM
13 years 8 months ago
Safe Kernel Extensions Without Run-Time Checking
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel r...
George C. Necula, Peter Lee
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 8 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...