![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Matas Sileikis
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Pedro Araújo, Jan Hladký
, Eng Keat Hng
, Matas Sileikis
:
Prominent examples of flip processes. Random Struct. Algorithms 64(3): 692-740 (2024) - 2023
- [j12]Tereza Klimosová
, Christian Reiher
, Andrzej Rucinski
, Matas Sileikis
:
Sandwiching biregular random graphs. Comb. Probab. Comput. 32(1): 1-44 (2023) - 2022
- [j11]Matas Sileikis
, Lutz Warnke:
Counting extensions revisited. Random Struct. Algorithms 61(1): 3-30 (2022) - 2021
- [j10]Jan Hladký
, Christos Pelekis, Matas Sileikis
:
A limit theorem for small cliques in inhomogeneous random graphs. J. Graph Theory 97(4): 578-599 (2021) - [c3]Václav Blazej
, Michal Opler
, Matas Sileikis
, Pavel Valtr
:
On the Intersections of Non-homotopic Loops. CALDAM 2021: 196-205 - [c2]Václav Blazej
, Michal Opler
, Matas Sileikis
, Pavel Valtr
:
Non-homotopic Loops with a Bounded Number of Pairwise Intersections. GD 2021: 210-222 - [i1]Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr:
Non-homotopic Loops with a Bounded Number of Pairwise Intersections. CoRR abs/2108.13953 (2021) - 2020
- [j9]Dimbinaina Ralaivaosaona
, Matas Sileikis
, Stephan G. Wagner
:
A Central Limit Theorem for Almost Local Additive Tree Functionals. Algorithmica 82(3): 642-679 (2020) - [j8]Matas Sileikis
, Lutz Warnke:
Upper Tail Bounds for Stars. Electron. J. Comb. 27(1): 1 (2020)
2010 – 2019
- 2019
- [j7]Matas Sileikis
, Lutz Warnke:
A counterexample to the DeMarco-Kahn upper tail conjecture. Random Struct. Algorithms 55(4): 775-794 (2019) - 2018
- [c1]Dimbinaina Ralaivaosaona, Matas Sileikis
, Stephan G. Wagner:
Asymptotic Normality of Almost Local Functionals in Conditioned Galton-Watson Trees. AofA 2018: 33:1-33:17 - 2017
- [j6]Cecilia Holmgren, Svante Janson, Matas Sileikis:
Multivariate Normal Limit Laws for the Numbers of Fringe Subtrees in m-ary Search Trees and Preferential Attachment Trees. Electron. J. Comb. 24(2): 2 (2017) - [j5]Andrzej Dudek, Alan M. Frieze
, Andrzej Rucinski
, Matas Sileikis
:
Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity. J. Comb. Theory B 122: 719-740 (2017) - 2015
- [j4]Andrzej Dudek, Alan M. Frieze
, Andrzej Rucinski
, Matas Sileikis
:
Loose Hamilton Cycles in Regular Hypergraphs. Comb. Probab. Comput. 24(1): 179-194 (2015) - 2013
- [j3]Andrzej Dudek, Alan M. Frieze
, Andrzej Rucinski
, Matas Sileikis
:
Approximate counting of regular hypergraphs. Inf. Process. Lett. 113(19-21): 785-788 (2013) - 2012
- [j2]Matas Sileikis:
On the Upper Tail of Counts of Strictly Balanced Subgraphs. Electron. J. Comb. 19(1): 4 (2012) - [j1]D. Dzindzalieta, Tomas Juskevicius
, Matas Sileikis
:
Optimal Probability Inequalities for Random Walks Related to Problems in Extremal Combinatorics. SIAM J. Discret. Math. 26(2): 828-837 (2012)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint