| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Dynamic Inference in Probabilistic Graphical Models | Feng, Weiming et al. | 2021 |
| 2 | From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix Spaces | Bei, Xiaohui et al. | 2020 |
| 3 | On the Degree of Boolean Functions as Polynomials over ℤ_m | Sun, Xiaoming et al. | 2020 |
| 4 | Querying a Matrix Through Matrix-Vector Products | Sun, Xiaoming et al. | 2019 |
| 5 | On the Decision Tree Complexity of String Matching | He, Xiaoyu et al. | 2018 |
| 6 | On the Sensitivity Complexity of k-Uniform Hypergraph Properties | Li, Qian et al. | 2017 |
| 7 | On the Optimality of Tape Merge of Two Lists with Similar Size | Li, Qian et al. | 2016 |
| 8 | Tight Bounds for Graph Problems in Insertion Streams | Sun, Xiaoming et al. | 2015 |
| 9 | Randomized Communication Complexity for Linear Algebra Problems over Finite Fields | Sun, Xiaoming et al. | 2012 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |