d abstract) Thomas Feierl⋆ Fakult¨at f¨ur Mathematik Universit¨at Wien Nordbergstr. 15 1090 Wien, Austria Abstract. We determine the weak limit of the distribution of the rand...
rogram. Our abstract interpretation algorithm may then be used to perform static type analysis. The analysis has applications in detecting probable errors in the PostScript code or...
Abstract. The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this proble...
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...