Sciweavers

2095 search results - page 23 / 419
» Improved pebbling bounds
Sort
View
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
14 years 3 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
ACSAC
2000
IEEE
14 years 2 months ago
Less Harm, Less Worry or How to Improve Network Security by Bounding System Offensiveness
In this paper we describe a new class of tools for protecting computer systems from security attacks. Their distinguished feature is the principle they are based on. Host or netwo...
Danilo Bruschi, Lorenzo Cavallaro, Emilia Rosti
FOCS
1998
IEEE
14 years 2 months ago
Improved Bounds and Algorithms for Hypergraph Two-Coloring
Jaikumar Radhakrishnan, Aravind Srinivasan
STACS
1999
Springer
14 years 2 months ago
Upper Bounds for Vertex Cover Further Improved
tended abstract of this work appears in the proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS’99), Springer, LNCS, held in Trier, Fed. Rep. of G...
Rolf Niedermeier, Peter Rossmanith