Michal Przykucki

Orcid: 0000-0002-1565-6841

According to our database1, Michal Przykucki authored at least 17 papers between 2008 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Shotgun reconstruction in the hypercube.
Random Struct. Algorithms, 2022

Algebraic and combinatorial expansion in random simplicial complexes.
Random Struct. Algorithms, 2022

2020
Vertex-isoperimetric stability in the hypercube.
J. Comb. Theory A, 2020

Smallest Percolating Sets in Bootstrap Percolation on Grids.
Electron. J. Comb., 2020

2019
On the purity of minor-closed classes of graphs.
J. Comb. Theory B, 2019

On the critical densities of minor-closed classes.
Eur. J. Comb., 2019

Parking on a Random Tree.
Comb. Probab. Comput., 2019

2017
The time of graph bootstrap percolation.
Random Struct. Algorithms, 2017

On the Maximum Running Time in Graph Bootstrap Percolation.
Electron. J. Comb., 2017

2015
Maximum Percolation Time in Two-Dimensional Bootstrap Percolation.
SIAM J. Discret. Math., 2015

2013
On Slowly Percolating Sets of Minimal Size in Bootstrap Percolation.
Electron. J. Comb., 2013

2012
Optimal stopping in a search for a vertex with full degree in a random graph.
Discret. Appl. Math., 2012

Maximal Percolation Time in Hypercubes Under 2-Bootstrap Percolation.
Electron. J. Comb., 2012

2010
Gusein-Zade problem for directed path.
Discret. Optim., 2010

Practical Universal Random Sampling.
Proceedings of the Advances in Information and Computer Security, 2010

2009
Data Deletion with Time-Aware Adversary Model.
Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, 2009

2008
Data Deletion with Provable Security.
Proceedings of the Information Security Applications, 9th International Workshop, 2008


  Loading...