Xusheng Zhi
where else to find them
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
- Thomas Repsonce
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Polynomial Bounds of CFLOBDDs against BDDs | OOPSLA 2025 | 2025-10-16 |
Shows that, given the same variable ordering, a CFLOBDD for any Boolean function is at most polynomially larger than a BDD: groupings count = O(b log b)… | ||
| nothing matches | ||