Francis Sullivan

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
A Comparison of Quantum and Traditional Fourier Transform Computations.
Comput. Sci. Eng., 2020

2019
A Sequential Importance Sampling Algorithm for Estimating Linear Extensions.
CoRR, 2019

2018
Former CiSE EICs Reflect on the Magazines 20th Anniversary.
Comput. Sci. Eng., 2018

2017
Learning Monte Carlo.
Comput. Sci. Eng., 2017

2015
Stratified sampling for the Ising model: A graph-theoretic approach.
Comput. Phys. Commun., 2015

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

2014
Permanents, (α)-permanents and Sinkhorn balancing.
Comput. Stat., 2014

Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial.
Algorithmica, 2014

2011
Linear algebra and sequential importance sampling for network reliability.
Proceedings of the Winter Simulation Conference 2011, 2011

2010
The Art of Approximation.
Comput. Sci. Eng., 2010

The Shape of Things to Come.
Comput. Sci. Eng., 2010

Whip Until Solved.
Comput. Sci. Eng., 2010

2009
Guest Editor's Introduction: Cloud Computing for the Sciences.
Comput. Sci. Eng., 2009

That Was Then, This Is Now.
Comput. Sci. Eng., 2009

Cut It Out!.
Comput. Sci. Eng., 2009

2008
This Time for Sure.
Comput. Sci. Eng., 2008

I Wandered Lonely as a Cloud.
Comput. Sci. Eng., 2008

Curb Your Enthusiasm.
Comput. Sci. Eng., 2008

Combinatorics in Computing.
Comput. Sci. Eng., 2008

2007
Is This the Party to Whom I Am Speaking?
Comput. Sci. Eng., 2007

Wrong Again!.
Comput. Sci. Eng., 2007

Petaflop Essay Contest.
Comput. Sci. Eng., 2007

Monte Carlo Minimization and Counting: One, Two, ..., Too Many.
Comput. Sci. Eng., 2007

2006
Is Numerical Analysis Boring?
Comput. Sci. Eng., 2006

Born to Compute.
Comput. Sci. Eng., 2006

What Is It Like to Be a Bot?
Comput. Sci. Eng., 2006

The Other Monte Carlo Method.
Comput. Sci. Eng., 2006

Guest Editors' Introduction: Monte Carlo Methods.
Comput. Sci. Eng., 2006

2005
Let a Hundred Flowers Bloom and a Hundred Schools of Thought Contend!
Comput. Sci. Eng., 2005

Book Review: Is that Your Final Answer?
Comput. Sci. Eng., 2005

2004
Computational science and pathological science.
Comput. Sci. Eng., 2004

Sez Who? - From the Editors.
Comput. Sci. Eng., 2004

Say every word on every slide.
Comput. Sci. Eng., 2004

2003
Ask the hard questions.
Comput. Sci. Eng., 2003

2002
EWD: making it simple is not easy.
Comput. Sci. Eng., 2002

Trust but verify.
Comput. Sci. Eng., 2002

Guest Eidtors' Introduction Limits on computations.
Comput. Sci. Eng., 2002

It's bound to be right [image state change detection].
Comput. Sci. Eng., 2002

2001
In order to form a more perfect union [minimum spanning tree algorithm].
Comput. Sci. Eng., 2001

2000
Guest Editors Introduction to the top 10 algorithms.
Comput. Sci. Eng., 2000

A=B? [Working with large integers].
Comput. Sci. Eng., 2000

The Metropolis Algorithm.
Comput. Sci. Eng., 2000

1999
Pay me now or pay me later [computer programming techniques].
Comput. Sci. Eng., 1999

The importance of importance sampling.
Comput. Sci. Eng., 1999

1996
From Theory to Practice.
ACM Comput. Surv., 1996

Parallelizing Computational Geometry: First Steps.
Proceedings of the Applications on Advanced Architecture Computers, 1996

1993
A data-parallel algorithm for three-dimensional Delaunay triangulation and its implementation.
Proceedings of the Proceedings Supercomputing '93, 1993

1987
Ising Spin on a Shared Memory Machine: Computational Experience.
Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing, 1987

1981
Diamond - A Sorting Method for Vector Machines.
BIT, 1981


  Loading...