Folgen
John Lapinskas
John Lapinskas
Lecturer in Computer Science, University of Bristol
Bestätigte E-Mail-Adresse bei bristol.ac.uk
Titel
Zitiert von
Zitiert von
Jahr
Amplifiers for the Moran process
A Galanis, A Göbel, LA Goldberg, J Lapinskas, D Richerby
Journal of the ACM (JACM) 64 (1), 1-90, 2017
432017
Approximately counting and sampling small witnesses using a colorful decision oracle
H Dell, J Lapinskas, K Meeks
SIAM Journal on Computing 51 (4), 849-899, 2022
352022
Optimal packings of Hamilton cycles in graphs of high minimum degree
D Kühn, J Lapinskas, D Osthus
Combinatorics, Probability and Computing 22 (3), 394-416, 2013
332013
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
D Kühn, J Lapinskas, D Osthus, V Patel
Proceedings of the London Mathematical Society 109 (3), 733-762, 2014
302014
Fine-grained reductions from approximate counting to decision
H Dell, J Lapinskas
ACM Transactions on Computation Theory (TOCT) 13 (2), 1-24, 2021
292021
Asymptotically optimal amplifiers for the Moran process
LA Goldberg, J Lapinskas, J Lengler, F Meier, K Panagiotou, P Pfister
Theoretical Computer Science 58, 73-93, 2018
262018
On-line Ramsey numbers of paths and cycles
J Cyman, T Dzido, J Lapinskas, A Lo
Electronic Journal of Combinatorics 22 (1), 2015
262015
Penalising transmission to hubs in scale-free spatial random graphs
J Komjáthy, J Lapinskas, J Lengler
Annales de l'Institut Henri Poincare (B) Probabilites et statistiques 57 (4 …, 2021
14*2021
Optimal covers with Hamilton cycles in random graphs
D Hefetz, D Kühn, J Lapinskas, D Osthus
Combinatorica 34 (5), 573-596, 2014
142014
Phase transitions of the Moran process and algorithmic consequences
L Ann Goldberg, J Lapinskas, D Richerby
Random Structures & Algorithms 56 (3), 597-647, 2020
122020
A fixed-parameter perspective on# BIS
R Curticapean, H Dell, F Fomin, LA Goldberg, J Lapinskas
The 12th International Symposium on Parameterized and Exact Computation …, 2017
122017
Approximately counting locally-optimal structures
LA Goldberg, R Gysel, J Lapinskas
Journal of Computer and System Sciences 82 (6), 1144-1160, 2016
112016
Increasing efficacy of contact-tracing applications by user referrals and stricter quarantining
LA Goldberg, J Jorritsma, J Komjáthy, J Lapinskas
Plos one 16 (5), e0250435, 2021
42021
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I
J Komjáthy, J Lapinskas, J Lengler, U Schaller
arXiv preprint arXiv:2309.11840, 2023
32023
Faster exponential-time algorithms for approximately counting independent sets
LA Goldberg, J Lapinskas, D Richerby
Theoretical Computer Science 892, 48-84, 2021
22021
Approximately counting and sampling small witnesses using a colourful decision oracle
JA Lapinskas, H Dell, K Meeks
ACM-SIAM Symposium on Discrete Algorithms (SODA20), 2019
12019
Instability of backoff protocols with arbitrary arrival rates
LA Goldberg, J Lapinskas
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
2023
Graph Ranking and the Cost of Sybil Defense
G Farach-Colton, M Farach-Colton, LA Goldberg, J Lapinskas, R Levi, ...
Proceedings of the 24th ACM Conference on Economics and Computation, 2023, 2023
2023
Nearly optimal independence oracle algorithms for edge estimation in hypergraphs
H Dell, J Lapinskas, K Meeks
arXiv preprint arXiv:2211.03874, 2022
2022
Packings and coverings with Hamilton cycles and on-line Ramsey theory
JA Lapinskas
University of Birmingham, 2014
2014
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20