1452 search results - page 160 / 291 » Algorithmic Analysis of Array-Accessing Programs |
114
Voted
ICALP
2000
Springer
15 years 4 months ago
2000
Springer
In this paper we investigate timed polyhedra, i.e. polyhedra which are finite unions of full dimensional simplices of a special kind. Such polyhedra form the basis of timing analys...
ISMB
2000
15 years 2 months ago
2000
The repetitive structure of genomic DNA holds many secrets to be discovered. A systematic study of repetitive DNA on a genomic or inter-genomic scale requires extensive algorithmi...
104
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
132
click to vote
ICALP
1993
Springer
15 years 4 months ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
101
click to vote
ICFP
2004
ACM
16 years 18 days ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...