81 citations · 92 across the 10 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.CO2012★ 1 cited
Computational Lower Bounds for Colourful Simplicial Depth
Antoine Deza, Tamon Stephen, Feng Xie
The colourful simplicial depth problem in dimension d is to find a configuration of (d+1) sets of (d+1) points such that the origin is contained in the convex hull of each set (col…
cs.DS2012★ 2 cited
Counting inequivalent monotone Boolean functions
Tamon Stephen, Timothy Yusun
Monotone Boolean functions (MBFs) are Boolean functions satisfying the monotonicity condition for any $x,y \in…
cs.DS2012★ 1 cited
Efficient Algorithms for Finding Tucker Patterns
Cedric Chauve, Tamon Stephen, Maria Tamayo
The Consecutive Ones Property is an important notion for binary matrices, both from a theoretical and applied point of view. Tucker gave in 1972 a characterization of matrices that…