Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
Awareness of others' interests can lead to fruitful collaborations, friendships and positive social change. Interviews of groups involved in both research and corporate work r...
Peer-to-Peer networks are gaining popularity through file-sharing communities. Most P2P networks demand a certain stability from it's nodes in order to function satisfactory. ...
This paper presents a one-year study of Internet packet traffic from a large campus network, showing that 15-25% of TCP connections have at least one TCP RST (reset). Similar resu...