Sciweavers

2498 search results - page 480 / 500
» Data Structures with Unpredictable Timing
Sort
View
SIGSOFT
2007
ACM
16 years 16 days ago
Efficient token based clone detection with flexible tokenization
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, ...
Hamid Abdul Basit, Stan Jarzabek
POPL
2003
ACM
16 years 3 days ago
New results on the computability and complexity of points - to analysis
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...
Venkatesan T. Chakaravarthy
ICALP
2009
Springer
16 years 2 days ago
Universal Succinct Representations of Trees?
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...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
15 years 12 months ago
CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies
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...
Ihab F. Ilyas, Volker Markl, Peter J. Haas, Paul B...
SOFSEM
2009
Springer
15 years 8 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
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...
Martin Dietzfelbinger, Ulf Schellbach