We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spann...
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
Gotsman et al. (SIGGRAPH 2003) presented the first method to generate a provably bijective parameterization of a closed genus-0 manifold mesh to the unit sphere. This involves the...
Shadi Saba, Irad Yavneh, Craig Gotsman, Alla Sheff...
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...