VU Matematikos ir informatikos fakulteto autoriaus 'Mindaugas Bloznelis' publikacijų sąrašas
pagal Lietuvos akademinių bibliotekų tinklo (LABT) publikacijų bazę VUB:

Eil. Nr. Publikacija
1Bloznelis, Mindaugas. Sparse and clustered stationary temporal networks // 10th Polish combinatorial conference, Będlewo, September 15–21, 2024 : abstracts. [s.l.] : [s.n.]. 2024, p. 11. Prieiga per internetą: <https://10pcc.wmi.amu.edu.pl/wp-content/uploads/2024/09/10pcc-abstracts.pdf>.
2Bloznelis, Mindaugas; Karjalainen, Joona; Leskelä, Lasse. Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs // Journal of applied probability. Cambridge : Cambridge University Press. ISSN 0021-9002. 2024, vol. 61, iss. 2, p. 401-419. DOI: 10.1017/jpr.2023.48.
3Ardickas, Daumilas; Bloznelis, Mindaugas. On the connectivity of community affiliation graph // 2023 IMS International Conference on Statistics and Data Science (ICSDS), December 18-21, 2023, Lisbon, Portugal : program book. Lisbon : Institute of Mathematical Statistics, 2023. ISBN 9780940600867. p. 411. Prieiga per internetą: <https://sites.google.com/view/icsds2023/full-program-book>.
4Bloznelis, Mindaugas; Jaworski, Jerzy; Rybarczyk, Katarzyna. The cover time of a random walk in affiliation networks // Complex networks 2023. The 12th international conference on Complex networks and their applications, 28 - 30 November, 2023, Palermo, Italy : book of abstracts. Palermo. 2023, p. 253-256. Prieiga per internetą: <https://2023.complexnetworks.org/>.
5Bloznelis, Mindaugas. Approximate subgraph count: asymptotic normality and jackknife estimate of variance // EMS 2023. European meeting of statisticians 2023, Warsaw 3–7 July, 2023 : book of abstracts. Warsaw. 2023, p. 52. Prieiga per internetą: <https://ems2023.org/sites/default/files/BoA_1.pdf>.
6Bloznelis, Mindaugas. Approximate subgraph count: asymptotic normality and jackknife estimate of variance // NORDSTAT 2023, 19-22 June, 2023, Gothenburg : [conference booklet (with abstracts)]. Gothenburg. 2023, p. [42]. Prieiga per internetą: <https://nordstat2023.org/wp-content/uploads/2023/06/Booklet_withAbstracts.pdf>.
7Bloznelis, Mindaugas; Leskela, Lasse. Clustering and percolation on superpositions of Bernoulli random graphs // Random structures and algorithms. Hoboken : Wiley. ISSN 1042-9832. eISSN 1098-2418. 2023, vol. 63, iss. 2, p. 283-342. DOI: 10.1002/rsa.21140.
8Bloznelis, Mindaugas; Jaworski, Jerzy; Rybarczyk, Katarzyna. The cover time of a random walk in affiliation networks // IEEE transactions on information theory. Piscataway, NJ : IEEE. ISSN 0018-9448. eISSN 1557-9654. 2022, vol. 68, no. 9, p. 6134-6150. DOI: 10.1109/TIT.2022.3169775.
9Bloznelis, Mindaugas; Karjalainen, Joona; Leskelä, Lasse. Assortativity and bidegree distributions on Bernoulli random graph superpositions // Probability in the engineering and informational sciences. New York : Cambridge University Press. ISSN 0269-9648. eISSN 1469-8951. 2022, vol. 36, iss. 4, p. 1188-1213. DOI: 10.1017/S0269964821000310.
10Bloznelis, Mindaugas; Götze, Friedrich. Edgeworth approximations for distributions of symmetric statistics // Probability theory and related fields. Heidelberg : Springer. ISSN 0178-8051. eISSN 1432-2064. 2022, vol. 183, iss. 3-4, p. 1153-1235. DOI: 10.1007/s00440-022-01144-x.
11Bloznelis, Mindaugas. Tikimybių teorijos paskaitos. Vilnius : Vilniaus universiteto leidykla, 2021. 148 p. ISBN 9786090706626. eISBN 9786090706633. Prieiga per internetą: <https://www.knygynas.vu.lt/tikimybiu-teorijos-paskaitos-2>.
12Bloznelis, Mindaugas; Karjalainen, Joona; Leskelä, Lasse. Assortativity and bidegree distributions on Bernoulli random graph superpositions // Algorithms and models for the Web graph : 17th International Workshop, WAW 2020, Warsaw, Poland, September 21–22, 2020: proceedings. Cham : Springer, 2020. ISBN 9783030484774. eISBN 9783030484781. p. 68-81. (Lecture notes in computer science, ISSN 0302-9743, eISSN 1611-3349 ; vol. 12091). DOI: 10.1007/978-3-030-48478-1_5.
13Bloznelis, Mindaugas. A note on the vertex degree distribution of random intersection graphs // Lithuanian mathematical journal. New York : Springer. ISSN 0363-1672. eISSN 1573-8825. 2020, vol. 60, no. 4, p. 452-455. DOI: 10.1007/s10986-020-09496-4.
14Rybarczyk, Katarzyna; Bloznelis, Mindaugas; Jaworski, Jerzy. A note on the conductance of the binomial random intersection graph // Algorithms and models for the Web graph : 17th International Workshop, WAW 2020, Warsaw, Poland, September 21–22, 2020: proceedings. Cham : Springer, 2020. ISBN 9783030484774. eISBN 9783030484781. p. 124-134. (Lecture notes in computer science, ISSN 0302-9743, eISSN 1611-3349 ; vol. 12091). DOI: 10.1007/978-3-030-48478-1_9.
15Ardickas, Daumilas; Bloznelis, Mindaugas. Clustering coefficient of a preferred attachment affiliation network // Algorithms and models for the Web graph : 17th International Workshop, WAW 2020, Warsaw, Poland, September 21–22, 2020: proceedings. Cham : Springer, 2020. ISBN 9783030484774. eISBN 9783030484781. p. 82-95. (Lecture notes in computer science, ISSN 0302-9743, eISSN 1611-3349 ; vol. 12091). DOI: 10.1007/978-3-030-48478-1_6.
16Bloznelis, Mindaugas. Local probabilities of randomly stopped sums of power-law lattice random variables // Lithuanian mathematical journal. New York : Springer Science+Business Media. ISSN 0363-1672. eISSN 1573-8825. 2019, vol. 59, no. 4, p. 437-468. DOI: 10.1007/s10986-019-09462-9.
17Bloznelis, Mindaugas; Račkauskas, Alfredas. Fifty years in the field of probability: a conversation with professor Vygantas Paulauskas // Lithuanian mathematical journal. New York : Springer Science+Business Media. ISSN 0363-1672. eISSN 1573-8825. 2019, vol. 59, no. 4, p. 425-436. DOI: 10.1007/s10986-019-09464-7.
18Bloznelis, Mindaugas; Jaworski, Jerzy. The asymptotic normality of the global clustering coefficient in sparse random intersection graphs // Algorithms and models for the Web graph : 15th international workshop, WAW 2018, Moscow, Russia, May 17-18, 2018 : proceedings. Cham : Springer International Publishing AG, 2018. ISBN 9783319928708. eISBN 9783319928715. p. 16-29. (Lecture notes in computer science, ISSN 0302-9743, eISSN 1611-3349 ; Vol. 10836). DOI: 10.1007/978-3-319-92871-5_2.
19Bloznelis, Mindaugas; Kurauskas, Valentas. Large cliques in sparse random intersection graphs // Electronic journal of combinatorics. Clemson : Electronic Journal of Combinatorics. ISSN 1077-8926. 2017, Vol. 24, no 2, P2.5 [p. 1-26]. DOI: 10.37236/6233.
20Bloznelis, Mindaugas. Degree-degree distribution in a power law random intersection graph with clustering // Internet mathematics : Ryerson University. ISSN 1542-7951. eISSN 1944-9488. 2017, Vol. 1, no 1, [p. 1-25]. DOI: 10.24166/im.03.2017.
21Bloznelis, Mindaugas; Kurauskas, Valentas. Clustering coefficient of random intersection graphs with infinite degree variance // Internet mathematics : Ryerson University. ISSN 1542-7951. eISSN 1944-9488. 2017, Vol. 1, no. 1, p. 1-23. DOI: 10.24166/im.02.2017.
22Bloznelis, Mindaugas; Petuchovas, Justinas. Correlation between clustering and degree in affiliation networks // Lecture notes in computer science : Springer International Publishing AG, 2017. ISBN 9783319678092. eISBN 9783319678108. ISSN 0302-9743. 2017, Vol. 10519, p. 90-104. DOI: 10.1007/978-3-319-67810-8_7.
23Bloznelis, Mindaugas; Kurauskas, Valentas. Clustering function: Another view on clustering coefficient // Journal of complex networks. Oxford : Oxford University press. ISSN 2051-1310. eISSN 2051-1329. 2016, Vol. 4, No. 1, p. 61-86. DOI: 10.1093/comnet/cnv010.
24Bloznelis, Mindaugas. Kombinatorikos ir grafų teorijos paskaitos. Vilnius : Vilniaus universiteto leidykla, 2016. 117 p. ISBN 9786094596636.
25Bloznelis, Mindaugas; Leskelä, Lasse. Diclique clustering in a directed random graph // Algorithms and models for the web graph : 13th international workshop, WAW 2016, Montreal, December 14-15, 2016 : proceedings / Editors: Bonato, Anthony, Graham, Fan Chung, Pralat. - Ser. : Lecture Notes in Computer Science Vol. 10088. Cham : Springer International Publishing, 2016. ISBN 9783319497860. eISBN 9783319497877. p. 22-33. DOI: 10.1007/978-3-319-49787-7.
26Bloznelis, Mindaugas; Karonski, Michal. Random intersection graph process // Internet mathematics: Special Issue on Algorithms and Models for the Web Graph. New York : Taylor & Francis Inc. ISSN 1542-7951. eISSN 1944-9488. 2015, vol. 11, no. 4-5, p. 385-402. DOI: 10.1080/15427951.2014.982310.
27Bloznelis, Mindaugas. Degree-degree distribution in a power law random intersection graph with clustering // Algorithms and Models for the Web Graph: 12th International Workshop, WAW 2015, Eindhoven, The Netherlands, December 10-11, 2015 : proceedings / Editors: David F. Gleich, Júlia Komjáthy, Nelly Litvak. Cham : Springer International Publishing, 2015. ISBN 9783319267838. eISBN 9783319267845. p. 42-53. (Lecture notes in computer science, ISSN 0302-9743 ; vol. 9476). DOI: 10.1007/978-3-319-26784-5_4.
28Bloznelis, Mindaugas; Godehardt, Erhard; Jaworski, Jerzy; Kurauskas, Valentas; Rybarczyk, Katarzyna. Recent progress in complex network analysis. Models of random intersection graphs // Data science, learning by latent structures, and knowledge discovery / Eds.: Berthold Lausen; Sabine Krolak-Schwerdt; Matthias Böhmer. Heidelberg : Springer, 2015. ISBN 9783662449820. eISBN 9783662449837. p. 69-78. (Studies in classification, data analysis, and knowledge organization). DOI: 10.1007/978-3-662-44983-7_6.
29Bloznelis, Mindaugas; Godehardt, Erhard; Jaworski, Jerzy; Kurauskas, Valentas; Rybarczyk, Katarzyna. Recent progress in complex network analysis. Properties of random intersection graphs // Data science, learning by latent structures, and knowledge discovery / Eds.: Berthold Lausen, Sabine Krolak-Schwerdt, Matthias Böhmer. Heidelberg : Springer, 2015. ISBN 9783662449820. eISBN 9783662449837. p. 79-88. (Studies in classification, data analysis, and knowledge organization). DOI: 10.1007/978-3-662-44983-7_7.
30Bloznelis, Mindaugas. Modeling evolving affiliation networks via random intersection graph processes // 11th international Vilnius conference on probability theory and mathematical statistics : abstracts of communication, Vilnius, birželio 30-liepos 4 d. Vilnius : TEV, 2014. ISBN 9786094332203. p. 89.
31Bloznelis, Mindaugas; Rybarczyk, Katarzyna. k-connectivity of uniform s-intersection graphs // Discrete mathematics. Amsterdam : Elsevier BV * North-Holland. ISSN 1365-8050. 2014, vol. 333, p. 94-100. DOI: 10.1016/j.disc.2012.12.024.
32Bloznelis, Mindaugas; Götze, Friedrich. Preferred attachment in affiliation networks // Journal of statistical physics. New York : Springer. ISSN 0022-4715. 2014, vol. 156, iss. 4, p. 800-821. DOI: 10.1007/s10955-014-1033-8.
33Bloznelis, Mindaugas. Two models of evolving affiliation networks // 11-th German probability and statistics days: abstracts. Ulm : Ulm University. 2014, p. 47.
34Bloznelis, Mindaugas; Karoński, Michał. Random intersection graph process // Algorithms and models for the web graph : 10th international workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013 : proceedings. Series: Lecture notes in computer science, Vol. 8305. Subseries: Theoretical computer science and general issues / Eds. : Bonato, Anthony; Mitzenmacher, Michael; Pralat, Pawel. Berlin : Springer-Verlag Berlin, 2013. ISBN 9783319035352. p. 93-105. DOI: 10.1007/978-3-319-03536-9.
35Bloznelis, Mindaugas; Damarackas, Julius. Degree distribution of an inhomogeneous random intersection graph // Electronic journal of combinatorics. Newark : Electronic Journal Of Combinatorics. ISSN 1077-8926. 2013, vol. 20, no. 3, Art. no. P3 [p. 1-16]. Prieiga per internetą: <http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i3p3> [žiūrėta 2013-10-21].
36Bloznelis, Mindaugas. Degree and clustering coefficient in sparse random intersection graphs // Annals of applied probability. Beachwood : Institute of Mathematical Statistics. ISSN 1050-5164. 2013, Vol. 23, no. 3, p. 1254-1289. DOI: 10.1214/12-AAP874.
37Bloznelis, Mindaugas; Jaworski, Jerzy; Kurauskas, Valentas. Assortativity and clustering of sparse random intersection graphs // Electronic journal of probability. Beachwood : Institute of Mathematical Statistics. ISSN 1083-6489. 2013, Vol. 18, art. no. 38 [p. 1-24]. DOI: 10.1214/EJP.v18-2277.
38Bloznelis, Mindaugas; Łuczak, Tomasz. Perfect matchings in random intersection graphs // Acta mathematica Hungarica. Budapest : Akademiai Kiado Rt. ISSN 0236-5294. 2013, Vol. 138, iss. 1-2, p. 15-33. DOI: 10.1007/s10474-012-0266-8.
39Bloznelis, Mindaugas. Clustering properties of intersection graphs and a liation networks // RS&A2013 : 16th International Conference on Random Structures and Algorithms, Poznan, Poland, 5-9 August, 2013 [Internete]. Poznan : Adam Mickiewicz University. 2013, [1 p.]. Prieiga per internetą: <http://rsa2013.amu.edu.pl/abstracts/Bloznelis.Mindaugas.pdf> [žiūrėta 2013-11-11].
40Bloznelis, Mindaugas. Clustering properties of random intersection graphs // Combinatorial probability and statistical mechanics workshop, 21-23 February 2013, London [Internete]. London : University of London. 2013, [1 p.].
41Bloznelis, Mindaugas; Götze, Friedrich; Jaworski, Jerzy. Birth of a strongly connected giant in an inhomogeneous random digraph // Journal of applied probability. Sheffield : Applied Probability Trust. ISSN 0021-9002. 2012, Vol. 49, no. 3, p. 601-611. DOI: 10.1017/S0021900200009402.
42Kurauskas, Valentas; Bloznelis, Mindaugas. Sankirtų grafai ir klikos // Fizinių ir technologijos mokslų tarpdalykiniai tyrimai : antroji LMA Jaunųjų mokslininkų konferencija, Vilnius, 2012 02 14. Fizinių mokslų sekcija : pranešimų tezės. Vilnius : LMA leidykla. 2012, [1 p.].
43Bloznelis, Mindaugas. Degree and clustering coefficient in sparse random intersection graphs // GPSD 2012 : 10th German Probability and Statistics Days, March 6-9, 2012, Mainz. Mainz : Johannes Gutenberg - Universität Mainz. 2012, p. 60.
44Bloznelis, Mindaugas. Random intersection graphs // 24th Nordic Conference on Mathematical Statistics, 10-14 June, 2012, Umeå University : programme. Umeå, Umeå University. 2012, p. 26.
45Bloznelis, Mindaugas; Radavičius, Irmantas. A note on Hamiltonicity of uniform random intersection graphs // Lithuanian mathematical journal. New York : Springer. ISSN 0363-1672. 2011, vol. 51, no. 2, p. 155-161. DOI: 10.1007/s10986-011-9115-7.
46Bloznelis, Mindaugas. Birth of a strongly connected giant in an inhomogeneous random digrap // 9th German open conference on probability and statistics, Leipzig, March 2-5, 2010 : programme and abstracts. Leipzig : Universität Leipzig. 2010, p. 122-123. Prieiga per internetą: <https://klevas.mif.vu.lt/~bloznelis/tekstai/str46.pdf> [žiūrėta 2018-09-28].
47Bloznelis, Mindaugas. The largest component in a random intersection graph // 10th international Vilnius conference on probability theory and mathematical statistics = 10-oji tarptautinė Vilniaus tikimybių teorijos ir matematinės statistikos konferencija : abstracts of communications. Vilnius : TEV, 2010. ISBN 9786094330094. p. 106-107.
48Bloznelis, Mindaugas; Radavičius, Irmantas. On hamiltonicity of uniform random intersection graphs = Apie tolygių atsitiktinių sankirtų grafų hamiltoniškumą // Lietuvos matematikos rinkinys. LMD darbai. Vilnius : Matematikos ir informatikos institutas. ISSN 0132-2818. 2010, t. 51, p. 443-447. DOI: 10.15388/LMR.2010.80.
49Bloznelis, Mindaugas. Component evolution in general random intersection graphs // SIAM journal on discrete mathematics. Philadelphia : Society for Industrial and Applied Mathematics. ISSN 0895-4801. 2010, vol. 24, no. 2, p. 639-654. DOI: 10.1007/978-3-642-18009-5_5.
50Bloznelis, Mindaugas. The largest component in an inhomogeneous random intersection graph with clustering // Electronic journal of combinatorics. Newark : Electronic Journal Of Combinatorics. ISSN 1077-8926. 2010, vol. 17, no. 1. Prieiga per internetą: <http://www.combinatorics.org/Volume_17/PDF/v17i1r110.pdf> [žiūrėta 2010-08-30].
51Bloznelis, Mindaugas. A random intersection digraph: indegree and outdegree distributions // Discrete mathematics. Amsterdam : Elsevier Science BV. ISSN 0012-365X. 2010, vol. 310, no. 19, p. 2560-2566. DOI: 10.1016/j.disc.2010.06.018.
52Bloznelis, Mindaugas; Götze, Friedrich; Paulauskas, Vygantas; Račkauskas, Alfredas; van Zwet, V. In memoriam Vidmantas Kastytis Bentkus (1949.07.28–2010.06.03) // Lithuanian mathematical journal. New York : Springer. ISSN 0363-1672. 2010, vol. 50, no. 4, p. 367-371. DOI: 10.1007/s10986-010-9092-2.
53Bloznelis, Mindaugas; Radavičius, Irmantas. Simulation study of a tree similarity measure based on small subtree counts = Empirinis mažų pomedžių skaičiais paremto medžių panašumo mato tyrimas // Lietuvos matematikos rinkinys. Vilnius : Vilniaus universiteto leidykla. ISSN 0132-2818. eISSN 2335-898X. 2009, t. 50, p. 362-367. DOI: 10.15388/LMR.2009.64.
54Bloznelis, Mindaugas; Jaworski, J.; Rybarczyk, K. Component evolution in a secure wireless sensor network // Networks. ISSN 0028-3045. 2009, Vol. 53, iss. 1, p. 19-26. DOI: 10.1002/net.20256.
55Bloznelis, Mindaugas; Radavičius, Irmantas. An empirical study of the structure of the shortest path tree = Svorinio grafo trumpiausiųjų kelių medžio empirinė analizė // Lietuvos matematikos rinkinys. Vilnius : Vilniaus universiteto leidykla. ISSN 0132-2818. eISSN 2335-898X. 2008, t. 48-49, p. 338-342. DOI: 10.15388/LMR.2008.18118.
56Bloznelis, Mindaugas. Component evolution in general random intersection graphs // 8th German open conference on probability and statistics: [abstracts], Aachen, March 4-7, 2008. Aachen. 2008, p. 91-92.
57Bloznelis, Mindaugas. Degree distribution of a typical vertex in a general random intersection graph // Lithuanian mathematical journal. ISSN 0363-1672. 2008, vol. 48, no. 1, p. 38-45. DOI: 10.1007/s10986-008-0004-7.
58Bloznelis, Mindaugas. Bootstrap approximation to distributions of finite population U-statistics // Acta applicandae mathematicae. ISSN 0167-8019. 2007, vol. 96, p. 71-86. DOI: 10.1007/s10440-007-9092-3.
59Bloznelis, Mindaugas. Second-order and resampling approximation of finite population U-statistics based on stratified samples // Statistics. ISSN 0233-1888. 2007, vol. 41, no. 4, p. 321-332. DOI: 10.1080/02331880701270424.
60Bloznelis, Mindaugas. Bootstrap approximation to the distribution function of a finite population U statistic // 9th international Vilnius conference on probability theory and mathematical statistics = 9-oji tarptautinė Vilniaus tikimybių teorijos ir matematinės statistikos konferencija : abstracts of communications. Vilnius : TEV, 2006. ISBN 9955680342. p. 108.
61Bloznelis, Mindaugas; Čekanavičius, Vydas; Paulauskas, Vygantas. Tikimybių teorijos ribinės teoremos Lietuvoje // Matematika Lietuvoje po 1945 metų. Vilnius : Matematikos ir informatikos institutas, 2006. ISBN 9986680328. p. 201-210.
62Bloznelis, Mindaugas. Bootstrap approximation to the distribution function of a finite population U statistic // Frankfurter Stochastik-Tage 2006 : German Open Conference on Probability and Statistics, March 14 to 17, 2006, Frankfurt am Main : abstracts. Frankfurt am Main. 2006, p. 71-72.
63Bloznelis, Mindaugas. Orthogonal decomposition of symmetric functions defined on random permutations // Combinatorics, probability and computing. ISSN 0963-5483. 2005, Vol. 14, Iss. 3, p. 249-268. DOI: 10.1017/S0963548304006364.
64Bloznelis, Mindaugas. Tikimybių teorijos paskaitos : mokymo priemonė. Vilnius : [s.n], 2005. 119 p. Prieiga per internetą: <http://www.mif.vu.lt/matinf/asm/mb/paskaitos/tik2005.pdf>.
65Bloznelis, Mindaugas; Čiginas, Andrius. On variance minimization for unequal probability sampling // Workshop on survey sampling theory and methodology : June 17-22, 2005, Vilnius, Lithuania. Vilnius, 2005. ISBN 995558887X. p. 70-75.
66Bloznelis, Mindaugas. Normal approximation for stratified samples // Workshop on survey sampling theory and methodology : June 18-22, 2004, Tartu, Estonia. Tartu. 2004, p. 18-23.
67Bloznelis, Mindaugas. On combinatorial Hoeffding decomposition and asymptotic normality of subgraph count statistics // Trends in mathematics. Basel : Birkhäuser Verlag, 2004. ISBN 3764371285. p. 73-79.
68Bloznelis, Mindaugas. Bias and consistency of jackknife variance estimation in stratified samples // Workshop on survey sampling theory and methodology : May 28-June 3, 2003, Palanga. Vilnius : Statistics Lithuania, 2003. ISBN 9986589983. p. 10-21.
69Bloznelis, Mindaugas. Edgeworth expansions for Studentized versions of symmetric finite population statistics = Baigtinių populiacijų stjudentizuotų simetrinių statistikų Edžvorto skleidiniai // Lietuvos matematikos rinkinys. ISSN 0132-2818. 2003, t. 43, Nr. 3, p. 271-293.
70Bloznelis, Mindaugas. An edgeworth expansion for studentized finite population statistics // Acta applicandae mathematicae. ISSN 0167-8019. 2003, Vol. 78, iss. 1-3, p. 51. DOI: 10.1023/A:1025727820044.
71Bloznelis, Mindaugas. A note on the bias and consistency of the jackknife variance estimator in stratified samples // Statistics. Abingdon : Taylor & Francis. ISSN 0233-1888. 2003, vol. 37, no. 6, p. 489-504. DOI: 10.1080/02664760310001619323.
72Bloznelis, Mindaugas. A note on the multivariate local limit theorem // Statistics & probability letters. Amsterdam : Elsevier. ISSN 0167-7152. 2002, vol. 59, iss. 3, p. 227-233. DOI: 10.1016/S0167-7152(02)00125-6.
73Bloznelis, Mindaugas; Putter, H. Second order and bootstrap approximation to Student's t statistic // Theory of probability and its applications. Philadelphia : SIAM publications. ISSN 0040-585X. 2002, vol. 47, no. 2, p. 300-307.
74Bloznelis, Mindaugas; Götze, Friedrich. An Edgeworth expansion for symmetric finite population statistics // Annals of probability. Cleveland : Institute of Mathematical Statistics. ISSN 0091-1798. 2002, vol. 30, no. 3, p. 1238-1265.
75Bloznelis, Mindaugas. Second-order resampling approximations in finite populations // 8-oji tarptautinė Vilniaus tikimybių teorijos ir matematinės statistikos konferencija : tezių rinkinys. Vilnius : TEV, 2002. ISBN 9955491183. p. 42.
76Bloznelis, Mindaugas. Orthogonal decomposition of combinatorial statistics // Stochastic analysis and its applications : [conference abstracts], Lviv, Ukraina, June 10-17 2001. Lviv : Lviv university press. 2001, p. 6.
77Bloznelis, Mindaugas; Gotze, F. Orthogonal decomposition of finite population statistics and its applications to distributional asymptotics // Annals of statistics. Cleveland : IMS. ISSN 0090-5364. 2001, vol. 29, no. 3, p. 899-917.
78Bloznelis, Mindaugas. One- and two-term Edgeworth expansions for finite population sample mean: exact results I // Lietuvos matematikos rinkinys. ISSN 0132-2818. 2000, nr. 40(3), p. 277-294.
79Bloznelis, Mindaugas; Paulauskas, Vygantas. Central limit theorem in D[0,1] // Skorokhod's ideas in probability theory. Kyiv : Institute of Mathematics. 2000, p. 99-109.
80Bloznelis, Mindaugas; Götze, Friedrich. An Edgeworth expansion for finite population U-statistics // Bernoulli. ISSN 1350-7265. 2000, vol. 6, iss. 4, p. 729-760. DOI: 10.2307/3318517.
81Bloznelis, Mindaugas. One- and two-term Edgeworth expansions for finite population sample mean: exact results II // Lietuvos matematikos rinkinys. ISSN 0132-2818. 2000, nr. 40(4), p. 430-443.
82Bloznelis, Mindaugas; Götze, Friedrich. One term Edgeworth expansion for finite population U-statistics of degree two // Acta applicandae mathematicae. ISSN 0167-8019. 1999, vol. 58, p. 75-90. DOI: 10.1023/A:1006317230342.
83Bloznelis, Mindaugas. A Berry-Esseen bound for finite population Student's statistic // Annals of probability. Cleveland : IMS. ISSN 0091-1798. 1999, vol. 27, no. 4, p. 2089-2108.
84Bloznelis, Mindaugas; Račkauskas, Alfredas. A Berry-Esseen bound for least squares error variance estimators of regression parameters // Lietuvos matematikos rinkinys. ISSN 0132-2818. 1999, t. 39, nr. 1, p. 1-8.
85Bloznelis, Mindaugas; Putter, H. One term Edgeworth expansion for student's t statistic // Probability theory and mathematical statistics : proceedings of the seventh Vilnius conference, Vilnius, Lithuania, 12-18 August, 1998. Vilnius : TEV, 1999. ISBN 9986546729. p. 81-98.