John Sylvester

Orcid: 0000-0002-6543-2934

Affiliations:
  • University of Liverpool, UK
  • University of Glasgow, UK (former)
  • University of Cambridge, UK (former)
  • University of Warwick, UK (former)


According to our database1, John Sylvester authored at least 20 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Power of Filling in Balanced Allocations.
SIAM J. Discret. Math., March, 2024

Rumors with Changing Credibility.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Tight bounds on adjacency labels for monotone graph classes.
CoRR, 2023

Mean-Biased Processes for Balanced Allocations.
CoRR, 2023

Small But Unwieldy.
CoRR, 2023

Cops and Robbers on Multi-Layer Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Balanced Allocations with Heterogeneous Bins: The Power of Memory.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Time Dependent Biased Random Walks.
ACM Trans. Algorithms, 2022

The power of two choices for random walks.
Comb. Probab. Comput., 2022

Bounds on the Twin-Width of Product Graphs.
CoRR, 2022

Balanced Allocations: Caching and Packing, Twinning and Thinning.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

A New Temporal Interpretation of Cluster Editing.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Cover and Hitting Times of Hyperbolic Random Graphs.
Proceedings of the Approximation, 2022

2021
Random walk hitting times and effective resistance in sparsely connected Erdős-Rényi random graphs.
J. Graph Theory, 2021

Tangled Paths: A Random Graph Model from Mallows Permutations.
CoRR, 2021

The Cover Time of a (Multiple) Markov Chain with Rational Transition Probabilities is Rational.
CoRR, 2021

Multiple Random Walks on Graphs: Mixing Few to Cover Many.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
Choice and Bias in Random Walks.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
The Dispersion Time of Random Walks on Finite Graphs.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019


  Loading...