John Lapinskas

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 26

Top Topics

Globally Optimal

Poisson Process

Phase Transition

Top Venues

Theor. Comput. Sci.

Publications

Holger Dell, John Lapinskas, Kitty Meeks
Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs. ICALP (2024)
Júlia Komjáthy, John Lapinskas, Johannes Lengler, Ulysse Schaller
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs II. CoRR (2023)
Leslie Ann Goldberg, John Lapinskas
Instability of backoff protocols with arbitrary arrival rates. SODA (2023)
Júlia Komjáthy, John Lapinskas, Johannes Lengler, Ulysse Schaller
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I. CoRR (2023)
Gwendolyn Farach-Colton, Martin Farach-Colton, Leslie Ann Goldberg, Hanna Komlós, John Lapinskas, Reut Levi, Moti Medina, Miguel A. Mosteiro
Graph Ranking and the Cost of Sybil Defense. EC (2023)
Holger Dell, John Lapinskas, Kitty Meeks
Nearly optimal independence oracle algorithms for edge estimation in hypergraphs. CoRR (2022)
Leslie Ann Goldberg, John Lapinskas
Instability of backoff protocols with arbitrary arrival rates. CoRR (2022)
Holger Dell, John Lapinskas, Kitty Meeks
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle. SIAM J. Comput. 51 (4) (2022)
Holger Dell, John Lapinskas
Fine-Grained Reductions from Approximate Counting to Decision. ACM Trans. Comput. Theory 13 (2) (2021)
Leslie Ann Goldberg, John Lapinskas, David Richerby
Faster exponential-time algorithms for approximately counting independent sets. Theor. Comput. Sci. 892 (2021)
Leslie Ann Goldberg, John Lapinskas, David Richerby
Phase transitions of the Moran process and algorithmic consequences. Random Struct. Algorithms 56 (3) (2020)
Holger Dell, John Lapinskas, Kitty Meeks
Approximately counting and sampling small witnesses using a colourful decision oracle. SODA (2020)
Leslie Ann Goldberg, John Lapinskas, David Richerby
Faster Exponential-time Algorithms for Approximately Counting Independent Sets. CoRR (2020)
Júlia Komjáthy, John Lapinskas, Johannes Lengler
Stopping explosion by penalising transmission to hubs in scale-free spatial random graphs. CoRR (2020)
Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister
Asymptotically optimal amplifiers for the Moran process. Theor. Comput. Sci. 758 (2019)
Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
A Fixed-Parameter Perspective on #BIS. Algorithmica 81 (10) (2019)
Holger Dell, John Lapinskas, Kitty Meeks
Approximately counting and sampling small witnesses using a colourful decision oracle. CoRR (2019)
Holger Dell, John Lapinskas
Fine-grained reductions from approximate counting to decision. STOC (2018)
Leslie Ann Goldberg, John Lapinskas, David Richerby
Phase Transitions of the Moran Process and Algorithmic Consequences. CoRR (2018)
Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
A Fixed-Parameter Perspective on #BIS. IPEC (2017)
Holger Dell, John Lapinskas
Fine-grained reductions from approximate counting to decision. CoRR (2017)
Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
A Fixed-Parameter Perspective on #BIS. CoRR (2017)
Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby
Amplifiers for the Moran Process. J. ACM 64 (1) (2017)
Leslie Ann Goldberg, Rob Gysel, John Lapinskas
Approximately counting locally-optimal structures. J. Comput. Syst. Sci. 82 (6) (2016)
Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister
Asymptotically Optimal Amplifiers for the Moran Process. CoRR (2016)
Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby
Amplifiers for the Moran Process. ICALP (2016)
Leslie Ann Goldberg, Rob Gysel, John Lapinskas
Approximately Counting Locally-Optimal Structures. ICALP (1) (2015)
Joanna Cyman, Tomasz Dzido, John Lapinskas, Allan Lo
On-line Ramsey Numbers of Paths and Cycles. Electron. J. Comb. 22 (1) (2015)
Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby
Amplifiers for the Moran Process. CoRR (2015)
Leslie Ann Goldberg, Rob Gysel, John Lapinskas
Approximately counting locally-optimal structures. CoRR (2014)
Dan Hefetz, Daniela Kühn, John Lapinskas, Deryk Osthus
Optimal covers with Hamilton cycles in random graphs. Comb. 34 (5) (2014)
Daniela Kühn, John Lapinskas, Deryk Osthus
Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree. Comb. Probab. Comput. 22 (3) (2013)