default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn C. Wierman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j19]Yunfan Zhao, John C. Wierman, Thomas G. Marge:
Perfect Domination Ratios of Archimedean Lattices. Electron. J. Comb. 29(3) (2022)- 2021
- [j18]Gaoran Yu, John C. Wierman:
An upper bound for the bond percolation threshold of the cubic lattice by a growth process approach. J. Appl. Probab. 58(3): 677-692 (2021)
2010 – 2019
- 2015
- [j17]John C. Wierman, Gaoran Yu, Theodore Huang:
A Disproof of Tsallis' Bond Percolation Threshold Conjecture for the Kagome Lattice. Electron. J. Comb. 22(2): 2 (2015) - 2011
- [j16]John C. Wierman, Robert M. Ziff:
Self-dual Planar Hypergraphs and Exact Bond Percolation Thresholds. Electron. J. Comb. 18(1) (2011) - 2010
- [j15]Klas Markström, John C. Wierman:
Aperiodic Non-Isomorphic Lattices with Equivalent Percolation and Random-Cluster Models. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [r1]John C. Wierman:
Percolation Thresholds, Exact. Encyclopedia of Complexity and Systems Science 2009: 6579-6587 - 2007
- [j14]William D. May, John C. Wierman:
The Application of Non-Crossing Partitions to Improving Percolation Threshold Bounds. Comb. Probab. Comput. 16(2): 285-307 (2007) - 2006
- [j13]Elvan Ceyhan, Carey E. Priebe, John C. Wierman:
Relative density of the random r. Comput. Stat. Data Anal. 50(8): 1925-1964 (2006) - 2005
- [j12]William D. May, John C. Wierman:
Using Symmetry to Improve Percolation Threshold Bounds. Comb. Probab. Comput. 14(4): 549-566 (2005) - 2004
- [j11]John C. Wierman, David J. Marchette:
Modeling computer virus prevalence with a susceptible-infected-susceptible model with reintroduction. Comput. Stat. Data Anal. 45(1): 3-23 (2004) - 2003
- [j10]John C. Wierman:
Upper And Lower Bounds For The Kagome Lattice Bond Percolation Critical Probability. Comb. Probab. Comput. 12(1): 95-111 (2003) - [j9]John C. Wierman:
Pairs of graphs with site and bond percolation critical probabilities in opposite orders. Discret. Appl. Math. 129(2-3): 545-548 (2003) - 2002
- [j8]John C. Wierman:
An Improved Upper Bound For The Hexagonal Lattice Site Percolation Critical Probability. Comb. Probab. Comput. 11(6): 629-643 (2002) - [j7]John C. Wierman:
Bond percolation critical probability bounds for three Archimedean lattices. Random Struct. Algorithms 20(4): 507-518 (2002)
1990 – 1999
- 1999
- [j6]Sven Erick Alm, John C. Wierman:
Inequalities For Means Of Restricted First-Passage Times In Percolation Theory. Comb. Probab. Comput. 8(4): 307-315 (1999) - 1995
- [j5]John C. Wierman:
Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model. Comb. Probab. Comput. 4: 181-188 (1995) - 1992
- [j4]John C. Wierman:
Equality of the Bond Percolation Critical Exponents for Two Pairs of Dual Lattices. Comb. Probab. Comput. 1: 95-105 (1992)
1980 – 1989
- 1989
- [j3]Tomasz Luczak
, John C. Wierman:
The chromatic number of random graphs at the double jump threshold. Comb. 9(1): 39-49 (1989) - [j2]Edward R. Scheinerman, John C. Wierman:
Optimal and near-optimal broadcast in random graphs. Discret. Appl. Math. 25(3): 289-297 (1989) - 1988
- [j1]Krzysztof Nowicki, John C. Wierman:
Subgraph counts in random graphs using incomplete u-statistics methods. Discret. Math. 72(1-3): 299-310 (1988)
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-04-24 22:52 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:
