Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
Event-Based Proof of the Mutual Exclusion Property of Peterson’s Algorithm
Proving properties of distributed algorithms is still a highly challenging problem and various approaches that have been proposed to tackle it [1] can be roughly divided into state-based and event-based proofs. Informally speaking, state-based approaches define the behavior of a distributed algorithm as a set of sequences of memory states during its executions, while event-based approaches treat the behaviors by means of events which are produced by the executions of an algorithm. Of course, combined...
Exact bounds on the complexity of sequential string matching algorithms. (Des bornes exactes de la complexité des algorithmes séquentiels de recherche d'un motif.)
Executable specifications for data-type constructors
Exhaustive List-Scheduling Heuristic for Dense Task Graphs
Exponential tail bounds for max-recursive sequences.
Extrapolation Applied to the Method of Characteristics for a first Order System of Two Partial Differential Equations. Part One : The Initial Value Problem.