Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time Fulltext Access 12 Pages 2005
Threshold properties of random boolean constraint satisfaction problems Fulltext Access 12 Pages 2005
From UML models to automatic generated tests for the dotLRN e-learning platform Fulltext Access 12 Pages 2005
Deciding the Security of Protocols with Commuting Public Key Encryption Fulltext Access 12 Pages 2005
On the Relative Soundness of the Free Algebra Model for Public Key Encryption Fulltext Access 12 Pages 2005
Modeling Software Evolution by Treating History as a First Class Entity Fulltext Access 12 Pages 2005
Leveraging UML Profiles to Generate Plugins From Visual Model Transformations Fulltext Access 12 Pages 2005
Trivially noncontractible edges in a contraction critically 5-connected graph Fulltext Access 12 Pages 2005
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs Fulltext Access 13 Pages 2005
On the descriptional complexity of some rewriting mechanisms regulated by context conditions Fulltext Access 13 Pages 2005
The effect of machine availability on the worst-case performance of LPT Fulltext Access 13 Pages 2005
On routing of wavebands for all-to-all communications in all-optical paths and cycles Fulltext Access 13 Pages 2005
An analysis of the LPT algorithm for the max-min and the min-ratio partition problems Fulltext Access 13 Pages 2005
Vertex-disjoint 4-cycles containing specified edges in a bipartite graph Fulltext Access 13 Pages 2005
Acute triangles in triangulations on the plane with minimum degree at least 4 Fulltext Access 13 Pages 2005
A new framework for addressing temporal range queries and some preliminary results Fulltext Access 13 Pages 2005
Computing unsatisfiable k-SAT instances with few occurrences per variable Fulltext Access 13 Pages 2005
Semi-on-line multiprocessor scheduling with given total processing time Fulltext Access 13 Pages 2005
Probabilistic analysis of algorithms for the Dutch national flag problem Fulltext Access 13 Pages 2005
The approximability of the weighted Hamiltonian path completion problem on a tree Fulltext Access 13 Pages 2005
Counterexamples to the nonorientable genus conjecture for complete tripartite graphs Fulltext Access 13 Pages 2005