default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Lapinskas
Person information
- affiliation: University of Bristol, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Holger Dell, John Lapinskas, Kitty Meeks:
Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs. ICALP 2024: 54:1-54:17- 2023
- [c7]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: 586-625 - [c6]Leslie Ann Goldberg, John Lapinskas:
Instability of backoff protocols with arbitrary arrival rates. SODA 2023: 3426-3436 - [i13]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 abs/2309.11840 (2023) - [i12]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 abs/2309.11880 (2023) - 2022
- [j11]Holger Dell, John Lapinskas, Kitty Meeks:
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle. SIAM J. Comput. 51(4): 849-899 (2022) - [i11]Leslie Ann Goldberg, John Lapinskas:
Instability of backoff protocols with arbitrary arrival rates. CoRR abs/2203.17144 (2022) - [i10]Holger Dell, John Lapinskas, Kitty Meeks:
Nearly optimal independence oracle algorithms for edge estimation in hypergraphs. CoRR abs/2211.03874 (2022) - 2021
- [j10]Leslie Ann Goldberg, John Lapinskas, David Richerby:
Faster exponential-time algorithms for approximately counting independent sets. Theor. Comput. Sci. 892: 48-84 (2021) - [j9]Holger Dell, John Lapinskas:
Fine-Grained Reductions from Approximate Counting to Decision. ACM Trans. Comput. Theory 13(2): 8:1-8:24 (2021) - 2020
- [j8]Leslie Ann Goldberg, John Lapinskas, David Richerby:
Phase transitions of the Moran process and algorithmic consequences. Random Struct. Algorithms 56(3): 597-647 (2020) - [c5]Holger Dell, John Lapinskas, Kitty Meeks:
Approximately counting and sampling small witnesses using a colourful decision oracle. SODA 2020: 2201-2211 - [i9]Júlia Komjáthy, John Lapinskas, Johannes Lengler:
Stopping explosion by penalising transmission to hubs in scale-free spatial random graphs. CoRR abs/2004.01149 (2020) - [i8]Leslie Ann Goldberg, John Lapinskas, David Richerby:
Faster Exponential-time Algorithms for Approximately Counting Independent Sets. CoRR abs/2005.05070 (2020)
2010 – 2019
- 2019
- [j7]Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas:
A Fixed-Parameter Perspective on #BIS. Algorithmica 81(10): 3844-3864 (2019) - [j6]Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister:
Asymptotically optimal amplifiers for the Moran process. Theor. Comput. Sci. 758: 73-93 (2019) - [i7]Holger Dell, John Lapinskas, Kitty Meeks:
Approximately counting and sampling small witnesses using a colourful decision oracle. CoRR abs/1907.04826 (2019) - 2018
- [c4]Holger Dell, John Lapinskas:
Fine-grained reductions from approximate counting to decision. STOC 2018: 281-288 - [i6]Leslie Ann Goldberg, John Lapinskas, David Richerby:
Phase Transitions of the Moran Process and Algorithmic Consequences. CoRR abs/1804.02293 (2018) - 2017
- [j5]Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
Amplifiers for the Moran Process. J. ACM 64(1): 5:1-5:90 (2017) - [c3]Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas:
A Fixed-Parameter Perspective on #BIS. IPEC 2017: 13:1-13:13 - [i5]Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas:
A Fixed-Parameter Perspective on #BIS. CoRR abs/1702.05543 (2017) - [i4]Holger Dell, John Lapinskas:
Fine-grained reductions from approximate counting to decision. CoRR abs/1707.04609 (2017) - 2016
- [j4]Leslie Ann Goldberg, Rob Gysel, John Lapinskas:
Approximately counting locally-optimal structures. J. Comput. Syst. Sci. 82(6): 1144-1160 (2016) - [c2]Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
Amplifiers for the Moran Process. ICALP 2016: 62:1-62:13 - [i3]Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister:
Asymptotically Optimal Amplifiers for the Moran Process. CoRR abs/1611.04209 (2016) - 2015
- [j3]Joanna Cyman, Tomasz Dzido, John Lapinskas, Allan Lo:
On-line Ramsey Numbers of Paths and Cycles. Electron. J. Comb. 22(1): 1 (2015) - [c1]Leslie Ann Goldberg, Rob Gysel, John Lapinskas:
Approximately Counting Locally-Optimal Structures. ICALP (1) 2015: 654-665 - [i2]Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
Amplifiers for the Moran Process. CoRR abs/1512.05632 (2015) - 2014
- [j2]Dan Hefetz, Daniela Kühn, John Lapinskas, Deryk Osthus:
Optimal covers with Hamilton cycles in random graphs. Comb. 34(5): 573-596 (2014) - [i1]Leslie Ann Goldberg, Rob Gysel, John Lapinskas:
Approximately counting locally-optimal structures. CoRR abs/1411.6829 (2014) - 2013
- [j1]Daniela Kühn, John Lapinskas, Deryk Osthus:
Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree. Comb. Probab. Comput. 22(3): 394-416 (2013)
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-07-03 20:43 CEST 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:
