<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://m2.mtmt.hu/xsl/gui3.xsl" ?>
<myciteResult>
  <serverUrl>https://m2.mtmt.hu/</serverUrl>
  <labelLang>hun</labelLang>
  <responseDate>2026-09-20 21:10</responseDate>
  <content>
    <publication>
      <otype>JournalArticle</otype>
      <mtid>32204289</mtid>
      <status>ADMIN_APPROVED</status>
      <published>true</published>
      <comment>Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, 1117, Hungary            
            MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, Budapest, 1051, Hungary            
            Export Date: 2 December 2021            
            CODEN: TCSCD            
            Correspondence Address: Gyongyosi, L.; Department of Networked Systems and Services, Hungary; email: gyongyosi@hit.bme.hu            
            Funding details: BME FIKP-MI/SC            
            Funding details: 2017-1.2.1-NKP-2017-00001            
            Funding details: Hungarian Scientific Research Fund, OTKA, OTKA K-112125            
            Funding details: Magyar Tudományos Akadémia, MTA            
            Funding details: Emberi Eroforrások Minisztériuma, EMMI            
            Funding details: Nemzeti Kutatási, Fejlesztési és Innovaciós Alap, NKFIA, TUDFO/51757/2019-ITM            
            Funding details: Innovációs és Technológiai Minisztérium            
            Funding details: National Research, Development and Innovation Office            
            Funding text 1: The research reported in this paper has been supported by the Hungarian Academy of Sciences (MTA Premium Postdoctoral Research Program 2019), by the National Research, Development and Innovation Fund ( TUDFO/51757/2019-ITM , Thematic Excellence Program), by the National Research Development and Innovation Office of Hungary (Project No. 2017-1.2.1-NKP-2017-00001 ), by the Hungarian Scientific Research Fund - OTKA K-112125 and in part by the BME Artificial Intelligence FIKP grant of EMMI (Budapest University of Technology, BME FIKP-MI/SC ), and by the Ministry of Innovation and Technology and the National Research, Development and Innovation Office within the Quantum Information National Laboratory of Hungary.</comment>
      <unhandledTickets>0</unhandledTickets>
      <deleted>false</deleted>
      <lastRefresh>2026-05-21T03:59:01.060+0000</lastRefresh>
      <lastModified>2024-05-22T20:57:56.598+0000</lastModified>
      <created>2021-09-16T08:40:30.747+0000</created>
      <creator>
        <snippet>true</snippet>
        <mtid>10040623</mtid>
        <familyName>Gyöngyösi</familyName>
        <givenName>László</givenName>
        <link>/api/author/10040623</link>
        <otype>Author</otype>
        <label>Gyöngyösi László (Informatika)</label>
        <published>true</published>
        <oldId>10040623</oldId>
      </creator>
      <lastDuplumOK>2024-04-24T10:04:19.586+0000</lastDuplumOK>
      <lastDuplumSearch>2024-04-24T10:04:19.586+0000</lastDuplumSearch>
      <adminApproved>2024-05-22T20:57:57.016+0000</adminApproved>
      <adminApprover>
        <snippet>true</snippet>
        <mtid>10003133</mtid>
        <familyName>Boros</familyName>
        <givenName>Annamária</givenName>
        <link>/api/admin/10003133</link>
        <otype>Admin</otype>
        <label>Boros Annamária (MTMT Központi admin)</label>
        <published>true</published>
        <oldId>10003133</oldId>
      </adminApprover>
      <tempLockers>
        <otype>Admin</otype>
        <mtid>10003133</mtid>
        <link>/api/admin/10003133</link>
        <label>Boros Annamária (MTMT Központi admin)</label>
        <familyName>Boros</familyName>
        <givenName>Annamária</givenName>
        <published>true</published>
        <oldId>10003133</oldId>
        <snippet>true</snippet>
      </tempLockers>
      <tempLocked>2024-05-27T17:21:32.173+0000</tempLocked>
      <core>true</core>
      <publicationPending>false</publicationPending>
      <type>
        <snippet>true</snippet>
        <mtid>24</mtid>
        <code>24</code>
        <link>/api/publicationtype/24</link>
        <otype>PublicationType</otype>
        <label>Folyóiratcikk</label>
        <listPosition>1</listPosition>
        <published>true</published>
        <oldId>24</oldId>
        <otypeName>JournalArticle</otypeName>
      </type>
      <subType>
        <snippet>true</snippet>
        <mtid>10000059</mtid>
        <nameEng>Article</nameEng>
        <docType>
          <snippet>true</snippet>
          <mtid>24</mtid>
          <code>24</code>
          <link>/api/publicationtype/24</link>
          <otype>PublicationType</otype>
          <label>Folyóiratcikk</label>
          <listPosition>1</listPosition>
          <published>true</published>
          <oldId>24</oldId>
          <otypeName>JournalArticle</otypeName>
        </docType>
        <link>/api/subtype/10000059</link>
        <name>Szakcikk</name>
        <otype>SubType</otype>
        <label>Szakcikk (Folyóiratcikk)</label>
        <listPosition>101</listPosition>
        <published>true</published>
        <oldId>10000059</oldId>
      </subType>
      <category>
        <snippet>true</snippet>
        <mtid>1</mtid>
        <link>/api/category/1</link>
        <otype>Category</otype>
        <label>Tudományos</label>
        <published>true</published>
        <oldId>1</oldId>
      </category>
      <firstAuthor>L., Gyongyosi</firstAuthor>
      <title>Post-processing optimization for continuous-variable quantum key distribution</title>
      <journal>
        <snippet>true</snippet>
        <sciIndexed>true</sciIndexed>
        <link>/api/journal/4260</link>
        <reviewType>REVIEWED</reviewType>
        <label>THEORETICAL COMPUTER SCIENCE 0304-3975 1879-2294</label>
        <published>true</published>
        <hungarian>false</hungarian>
        <oldId>4260</oldId>
        <noIF>false</noIF>
        <mtid>4260</mtid>
        <scopusIndexed>true</scopusIndexed>
        <pIssn>0304-3975</pIssn>
        <eIssn>1879-2294</eIssn>
        <otype>Journal</otype>
        <lang>FOREIGN</lang>
      </journal>
      <volume>893</volume>
      <firstPage>146</firstPage>
      <lastPage>158</lastPage>
      <firstPageOrInternalIdForSort>146</firstPageOrInternalIdForSort>
      <pageLength>13</pageLength>
      <publishedYear>2021</publishedYear>
      <abstractText>The performance of a continuous-variable quantum key distribution (CVQKD) protocol depends on the efficiency of the post-processing of measurement results. The post-processing methods extract statistical information from the raw data, establish the mutual knowledge between the parties, and produce a final key that provides absolute security. The post-processing phase is a bottleneck in CVQKD with crucial importance to the efficiency and protocol attributes. Post-processing uses the raw data of the parties generated by the quantum-level transmission and a classical authenticated channel to generate a secret key between the parties. The current reconciliation procedures require high-complexity coding with moderate resulting efficiency. Here we define an optimization method for post-processing in continuous-variable quantum key distribution. The reconciliation method achieves additive Gaussian noise on the random secret for arbitrarily low dimensional blocks. The model consumes all information from the raw data blocks to provide maximal efficiency and security via standard operations. The results can be realized by generic Gaussian coding schemes, allowing an easily implementation for experimental CVQKD protocols. © 2021 The Author(s)</abstractText>
      <digital/>
      <printed>true</printed>
      <sourceYear>2021</sourceYear>
      <foreignEdition>true</foreignEdition>
      <foreignLanguage>true</foreignLanguage>
      <fullPublication>true</fullPublication>
      <conferencePublication>false</conferencePublication>
      <nationalOrigin>true</nationalOrigin>
      <missingAuthor>false</missingAuthor>
      <oaType>NONE</oaType>
      <oaCheckDate>2026-05-21</oaCheckDate>
      <oaFree>false</oaFree>
      <citationCount>7</citationCount>
      <citationCountUnpublished>0</citationCountUnpublished>
      <citationCountWoOther>7</citationCountWoOther>
      <independentCitCountWoOther>6</independentCitCountWoOther>
      <nationalOriginCitationCount>1</nationalOriginCitationCount>
      <foreignEditionCitationCount>7</foreignEditionCitationCount>
      <doiCitationCount>7</doiCitationCount>
      <wosCitationCount>7</wosCitationCount>
      <scopusCitationCount>2</scopusCitationCount>
      <wosScopusCitationCount>7</wosScopusCitationCount>
      <wosScopusCitationCountWoOther>7</wosScopusCitationCountWoOther>
      <wosScopusIndependentCitationCount>6</wosScopusIndependentCitationCount>
      <wosScopusIndependentCitationCountWoOther>6</wosScopusIndependentCitationCountWoOther>
      <independentCitationCount>6</independentCitationCount>
      <selfCitationCount>1</selfCitationCount>
      <unhandledCitationCount>0</unhandledCitationCount>
      <citingPubCount>7</citingPubCount>
      <independentCitingPubCount>6</independentCitingPubCount>
      <citingPubCountWoOther>7</citingPubCountWoOther>
      <independentCitingPubCountWoOther>6</independentCitingPubCountWoOther>
      <unhandledCitingPubCount>0</unhandledCitingPubCount>
      <citedPubCount>23</citedPubCount>
      <citedCount>23</citedCount>
      <pubStats>
        <types>
          <type>Folyóiratcikk</type>
          <typeEng>Journal Article</typeEng>
          <code>24</code>
          <count>7</count>
        </types>
        <types>
          <type>Könyvrészlet</type>
          <typeEng>Chapter in Book</typeEng>
          <code>25</code>
          <count>0</count>
        </types>
        <types>
          <type>Könyv</type>
          <typeEng>Book</typeEng>
          <code>23</code>
          <count>0</count>
        </types>
        <types>
          <type>Egyéb konferenciaközlemény</type>
          <typeEng>Conference paper</typeEng>
          <code>31</code>
          <count>0</count>
        </types>
        <types>
          <type>Egyéb konferenciakötet</type>
          <typeEng>Conference proceedings</typeEng>
          <code>32</code>
          <count>0</count>
        </types>
        <types>
          <type>Oltalmi formák</type>
          <typeEng>Protection forms</typeEng>
          <code>26</code>
          <count>0</count>
        </types>
        <types>
          <type>Disszertáció</type>
          <typeEng>Thesis</typeEng>
          <code>28</code>
          <count>0</count>
        </types>
        <types>
          <type>Egyéb</type>
          <typeEng>Miscellaneous</typeEng>
          <code>29</code>
          <count>0</count>
        </types>
        <types>
          <type>Alkotás</type>
          <typeEng>Achievement</typeEng>
          <code>22</code>
          <count>0</count>
        </types>
        <types>
          <type>Kutatási adat</type>
          <typeEng>Research data</typeEng>
          <code>33</code>
          <count>0</count>
        </types>
        <citationTypes>
          <type>Folyóiratcikk</type>
          <typeEng>Journal Article</typeEng>
          <code>24</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Könyvrészlet</type>
          <typeEng>Chapter in Book</typeEng>
          <code>25</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Könyv</type>
          <typeEng>Book</typeEng>
          <code>23</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Egyéb konferenciaközlemény</type>
          <typeEng>Conference paper</typeEng>
          <code>31</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Egyéb konferenciakötet</type>
          <typeEng>Conference proceedings</typeEng>
          <code>32</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Oltalmi formák</type>
          <typeEng>Protection forms</typeEng>
          <code>26</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Disszertáció</type>
          <typeEng>Thesis</typeEng>
          <code>28</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Egyéb</type>
          <typeEng>Miscellaneous</typeEng>
          <code>29</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Alkotás</type>
          <typeEng>Achievement</typeEng>
          <code>22</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Kutatási adat</type>
          <typeEng>Research data</typeEng>
          <code>33</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <years>
          <year>2022</year>
          <publicationCount>0</publicationCount>
          <citationCount>1</citationCount>
          <independentCitationCount>1</independentCitationCount>
          <citingPubCount>1</citingPubCount>
          <independentCitingPubCount>1</independentCitingPubCount>
          <oaStats/>
          <oaStats2/>
        </years>
        <years>
          <year>2023</year>
          <publicationCount>0</publicationCount>
          <citationCount>0</citationCount>
          <independentCitationCount>0</independentCitationCount>
          <citingPubCount>0</citingPubCount>
          <independentCitingPubCount>0</independentCitingPubCount>
          <oaStats/>
          <oaStats2/>
        </years>
        <years>
          <year>2024</year>
          <publicationCount>0</publicationCount>
          <citationCount>0</citationCount>
          <independentCitationCount>0</independentCitationCount>
          <citingPubCount>0</citingPubCount>
          <independentCitingPubCount>0</independentCitingPubCount>
          <oaStats/>
          <oaStats2/>
        </years>
        <years>
          <year>2025</year>
          <publicationCount>0</publicationCount>
          <citationCount>4</citationCount>
          <independentCitationCount>4</independentCitationCount>
          <citingPubCount>4</citingPubCount>
          <independentCitingPubCount>4</independentCitingPubCount>
          <oaStats/>
          <oaStats2/>
        </years>
        <years>
          <year>2026</year>
          <publicationCount>0</publicationCount>
          <citationCount>2</citationCount>
          <independentCitationCount>1</independentCitationCount>
          <citingPubCount>2</citingPubCount>
          <independentCitingPubCount>1</independentCitingPubCount>
          <oaStats/>
          <oaStats2/>
        </years>
      </pubStats>
      <ratingsForSort>Q2</ratingsForSort>
      <hasCitationDuplums>false</hasCitationDuplums>
      <inSelectedPubs>10040623</inSelectedPubs>
      <importDuplum>false</importDuplum>
      <importOverwritten>false</importOverwritten>
      <importSkipped>false</importSkipped>
      <userChangeableUntil>2021-12-15T09:44:48.230+0000</userChangeableUntil>
      <directInstitutesForSort>Hálózati Rendszerek és Szolgáltatások Tanszék (BME / VIK)</directInstitutesForSort>
      <ownerAuthorCount>1</ownerAuthorCount>
      <ownerInstituteCount>7</ownerInstituteCount>
      <directInstituteCount>1</directInstituteCount>
      <authorCount>1</authorCount>
      <contributorCount>0</contributorCount>
      <hasQualityFactor>true</hasQualityFactor>
      <tempLockerIds>10003133</tempLockerIds>
      <languages>
        <language>
          <otype>Language</otype>
          <mtid>10002</mtid>
          <link>/api/language/10002</link>
          <label>Angol</label>
          <name>Angol</name>
          <nameEng>English</nameEng>
          <published>true</published>
          <oldId>2</oldId>
          <snippet>true</snippet>
        </language>
      </languages>
      <authorships>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>97470256</mtid>
          <link>/api/authorship/97470256</link>
          <label>L., Gyongyosi ✉ [Gyöngyösi, László (Informatika), szerző] Hálózati Rendszerek és Szolgáltatások Tanszék (BME / VIK)</label>
          <listPosition>1</listPosition>
          <share>1.0</share>
          <first>true</first>
          <last>false</last>
          <corresponding>true</corresponding>
          <author>
            <otype>Author</otype>
            <mtid>10040623</mtid>
            <link>/api/author/10040623</link>
            <label>Gyöngyösi László (Informatika)</label>
            <familyName>Gyöngyösi</familyName>
            <givenName>László</givenName>
            <published>true</published>
            <oldId>10040623</oldId>
            <snippet>true</snippet>
          </author>
          <familyName>L.</familyName>
          <givenName>Gyongyosi</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <snippet>true</snippet>
        </authorship>
      </authorships>
      <identifiers>
        <identifier>
          <otype>PublicationIdentifier</otype>
          <mtid>19290630</mtid>
          <link>/api/publicationidentifier/19290630</link>
          <label>DOI: 10.1016/j.tcs.2021.08.023</label>
          <source>
            <otype>PlainSource</otype>
            <mtid>6</mtid>
            <link>/api/publicationsource/6</link>
            <label>DOI</label>
            <type>
              <otype>PublicationSourceType</otype>
              <mtid>10001</mtid>
              <link>/api/publicationsourcetype/10001</link>
              <label>DOI</label>
              <mayHaveOa>true</mayHaveOa>
              <published>true</published>
              <snippet>true</snippet>
            </type>
            <name>DOI</name>
            <nameEng>DOI</nameEng>
            <linkPattern>https://doi.org/@@@</linkPattern>
            <publiclyVisible>true</publiclyVisible>
            <published>true</published>
            <oldId>6</oldId>
            <snippet>true</snippet>
          </source>
          <validState>IDENTICAL</validState>
          <idValue>10.1016/j.tcs.2021.08.023</idValue>
          <realUrl>https://doi.org/10.1016/j.tcs.2021.08.023</realUrl>
          <published>false</published>
          <snippet>true</snippet>
        </identifier>
        <identifier>
          <otype>PublicationIdentifier</otype>
          <mtid>20250415</mtid>
          <link>/api/publicationidentifier/20250415</link>
          <label>WoS: 000710180500010</label>
          <source>
            <otype>PlainSource</otype>
            <mtid>1</mtid>
            <link>/api/publicationsource/1</link>
            <label>WoS</label>
            <type>
              <otype>PublicationSourceType</otype>
              <mtid>10003</mtid>
              <link>/api/publicationsourcetype/10003</link>
              <label>Indexelő adatbázis</label>
              <mayHaveOa>false</mayHaveOa>
              <published>true</published>
              <snippet>true</snippet>
            </type>
            <name>WoS</name>
            <nameEng>WoS</nameEng>
            <linkPattern>https://www.webofscience.com/wos/woscc/full-record/@@@</linkPattern>
            <publiclyVisible>true</publiclyVisible>
            <published>true</published>
            <oldId>1</oldId>
            <snippet>true</snippet>
          </source>
          <validState>IDENTICAL</validState>
          <idValue>000710180500010</idValue>
          <realUrl>https://www.webofscience.com/wos/woscc/full-record/000710180500010</realUrl>
          <published>false</published>
          <snippet>true</snippet>
        </identifier>
        <identifier>
          <otype>PublicationIdentifier</otype>
          <mtid>20250565</mtid>
          <link>/api/publicationidentifier/20250565</link>
          <label>Scopus: 85114686983</label>
          <source>
            <otype>PlainSource</otype>
            <mtid>3</mtid>
            <link>/api/publicationsource/3</link>
            <label>Scopus</label>
            <type>
              <otype>PublicationSourceType</otype>
              <mtid>10003</mtid>
              <link>/api/publicationsourcetype/10003</link>
              <label>Indexelő adatbázis</label>
              <mayHaveOa>false</mayHaveOa>
              <published>true</published>
              <snippet>true</snippet>
            </type>
            <name>Scopus</name>
            <nameEng>Scopus</nameEng>
            <linkPattern>http://www.scopus.com/record/display.url?origin=inward&amp;eid=2-s2.0-@@@</linkPattern>
            <publiclyVisible>true</publiclyVisible>
            <published>true</published>
            <oldId>3</oldId>
            <snippet>true</snippet>
          </source>
          <validState>IDENTICAL</validState>
          <idValue>85114686983</idValue>
          <realUrl>http://www.scopus.com/record/display.url?origin=inward&amp;eid=2-s2.0-85114686983</realUrl>
          <published>false</published>
          <snippet>true</snippet>
        </identifier>
        <identifier>
          <otype>PublicationIdentifier</otype>
          <mtid>19290631</mtid>
          <link>/api/publicationidentifier/19290631</link>
          <label>Egyéb URL: https://linkinghub.elsevier.com/retrieve/pii/S0304397521004941</label>
          <source>
            <otype>PlainSource</otype>
            <mtid>40</mtid>
            <link>/api/publicationsource/40</link>
            <label>Egyéb URL</label>
            <type>
              <otype>PublicationSourceType</otype>
              <mtid>10006</mtid>
              <link>/api/publicationsourcetype/10006</link>
              <label>Link</label>
              <mayHaveOa>true</mayHaveOa>
              <published>true</published>
              <snippet>true</snippet>
            </type>
            <name>Egyéb URL</name>
            <nameEng>Other URL</nameEng>
            <linkPattern>@@@</linkPattern>
            <publiclyVisible>true</publiclyVisible>
            <published>true</published>
            <oldId>40</oldId>
            <snippet>true</snippet>
          </source>
          <idValue>https://linkinghub.elsevier.com/retrieve/pii/S0304397521004941</idValue>
          <realUrl>https://linkinghub.elsevier.com/retrieve/pii/S0304397521004941</realUrl>
          <published>false</published>
          <snippet>true</snippet>
        </identifier>
      </identifiers>
      <ratings>
        <rating>
          <otype>SjrRating</otype>
          <mtid>11204041</mtid>
          <link>/api/sjrrating/11204041</link>
          <label>sjr:Q2 (2021) Scopus - Computer Science (miscellaneous) THEORETICAL COMPUTER SCIENCE 0304-3975 1879-2294</label>
          <listPos>85</listPos>
          <rankValue>0.49</rankValue>
          <type>journal</type>
          <ratingType>
            <otype>RatingType</otype>
            <mtid>10002</mtid>
            <link>/api/ratingtype/10002</link>
            <label>sjr</label>
            <code>sjr</code>
            <published>true</published>
            <snippet>true</snippet>
          </ratingType>
          <subject>
            <otype>ClassificationExternal</otype>
            <mtid>1701</mtid>
            <link>/api/classificationexternal/1701</link>
            <label>Scopus - Computer Science (miscellaneous)</label>
            <published>true</published>
            <oldId>1701</oldId>
            <snippet>true</snippet>
          </subject>
          <ranking>Q2</ranking>
          <calculation>DIRECT</calculation>
          <published>true</published>
          <snippet>true</snippet>
        </rating>
      </ratings>
      <references>
        <reference>
          <otype>Reference</otype>
          <mtid>23152833</mtid>
          <link>/api/reference/23152833</link>
          <label>1. Arute 2019: Quantum supremacy using a programmable superconducting processor., Nature, 574, DOI: 10.1038/s41586-019-1666-5</label>
          <listPosition>1</listPosition>
          <doi>10.1038/s41586-019-1666-5</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152834</mtid>
          <link>/api/reference/23152834</link>
          <label>2. Preskill 2018: Quantum computing in the NISQ era and beyond., Quantum, 2, p. 79, DOI: 10.22331/q-2018-08-06-79</label>
          <listPosition>2</listPosition>
          <doi>10.22331/q-2018-08-06-79</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152835</mtid>
          <link>/api/reference/23152835</link>
          <label>3. Harrow 2017: Quantum computational supremacy., Nature, 549, p. 203, DOI: 10.1038/nature23458</label>
          <listPosition>3</listPosition>
          <doi>10.1038/nature23458</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152836</mtid>
          <link>/api/reference/23152836</link>
          <label>4. Aaronson 2017: Complexity-theoretic foundations of quantum supremacy experiments.Proceedings of the 32nd Computational Complexity Conference, CCC '17, p. 22:1</label>
          <listPosition>4</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152837</mtid>
          <link>/api/reference/23152837</link>
          <label>5. Farhi</label>
          <listPosition>5</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152838</mtid>
          <link>/api/reference/23152838</link>
          <label>6. Farhi</label>
          <listPosition>6</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152839</mtid>
          <link>/api/reference/23152839</link>
          <label>7. Alexeev</label>
          <listPosition>7</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152840</mtid>
          <link>/api/reference/23152840</link>
          <label>8. Loncar</label>
          <listPosition>8</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152841</mtid>
          <link>/api/reference/23152841</link>
          <label>9. Foxen</label>
          <listPosition>9</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152842</mtid>
          <link>/api/reference/23152842</link>
          <label>10. Ajagekar 2020: Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems., Comput. Chem. Eng., 132, DOI: 10.1016/j.compchemeng.2019.106630</label>
          <listPosition>10</listPosition>
          <doi>10.1016/j.compchemeng.2019.106630</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152843</mtid>
          <link>/api/reference/23152843</link>
          <label>11. Ajagekar 2019: Quantum computing for energy systems optimization: challenges and opportunities., Energy, 179, p. 76, DOI: 10.1016/j.energy.2019.04.186</label>
          <listPosition>11</listPosition>
          <doi>10.1016/j.energy.2019.04.186</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152844</mtid>
          <link>/api/reference/23152844</link>
          <label>12. Harrigan</label>
          <listPosition>12</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152845</mtid>
          <link>/api/reference/23152845</link>
          <label>13. Rubin</label>
          <listPosition>13</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152846</mtid>
          <link>/api/reference/23152846</link>
          <label>14. Lloyd</label>
          <listPosition>14</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152847</mtid>
          <link>/api/reference/23152847</link>
          <label>15. Gyongyosi 2020: Multicarrier continuous-variable quantum key distribution., Theor. Comput. Sci., 816, p. 67, DOI: 10.1016/j.tcs.2019.11.026</label>
          <listPosition>15</listPosition>
          <doi>10.1016/j.tcs.2019.11.026</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152848</mtid>
          <link>/api/reference/23152848</link>
          <label>16. Gyongyosi 2020: Singular value decomposition assisted multicarrier continuous-variable quantum key distribution., Theor. Comput. Sci., 801, p. 35, DOI: 10.1016/j.tcs.2019.07.029</label>
          <listPosition>16</listPosition>
          <doi>10.1016/j.tcs.2019.07.029</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152849</mtid>
          <link>/api/reference/23152849</link>
          <label>17. Gyongyosi 2019: Order statistics and random matrix theory of multicarrier continuous-variable quantum key distribution., Int. J. Commun. Syst.</label>
          <listPosition>17</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152850</mtid>
          <link>/api/reference/23152850</link>
          <label>18. Gyongyosi 2019: Secret key rates of free-space optical continuous-variable quantum key distribution., Int. J. Commun. Syst., 32</label>
          <listPosition>18</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152851</mtid>
          <link>/api/reference/23152851</link>
          <label>19. Gyongyosi 2019: Diversity space of multicarrier continuous-variable quantum key distribution., Int. J. Commun. Syst., 32</label>
          <listPosition>19</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152852</mtid>
          <link>/api/reference/23152852</link>
          <label>20. Gyongyosi 2019: Secret key rate proof of multicarrier continuous-variable quantum key distribution., Int. J. Commun. Syst., 32</label>
          <listPosition>20</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152853</mtid>
          <link>/api/reference/23152853</link>
          <label>21. Pirandola 2020: Advances in quantum cryptography., Adv. Opt. Photonics, DOI: 10.1364/AOP.361502</label>
          <listPosition>21</listPosition>
          <doi>10.1364/AOP.361502</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152854</mtid>
          <link>/api/reference/23152854</link>
          <label>22. Pirandola 2016: Unite to build a quantum internet., Nature, 532, p. 169, DOI: 10.1038/532169a</label>
          <listPosition>22</listPosition>
          <doi>10.1038/532169a</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152855</mtid>
          <link>/api/reference/23152855</link>
          <label>23. Pirandola 2019: End-to-end capacities of a quantum communication network., Commun. Phys., 2, p. 51, DOI: 10.1038/s42005-019-0147-3</label>
          <listPosition>23</listPosition>
          <doi>10.1038/s42005-019-0147-3</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152856</mtid>
          <link>/api/reference/23152856</link>
          <label>24. Pirandola 2019: Bounds for multi-end communication over quantum networks., Quantum Sci. Technol., 4, DOI: 10.1088/2058-9565/ab3f66</label>
          <listPosition>24</listPosition>
          <doi>10.1088/2058-9565/ab3f66</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152857</mtid>
          <link>/api/reference/23152857</link>
          <label>25. Pirandola</label>
          <listPosition>25</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152858</mtid>
          <link>/api/reference/23152858</link>
          <label>26. Wehner 2018: Quantum internet: a vision for the road ahead., Science, 362, p. 6412, DOI: 10.1126/science.aam9288</label>
          <listPosition>26</listPosition>
          <doi>10.1126/science.aam9288</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152859</mtid>
          <link>/api/reference/23152859</link>
          <label>27. Gyongyosi 2018: A survey on quantum channel capacities., IEEE Commun. Surv. Tutor., 99, p. 1</label>
          <listPosition>27</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152860</mtid>
          <link>/api/reference/23152860</link>
          <label>28. Gyongyosi 2019: A survey on quantum key distribution., Infocom. J., p. 14</label>
          <listPosition>28</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152861</mtid>
          <link>/api/reference/23152861</link>
          <label>29. Gyongyosi 2019: A survey on quantum computing technology., Comput. Sci. Rev., 31, p. 51, DOI: 10.1016/j.cosrev.2018.11.002</label>
          <listPosition>29</listPosition>
          <doi>10.1016/j.cosrev.2018.11.002</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152862</mtid>
          <link>/api/reference/23152862</link>
          <label>30. Imre 2013: Advanced Quantum Communications - An Engineering Approach</label>
          <listPosition>30</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152863</mtid>
          <link>/api/reference/23152863</link>
          <label>31. Pirandola 2008: Continuous-variable quantum cryptography using two-way quantum communication., Nat. Phys., 4, p. 726, DOI: 10.1038/nphys1018</label>
          <listPosition>31</listPosition>
          <doi>10.1038/nphys1018</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152864</mtid>
          <link>/api/reference/23152864</link>
          <label>32. Pirandola 2009: Direct and reverse secret-key capacities of a quantum channel., Phys. Rev. Lett., 102, DOI: 10.1103/PhysRevLett.102.050503</label>
          <listPosition>32</listPosition>
          <doi>10.1103/PhysRevLett.102.050503</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152865</mtid>
          <link>/api/reference/23152865</link>
          <label>33. Pirandola 2009: Correlation matrices of two-mode bosonic systems., Phys. Rev. A, 79, DOI: 10.1103/PhysRevA.79.052327</label>
          <listPosition>33</listPosition>
          <doi>10.1103/PhysRevA.79.052327</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152866</mtid>
          <link>/api/reference/23152866</link>
          <label>34. Pirandola 2008: Characterization of collective Gaussian attacks and security of coherent-state quantum cryptography., Phys. Rev. Lett., 101, DOI: 10.1103/PhysRevLett.101.200504</label>
          <listPosition>34</listPosition>
          <doi>10.1103/PhysRevLett.101.200504</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152867</mtid>
          <link>/api/reference/23152867</link>
          <label>35. Weedbrook 2010: Quantum cryptography approaching the classical limit., Phys. Rev. Lett., 105, DOI: 10.1103/PhysRevLett.105.110501</label>
          <listPosition>35</listPosition>
          <doi>10.1103/PhysRevLett.105.110501</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152868</mtid>
          <link>/api/reference/23152868</link>
          <label>36. Weedbrook 2012: Gaussian quantum information., Rev. Mod. Phys., 84, p. 621, DOI: 10.1103/RevModPhys.84.621</label>
          <listPosition>36</listPosition>
          <doi>10.1103/RevModPhys.84.621</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152869</mtid>
          <link>/api/reference/23152869</link>
          <label>37. Sun 2012: Security of a new two-way continuous-variable quantum key distribution protocol., Int. J. Quantum Inf., 10, DOI: 10.1142/S0219749912500591</label>
          <listPosition>37</listPosition>
          <doi>10.1142/S0219749912500591</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152870</mtid>
          <link>/api/reference/23152870</link>
          <label>38. Sun 2013: An improved two-way continuous-variable quantum key distribution protocol with added noise in homodyne detection., J. Phys. B, At. Mol. Opt. Phys., 46, DOI: 10.1088/0953-4075/46/8/085501</label>
          <listPosition>38</listPosition>
          <doi>10.1088/0953-4075/46/8/085501</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152871</mtid>
          <link>/api/reference/23152871</link>
          <label>39. Jouguet 2011: Long-distance continuous-variable quantum key distribution with a Gaussian modulation., Phys. Rev. A, 84, DOI: 10.1103/PhysRevA.84.062317</label>
          <listPosition>39</listPosition>
          <doi>10.1103/PhysRevA.84.062317</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152872</mtid>
          <link>/api/reference/23152872</link>
          <label>40. Jouguet 2012: Analysis of imperfections in practical continuous-variable quantum key distribution., Phys. Rev. A, 86, DOI: 10.1103/PhysRevA.86.032309</label>
          <listPosition>40</listPosition>
          <doi>10.1103/PhysRevA.86.032309</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152873</mtid>
          <link>/api/reference/23152873</link>
          <label>41. Leverrier 2008: Multidimensional reconciliation for a continuous-variable quantum key distribution., Phys. Rev. A, 77, DOI: 10.1103/PhysRevA.77.042325</label>
          <listPosition>41</listPosition>
          <doi>10.1103/PhysRevA.77.042325</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152874</mtid>
          <link>/api/reference/23152874</link>
          <label>42. Jouguet</label>
          <listPosition>42</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152875</mtid>
          <link>/api/reference/23152875</link>
          <label>43. Leverrier 2013: Security of continuous-variable quantum key distribution against general attacks., Phys. Rev. Lett., 110, DOI: 10.1103/PhysRevLett.110.030502</label>
          <listPosition>43</listPosition>
          <doi>10.1103/PhysRevLett.110.030502</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152876</mtid>
          <link>/api/reference/23152876</link>
          <label>44. Milicevic</label>
          <listPosition>44</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152877</mtid>
          <link>/api/reference/23152877</link>
          <label>45. Lodewyck 2007: Quantum key distribution over 25 km with an all-fiber continuous-variable system., Phys. Rev. A, 76, DOI: 10.1103/PhysRevA.76.042305</label>
          <listPosition>45</listPosition>
          <doi>10.1103/PhysRevA.76.042305</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152878</mtid>
          <link>/api/reference/23152878</link>
          <label>46. Zhang 2006: The Role of Correlation in Communication over Fading Channels</label>
          <listPosition>46</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152879</mtid>
          <link>/api/reference/23152879</link>
          <label>47. Pinsker 1995: Sensitivity of channel capacity., IEEE Trans. Inf. Theory, 41, DOI: 10.1109/18.476313</label>
          <listPosition>47</listPosition>
          <doi>10.1109/18.476313</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152880</mtid>
          <link>/api/reference/23152880</link>
          <label>48. Gyongyosi 2014: Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography., Inf. Sci., 285, p. 1, DOI: 10.1016/j.ins.2014.07.010</label>
          <listPosition>48</listPosition>
          <doi>10.1016/j.ins.2014.07.010</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152881</mtid>
          <link>/api/reference/23152881</link>
          <label>49. Gyongyosi 2014: Adaptive multicarrier quadrature division modulation for long-distance continuous-variable quantum key distribution.Proc. SPIE 9123, Quantum Information and Computation XII</label>
          <listPosition>49</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152882</mtid>
          <link>/api/reference/23152882</link>
          <label>50. Gyongyosi 2014: Proceedings Volume 8997, Advances in Photonics of Quantum Computing, Memory, and Communication VII</label>
          <listPosition>50</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152883</mtid>
          <link>/api/reference/23152883</link>
          <label>51. Imre 2005: Quantum Computing and Communications – An Engineering Approach</label>
          <listPosition>51</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152884</mtid>
          <link>/api/reference/23152884</link>
          <label>52. Petz 2008: Quantum Information Theory and Quantum Statistics, vol. 6</label>
          <listPosition>52</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152885</mtid>
          <link>/api/reference/23152885</link>
          <label>53. Van Meter 2014: Quantum Networking</label>
          <listPosition>53</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152886</mtid>
          <link>/api/reference/23152886</link>
          <label>54. Ruppert 2014: Long-distance continuous-variable quantum key distribution with efficient channel estimation., Phys. Rev. A, 90, DOI: 10.1103/PhysRevA.90.062310</label>
          <listPosition>54</listPosition>
          <doi>10.1103/PhysRevA.90.062310</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152887</mtid>
          <link>/api/reference/23152887</link>
          <label>55. Leverrier 2013: Security of continuous-variable quantum key distribution against general attacks., Phys. Rev. Lett., 110, DOI: 10.1103/PhysRevLett.110.030502</label>
          <listPosition>55</listPosition>
          <doi>10.1103/PhysRevLett.110.030502</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152888</mtid>
          <link>/api/reference/23152888</link>
          <label>56. Renner 2009: Representation theorem for infinite-dimensional quantum systems and applications to quantum cryptography., Phys. Rev. Lett., 102, DOI: 10.1103/PhysRevLett.102.110504</label>
          <listPosition>56</listPosition>
          <doi>10.1103/PhysRevLett.102.110504</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152889</mtid>
          <link>/api/reference/23152889</link>
          <label>57. Furrer 2012: Continuous variable quantum key distribution: finite-key analysis of composable security against coherent attacks., Phys. Rev. Lett., 109, DOI: 10.1103/PhysRevLett.109.100502</label>
          <listPosition>57</listPosition>
          <doi>10.1103/PhysRevLett.109.100502</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152890</mtid>
          <link>/api/reference/23152890</link>
          <label>58. Leverrier 2015: Composable security proof for continuous-variable quantum key distribution with coherent states., Phys. Rev. Lett., 114, DOI: 10.1103/PhysRevLett.114.070501</label>
          <listPosition>58</listPosition>
          <doi>10.1103/PhysRevLett.114.070501</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152891</mtid>
          <link>/api/reference/23152891</link>
          <label>59. Van Assche 2004: Reconciliation of a quantum-distributed Gaussian key., IEEE Trans. Inf. Theory, 50, p. 394, DOI: 10.1109/TIT.2003.822618</label>
          <listPosition>59</listPosition>
          <doi>10.1109/TIT.2003.822618</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152892</mtid>
          <link>/api/reference/23152892</link>
          <label>60. Leverrier 2011: Continuous-variable quantum-key-distribution protocols with a non-Gaussian modulation., Phys. Rev. A, 83, DOI: 10.1103/PhysRevA.83.042312</label>
          <listPosition>60</listPosition>
          <doi>10.1103/PhysRevA.83.042312</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152893</mtid>
          <link>/api/reference/23152893</link>
          <label>61. Leverrier 2009: Unconditional security proof of long-distance continuous-variable quantum key distribution with discrete modulation., Phys. Rev. Lett., 102, DOI: 10.1103/PhysRevLett.102.180504</label>
          <listPosition>61</listPosition>
          <doi>10.1103/PhysRevLett.102.180504</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152894</mtid>
          <link>/api/reference/23152894</link>
          <label>62. Zwillinger 2010: Standard Probability and Statistics Tables and Formulae</label>
          <listPosition>62</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152895</mtid>
          <link>/api/reference/23152895</link>
          <label>63. Gentle 2009: Computational Statistics, DOI: 10.1007/978-0-387-98144-4</label>
          <listPosition>63</listPosition>
          <doi>10.1007/978-0-387-98144-4</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152896</mtid>
          <link>/api/reference/23152896</link>
          <label>64. Billingsley 1995: Probability and Measure</label>
          <listPosition>64</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152897</mtid>
          <link>/api/reference/23152897</link>
          <label>65. Marsaglia 2006: Ratios of normal variables., J. Stat. Softw., 16, DOI: 10.18637/jss.v016.i04</label>
          <listPosition>65</listPosition>
          <doi>10.18637/jss.v016.i04</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152898</mtid>
          <link>/api/reference/23152898</link>
          <label>66. Pirandola 2017: Fundamental limits of repeaterless quantum communications., Nat. Commun., 8, DOI: 10.1038/ncomms15043</label>
          <listPosition>66</listPosition>
          <doi>10.1038/ncomms15043</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152899</mtid>
          <link>/api/reference/23152899</link>
          <label>67. Pirandola 2018: Theory of channel simulation and bounds for private communication., Quantum Sci. Technol., 3, DOI: 10.1088/2058-9565/aac394</label>
          <listPosition>67</listPosition>
          <doi>10.1088/2058-9565/aac394</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152900</mtid>
          <link>/api/reference/23152900</link>
          <label>68. Laurenza 2017: General bounds for sender-receiver capacities in multipoint quantum communications., Phys. Rev. A, 96, DOI: 10.1103/PhysRevA.96.032318</label>
          <listPosition>68</listPosition>
          <doi>10.1103/PhysRevA.96.032318</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152901</mtid>
          <link>/api/reference/23152901</link>
          <label>69. Gyongyosi 2018: Low-dimensional reconciliation for continuous-variable quantum key distribution., Appl. Sci., DOI: 10.3390/app8010087</label>
          <listPosition>69</listPosition>
          <doi>10.3390/app8010087</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152902</mtid>
          <link>/api/reference/23152902</link>
          <label>70. Gyongyosi 2018: Decentralized base-graph routing for the quantum Internet., Phys. Rev. A, DOI: 10.1103/PhysRevA.98.022310</label>
          <listPosition>70</listPosition>
          <doi>10.1103/PhysRevA.98.022310</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152903</mtid>
          <link>/api/reference/23152903</link>
          <label>71. Gyongyosi 2020: Dynamics of entangled networks of the quantum Internet., Sci. Rep., Nature</label>
          <listPosition>71</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152904</mtid>
          <link>/api/reference/23152904</link>
          <label>72. Gyongyosi 2018: Multiple access multicarrier continuous-variable quantum key distribution., Chaos Solitons Fractals, DOI: 10.1016/j.chaos.2018.07.006</label>
          <listPosition>72</listPosition>
          <doi>10.1016/j.chaos.2018.07.006</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152905</mtid>
          <link>/api/reference/23152905</link>
          <label>73. Gyongyosi 2017: Entanglement-gradient routing for quantum networks., Sci. Rep., DOI: 10.1038/s41598-017-14394-w</label>
          <listPosition>73</listPosition>
          <doi>10.1038/s41598-017-14394-w</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152906</mtid>
          <link>/api/reference/23152906</link>
          <label>74. Gyongyosi 2020: Resource prioritization and balancing for the quantum Internet., Sci. Rep., Nature</label>
          <listPosition>74</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152907</mtid>
          <link>/api/reference/23152907</link>
          <label>75. Bacsardi 2013: On the way to quantum-based satellite communication., IEEE Commun. Mag., 51, p. 50, DOI: 10.1109/MCOM.2013.6576338</label>
          <listPosition>75</listPosition>
          <doi>10.1109/MCOM.2013.6576338</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152908</mtid>
          <link>/api/reference/23152908</link>
          <label>76. Gyongyosi 2019: Improved reconciliation for continuous-variable quantum key distribution.Proceedings of Advances in Photonics of Quantum Computing, Memory, and Communication XII, vol. 10933</label>
          <listPosition>76</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152909</mtid>
          <link>/api/reference/23152909</link>
          <label>77. Caleffi 2018: End-to-end entanglement rate: toward a quantum route metric.2017 IEEE Globecom</label>
          <listPosition>77</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152910</mtid>
          <link>/api/reference/23152910</link>
          <label>78. Caleffi 2017: Optimal routing for quantum networks., IEEE Access, 5, DOI: 10.1109/ACCESS.2017.2763325</label>
          <listPosition>78</listPosition>
          <doi>10.1109/ACCESS.2017.2763325</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152911</mtid>
          <link>/api/reference/23152911</link>
          <label>79. Caleffi</label>
          <listPosition>79</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152912</mtid>
          <link>/api/reference/23152912</link>
          <label>80. Castelvecchi 2018: The quantum internet has arrived., Nature, News and Comment, DOI: 10.1038/d41586-018-07129-y</label>
          <listPosition>80</listPosition>
          <doi>10.1038/d41586-018-07129-y</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152913</mtid>
          <link>/api/reference/23152913</link>
          <label>81. Cacciapuoti</label>
          <listPosition>81</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152914</mtid>
          <link>/api/reference/23152914</link>
          <label>82. Cuomo</label>
          <listPosition>82</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152915</mtid>
          <link>/api/reference/23152915</link>
          <label>83. Chakraborty</label>
          <listPosition>83</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152916</mtid>
          <link>/api/reference/23152916</link>
          <label>84. Khatri 2019: Practical figures of merit and thresholds for entanglement distribution in quantum networks., Phys. Rev. Res. Int., 1</label>
          <listPosition>84</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152917</mtid>
          <link>/api/reference/23152917</link>
          <label>85. Kozlowski 2019: Towards large-scale quantum networks.Proc. of the Sixth Annual ACM International Conference on Nanoscale Computing and Communication, Dublin, Ireland</label>
          <listPosition>85</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152918</mtid>
          <link>/api/reference/23152918</link>
          <label>86. Pathumsoot</label>
          <listPosition>86</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152919</mtid>
          <link>/api/reference/23152919</link>
          <label>87. Pal</label>
          <listPosition>87</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152920</mtid>
          <link>/api/reference/23152920</link>
          <label>88. Miguel-Ramiro 2020: Delocalized information in quantum networks., New J. Phys., 22, DOI: 10.1088/1367-2630/ab784d</label>
          <listPosition>88</listPosition>
          <doi>10.1088/1367-2630/ab784d</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152921</mtid>
          <link>/api/reference/23152921</link>
          <label>89. Pirker</label>
          <listPosition>89</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152922</mtid>
          <link>/api/reference/23152922</link>
          <label>90. Krisnanda 2018: Probing quantum features of photosynthetic organisms., npj Quantum Inf., 4, p. 60, DOI: 10.1038/s41534-018-0110-2</label>
          <listPosition>90</listPosition>
          <doi>10.1038/s41534-018-0110-2</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152923</mtid>
          <link>/api/reference/23152923</link>
          <label>91. Krisnanda 2017: Revealing nonclassicality of inaccessible objects., Phys. Rev. Lett., 119, DOI: 10.1103/PhysRevLett.119.120402</label>
          <listPosition>91</listPosition>
          <doi>10.1103/PhysRevLett.119.120402</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152924</mtid>
          <link>/api/reference/23152924</link>
          <label>92. Shannon</label>
          <listPosition>92</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152925</mtid>
          <link>/api/reference/23152925</link>
          <label>93. Amoretti 2020: Entanglement verification in quantum networks with tampered nodes., IEEE J. Sel. Areas Commun., 38, p. 598, DOI: 10.1109/JSAC.2020.2967955</label>
          <listPosition>93</listPosition>
          <doi>10.1109/JSAC.2020.2967955</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152926</mtid>
          <link>/api/reference/23152926</link>
          <label>94. Cao 2020: Multi-tenant provisioning for quantum key distribution networks with heuristics and reinforcement learning: a comparative study., IEEE Trans. Netw. Serv. Manag., 17, p. 946, DOI: 10.1109/TNSM.2020.2964003</label>
          <listPosition>94</listPosition>
          <doi>10.1109/TNSM.2020.2964003</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152927</mtid>
          <link>/api/reference/23152927</link>
          <label>95. Cao 2019: Key as a service (KaaS) over quantum key distribution (QKD)-integrated optical networks., IEEE Commun. Mag., 57, p. 152, DOI: 10.1109/MCOM.2019.1701375</label>
          <listPosition>95</listPosition>
          <doi>10.1109/MCOM.2019.1701375</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152928</mtid>
          <link>/api/reference/23152928</link>
          <label>96. Liu</label>
          <listPosition>96</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152929</mtid>
          <link>/api/reference/23152929</link>
          <label>97. Chai 2020: Blind channel estimation for continuous-variable quantum key distribution., Quantum Eng., 2, DOI: 10.1002/que2.37</label>
          <listPosition>97</listPosition>
          <doi>10.1002/que2.37</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152930</mtid>
          <link>/api/reference/23152930</link>
          <label>98. Sun 2020: Performance analysis of quantum channels., Quantum Eng., DOI: 10.1002/que2.35</label>
          <listPosition>98</listPosition>
          <doi>10.1002/que2.35</doi>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>23152931</mtid>
          <link>/api/reference/23152931</link>
          <label>99. Laudenbach</label>
          <listPosition>99</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
      </references>
      <link>/api/publication/32204289</link>
      <label>L. Gyongyosi. Post-processing optimization for continuous-variable quantum key distribution. (2021) THEORETICAL COMPUTER SCIENCE 0304-3975 1879-2294 893 146-158</label><template>&lt;div class=&quot;JournalArticle Publication short-list&quot;&gt; &lt;div class=&quot;authors&quot;&gt; &lt;span class=&quot;author-name&quot; mtid=&quot;10040623&quot;&gt; &lt;a href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10040623&quot; target=&quot;_blank&quot;&gt;L., Gyongyosi ✉&lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; &lt;/div &gt;&lt;div class=&quot;title&quot;&gt;&lt;a href=&quot;/gui2/?mode=browse&amp;params=publication;32204289&quot; mtid=&quot;32204289&quot; target=&quot;_blank&quot;&gt;Post-processing optimization for continuous-variable quantum key distribution&lt;/a&gt;&lt;/div&gt; &lt;div class=&quot;pub-info&quot;&gt; &lt;span class=&quot;journal-title&quot;&gt;THEORETICAL COMPUTER SCIENCE&lt;/span&gt; &lt;span class=&quot;journal-volume&quot;&gt;893&lt;/span&gt; &lt;span class=&quot;page&quot;&gt; pp. 146-158. , 13 p. &lt;/span&gt; &lt;span class=&quot;year&quot;&gt;(2021)&lt;/span&gt; &lt;/div&gt; &lt;div class=&quot;pub-end&quot;&gt;&lt;div class=&quot;identifier-list&quot;&gt; &lt;span class=&quot;identifiers&quot;&gt; &lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt; &lt;a style=&quot;color:blue&quot; title=&quot;10.1016/j.tcs.2021.08.023&quot; target=&quot;_blank&quot; href=&quot;https://doi.org/10.1016/j.tcs.2021.08.023&quot;&gt; DOI &lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt; &lt;a style=&quot;color:blue&quot; title=&quot;000710180500010&quot; target=&quot;_blank&quot; href=&quot;https://www.webofscience.com/wos/woscc/full-record/000710180500010&quot;&gt; WoS &lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt; &lt;a style=&quot;color:blue&quot; title=&quot;85114686983&quot; target=&quot;_blank&quot; href=&quot;http://www.scopus.com/record/display.url?origin=inward&amp;eid=2-s2.0-85114686983&quot;&gt; Scopus &lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt; &lt;a style=&quot;color:black&quot; title=&quot;https://linkinghub.elsevier.com/retrieve/pii/S0304397521004941&quot; target=&quot;_blank&quot; href=&quot;https://linkinghub.elsevier.com/retrieve/pii/S0304397521004941&quot;&gt; Egyéb URL &lt;/a&gt; &lt;/span&gt; &lt;/span&gt; &lt;/div&gt; &lt;div class=&quot;short-pub-prop-list&quot;&gt; &lt;span class=&quot;deleted-record&quot;&gt;Központi kezelésű&lt;/span&gt; &lt;span class=&quot;short-pub-mtid&quot;&gt; Közlemény:32204289 &lt;/span&gt; &lt;span class=&quot;status-holder&quot;&gt;&lt;span class=&quot;status-data status-ADMIN_APPROVED&quot;&gt; Admin láttamozott &lt;/span&gt;&lt;/span&gt; &lt;span class=&quot;pub-core&quot;&gt;Forrás Idéző &lt;/span&gt; &lt;span class=&quot;pub-type&quot;&gt;Folyóiratcikk (Szakcikk ) &lt;/span&gt; &lt;!-- &amp;&amp; !record.category.scientific --&gt; &lt;span class=&quot;pub-category&quot;&gt;Tudományos&lt;/span&gt; &lt;div class=&quot;publication-citation&quot; style=&quot;margin-left: 0.5cm;&quot;&gt; &lt;span title=&quot;Nyilvános idézőközlemények összesen, említések nélkül&quot; class=&quot;citingPub-count&quot;&gt;Nyilvános idéző összesen: 7&lt;/span&gt; | Független: 6 | Függő: 1 | Nem jelölt: 0 | WoS jelölt: 7 | Scopus jelölt:&amp;nbsp;2 | WoS/Scopus jelölt:&amp;nbsp;7 | DOI jelölt:&amp;nbsp;7 &lt;/div&gt; &lt;/div&gt; &lt;/div&gt; &lt;/div&gt;</template><template2>&lt;div class=&quot;JournalArticle Publication long-list&quot;&gt;
&lt;div class=&quot;authors&quot;&gt;
	&lt;img title=&quot;Forrásközlemény&quot; style=&quot;float: left&quot; src=&quot;/frontend/resources/grid/publication-core-icon.png&quot;&gt;
	&lt;img title=&quot;Idézőközlemény&quot; style=&quot;float: left&quot; src=&quot;/frontend/resources/grid/publication-citation-icon.png&quot;&gt;

		&lt;div class=&quot;autype autype0&quot;&gt;				&lt;span class=&quot;author-name&quot; mtid=&quot;10040623&quot;&gt;&lt;a 
																				   href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10040623&quot; target=&quot;_blank&quot;&gt;L. Gyongyosi ✉
            (&lt;span class=&quot;authorship-author-name&quot;&gt;Gyöngyösi László&lt;/span&gt;
            &lt;span class=&quot;authorAux-mtmt&quot;&gt; Informatika&lt;/span&gt;)
			&lt;/a&gt;
    &lt;/span&gt;
&lt;span class=&quot;author-affil&quot;&gt;&lt;span title=&quot;Budapesti Műszaki és Gazdaságtudományi Egyetem&quot;&gt;BME&lt;/span&gt;/&lt;span title=&quot;Villamosmérnöki és Informatikai Kar&quot;&gt;VIK&lt;/span&gt;/Hálózati Rendszerek és Szolgáltatások Tanszék&lt;/span&gt;

				    &lt;/div&gt;
&lt;/div&gt;
&lt;div class=&quot;title&quot;&gt;&lt;a href=&quot;/gui2/?mode=browse&amp;params=publication;32204289&quot; target=&quot;_blank&quot;&gt;Post-processing optimization for continuous-variable quantum key distribution&lt;/a&gt;&lt;/div&gt;    &lt;div&gt;		&lt;span class=&quot;journal-title&quot;&gt;THEORETICAL COMPUTER SCIENCE&lt;/span&gt;

        &lt;span class=&quot;journal-issn&quot;&gt;(&lt;a target=&quot;_blank&quot; href=&quot;https://portal.issn.org/resource/ISSN/0304-3975&quot;&gt;0304-3975&lt;/a&gt; &lt;a target=&quot;_blank&quot; href=&quot;https://portal.issn.org/resource/ISSN/1879-2294&quot;&gt;1879-2294&lt;/a&gt;)&lt;/span&gt;:
		&lt;span class=&quot;journal-volume&quot;&gt;893&lt;/span&gt; 
&lt;span class=&quot;page&quot;&gt;
	pp 146-158
			
&lt;/span&gt;		 &lt;span class=&quot;year&quot;&gt;(2021)&lt;/span&gt;  
    &lt;/div&gt;
&lt;div class=&quot;pub-footer&quot;&gt;
    

	&lt;span class=&quot;language&quot; xmlns=&quot;http://www.w3.org/1999/html&quot;&gt;Nyelv:
			Angol
		 |  &lt;/span&gt;

	&lt;span class=&quot;identifiers&quot;&gt;
						&lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt;
							
							&lt;a style=&quot;color:blue&quot; title=&quot;10.1016/j.tcs.2021.08.023&quot; target=&quot;_blank&quot; href=&quot;https://doi.org/10.1016/j.tcs.2021.08.023&quot;&gt;
									DOI
							&lt;/a&gt;
						&lt;/span&gt;
						&lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt;
							
							&lt;a style=&quot;color:blue&quot; title=&quot;000710180500010&quot; target=&quot;_blank&quot; href=&quot;https://www.webofscience.com/wos/woscc/full-record/000710180500010&quot;&gt;
									WoS
							&lt;/a&gt;
						&lt;/span&gt;
						&lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt;
							
							&lt;a style=&quot;color:blue&quot; title=&quot;85114686983&quot; target=&quot;_blank&quot; href=&quot;http://www.scopus.com/record/display.url?origin=inward&amp;eid=2-s2.0-85114686983&quot;&gt;
									Scopus
							&lt;/a&gt;
						&lt;/span&gt;
						&lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt;
							
							&lt;a style=&quot;color:black&quot; title=&quot;https://linkinghub.elsevier.com/retrieve/pii/S0304397521004941&quot; target=&quot;_blank&quot; href=&quot;https://linkinghub.elsevier.com/retrieve/pii/S0304397521004941&quot;&gt;
									Egyéb URL
							&lt;/a&gt;
						&lt;/span&gt;
	&lt;/span&gt;


	&lt;OnlyViewableByAuthor&gt;&lt;div class=&quot;ratings&quot;&gt;
				&lt;div class=&quot;journal-subject&quot;&gt;Folyóirat szakterülete: Scopus - Computer Science (miscellaneous)&amp;nbsp;&amp;nbsp;&amp;nbsp;SJR indikátor:&amp;nbsp;Q2&lt;/div&gt;
				&lt;div class=&quot;journal-subject&quot;&gt;Folyóirat szakterülete: Scopus - Theoretical Computer Science&amp;nbsp;&amp;nbsp;&amp;nbsp;SJR indikátor:&amp;nbsp;Q2&lt;/div&gt;
    &lt;/div&gt;&lt;/OnlyViewableByAuthor&gt;


	&lt;div class=&quot;publication-citation&quot; style=&quot;margin-left: 0.5cm;&quot;&gt;
		&lt;span title=&quot;Nyilvános idézőközlemények összesen, említések nélkül&quot; class=&quot;citingPub-count&quot;&gt;Nyilvános idéző összesen: 7&lt;/span&gt;
		| Független: 6
		| Függő: 1
		| Nem jelölt: 0
		| WoS jelölt: 7 
		|  Scopus jelölt:&amp;nbsp;2 
		|  WoS/Scopus jelölt:&amp;nbsp;7 
		|  DOI jelölt:&amp;nbsp;7 
		
	&lt;/div&gt;
    
    
	&lt;div class=&quot;publication-citation&quot;&gt;
		&lt;a target=&quot;_blank&quot; href=&quot;/api/publication?cond=citations.related;eq;32204289&amp;sort=publishedYear,desc&amp;sort=title&quot;&gt;
			Idézett közlemények száma: 23
		&lt;/a&gt;
	&lt;/div&gt;



    &lt;div class=&quot;mtid&quot;&gt;&lt;span class=&quot;long-pub-mtid&quot;&gt;Közlemény: 32204289&lt;/span&gt;
    | &lt;span class=&quot;status-data status-ADMIN_APPROVED&quot;&gt; 	Admin láttamozott
  &lt;/span&gt;
        
	
	
Forrás	 Idéző
	
	
    | &lt;span class=&quot;type-subtype&quot;&gt;Folyóiratcikk
			( Szakcikk
			
			)
		&lt;/span&gt;
      		| &lt;span class=&quot;pub-category&quot;&gt;Tudományos&lt;/span&gt;
	| &lt;span class=&quot;publication-sourceOfData&quot;&gt;kézi felvitel&lt;/span&gt;
&lt;/div&gt;


	&lt;div class=&quot;notDuplums&quot;&gt;&lt;a target=&quot;_blank&quot; href=&quot;/api/publication/32204289/notduplums&quot;&gt;1 Nem duplumnak jelölés&lt;/a&gt;
	&lt;/div&gt;
&lt;div class=&quot;lastModified&quot;&gt;Utolsó módosítás: 2024.05.22. 22:57 Boros Annamária (MTMT Központi admin)
&lt;/div&gt;


        &lt;div class=&quot;lockedBy&quot;&gt;Központi kezelésű 2024.05.27. 19:21  Boros Annamária (MTMT Központi admin)
        &lt;/div&gt;


	&lt;pre class=&quot;comment&quot; style=&quot;margin-top: 0; margin-bottom: 0;&quot;&gt;&lt;u&gt;Megjegyzés&lt;/u&gt;: Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, 1117, Hungary            
            MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, Budapest, 1051, Hungary            
            Export Date: 2 December 2021            
            CODEN: TCSCD            
            Correspondence Address: Gyongyosi, L.; De...&lt;/pre&gt;

&lt;/div&gt;&lt;/div&gt;</template2>
    </publication>
  </content>
</myciteResult>
