default search action
Michal Przykucki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j14]Michal Przykucki, Alexander Roberts
, Alex Scott
Shotgun reconstruction in the hypercube. Random Struct. Algorithms 60(1): 117-150 (2022) - [j13]Nikolaos Fountoulakis, Michal Przykucki
Algebraic and combinatorial expansion in random simplicial complexes. Random Struct. Algorithms 60(3): 339-366 (2022) - 2020
- [j12]Michal Przykucki, Thomas Shelton:
Smallest Percolating Sets in Bootstrap Percolation on Grids. Electron. J. Comb. 27(4): 4 (2020) - [j11]Michal Przykucki, Alexander Roberts:
Vertex-isoperimetric stability in the hypercube. J. Comb. Theory A 172: 105186 (2020)
2010 – 2019
- 2019
- [j10]Christina Goldschmidt
Parking on a Random Tree. Comb. Probab. Comput. 28(1): 23-45 (2019) - [j9]Colin McDiarmid, Michal Przykucki
On the critical densities of minor-closed classes. Eur. J. Comb. 75: 66-91 (2019) - [j8]Colin McDiarmid, Michal Przykucki
On the purity of minor-closed classes of graphs. J. Comb. Theory B 135: 295-318 (2019) - 2017
- [j7]Béla Bollobás, Michal Przykucki, Oliver Riordan, Julian Sahasrabudhe:
On the Maximum Running Time in Graph Bootstrap Percolation. Electron. J. Comb. 24(2): 2 (2017) - [j6]Karen Gunderson, Sebastian Koch, Michal Przykucki
The time of graph bootstrap percolation. Random Struct. Algorithms 51(1): 143-168 (2017) - 2015
- [j5]Fabrício Siqueira Benevides
Maximum Percolation Time in Two-Dimensional Bootstrap Percolation. SIAM J. Discret. Math. 29(1): 224-251 (2015) - 2013
- [j4]Fabrício Siqueira Benevides, Michal Przykucki:
On Slowly Percolating Sets of Minimal Size in Bootstrap Percolation. Electron. J. Comb. 20(2): 46 (2013) - 2012
- [j3]Michal Przykucki:
Maximal Percolation Time in Hypercubes Under 2-Bootstrap Percolation. Electron. J. Comb. 19(2): 41 (2012) - [j2]Michal Przykucki
Optimal stopping in a search for a vertex with full degree in a random graph. Discret. Appl. Math. 160(3): 339-343 (2012) - 2010
- [j1]Michal Przykucki
Gusein-Zade problem for directed path. Discret. Optim. 7(1-2): 13-20 (2010) - [c3]Marek Klonowski, Michal Przykucki
Practical Universal Random Sampling. IWSEC 2010: 84-100
2000 – 2009
- 2009
- [c2]Marek Klonowski, Michal Przykucki
Data Deletion with Time-Aware Adversary Model. CSE (2) 2009: 659-664 - 2008
- [c1]Marek Klonowski, Michal Przykucki
Data Deletion with Provable Security. WISA 2008: 240-255
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-06-10 20:30 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: