2 citations · 5 across the 5 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2025
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…
cs.CC2012★ 1 cited
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…
cs.CC2011★ 2 cited
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…