default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIsabel Beichl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j34]Alathea Jensen
, Isabel Beichl:
A Sequential Importance Sampling Algorithm for Counting Linear Extensions. ACM J. Exp. Algorithmics 25: 1-14 (2020)
2010 – 2019
- 2019
- [i2]Isabel Beichl, Alathea Jensen, Francis Sullivan:
A Sequential Importance Sampling Algorithm for Estimating Linear Extensions. CoRR abs/1902.01704 (2019) - 2018
- [j33]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) - 2016
- [i1]Yvonne Kemper, Isabel Beichl:
Approximating the Chromatic Polynomial. CoRR abs/1608.04883 (2016) - 2015
- [j32]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) - 2014
- [j31]David G. Harris, Francis Sullivan, Isabel Beichl:
Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial. Algorithmica 68(4): 916-939 (2014) - [j30]Francis Sullivan, Isabel Beichl:
Permanents, (α)-permanents and Sinkhorn balancing. Comput. Stat. 29(6): 1793-1798 (2014) - 2012
- [j29]Isabel Beichl:
Of Art and CS Education. Comput. Sci. Eng. 14(1): 4 (2012) - [j28]Isabel Beichl:
Is My Car Smarter than My Cat? Comput. Sci. Eng. 14(3): 4-5 (2012) - [j27]Isabel Beichl:
Counting on Today's Students. Comput. Sci. Eng. 14(5): 4 (2012) - [j26]Isabel Beichl:
Hail and Farewell. Comput. Sci. Eng. 14(6): 4 (2012) - 2011
- [j25]Isabel Beichl:
Changes. Comput. Sci. Eng. 13(1): 4 (2011) - [j24]Isabel Beichl:
Watchful Waiting. Comput. Sci. Eng. 13(2): 3-4 (2011) - [j23]Isabel Beichl:
Top of the Charts. Comput. Sci. Eng. 13(5): 4 (2011) - [j22]Isabel Beichl:
Just Try. Comput. Sci. Eng. 13(6): 4-5 (2011) - [c7]David G. Harris, Francis Sullivan, Isabel Beichl:
Linear algebra and sequential importance sampling for network reliability. WSC 2011: 3344-3352 - 2010
- [j21]Isabel Beichl:
Ephemera. Comput. Sci. Eng. 12(1): 3 (2010) - [j20]Isabel Beichl:
You Say You Want a Revolution. Comput. Sci. Eng. 12(2): 5 (2010) - [j19]Isabel Beichl:
Good Policy Makes Good Science. Comput. Sci. Eng. 12(3): 5 (2010) - [j18]Isabel Beichl:
Revitalizing Work in CiSE. Comput. Sci. Eng. 12(5): 4 (2010) - [j17]Isabel Beichl:
Dystopia. Comput. Sci. Eng. 12(6): 4 (2010)
2000 – 2009
- 2009
- [j16]Isabel Beichl:
Begin at the Beginning. Comput. Sci. Eng. 11(1): 3 (2009) - [j15]Isabel Beichl:
We'll Take Care of All Your Problems. Comput. Sci. Eng. 11(2): 3-4 (2009) - [j14]Isabel Beichl, Francis Sullivan:
Cut It Out!. Comput. Sci. Eng. 11(3): 74-79 (2009) - [j13]Isabel Beichl:
Where the Rubber Meets the Road. Comput. Sci. Eng. 11(5): 3 (2009) - [c6]Isabel Beichl, Brian Cloteaux:
A Structural Approach to the Temporal Modeling of Networks. WSC 2009: 788-796 - 2008
- [j12]Isabel Beichl, Francis Sullivan:
Combinatorics in Computing. Comput. Sci. Eng. 10(2): 12-13 (2008) - [c5]Isabel Beichl, Brian Cloteaux:
Generating Network Models Using the S-Metric. MSV 2008: 159-164 - [c4]Isabel Beichl, Brian Cloteaux:
Measuring the effectiveness of the s-metric to produce better network models. WSC 2008: 1020-1028 - 2007
- [j11]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) - 2006
- [j10]Isabel Beichl, Francis Sullivan:
Guest Editors' Introduction: Monte Carlo Methods. Comput. Sci. Eng. 8(2): 7-8 (2006) - [j9]Isabel Beichl, Francis Sullivan:
The Other Monte Carlo Method. Comput. Sci. Eng. 8(2): 42-47 (2006) - 2003
- [j8]April K. Andreas, Isabel Beichl:
Estimating the work in integer partitioning. Comput. Sci. Eng. 5(1): 48-56 (2003) - 2002
- [j7]Isabel Beichl, Francis Sullivan:
It's bound to be right [image state change detection]. Comput. Sci. Eng. 4(2): 86-89 (2002) - [j6]Isabel Beichl:
Dealing with degeneracy in triangulation. Comput. Sci. Eng. 4(6): 70-74 (2002) - 2001
- [j5]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
- [j4]Isabel Beichl, Francis Sullivan:
The Metropolis Algorithm. Comput. Sci. Eng. 2(1): 65-69 (2000) - [j3]Isabel Beichl, Francis Sullivan:
A=B? [Working with large integers]. Comput. Sci. Eng. 2(3): 84-87 (2000)
1990 – 1999
- 1999
- [j2]Isabel Beichl, Francis Sullivan:
The importance of importance sampling. Comput. Sci. Eng. 1(2): 71-73 (1999) - [j1]Isabel Beichl, Francis Sullivan:
Pay me now or pay me later [computer programming techniques]. Comput. Sci. Eng. 1(4): 59-62 (1999) - 1997
- [c3]John Albert Horst, Isabel Beichl:
A Simple Algorithm for Efficient Piecewise Linear Approximation of Space Curves. ICIP (2) 1997: 744-747 - 1996
- [p1]Isabel Beichl, Francis Sullivan:
Parallelizing Computational Geometry: First Steps. Applications on Advanced Architecture Computers 1996: 121-129 - 1995
- [c2]Isabel Beichl, Y. Ansel Teng, James L. Blue:
Parallel Monte Carlo simulation of MBE growth. IPPS 1995: 46-52 - 1993
- [c1]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
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-10-07 22:08 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:
