default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Sylvester 0001
Person information
- affiliation: University of Liverpool, UK
- affiliation (former): University of Glasgow, UK
- affiliation (former): University of Cambridge, UK
- affiliation (former): University of Warwick, UK
Other persons with the same name
- John Sylvester 0002 — University of Washington, Seattle, WA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Jessica A. Enright
, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester:
The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation. Algorithmica 86(10): 3186-3230 (2024)- [j7]Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester:
A new temporal interpretation of cluster editing. J. Comput. Syst. Sci. 144: 103551 (2024) - [j6]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SIAM J. Comput. 53(5): 1578-1601 (2024) - [j5]Dimitrios Los, Thomas Sauerwald, John Sylvester:
The Power of Filling in Balanced Allocations. SIAM J. Discret. Math. 38(1): 529-565 (2024) - [c13]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Tight Bounds on Adjacency Labels for Monotone Graph Classes. ICALP 2024: 31:1-31:20 - [c12]Charlotte Out, Nicolás Rivera, Thomas Sauerwald, John Sylvester:
Rumors with Changing Credibility. ITCS 2024: 86:1-86:23 - [c11]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev:
Symmetric-Difference (Degeneracy) and Signed Tree Models. MFCS 2024: 32:1-32:16 - [c10]Edouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SODA 2024: 1147-1165 - [i19]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev:
Symmetric-Difference (Degeneracy) and Signed Tree Models. CoRR abs/2405.09011 (2024) - [i18]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev:
Adjacency Labeling Schemes for Small Classes. CoRR abs/2409.04821 (2024) - 2023
- [j4]Nicolás Rivera, Thomas Sauerwald, John Sylvester:
Multiple random walks on graphs: mixing few to cover many. Comb. Probab. Comput. 32(4): 594-637 (2023) - [c9]Dimitrios Los, Thomas Sauerwald, John Sylvester:
Balanced Allocations with Heterogeneous Bins: The Power of Memory. SODA 2023: 4448-4477 - [c8]Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester:
Cops and Robbers on Multi-Layer Graphs. WG 2023: 319-333 - [i17]Dimitrios Los, Thomas Sauerwald, John Sylvester:
Balanced Allocations with Heterogeneous Bins: The Power of Memory. CoRR abs/2301.09810 (2023) - [i16]Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester:
Cops and Robbers on Multi-Layer Graphs. CoRR abs/2303.03962 (2023) - [i15]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Small But Unwieldy. CoRR abs/2307.11225 (2023) - [i14]Dimitrios Los, Thomas Sauerwald, John Sylvester:
Mean-Biased Processes for Balanced Allocations. CoRR abs/2308.05087 (2023) - [i13]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Tight bounds on adjacency labels for monotone graph classes. CoRR abs/2310.20522 (2023) - [i12]Charlotte Out, Nicolás Rivera, Thomas Sauerwald, John Sylvester:
Rumors with Changing Credibility. CoRR abs/2311.17040 (2023) - 2022
- [j3]Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester:
The power of two choices for random walks. Comb. Probab. Comput. 31(1): 73-100 (2022) - [j2]John Haslegrave, Thomas Sauerwald, John Sylvester:
Time Dependent Biased Random Walks. ACM Trans. Algorithms 18(2): 12:1-12:30 (2022) - [c7]Marcos Kiwi, Markus Schepers, John Sylvester:
Cover and Hitting Times of Hyperbolic Random Graphs. APPROX/RANDOM 2022: 30:1-30:19 - [c6]Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester:
A New Temporal Interpretation of Cluster Editing. IWOCA 2022: 214-227 - [c5]Dimitrios Los, Thomas Sauerwald, John Sylvester:
Balanced Allocations: Caching and Packing, Twinning and Thinning. SODA 2022: 1847-1874 - [i11]Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester:
A New Temporal Interpretation of Cluster Editing. CoRR abs/2202.01103 (2022) - [i10]William Pettersson, John Sylvester:
Bounds on the Twin-Width of Product Graphs. CoRR abs/2202.11556 (2022) - [i9]Dimitrios Los, Thomas Sauerwald, John Sylvester:
The Power of Filling in Balanced Allocations. CoRR abs/2204.04057 (2022) - [i8]Marcos Kiwi, Markus Schepers, John Sylvester:
Cover and Hitting Times of Hyperbolic Random Graphs. CoRR abs/2207.06956 (2022) - 2021
- [j1]John Sylvester:
Random walk hitting times and effective resistance in sparsely connected Erdős-Rényi random graphs. J. Graph Theory 96(1): 44-84 (2021) - [c4]Jessica A. Enright, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester:
The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation. COCOA 2021: 152-166 - [c3]Nicolás Rivera, Thomas Sauerwald, John Sylvester:
Multiple Random Walks on Graphs: Mixing Few to Cover Many. ICALP 2021: 107:1-107:16 - [i7]John Sylvester:
The Cover Time of a (Multiple) Markov Chain with Rational Transition Probabilities is Rational. CoRR abs/2102.12356 (2021) - [i6]Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester:
Tangled Paths: A Random Graph Model from Mallows Permutations. CoRR abs/2108.04786 (2021) - [i5]Dimitrios Los, Thomas Sauerwald, John Sylvester:
Balanced Allocations: Caching and Packing, Twinning and Thinning. CoRR abs/2110.10759 (2021) - 2020
- [c2]Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester:
Choice and Bias in Random Walks. ITCS 2020: 76:1-76:19 - [i4]John Haslegrave, Thomas Sauerwald, John Sylvester:
Time Dependent Biased Random Walks. CoRR abs/2006.02475 (2020) - [i3]Nicolás Rivera, Thomas Sauerwald, John Sylvester:
Multiple Random Walks on Graphs: Mixing Few to Cover Many. CoRR abs/2011.07893 (2020)
2010 – 2019
- 2019
- [c1]Nicolás Rivera, Thomas Sauerwald, Alexandre Stauffer, John Sylvester:
The Dispersion Time of Random Walks on Finite Graphs. SPAA 2019: 103-113 - [i2]Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester:
The Power of Two Choices for Random Walks. CoRR abs/1911.05170 (2019) - 2018
- [i1]Nicolas Rivera, Alexandre Stauffer, Thomas Sauerwald, John Sylvester:
The dispersion time of random walks on finite graphs. CoRR abs/1808.09219 (2018)
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-11-07 20:33 CET 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:
