Ivona Bezáková

Shaoxuan Xu

Proceedings of the 55th ACM Technical Symposium on Computer Science Education, 2024

2023

Partial Credit Grading of DFAs: Automation vs Human Graders.

[BibT_eX]

[DOI]

Nathan Smearsoll

Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 2, 2023

Putting a Context in Context: Investigating the Context of Pencil Puzzles in Multiple Academic Environments.

[BibT_eX]

[DOI]

Zack J. Butler

Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 1, 2023

Feedback Tools and Motivation to Persist in Intro CS Theory.

[BibT_eX]

[DOI]

Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 2, 2023

GRASMOS: Graph Signage Model Selection for Gene Regulatory Networks.

[BibT_eX]

[DOI]

Hannah Miller

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Model Selection of Graph Signage Models Using Maximum Likelihood (Student Abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Counting and Sampling Orientations on Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

Pencil Puzzles as a Context for Introductory Computing Assignments in Diverse Settings.

[BibT_eX]

[DOI]

Hannah Miller

Proceedings of the SIGCSE 2022: The 53rd ACM Technical Symposium on Computer Science Education, 2022

Effective Succinct Feedback for Intro CS Theory: A JFLAP Extension.

[BibT_eX]

[DOI]

Proceedings of the SIGCSE 2022: The 53rd ACM Technical Symposium on Computer Science Education, 2022

2021

The Complexity of Approximating the Matching Polynomial in the Complex Plane.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2021

Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword.

[BibT_eX]

[DOI]

Noga Ron-Zewi

László A. Végh

Theory Comput., 2021

Teaching Computer Science with Abstract Strategy Games.

[BibT_eX]

[DOI]

Proceedings of the SIGCSE '21: The 52nd ACM Technical Symposium on Computer Science Education, 2021

Puzzles in Many Places: Closing the Loop on Propagation.

[BibT_eX]

[DOI]

Proceedings of the SIGCSE '21: The 52nd ACM Technical Symposium on Computer Science Education, 2021

Witness Feedback for Introductory CS Theory Assignments.

[BibT_eX]

[DOI]

Proceedings of the SIGCSE '21: The 52nd ACM Technical Symposium on Computer Science Education, 2021

Sampling Partial Acyclic Orientations in Chordal Graphs by the Lovasz Local Lemma (Student Abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Inapproximability of the Independent Set Polynomial in the Complex Plane.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2020

Effective Feedback for Introductory CS Theory: A JFLAP Extension and Student Persistence.

[BibT_eX]

[DOI]

CoRR, 2020

Prototype of an Automated Feedback Tool for Intro CS Theory.

[BibT_eX]

[DOI]

Proceedings of the 51st ACM Technical Symposium on Computer Science Education, 2020

Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Sampling Random Chordal Graphs by MCMC (Student Abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Finding Detours is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Approximation via Correlation Decay When Strong Spatial Mixing Fails.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

2018

Qualitative Analysis of Open-ended Comments in Introductory CS Courses: (Abstract Only).

[BibT_eX]

[DOI]

Proceedings of the 49th ACM Technical Symposium on Computer Science Education, 2018

Analyzing rich qualitative data to study pencil-puzzle-based assignments in CS1 and CS2.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, 2018

On Counting Oracles for Path Problems.

[BibT_eX]

[DOI]

Andrew Searns

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Computational Counting (Dagstuhl Seminar 18341).

[BibT_eX]

[DOI]

Leslie Ann Goldberg

Mark Jerrum

Dagstuhl Reports, 2017

Pencil Puzzles for Introductory Computer Science: an Experience- and Gender-Neutral Context.

[BibT_eX]

[DOI]

Zack J. Butler

Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education, 2017

2015

On Beyond Sudoku: Pencil Puzzles for Introductory Computer Science (Abstract Only).

[BibT_eX]

[DOI]

Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 2015

2014

Computing and counting longest paths on circular-arc graphs in polynomial time.

[BibT_eX]

[DOI]

George B. Mertzios

Discret. Appl. Math., 2014

On the efficacy of board game strategy development as a first-year CS project.

[BibT_eX]

[DOI]

James E. Heliotis

Sean Strout

Proceedings of the 45th ACM Technical Symposium on Computer Science Education, 2014

Minimum Planar Multi-sink Cuts with Connectivity Priors.

[BibT_eX]

[DOI]

Zachary Langley

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Model AI Assignments 2014.

[BibT_eX]

[DOI]

Daniel Lucas Thompson

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Student development of board game strategies in a web-based graphical infrastructure (abstract only).

[BibT_eX]

[DOI]

Proceedings of the 44th ACM Technical Symposium on Computer Science Education, 2013

Board game strategies in introductory computer science.

[BibT_eX]

[DOI]

James E. Heliotis

Sean Strout

Proceedings of the 44th ACM Technical Symposium on Computer Science Education, 2013

Programming board game strategies in CS2.

[BibT_eX]

[DOI]

James E. Heliotis

Sean Strout

Proceedings of the IEEE Frontiers in Education Conference, 2013

EDR: An energy-aware runtime load distribution system for data-intensive applications in the cloud.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Conference on Cluster Computing, 2013

2012

Counting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time.

[BibT_eX]

[DOI]

Adam J. Friedlander

Theor. Comput. Sci., 2012

Negative Examples for Sequential Importance Sampling of Binary Contingency Tables.

[BibT_eX]

[DOI]

Algorithmica, 2012

Programming board-game strategies in the introductory CS sequence (abstract only).

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

Energy-Aware Replica Selection for Data-Intensive Services in Cloud.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE International Symposium on Modeling, 2012

Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs.

[BibT_eX]

[DOI]

Zachary Langley

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries.

[BibT_eX]

[DOI]

Nayantara Bhatnagar

Dana Randall

J. Comb. Optim., 2011

2010

Counting Minimum (<i>s</i>, <i>t</i>)-Cuts in Weighted Planar Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Adam J. Friedlander

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

Sampling Edge Covers in 3-Regular Graphs.

[BibT_eX]

[DOI]

William A. Rummler

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008

Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Sampling Binary Contingency Tables.

[BibT_eX]

[DOI]

Comput. Sci. Eng., 2008

2007

Sampling binary contingency tables with a greedy start.

[BibT_eX]

[DOI]

Nayantara Bhatnagar

Eric Vigoda

Random Struct. Algorithms, 2007

2006

Graph model selection using maximum likelihood.

[BibT_eX]

[DOI]

Adam Kalai

Rahul Santhanam

Proceedings of the Machine Learning, 2006

2005

Allocating indivisible goods.

[BibT_eX]

[DOI]