The shield that never was: Societies with single-peaked preferences are more open to manipulation and control Fulltext Access 19 Pages 2011
On Dillonʼs class H of bent functions, Niho bent functions and o-polynomials Fulltext Access 19 Pages 2011
Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract) Fulltext Access 19 Pages 2011
Two matrix inversions associated with the Hagen–Rothe formula, their q-analogues and applications Fulltext Access 19 Pages 2011
A theory of decomposition into prime factors of layered interconnection networks Fulltext Access 19 Pages 2011
Communication complexity and intrinsic universality in cellular automata Fulltext Access 20 Pages 2011
A semantic equivalence for Bio-PEPA based on discretisation of continuous values Fulltext Access 20 Pages 2011
Design, optimization and predictions of a coupled model of the cell cycle, circadian clock, DNA repair system, irinotecan metabolism and exposure control under temporal logic constraints Fulltext Access 20 Pages 2011
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata Fulltext Access 20 Pages 2011
Fuzzy rough granular neural networks, fuzzy granules, and classification Fulltext Access 20 Pages 2011
Chain enumeration of k-divisible noncrossing partitions of classical types Fulltext Access 20 Pages 2011
Computational complexity of the problem of tree generation under fine-grained access control policies Fulltext Access 20 Pages 2011
On Using B in the Design of Secure Micro-controllers: An Experience Report Fulltext Access 20 Pages 2011
The correctness of Newman’s typability algorithm and some of its extensions Fulltext Access 20 Pages 2011
Performance Evaluation of Software Development Teams: a Practical Case Study Fulltext Access 20 Pages 2011
Total restrained domination in claw-free graphs with minimum degree at least two Fulltext Access 20 Pages 2011
A novel formalization of symbolic trajectory evaluation semantics in Isabelle/HOL Fulltext Access 20 Pages 2011
Generalized Stirling permutations, families of increasing trees and urn models Fulltext Access 21 Pages 2011
Efficient and accurate computation of upper bounds of approximation errors Fulltext Access 21 Pages 2011
Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems Fulltext Access 21 Pages 2011
Self-stabilizing leader election in optimal space under an arbitrary scheduler Fulltext Access 21 Pages 2011
A new approach and generalizations to some results about mock theta functions Fulltext Access 21 Pages 2011
The enumeration of vertex induced subgraphs with respect to the number of components Fulltext Access 21 Pages 2011
Logical classification of distributed algorithms (Bakery algorithms as an example) Fulltext Access 22 Pages 2011
Two linear-time algorithms for computing the minimum length polygon of a digital contour Fulltext Access 22 Pages 2011
Some New Approaches in Functional Programming Using Algebras and Coalgebras Fulltext Access 22 Pages 2011
Testing Data Consistency of Data-Intensive Applications Using QuickCheck Fulltext Access 22 Pages 2011
Divisible designs and semi-regular relative difference sets from additive Hadamard cocycles Fulltext Access 22 Pages 2011
Bounded budget betweenness centrality game for strategic network formations Fulltext Access 22 Pages 2011
Simplification of a complex signal transduction model using invariants and flow equivalent servers Fulltext Access 22 Pages 2011