


default search action
Malvina Vamvakari
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Malvina Vamvakari
:
Asymptotic Behaviour of Univariate and Multivariate Absorption Distributions. RAIRO Theor. Informatics Appl. 58: 15 (2024) - [c4]Malvina Vamvakari:
Local Limit Theorems for q-Multinomial and Multiple Heine Distributions. GASCom 2024: 196-202
2010 – 2019
- 2019
- [j10]Dimitris Panaretos, George Tzavelas
, Malvina Vamvakari
, Demosthenes B. Panagiotakos
:
Investigating the role of orthogonal and non - orthogonal rotation in multivariate factor analysis, in regard to the repeatability of the extracted factors: A simulation study. Commun. Stat. Simul. Comput. 48(7): 2165-2176 (2019) - 2018
- [c3]Thomas Kamalakis, Malvina Vamvakari:
q-Random walks on the integers and on the two-dimensional integer lattice. GASCom 2018: 156-165 - [c2]Andreas Kyriakoussis, Malvina Vamvakari:
On associated q-orthogonal polynomials with a class of discrete q-distributions. GASCom 2018: 172-178 - [e1]Luca Ferrari, Malvina Vamvakari:
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, GASCom 2018, Athens, Greece, June 18-20, 2018. CEUR Workshop Proceedings 2113, CEUR-WS.org 2018 [contents] - 2017
- [j9]Malvina Vamvakari
:
A q-random walk approximated by a q-Brownian motion. Electron. Notes Discret. Math. 59: 51-63 (2017) - 2014
- [j8]Andreas Kyriakoussis, Malvina Vamvakari
:
Continuous Stieltjes-Wigert Limiting Behaviour of a Family of Confluent q-Chu-Vandermonde Distributions. Axioms 3(2): 140-152 (2014) - 2012
- [j7]Andreas Kyriakoussis, Malvina Vamvakari
:
On Terminating and Non-Terminating q-Gauss Hypergeometric Series Distributions and the Associated q-Orthogonal Polynomials. Fundam. Informaticae 117(1-4): 229-248 (2012)
2000 – 2009
- 2007
- [j6]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou
, Malvina Vamvakari
, Michele Zito:
The unsatisfiability threshold revisited. Discret. Appl. Math. 155(12): 1525-1538 (2007) - 2005
- [j5]A. Kyriakoussis, Malvina Vamvakari
:
Generalization of matching extensions in graphs-combinatorial interpretation of orthogonal and q-orthogonal polynomials. Discret. Math. 296(2-3): 199-209 (2005) - 2001
- [j4]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou
, Malvina Vamvakari
, Michele Zito:
The unsatisfiability threshold revisited. Electron. Notes Discret. Math. 9: 81-95 (2001) - [j3]Svante Janson, Yannis C. Stamatiou, Malvina Vamvakari:
Erratum to Bounding the Unsatisfiability Threshold of Random 3-SAT. Random Struct. Algorithms 18(1): 99-100 (2001) - [c1]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou
, Malvina Vamvakari
, Michele Zito:
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. ICTCS 2001: 328-338 - 2000
- [j2]Svante Janson, Yannis C. Stamatiou
, Malvina Vamvakari
:
Bounding the unsatisfiability threshold of random 3-SAT. Random Struct. Algorithms 17(2): 103-116 (2000)
1990 – 1999
- 1999
- [j1]A. Kyriakoussis, M. G. Vamvakari
:
Asymptotic normality of the coefficients of polynomials related to the classical system orthogonal ones. Discret. Math. 205(1-3): 145-169 (1999)
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 2025-03-04 21:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint