On the one-sided crossing minimization in a bipartite graph with large degrees Fulltext Access 30 Pages 2005
Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines Fulltext Access 30 Pages 2005
Performing work with asynchronous processors: Message-delay-sensitive bounds Fulltext Access 30 Pages 2005
Translation of resolution proofs into short first-order proofs without choice axioms Fulltext Access 31 Pages 2005
Chebyshev polynomials and spanning tree formulas for circulant and related graphs Fulltext Access 31 Pages 2005
ASM refinement and generalizations of forward simulation in data refinement: a comparison Fulltext Access 33 Pages 2005
A partial order semantics approach to the clock explosion problem of timed automata Fulltext Access 33 Pages 2005
Issues in the Analysis of Proof-Search Strategies in Sequential Presentations of Logics Fulltext Access 33 Pages 2005
Results on multiples of primitive polynomials and their products over GF(2) Fulltext Access 33 Pages 2005
Quantum and classical complexity classes: Separations, collapses, and closure properties Fulltext Access 34 Pages 2005
Temporal stratification tests for linear and branching-time deductive databases Fulltext Access 34 Pages 2005
Convergence results for the (1,λ)-SA-ES using the theory of Ï-irreducible Markov chains Fulltext Access 35 Pages 2005
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon Fulltext Access 35 Pages 2005
Heterogeneous Reasoning with Euler/Venn Diagrams Containing Named Constants and FOL Fulltext Access 35 Pages 2005
The existential theory of equations with rational constraints in free groups is PSPACE-complete Fulltext Access 36 Pages 2005
A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint Fulltext Access 37 Pages 2005
Sequential and indexed two-dimensional combinatorial template matching allowing rotations Fulltext Access 37 Pages 2005
From Hopfield nets to recursive networks to graph machines: Numerical machine learning for structured data Fulltext Access 37 Pages 2005
Tableaux on k+1-cores, reduced words for affine permutations, and k-Schur expansions Fulltext Access 38 Pages 2005
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing Fulltext Access 39 Pages 2005