Abstract. A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit...
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
Abstract. This paper is concerned with the asymptotic convergence of numerical solutions toward discrete travelling waves for a class of relaxation numerical schemes, approximating...
Abstract. More real systems have many components and their simulation requires significant execution times. The practical needs have conducted to distributed simulation rather tha...