| A Sequential Importance Sampling Algorithm for Counting Linear Extensions | 0 | 0.34 | 2019 |
| Former CiSE EICs Reflect on the Magazines 20th Anniversary. | 0 | 0.34 | 2018 |
| Approximating the Chromatic Polynomial. | 0 | 0.34 | 2016 |
| Stratified sampling for the Ising model: A graph-theoretic approach. | 0 | 0.34 | 2015 |
| Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial. | 3 | 0.50 | 2014 |
| Permanents, $$\alpha $$ α -permanents and Sinkhorn balancing | 0 | 0.34 | 2014 |
| Permanents, \(\alpha \) -permanents and Sinkhorn balancing | 0 | 0.34 | 2014 |
| Counting on Today's Students | 0 | 0.34 | 2012 |
| Hail and Farewell | 0 | 0.34 | 2012 |
| Is My Car Smarter than My Cat? | 0 | 0.34 | 2012 |
| Of Art and CS Education | 0 | 0.34 | 2012 |
| Watchful Waiting | 0 | 0.34 | 2011 |
| Linear algebra and sequential importance sampling for network reliability | 1 | 0.37 | 2011 |
| Just Try | 0 | 0.34 | 2011 |
| Top of the Charts | 0 | 0.34 | 2011 |
| You Say You Want a Revolution. | 0 | 0.34 | 2010 |
| Revitalizing Work in CiSE | 0 | 0.34 | 2010 |
| Dystopia | 0 | 0.34 | 2010 |
| Good Policy Makes Good Science | 0 | 0.34 | 2010 |
| A structural approach to the temporal modeling of networks | 0 | 0.34 | 2009 |
| Cut It Out! | 0 | 0.34 | 2009 |
| Where the Rubber Meets the Road | 0 | 0.34 | 2009 |
| Begin at the Beginning | 0 | 0.34 | 2009 |
| We'll Take Care of All Your Problems | 0 | 0.34 | 2009 |
| Combinatorics in Computing | 0 | 0.34 | 2008 |
| Measuring the effectiveness of the s-metric to produce better network models | 4 | 0.52 | 2008 |
| Generating Network Models Using the S-Metric | 3 | 0.57 | 2008 |
| Monte Carlo Minimization and Counting: One, Two, ..., Too Many | 0 | 0.34 | 2007 |
| Guest Editors' Introduction: Monte Carlo Methods | 1 | 0.39 | 2006 |
| The other Monte Carlo method | 2 | 0.57 | 2006 |
| Estimating the Work in Integer Partitioning | 0 | 0.34 | 2003 |
| Dealing with degeneracy in triangulation | 3 | 0.45 | 2002 |
| In order to form a more perfect union [minimum spanning tree algorithm]. | 1 | 0.37 | 2001 |
| A=B? [Working with large integers] | 0 | 0.34 | 2000 |
| The Metropolis Algorithm | 27 | 7.80 | 2000 |
| The importance of importance sampling | 8 | 1.15 | 1999 |
| A Simple Algorithm for Efficient Piecewise Linear Approximation of Space Curves | 8 | 0.73 | 1997 |
| Parallel Monte Carlo simulation of MBE growth | 2 | 0.38 | 1995 |
