ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
In this paper, the interference channel with common information (ICC), in which two senders need deliver not only private messages but also certain common messages to their corresp...
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
In this paper we study some classes of infinite words generalizing episturmian words, and analyse the relations occurring among such classes. In each case, the reversal operator R...
Michelangelo Bucci, Aldo de Luca, Alessandro De Lu...
This paper continues earlier work by the same author concerning the stability and B-convergence properties of multistep Runge-Kutta methods for the numerical solution of nonlinear ...