Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs | 0 | 0.34 | 2022 |
Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword. | 0 | 0.34 | 2021 |
Witness Feedback for Introductory CS Theory Assignments | 0 | 0.34 | 2021 |
Puzzles in Many Places: Closing the Loop on Propagation | 0 | 0.34 | 2021 |
Teaching Computer Science with Abstract Strategy Games | 0 | 0.34 | 2021 |
Prototype of an Automated Feedback Tool for Intro CS Theory. | 0 | 0.34 | 2020 |
Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators. | 0 | 0.34 | 2020 |
Analyzing rich qualitative data to study pencil-puzzle-based assignments in CS1 and CS2. | 0 | 0.34 | 2018 |
Qualitative Analysis of Open-ended Comments in Introductory CS Courses: (Abstract Only). | 0 | 0.34 | 2018 |
On Beyond Sudoku: Pencil Puzzles for Introductory Computer Science (Abstract Only) | 0 | 0.34 | 2015 |
Accelerating simulated annealing for the permanent and combinatorial counting problems | 0 | 0.34 | 2006 |