default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancis Sullivan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j43]Damian R. Musk
, Francis Sullivan:
A Comparison of Quantum and Traditional Fourier Transform Computations. Comput. Sci. Eng. 22(6): 103-110 (2020)
2010 – 2019
- 2019
- [i1]Isabel Beichl, Alathea Jensen, Francis Sullivan:
A Sequential Importance Sampling Algorithm for Estimating Linear Extensions. CoRR abs/1902.01704 (2019) - 2018
- [j42]Francis Sullivan, Norman Chonacky, Isabel Beichl, George K. Thiruvathukal:
Former CiSE EICs Reflect on the Magazines 20th Anniversary. Comput. Sci. Eng. 20(1): 3-7 (2018) - 2017
- [j41]Francis Sullivan:
Learning Monte Carlo. Comput. Sci. Eng. 19(1): 86-87 (2017) - 2015
- [j40]Amanda Streib, Noah Streib, Isabel Beichl, Francis Sullivan:
Stratified sampling for the Ising model: A graph-theoretic approach. Comput. Phys. Commun. 191: 1-8 (2015) - [c4]David G. Harris, Francis Sullivan:
Sequential Importance Sampling Algorithms for Estimating the All-Terminal Reliability Polynomial of Sparse Graphs. APPROX-RANDOM 2015: 323-340 - 2014
- [j39]David G. Harris, Francis Sullivan, Isabel Beichl:
Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial. Algorithmica 68(4): 916-939 (2014) - [j38]Francis Sullivan, Isabel Beichl:
Permanents, (α)-permanents and Sinkhorn balancing. Comput. Stat. 29(6): 1793-1798 (2014) - 2011
- [c3]David G. Harris, Francis Sullivan, Isabel Beichl:
Linear algebra and sequential importance sampling for network reliability. WSC 2011: 3344-3352 - 2010
- [j37]Francis Sullivan:
Whip Until Solved. Comput. Sci. Eng. 12(1): 73-75 (2010) - [j36]Francis Sullivan:
The Shape of Things to Come. Comput. Sci. Eng. 12(2): 96 (2010) - [j35]Francis Sullivan:
The Art of Approximation. Comput. Sci. Eng. 12(6): 59-61 (2010)
2000 – 2009
- 2009
- [j34]Francis Sullivan:
That Was Then, This Is Now. Comput. Sci. Eng. 11(1): 80 (2009) - [j33]Isabel Beichl, Francis Sullivan:
Cut It Out!. Comput. Sci. Eng. 11(3): 74-79 (2009) - [j32]Francis Sullivan:
Guest Editor's Introduction: Cloud Computing for the Sciences. Comput. Sci. Eng. 11(4): 10-11 (2009) - 2008
- [j31]Francis Sullivan:
Curb Your Enthusiasm. Comput. Sci. Eng. 10(1): 96 (2008) - [j30]Isabel Beichl, Francis Sullivan:
Combinatorics in Computing. Comput. Sci. Eng. 10(2): 12-13 (2008) - [j29]Francis Sullivan:
I Wandered Lonely as a Cloud. Comput. Sci. Eng. 10(3): 88 (2008) - [j28]Francis Sullivan:
This Time for Sure. Comput. Sci. Eng. 10(5): 80 (2008) - 2007
- [j27]Isabel Beichl, Dianne P. O'Leary, Francis Sullivan:
Monte Carlo Minimization and Counting: One, Two, ..., Too Many. Comput. Sci. Eng. 9(1): 72-80 (2007) - [j26]Francis Sullivan:
Wrong Again!. Comput. Sci. Eng. 9(3): 96 (2007) - [j25]Francis Sullivan:
Is This the Party to Whom I Am Speaking? Comput. Sci. Eng. 9(5): 96 (2007) - [j24]Thomas C. Luu, Ron Soltz, Pavlos Vranas, Christopher M. Frenz, Francis Sullivan:
Petaflop Essay Contest. Comput. Sci. Eng. 9(6): 55-59 (2007) - 2006
- [j23]Francis Sullivan:
What Is It Like to Be a Bot? Comput. Sci. Eng. 8(1): 96 (2006) - [j22]Isabel Beichl, Francis Sullivan:
Guest Editors' Introduction: Monte Carlo Methods. Comput. Sci. Eng. 8(2): 7-8 (2006) - [j21]Isabel Beichl, Francis Sullivan:
The Other Monte Carlo Method. Comput. Sci. Eng. 8(2): 42-47 (2006) - [j20]Francis Sullivan:
Born to Compute. Comput. Sci. Eng. 8(4): 88 (2006) - [j19]Francis Sullivan:
Is Numerical Analysis Boring? Comput. Sci. Eng. 8(6): 104 (2006) - 2005
- [j18]Francis Sullivan:
Book Review: Is that Your Final Answer? Comput. Sci. Eng. 7(4): 67 (2005) - [j17]Francis Sullivan:
Let a Hundred Flowers Bloom and a Hundred Schools of Thought Contend! Comput. Sci. Eng. 7(4): 96 (2005) - 2004
- [j16]Francis Sullivan:
Say every word on every slide. Comput. Sci. Eng. 6(1): 3-4 (2004) - [j15]Francis Sullivan:
Sez Who? - From the Editors. Comput. Sci. Eng. 6(2): 4 (2004) - [j14]Francis Sullivan:
Computational science and pathological science. Comput. Sci. Eng. 6(3): 2-3 (2004) - 2003
- [j13]Francis Sullivan:
Ask the hard questions. Comput. Sci. Eng. 5(6): 3-4 (2003) - 2002
- [j12]Francis Sullivan:
Trust but verify. Comput. Sci. Eng. 4(2): 3-4 (2002) - [j11]Isabel Beichl, Francis Sullivan:
It's bound to be right [image state change detection]. Comput. Sci. Eng. 4(2): 86-89 (2002) - [j10]Douglass E. Post, Francis Sullivan:
Guest Eidtors' Introduction Limits on computations. Comput. Sci. Eng. 4(3): 14-15 (2002) - [j9]Francis Sullivan:
EWD: making it simple is not easy. Comput. Sci. Eng. 4(6): 2-3 (2002) - 2001
- [j8]Isabel Beichl, Francis Sullivan:
In order to form a more perfect union [minimum spanning tree algorithm]. Comput. Sci. Eng. 3(2): 60-64 (2001) - 2000
- [j7]Jack J. Dongarra, Francis Sullivan:
Guest Editors Introduction to the top 10 algorithms. Comput. Sci. Eng. 2(1): 22-23 (2000) - [j6]Isabel Beichl, Francis Sullivan:
The Metropolis Algorithm. Comput. Sci. Eng. 2(1): 65-69 (2000) - [j5]Isabel Beichl, Francis Sullivan:
A=B? [Working with large integers]. Comput. Sci. Eng. 2(3): 84-87 (2000)
1990 – 1999
- 1999
- [j4]Isabel Beichl, Francis Sullivan:
The importance of importance sampling. Comput. Sci. Eng. 1(2): 71-73 (1999) - [j3]Isabel Beichl, Francis Sullivan:
Pay me now or pay me later [computer programming techniques]. Comput. Sci. Eng. 1(4): 59-62 (1999) - 1996
- [j2]Francis Sullivan:
From Theory to Practice. ACM Comput. Surv. 28(4es): 25 (1996) - [p1]Isabel Beichl, Francis Sullivan:
Parallelizing Computational Geometry: First Steps. Applications on Advanced Architecture Computers 1996: 121-129 - 1993
- [c2]Y. Ansel Teng, Francis Sullivan, Isabel Beichl, Enrico Puppo:
A data-parallel algorithm for three-dimensional Delaunay triangulation and its implementation. SC 1993: 112-121
1980 – 1989
- 1987
- [c1]James L. Blue, Francis Sullivan:
Ising Spin on a Shared Memory Machine: Computational Experience. PP 1987: 255-264 - 1981
- [j1]Harvey K. Brock, Barbara J. Brooks, Francis Sullivan:
Diamond - A Sorting Method for Vector Machines. BIT 21(2): 142-152 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
