Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
Jonathan K. Lee, Jens Palsberg, Fernando Magno Qui...
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
Cornelia Dangelmayr, Stefan Felsner, William T. Tr...
In this paper we introduce the problem of Constrained Subspace Skyline Queries. This class of queries can be thought of as a generalization of subspace skyline queries using range...
Abstract. This paper describes a new method in pairing-based signature schemes for identifying the invalid digital signatures in a batch after batch verification has failed. The me...