John Lapinskas

Orcid: 0000-0003-3197-0854

Affiliations:
  • University of Bristol, UK


According to our database1, John Lapinskas authored at least 18 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs II.
CoRR, 2023

Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I.
CoRR, 2023

Instability of backoff protocols with arbitrary arrival rates.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Graph Ranking and the Cost of Sybil Defense.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle.
SIAM J. Comput., 2022

2021
Fine-Grained Reductions from Approximate Counting to Decision.
ACM Trans. Comput. Theory, 2021

Faster exponential-time algorithms for approximately counting independent sets.
Theor. Comput. Sci., 2021

2020
Phase transitions of the Moran process and algorithmic consequences.
Random Struct. Algorithms, 2020

Stopping explosion by penalising transmission to hubs in scale-free spatial random graphs.
CoRR, 2020

Approximately counting and sampling small witnesses using a colourful decision oracle.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Asymptotically optimal amplifiers for the Moran process.
Theor. Comput. Sci., 2019

A Fixed-Parameter Perspective on #BIS.
Algorithmica, 2019

2017
Amplifiers for the Moran Process.
J. ACM, 2017

2016
Approximately counting locally-optimal structures.
J. Comput. Syst. Sci., 2016

2015
On-line Ramsey Numbers of Paths and Cycles.
Electron. J. Comb., 2015

2014
Optimal covers with Hamilton cycles in random graphs.
Comb., 2014

2013
Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree.
Comb. Probab. Comput., 2013


  Loading...