Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Singh, Alexandros"'
Structural properties of large random maps and lambda-terms may be gleaned by studying the limit distributions of various parameters of interest. In our work we focus on restricted classes of maps and their counterparts in the lambda-calculus, buildi
Externí odkaz:
http://arxiv.org/abs/2106.08291
Autor:
Johri, Sonika, Debnath, Shantanu, Mocherla, Avinash, Singh, Alexandros, Prakash, Anupam, Kim, Jungsang, Kerenidis, Iordanis
Quantum machine learning has seen considerable theoretical and practical developments in recent years and has become a promising area for finding real world applications of quantum computers. In pursuit of this goal, here we combine state-of-the-art
Externí odkaz:
http://arxiv.org/abs/2012.04145
Autor:
Leivaditis, Alexandros, Singh, Alexandros, Stamoulis, Giannos, Thilikos, Dimitrios, Tsatsanis, Konstantinos, Velona, Vasiliki
A graph is sub-unicyclic if it contains at most one cycle. We also say that a graph $G$ is $k$-apex sub-unicyclic if it can become sub-unicyclic by removing $k$ of its vertices. We identify 29 graphs that are the minor-obstructions of the class of $1
Externí odkaz:
http://arxiv.org/abs/1902.02231
Autor:
Leivaditis, Alexandros, Singh, Alexandros, Stamoulis, Giannos, Thilikos, Dimitrios M., Tsatsanis, Konstantinos
A graph is called a pseudoforest if none of its connected components contains more than one cycle. A graph is an apex-pseudoforest if it can become a pseudoforest by removing one of its vertices. We identify 33 graphs that form the minor-obstruction
Externí odkaz:
http://arxiv.org/abs/1811.06761
Autor:
Leivaditis, Alexandros, Singh, Alexandros, Stamoulis, Giannos, Thilikos, Dimitrios M., Tsatsanis, Konstantinos
Publikováno v:
In Discrete Mathematics October 2021 344(10)
Autor:
Leivaditis, Alexandros, Singh, Alexandros, Stamoulis, Giannos, Thilikos, Dimitrios M., Tsatsanis, Konstantinos, Velona, Vasiliki
Publikováno v:
In Discrete Applied Mathematics 30 September 2020 284:538-555
A graph is called a pseudoforest if none of its connected components contains more than one cycle. A graph is an apex-pseudoforest if it can become a pseudoforest by removing one of its vertices. We identify 33 graphs that form the minor obstruction
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2127::6fab4fadd20962bcb4083c552906e623
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:3032002
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:3032002
Publikováno v:
Pure Mathematics & Applications; Jun2022, Vol. 30 Issue 1, p45-55, 11p
Autor:
Giannakis K; Department of Informatics, Ionian University, Corfu, Greece. kgiann@ionio.gr., Singh A; Department of Informatics, Ionian University, Corfu, Greece., Kastampolidou K; Department of Informatics, Ionian University, Corfu, Greece., Papalitsas C; Department of Informatics, Ionian University, Corfu, Greece., Andronikos T; Department of Informatics, Ionian University, Corfu, Greece.
Publikováno v:
Advances in experimental medicine and biology [Adv Exp Med Biol] 2017; Vol. 988, pp. 193-204.
Autor:
Singh A; Department of Informatics, Ionian University, Corfu, Greece. p13sing@ionio.gr., Giannakis K; Department of Informatics, Ionian University, Corfu, Greece., Kastampolidou K; Department of Informatics, Ionian University, Corfu, Greece., Papalitsas C; Department of Informatics, Ionian University, Corfu, Greece.
Publikováno v:
Advances in experimental medicine and biology [Adv Exp Med Biol] 2017; Vol. 989, pp. 201-210.