default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMario-Osvin Pavcevic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Vedran Krcadinac, Mario-Osvin Pavcevic
, Kristijan Tabak:
Three-dimensional Hadamard matrices of Paley type. Finite Fields Their Appl. 92: 102306 (2023)
2010 – 2019
- 2018
- [j12]Oliver Wilhelm Gnilke, Marcus Greferath, Mario-Osvin Pavcevic:
Mosaics of combinatorial designs. Des. Codes Cryptogr. 86(1): 85-95 (2018) - [j11]Simon R. Blackburn, Marcus Greferath, Camilla Hollanti, Mario-Osvin Pavcevic, Joachim Rosenthal, Leo Storme, Ángeles Vázquez-Castro, Alfred Wassermann:
Preface to the special issue on network coding and designs. Des. Codes Cryptogr. 86(2): 237-238 (2018) - 2017
- [c3]Vedran Krcadinac, Mario-Osvin Pavcevic:
New Small 4-Designs with Nonabelian Automorphism Groups. MACIS 2017: 289-294 - 2016
- [j10]Adalbert Kerber, Michael Kiermaier, Reinhard Laue, Mario-Osvin Pavcevic, Alfred Wassermann:
Editorial. Adv. Math. Commun. 10(3): i-ii (2016) - 2015
- [j9]Anamari Nakic, Mario-Osvin Pavcevic:
Tactical decompositions of designs over finite fields. Des. Codes Cryptogr. 77(1): 49-60 (2015) - [j8]Filip Cvitic, Mario-Osvin Pavcevic, Jesenka Pibernik:
Two Messages out of One 2D Matrix Bar Code. KSII Trans. Internet Inf. Syst. 9(3): 1105-1120 (2015) - [i1]Oliver W. Gnilke, Marcus Greferath, Mario-Osvin Pavcevic:
Mosaics of Combinatorial Designs. CoRR abs/1503.01643 (2015) - 2014
- [j7]Vedran Krcadinac, Anamari Nakic, Mario-Osvin Pavcevic:
Equations for coefficients of tactical decomposition matrices for t-designs. Des. Codes Cryptogr. 72(2): 465-469 (2014) - 2013
- [c2]Goran Mausa, Tihana Galinac Grbac, Bojana Dalbelo Basic, Mario-Osvin Pavcevic:
Hill Climbing and simulated annealing in large scale next release problem. EUROCON 2013: 452-459 - 2011
- [j6]Ivica Martinjak, Mario-Osvin Pavcevic:
Symmetric designs possessing tactical decompositions. Adv. Math. Commun. 5(2): 199-208 (2011) - 2010
- [j5]Ivica Martinjak, Mario-Osvin Pavcevic:
Refined Deterministic Algorithm for Biplane Construction. J. Comput. Inf. Technol. 18(1): 45-52 (2010)
2000 – 2009
- 2009
- [c1]Ivica Martinjak, Mario-Osvin Pavcevic:
Modified genetic algorithm for BIBD construction. ITI 2009: 647-652 - 2001
- [j4]Dean Crnkovic, Mario-Osvin Pavcevic:
Some new symmetric designs with parameters (64, 28, 12). Discret. Math. 237(1-3): 109-118 (2001) - [j3]Dieter Held, Mario-Osvin Pavcevic:
Some new Hadamard designs with 79 points admitting automorphisms of order 13 and 19. Discret. Math. 238(1-3): 61-65 (2001)
1990 – 1999
- 1999
- [j2]Mario-Osvin Pavcevic, Edward Spence:
Some new symmetric designs with lambda = 10 having an automorphism of order 5. Discret. Math. 196(1-3): 257-266 (1999) - 1997
- [j1]Dieter Held, Mario-Osvin Pavcevic:
Symmetric (79, 27, 9)-designs Admitting a Faithful Action of a Frobenius Group of Order 39. Eur. J. Comb. 18(4): 409-416 (1997)
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 2024-10-09 21:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
