Sciweavers

1520 search results - page 147 / 304
» Class Hierarchy Specialization
Sort
View
FSTTCS
2008
Springer
13 years 9 months ago
STCON in Directed Unique-Path Graphs
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 ...
Sampath Kannan, Sanjeev Khanna, Sudeepa Roy
CORR
2006
Springer
85views Education» more  CORR 2006»
13 years 8 months ago
Interference Channels with Common Information
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...
Jinhua Jiang, Yan Xin, Hari Krishna Garg
ENTCS
2007
158views more  ENTCS 2007»
13 years 8 months ago
Abstraction and Completeness for Real-Time Maude
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...
Peter Csaba Ölveczky, José Meseguer
TCS
2008
13 years 8 months ago
On different generalizations of episturmian words
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...
MOC
2000
83views more  MOC 2000»
13 years 7 months ago
Stability and B-convergence properties of multistep Runge-Kutta methods
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 ...
Shoufu Li