default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Bruce Wilson
- > Home > Persons > David Bruce Wilson
Publications
- 2017
[j17]Richard W. Kenyon, David Bruce Wilson:
The Space of Circular Planar Electrical Networks. SIAM J. Discret. Math. 31(1): 1-28 (2017)- 2015
- [j15]David Bruce Wilson, Uri Zwick
:
A Forward-Backward Single-Source Shortest Paths Algorithm. SIAM J. Comput. 44(3): 698-739 (2015) - 2014
- [i3]David Bruce Wilson, Uri Zwick:
A forward-backward single-source shortest paths algorithm. CoRR abs/1405.7619 (2014) - 2013
- [j13]Claire Mathieu, David B. Wilson:
The Min Mean-Weight Cycle in a Random Network. Comb. Probab. Comput. 22(5): 763-782 (2013) - [c10]David B. Wilson, Uri Zwick:
A Forward-Backward Single-Source Shortest Paths Algorithm. FOCS 2013: 707-716 - 2012
- [j12]Omer Angel, Abraham D. Flaxman, David B. Wilson:
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks. Comb. 32(1): 1-33 (2012) - [i2]Claire Mathieu, David B. Wilson:
The min mean-weight cycle in a random network. CoRR abs/1201.3955 (2012) - 2011
- [j11]Richard W. Kenyon, David B. Wilson:
Double-Dimer Pairings and Skew Young Diagrams. Electron. J. Comb. 18(1) (2011) - 2009
- [j10]Richard W. Kenyon, David B. Wilson:
Combinatorics of Tripartite Boundary Connections for Trees and Dimers. Electron. J. Comb. 16(1) (2009) - 2007
- [j9]Yuval Peres, Oded Schramm, Scott Sheffield, David Bruce Wilson:
Random-Turn Hex and Other Selection Games. Am. Math. Mon. 114(5): 373-387 (2007) - 2005
- [c9]Itai Benjamini, Oded Schramm, David Bruce Wilson:
Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read. STOC 2005: 244-250 - 2004
- [i1]Itai Benjamini, Oded Schramm, David Bruce Wilson:
Balanced Boolean functions that can be evaluated so that every input bit is unlikely to be read. CoRR math.PR/0410282 (2004) - 2001
- [j6]Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Jeong Han Kim, David Bruce Wilson:
The scaling window of the 2-SAT transition. Random Struct. Algorithms 18(3): 201-256 (2001) - 2000
- [j5]Richard W. Kenyon, James Gary Propp, David Bruce Wilson:
Trees and Matchings. Electron. J. Comb. 7 (2000) - 1998
- [j2]James Gary Propp, David Bruce Wilson:
How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph. J. Algorithms 27(2): 170-217 (1998) - 1996
- [j1]James Gary Propp, David Bruce Wilson:
Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Struct. Algorithms 9(1-2): 223-252 (1996) - [c5]David Bruce Wilson, James Gary Propp:
How to Get an Exact Sample From a Generic Markov Chain and Sample a Random Spanning Tree From a Directed Graph, Both Within the Cover Time. SODA 1996: 448-457
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-08-05 21:12 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:
