Optimal Byzantine-resilient convergence in uni-dimensional robot networks Fulltext Access 15 Pages 2010
Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight Fulltext Access 15 Pages 2010
Degree-bounded factorizations of bipartite multigraphs and of pseudographs Fulltext Access 15 Pages 2010
The isomorphism problem for Cayley ternary relational structures for some abelian groups of order 8p8p Fulltext Access 15 Pages 2010
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid Fulltext Access 15 Pages 2010
Multidimensional generalized automatic sequences and shape-symmetric morphic words Fulltext Access 15 Pages 2010
The pros and cons of flocking in the long-range “migration” of mobile robot swarms Fulltext Access 15 Pages 2010
Simple extractors via constructions of cryptographic pseudo-random generators Fulltext Access 15 Pages 2010
The operator formula for monotone triangles – simplified proof and three generalizations Fulltext Access 15 Pages 2010
Posets and permutations in the duplication–loss model: Minimal permutations with d descents Fulltext Access 15 Pages 2010
The Helly property and satisfiability of Boolean formulas defined on set families Fulltext Access 15 Pages 2010
Credo Methodology: Modeling and Analyzing A Peer-to-Peer System in Credo Fulltext Access 16 Pages 2010
A Propositional Dynamic Logic for Concurrent Programs Based on the π-Calculus Fulltext Access 16 Pages 2010
Model Testing Asynchronously Communicating Objects using Modulo AC Rewriting Fulltext Access 16 Pages 2010
Present and Absent Sets: Abstraction for Testing of Reactive Systems with Databases Fulltext Access 16 Pages 2010
Feature Interaction Aware Test Case Generation for Embedded Control Systems Fulltext Access 16 Pages 2010
A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem Fulltext Access 16 Pages 2010
Adaptive multiple minor directions extraction in parallel using a PCA neural network Fulltext Access 16 Pages 2010
The relevant prefixes of coloured Motzkin walks: An average case analysis Fulltext Access 16 Pages 2010
An exact correspondence between a typed pi-calculus and polarised proof-nets Fulltext Access 16 Pages 2010
Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi Fulltext Access 16 Pages 2010
Semi-Automatic Specification of Behavioural Service Adaptation Contracts Fulltext Access 16 Pages 2010
All-to-all personalized exchange in generalized shuffle-exchange networks Fulltext Access 16 Pages 2010
A Systematic Approach to Construct Compositional Behaviour Models for Network-structured Safety-critical Systems Fulltext Access 16 Pages 2010
A Formal Framework for Structural Reconfiguration of Components under Behavioural Adaptation Fulltext Access 16 Pages 2010
Locally finite graphs with ends: A topological approach, II. Applications Fulltext Access 16 Pages 2010