Francis Sullivan

According to our database, Francis Sullivan authored at least 49 papers between 1981 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

A Comparison of Quantum and Traditional Fourier Transform Computations.

Damian R. Musk, Francis Sullivan

Comput. Sci. Eng., 2020

2019

A Sequential Importance Sampling Algorithm for Estimating Linear Extensions.

Isabel Beichl, Alathea Jensen, Francis Sullivan

CoRR, 2019

2018

Former CiSE EICs Reflect on the Magazines 20th Anniversary.

Francis Sullivan, Norman Chonacky, Isabel Beichl, George K. Thiruvathukal

Comput. Sci. Eng., 2018

2017

Learning Monte Carlo.

Francis Sullivan

Comput. Sci. Eng., 2017

2015

Stratified sampling for the Ising model: A graph-theoretic approach.

Amanda Streib, Noah Streib, Isabel Beichl, Francis Sullivan

Comput. Phys. Commun., 2015

Sequential Importance Sampling Algorithms for Estimating the All-Terminal Reliability Polynomial of Sparse Graphs.

David G. Harris, Francis Sullivan

Proceedings of the Approximation, 2015

2014

Permanents, (α)-permanents and Sinkhorn balancing.

Francis Sullivan, Isabel Beichl

Comput. Stat., 2014

Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial.

David G. Harris, Francis Sullivan, Isabel Beichl

Algorithmica, 2014

2011

Linear algebra and sequential importance sampling for network reliability.

David G. Harris, Francis Sullivan, Isabel Beichl

Proceedings of the Winter Simulation Conference 2011, 2011

2010

The Art of Approximation.

Francis Sullivan

Comput. Sci. Eng., 2010

The Shape of Things to Come.

Francis Sullivan

Comput. Sci. Eng., 2010

Whip Until Solved.

Francis Sullivan

Comput. Sci. Eng., 2010

2009

Guest Editor's Introduction: Cloud Computing for the Sciences.

Francis Sullivan

Comput. Sci. Eng., 2009

That Was Then, This Is Now.

Francis Sullivan

Comput. Sci. Eng., 2009

Cut It Out!.

Isabel Beichl, Francis Sullivan

Comput. Sci. Eng., 2009

2008

This Time for Sure.

Francis Sullivan

Comput. Sci. Eng., 2008

I Wandered Lonely as a Cloud.

Francis Sullivan

Comput. Sci. Eng., 2008

Curb Your Enthusiasm.

Francis Sullivan

Comput. Sci. Eng., 2008

Combinatorics in Computing.

Isabel Beichl, Francis Sullivan

Comput. Sci. Eng., 2008

2007

Is This the Party to Whom I Am Speaking?

Francis Sullivan

Comput. Sci. Eng., 2007

Wrong Again!.

Francis Sullivan

Comput. Sci. Eng., 2007

Petaflop Essay Contest.

Thomas C. Luu, Ron Soltz, Pavlos Vranas, Christopher M. Frenz, Francis Sullivan

Comput. Sci. Eng., 2007

Monte Carlo Minimization and Counting: One, Two, ..., Too Many.

Isabel Beichl, Dianne P. O'Leary, Francis Sullivan

Comput. Sci. Eng., 2007

2006

Is Numerical Analysis Boring?

Francis Sullivan

Comput. Sci. Eng., 2006

Born to Compute.

Francis Sullivan

Comput. Sci. Eng., 2006

What Is It Like to Be a Bot?

Francis Sullivan

Comput. Sci. Eng., 2006

The Other Monte Carlo Method.

Isabel Beichl, Francis Sullivan

Comput. Sci. Eng., 2006

Guest Editors' Introduction: Monte Carlo Methods.

Isabel Beichl, Francis Sullivan

Comput. Sci. Eng., 2006

2005

Let a Hundred Flowers Bloom and a Hundred Schools of Thought Contend!

Francis Sullivan

Comput. Sci. Eng., 2005

Book Review: Is that Your Final Answer?

Francis Sullivan

Comput. Sci. Eng., 2005

2004

Computational science and pathological science.

Francis Sullivan

Comput. Sci. Eng., 2004

Sez Who? - From the Editors.

Francis Sullivan

Comput. Sci. Eng., 2004

Say every word on every slide.

Francis Sullivan

Comput. Sci. Eng., 2004

2003

Ask the hard questions.

Francis Sullivan

Comput. Sci. Eng., 2003

2002

EWD: making it simple is not easy.

Francis Sullivan

Comput. Sci. Eng., 2002

Trust but verify.

Francis Sullivan

Comput. Sci. Eng., 2002

Guest Eidtors' Introduction Limits on computations.

Douglass E. Post, Francis Sullivan

Comput. Sci. Eng., 2002

It's bound to be right [image state change detection].

Isabel Beichl, Francis Sullivan

Comput. Sci. Eng., 2002

2001

In order to form a more perfect union [minimum spanning tree algorithm].

Isabel Beichl, Francis Sullivan

Comput. Sci. Eng., 2001

2000

Guest Editors Introduction to the top 10 algorithms.

Jack J. Dongarra, Francis Sullivan

Comput. Sci. Eng., 2000

A=B? [Working with large integers].

Isabel Beichl, Francis Sullivan

Comput. Sci. Eng., 2000

The Metropolis Algorithm.

Isabel Beichl, Francis Sullivan

Comput. Sci. Eng., 2000

1999

Pay me now or pay me later [computer programming techniques].

Isabel Beichl, Francis Sullivan

Comput. Sci. Eng., 1999

The importance of importance sampling.

Isabel Beichl, Francis Sullivan

Comput. Sci. Eng., 1999

1996

From Theory to Practice.

Francis Sullivan

ACM Comput. Surv., 1996

Parallelizing Computational Geometry: First Steps.

Isabel Beichl, Francis Sullivan

Proceedings of the Applications on Advanced Architecture Computers, 1996

1993

A data-parallel algorithm for three-dimensional Delaunay triangulation and its implementation.

Y. Ansel Teng, Francis Sullivan, Isabel Beichl, Enrico Puppo

Proceedings of the Proceedings Supercomputing '93, 1993

1987

Ising Spin on a Shared Memory Machine: Computational Experience.

James L. Blue, Francis Sullivan

Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing, 1987

1981

Diamond - A Sorting Method for Vector Machines.

Harvey K. Brock, Barbara J. Brooks, Francis Sullivan

BIT, 1981