Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/20632
DC FieldValueLanguage
dc.contributor.authorBen Eliezer Omri-
dc.contributor.authorHefetz Dan-
dc.contributor.authorKronenberg Gal-
dc.contributor.authorParczyk Olaf-
dc.contributor.authorShikhelman Clara-
dc.contributor.authorStojakovic Milos-
dc.date.accessioned2020-12-13T14:54:56Z-
dc.date.available2020-12-13T14:54:56Z-
dc.date.issued2020-
dc.identifier.issn1042-9832-
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/20632-
dc.language.isoen-
dc.relation.ispartofRandom Structures and Algorithmsen
dc.sourceCRIS UNS-
dc.source.urihttp://cris.uns.ac.rs-
dc.titleSemi-random graph process 56 (2020), 648-675en
dc.typeJournal/Magazine Articleen
dc.identifier.urlhttps://www.cris.uns.ac.rs/record.jsf?recordId=115941&source=BEOPEN&language=enen
dc.relation.lastpage675-
dc.relation.firstpage648-
dc.relation.issue3-
dc.relation.volume56-
dc.identifier.externalcrisreference(BISIS)115941-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.deptPrirodno-matematički fakultet, Departman za matematiku i informatiku-
crisitem.author.orcid0000-0002-2545-8849-
crisitem.author.parentorgPrirodno-matematički fakultet-
Appears in Collections:PMF Publikacije/Publications
Show simple item record

Page view(s)

28
Last Week
8
Last month
0
checked on May 10, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.