FSTTCS
2010
Springer
13 years 10 months ago
2010
Springer
Quantitative properties of timed regular languages, such as information content (growth rate, entropy) are explored. The approach suggested by the same authors is extended to lang...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
It is well known that the spectral radius of a tree whose maximum degree is ∆ cannot exceed 2 √
MOC
1998
14 years 4 days ago
1998
We consider solutions of a system of refinement equations written in the form φ = α∈Z a(α)φ(2 · −α), where the vector of functions φ = (φ1, . . . , φr)T is in (Lp(R))...
JUCS
2007
14 years 10 days ago
2007
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...
JCT
2007
14 years 11 days ago
2007
We study the spectral radius of connected non-regular graphs. Let λ1(n,Δ) be the maximum spectral radius among all connected non-regular graphs with n vertices and maximum degre...
VALUETOOLS
2006
ACM
14 years 6 months ago
2006
ACM
We study how the spread of computer viruses, worms, and other self-replicating malware is affected by the logical topology of the network over which they propagate. We consider a...