Refinement calculus: A basis for translation validation, debugging and certification Fulltext Access 16 Pages 2006
Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems Fulltext Access 16 Pages 2006
Efficient algorithms for robustness in resource allocation and scheduling problems Fulltext Access 16 Pages 2006
Component composition preserving behavioral contracts based on communication traces Fulltext Access 16 Pages 2006
Fully asynchronous behavior of double-quiescent elementary cellular automata Fulltext Access 16 Pages 2006
Local heuristics and the emergence of spanning subgraphs in complex networks Fulltext Access 16 Pages 2006
Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment Fulltext Access 16 Pages 2006
Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time Fulltext Access 16 Pages 2006
A PTAS for the minimization of polynomials of fixed degree over the simplex Fulltext Access 16 Pages 2006
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems Fulltext Access 16 Pages 2006
On geodesic structures of weakly median graphs—II: Compactness, the role of isometric rays Fulltext Access 16 Pages 2006
Solitary and edge-minimal bases for representations of the simple lie algebra G2G2 Fulltext Access 16 Pages 2006
A Lagrangian heuristic algorithm for a real-world train timetabling problem Fulltext Access 16 Pages 2006
Application of an optimization problem in Max-Plus algebra to scheduling problems Fulltext Access 16 Pages 2006
Closure properties of linear context-free tree languages with an application to optimality theory Fulltext Access 16 Pages 2006
Eigenvariables, bracketing and the decidability of positive minimal predicate logic Fulltext Access 16 Pages 2006
A simpler and faster 1.5-approximation algorithm for sorting by transpositions Fulltext Access 16 Pages 2006
Decomposition of almost complete tripartite graphs into two isomorphic factors of fixed diameter Fulltext Access 17 Pages 2006
Dense near polygons with hexes of type HD(5,q2), Q(5,q)×Lq+1 or Q(5,q)⊗Q(5,q) Fulltext Access 17 Pages 2006
New Hadamard matrices of order 4p2 obtained from Jacobi sums of order 16 Fulltext Access 17 Pages 2006
Minimal 1-saturating sets and complete caps in binary projective spaces Fulltext Access 17 Pages 2006
Non-normal one-regular and 4-valent Cayley graphs of dihedral groups D2nD2n Fulltext Access 17 Pages 2006
On the classification of all self-dual additive codes over GF(4) of length up to 12 Fulltext Access 17 Pages 2006
Conditional Doxastic Models: A Qualitative Approach to Dynamic Belief Revision Fulltext Access 17 Pages 2006
AspectLISA: An Aspect-oriented Compiler Construction System Based on Attribute Grammars Fulltext Access 17 Pages 2006
Reasoning About Connector Reconfiguration II: Basic Reconfiguration Logic Fulltext Access 17 Pages 2006
Applying a Model Transformation Taxonomy to Graph Transformation Technology Fulltext Access 17 Pages 2006
Language-Emptiness Checking of Alternating Tree Automata Using Symbolic Reachability Analysis Fulltext Access 17 Pages 2006
Efficient Patterns for Model Checking Partial State Spaces in CTL ∩ LTL Fulltext Access 17 Pages 2006