Deterministic bottom-up tree transducers and ground term rewrite systems Fulltext Access 29 Pages 2009
Approximation algorithms for orthogonal packing problems for hypercubes Fulltext Access 29 Pages 2009
Robustness of temporal logic specifications for continuous-time signals Fulltext Access 30 Pages 2009
A study of substitution, using nominal techniques and Fraenkel–Mostowksi sets Fulltext Access 31 Pages 2009
Frame cellular automata: Configurations, generating sets and related matroids Fulltext Access 33 Pages 2009
Fully abstract models and refinements as tools to compare agents in timed coordination languages Fulltext Access 33 Pages 2009
Polynomial cases of graph decomposition: A complete solution of Holyer’s problem Fulltext Access 33 Pages 2009
Reactors: A data-oriented synchronous/asynchronous programming model for distributed applications Fulltext Access 34 Pages 2009
Relating state-based and process-based concurrency through linear logic (full-version) Fulltext Access 34 Pages 2009
Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids Fulltext Access 35 Pages 2009
Specification and Analysis of SOC Systems Using COWS: A Finance Case Study Fulltext Access 35 Pages 2009
Parabolic Kazhdan–Lusztig polynomials, plethysm and generalized Hall–Littlewood functions for classical types Fulltext Access 35 Pages 2009
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences Fulltext Access 68 Pages 2009
Elation generalized quadrangles with extra automorphisms and trivial spans Fulltext Access 4 Pages 2008
Improved upper bounds on the L(2,1) -labeling of the skew and converse skew product graphs Fulltext Access 4 Pages 2008
On degree sum conditions for long cycles and cycles through specified vertices Fulltext Access 4 Pages 2008
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices Fulltext Access 4 Pages 2008
Symmetric and resolvable λλ-configurations constructed from block designs Fulltext Access 4 Pages 2008
A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs Fulltext Access 4 Pages 2008
An answer to Hirasaka and Muzychuk: Every p-Schur ring over Cp3 is Schurian Fulltext Access 4 Pages 2008