2252 search results - page 316 / 451 » Lower Bounds for Dynamic Algorithms |
142
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
147
Voted
CCS
2006
ACM
15 years 5 months ago
2006
ACM
Packet filtering plays a critical role in many of the current high speed network technologies such as firewalls and IPSec devices. The optimization of firewall policies is critica...
134
Voted
IPL
2010
15 years 1 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
119
Voted
EMSOFT
2001
Springer
15 years 8 months ago
2001
Springer
Dynamic storage allocation and automatic garbage collection are among the most popular features that high-level languages can offer. However, timecritical applications cannot be wr...
146
Voted
SODA
2010
ACM
16 years 24 days ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...