Reconstruction of domino tilings-Combinatorial and probabilistic questions Fulltext Access 19 Pages 2016
On a symmetric representation of Hermitian matrices and its applications to graph theory Fulltext Access 20 Pages 2016
Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs Fulltext Access 20 Pages 2016
Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions Fulltext Access 20 Pages 2016
Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations Fulltext Access 20 Pages 2016
Structural operational semantics for non-deterministic processes with quantitative aspects Fulltext Access 20 Pages 2016
Multiphase until formulas over Markov reward models: An algebraic approach Fulltext Access 20 Pages 2016
Mutation strength control via meta evolution strategies on the ellipsoid model Fulltext Access 20 Pages 2016
Dynamic Fault Trees with Rejuvenation: Numerical Analysis and Stochastic Bounds Fulltext Access 21 Pages 2016
Enabling Fluid Analysis for Queueing Petri Nets via Model Transformation Fulltext Access 21 Pages 2016
Improved algorithms for colorings of simple hypergraphs and applications Fulltext Access 21 Pages 2016
Conditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks Fulltext Access 21 Pages 2016
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees Fulltext Access 21 Pages 2016
Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time Fulltext Access 21 Pages 2016
Modular verification of chemical reaction network encodings via serializability analysis Fulltext Access 22 Pages 2016
A provably secure non-iterative hash function resisting birthday attack Fulltext Access 22 Pages 2016
On natural deduction in classical first-order logic: Curry–Howard correspondence, strong normalization and Herbrand's theorem Fulltext Access 22 Pages 2016
Parameterized verification of time-sensitive models of ad hoc network protocols Fulltext Access 22 Pages 2016
Composition Colored Petri Nets for the Refinement of Reaction-based Models Fulltext Access 22 Pages 2016
Constructions of dynamic and non-dynamic threshold public-key encryption schemes with decryption consistency Fulltext Access 22 Pages 2016
Efficient algorithms for membership in boolean hierarchies of regular languages Fulltext Access 23 Pages 2016
Sparse convolution-based digital derivatives, fast estimation for noisy signals and approximation results Fulltext Access 23 Pages 2016
Finding all solutions of equations in free groups and monoids with involution Fulltext Access 24 Pages 2016
A complete refinement procedure for regular separability of context-free languages Fulltext Access 24 Pages 2016
Symmetry constraints on temporal order in measurement-based quantum computation Fulltext Access 24 Pages 2016
A study on several combination problems of classic shop scheduling and shortest path Fulltext Access 25 Pages 2016
Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons) Fulltext Access 25 Pages 2016
The challenges of unbounded treewidth in parameterised subgraph counting problems Fulltext Access 25 Pages 2016
Test Scenario Generation from Natural Language Requirements Descriptions based on Petri-Nets Fulltext Access 26 Pages 2016