Longest increasing subsequences in windows based on canonical antichain partition Fulltext Access 14 Pages 2007
Adaptive searching in succinctly encoded binary relations and tree-structured documents Fulltext Access 14 Pages 2007
A tight linear bound on the synchronization delay of bijective automata Fulltext Access 14 Pages 2007
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms Fulltext Access 14 Pages 2007
View-based query processing: On the relationship between rewriting, answering and losslessness Fulltext Access 14 Pages 2007
A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms Fulltext Access 14 Pages 2007
PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance Fulltext Access 14 Pages 2007
Some set partition statistics in non-crossing partitions and generating functions Fulltext Access 14 Pages 2007
Stochastic complexity for mixture of exponential families in generalized variational Bayes Fulltext Access 14 Pages 2007
Convergence analysis of the OJAn MCA learning algorithm by the deterministic discrete time method Fulltext Access 14 Pages 2007
Feasibility and complexity of broadcasting with random transmission failures Fulltext Access 14 Pages 2007
An Aspect-Oriented Adaptation Framework for Dynamic Component Evolution 1 Fulltext Access 14 Pages 2007
A Method for Patching Interleaving-Replay Attacks in Faulty Security Protocols 1 Fulltext Access 14 Pages 2007
Efficient Reductants Calculi using Partial Evaluation Techniques with Thresholding 1 Fulltext Access 14 Pages 2007
Handling Model Changes: Regression Testing and Test-Suite Update with Model-Checkers Fulltext Access 14 Pages 2007
Architecting Fault-tolerant Component-based Systems: from requirements to testing Fulltext Access 14 Pages 2007
Using Verified Data-Flow Analysis-based Optimizations in Attribute Grammars 1 Fulltext Access 14 Pages 2007
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids Fulltext Access 14 Pages 2007
Algorithmic and explicit determination of the Lovász number for certain circulant graphs Fulltext Access 14 Pages 2007
Pareto optima for total weighted completion time and maximum lateness on a single machine Fulltext Access 14 Pages 2007
A Rewriting Semantics for ABEL with Applications to Hardware/Software Co-Design and Analysis Fulltext Access 14 Pages 2007
Multi Labelled Transition Systems: A Semantic Framework for Nominal Calculi ⋆ Fulltext Access 14 Pages 2007
Paraconsistent Arithmetic with a Local Consistency Operator and Global Selfreference Fulltext Access 14 Pages 2007
A List-machine Benchmark for Mechanized Metatheory: (Extended Abstract) Fulltext Access 14 Pages 2007
Modeling and Verification of Reliable Messaging by Graph Transformation Systems 4 Fulltext Access 14 Pages 2007
Simulation of Generalised Semi-Markov Processes based on Graph Transformation Systems Fulltext Access 14 Pages 2007
Computing the minimum number of hybridization events for a consistent evolutionary history Fulltext Access 15 Pages 2007
Computational complexity of counting problems on 3-regular planar graphs Fulltext Access 15 Pages 2007
Cramer–Damgård signatures revisited: Efficient flat-tree signatures based on factoring Fulltext Access 15 Pages 2007
Finding a minimum path cover of a distance-hereditary graph in polynomial time Fulltext Access 15 Pages 2007
Arithmetic computation in the tile assembly model: Addition and multiplication Fulltext Access 15 Pages 2007