21 search results - page 1 / 5 » Points-to Analysis in Almost Linear Time |
POPL
1996
ACM
13 years 8 months ago
1996
ACM
MOC
2002
13 years 4 months ago
2002
This paper presents an average time analysis of a Hensel lifting based factorisation algorithm for bivariate polynomials over finite fields. It is shown that the average running ti...
ISPD
2004
ACM
13 years 10 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
SODA
2004
ACM
13 years 5 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...