2 citations · 5 across the 5 of their papers we have counts for
5 papers
Monotone Bounded-Depth Complexity of Homomorphism Polynomials
C. S. Bhargav, Shiteng Chen, Radu Curticapean +1
For every fixed graph , it is known that homomorphism counts from and colorful -subgraph counts can be determined in time on -vertex input graphs , whe…
From independent sets and vertex colorings to isotropic spaces and isotropic decompositions
Xiaohui Bei, Shiteng Chen, Ji Guan +2
In the 1970's, Lovász built a bridge between graphs and alternating matrix spaces, in the context of perfect matchings (FCT 1979). A similar connection between bipartite graphs and…
On the power of dominated players in team competitions
Kai Jin, Pingzhong Tang, Shiteng Chen
We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The c…
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
Shiteng Chen, Elad Verbin, Wei Yu
In this paper we investigate the problem of building a static data structure that represents a string s using space close to its compressed size, and allows fast access to individu…
Width-parameterized SAT: Time-Space Tradeoffs
Shiteng Chen, Tiancheng Lou, Periklis Papakonstantinou +1
Width parameterizations of SAT, such as tree-width and path-width, enable the study of computationally more tractable and practical SAT instances. We give two simple algorithms. On…