2498 search results - page 480 / 500 » Data Structures with Unpredictable Timing |
141
click to vote
SIGSOFT
2007
ACM
16 years 2 months ago
2007
ACM
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
207
click to vote
POPL
2003
ACM
16 years 2 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
106
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
121
click to vote
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
112
click to vote
SOFSEM
2009
Springer
15 years 10 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...