Sciweavers

56 search results - page 5 / 12
» acta 2007
Sort
View
ACTA
1998
69views more  ACTA 1998»
13 years 7 months ago
Asymptotic Expansions of the Mergesort Recurrences
This note provides exact formulæ for the mean and variance of the cost of top-down recursive mergesort. These formulæ improve upon earlier results of Flajolet and Golin. Key wor...
Hsien-Kuei Hwang
ACTA
1998
111views more  ACTA 1998»
13 years 7 months ago
Machine Scheduling with Availability Constraints
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
Eric Sanlaville, Günter Schmidt
ACTA
2007
114views more  ACTA 2007»
13 years 7 months ago
Recursive descent parsing for Boolean grammars
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...
Alexander Okhotin
ACTA
2005
101views more  ACTA 2005»
13 years 7 months ago
A general framework for types in graph rewriting
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
Barbara König
ACTA
2004
97views more  ACTA 2004»
13 years 7 months ago
Past is for free: on the complexity of verifying linear temporal properties with past
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
Nicolas Markey