Constructive linear-time temporal logic: Proof systems and Kripke semantics Fulltext Access 13 Pages 2011
An integer LL-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays Fulltext Access 13 Pages 2011
An Erdős–Ko–Rado theorem for the derangement graph of PGL(2,q) acting on the projective line Fulltext Access 13 Pages 2011
A recipe theorem for the topological Tutte polynomial of Bollobás and Riordan Fulltext Access 13 Pages 2011
On nn-facility median problem with facilities subject to failure facing uniform demand Fulltext Access 13 Pages 2011
Treegraph-based Instruction Scheduling for Stack-based Virtual Machines Fulltext Access 13 Pages 2011
Implementing a Language with Flow-Sensitive and Structural Typing on the JVM Fulltext Access 13 Pages 2011
Propositional Dynamic Logic with Storing, Recovering and Parallel Composition Fulltext Access 13 Pages 2011
Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition Fulltext Access 13 Pages 2011
Sharp lower bounds on the extractable randomness from non-uniform sources Fulltext Access 13 Pages 2011
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges Fulltext Access 14 Pages 2011
Some combinatorially defined subsets of βN and their relation to the idempotents Fulltext Access 14 Pages 2011
A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2 Fulltext Access 14 Pages 2011
Optimal permutation anticodes with the infinity norm via permanents of (0,1)-matrices Fulltext Access 14 Pages 2011
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays Fulltext Access 14 Pages 2011
On the computational complexity of behavioral description-based web service composition Fulltext Access 14 Pages 2011
Disjoint path covers in recursive circulants G(2m,4) with faulty elements Fulltext Access 14 Pages 2011
Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures Fulltext Access 14 Pages 2011
The search for a reduction in combinatory logic equivalent to λβ-reduction Fulltext Access 14 Pages 2011
A formal library of set relations and its application to synchronous languages Fulltext Access 14 Pages 2011
On the number of infinite sequences with trivial initial segment complexity Fulltext Access 14 Pages 2011
Component-based construction of bio-pathway models: The parameter estimation problem Fulltext Access 14 Pages 2011
Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern Fulltext Access 14 Pages 2011
Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid Fulltext Access 14 Pages 2011
Performance driven distributed scheduling of parallel hybrid computations Fulltext Access 14 Pages 2011
Complexity of graph self-assembly in accretive systems and self-destructible systems Fulltext Access 14 Pages 2011