2976 search results - page 258 / 596 » On the bounded integer programming |
155
Voted
ICALP
1999
Springer
15 years 9 months ago
1999
Springer
We introduce new techniques for studying the structure of partial k-trees. In particular, we show that the complements of partial k-trees provide an intuitively-appealing character...
131
click to vote
ICFP
1996
ACM
15 years 9 months ago
1996
ACM
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...
176
Voted
ICALP
1994
Springer
15 years 9 months ago
1994
Springer
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
123
Voted
FLOPS
2006
Springer
15 years 8 months ago
2006
Springer
We propose a new method to control memory resources by static analysis. For this, we introduce the notion of sup-interpretation which bounds from above the size of function outputs...
141
Voted
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...