Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDragomir Z. Dokovic
Person information
- affiliation: University of Waterloo, Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j29]Curtis Bright
, Dragomir Z. Dokovic, Ilias S. Kotsireas, Vijay Ganesh:
The SAT+CAS method for combinatorial search with applications to best matrices. Ann. Math. Artif. Intell. 87(4): 321-342 (2019)- [j28]Lin Chen, Dragomir Z. Dokovic:
The unextendible product bases of four qubits: Hasse diagrams. Quantum Inf. Process. 18(5): 143 (2019) - 2018
- [j27]Dragomir Z. Dokovic, Ilias S. Kotsireas:
Goethals-Seidel Difference Families with Symmetric or Skew Base Blocks. Math. Comput. Sci. 12(4): 373-388 (2018) - [j26]Lin Chen, Dragomir Z. Dokovic:
Nonexistence of n-qubit unextendible product bases of size \(2^n-5\). Quantum Inf. Process. 17(2): 24 (2018) - 2016
- [j25]Dragomir Z. Dokovic:
On Two-Distillable Werner States. Entropy 18(6): 216 (2016) - 2015
- [j24]Dragomir Z. Dokovic, Ilias S. Kotsireas, Daniel Recoskie, Joe Sawada:
Charm bracelets and their application to the construction of periodic Golay pairs. Discret. Appl. Math. 188: 32-40 (2015) - [j23]Dragomir Z. Dokovic, Ilias S. Kotsireas:
Compression of periodic complementary sequences and applications. Des. Codes Cryptogr. 74(2): 365-377 (2015) - [j22]Dragomir Z. Dokovic, Ilias S. Kotsireas:
Some new periodic Golay pairs. Numer. Algorithms 69(3): 523-530 (2015) - [j21]Lin Chen, Dragomir Z. Dokovic:
Dimension formula for induced maximal faces of separable states and genuine entanglement. Quantum Inf. Process. 14(9): 3335-3350 (2015) - 2010
- [j20]Dragomir Z. Dokovic:
A new Yang number and consequences. Des. Codes Cryptogr. 54(3): 201-204 (2010) - [j19]Dragomir Z. Dokovic:
On the base sequence conjecture. Discret. Math. 310(13-14): 1956-1964 (2010) - 2009
- [j18]Dragomir Z. Dokovic:
Classification of Near-Normal Sequences. Discret. Math. Algorithms Appl. 1(3): 389-400 (2009) - [j17]Dragomir Z. Dokovic, Richard Stong:
A Unipotent Matrix: 11282 [2007, 260]. Am. Math. Mon. 116(6): 549-550 (2009) - 2008
- [j16]Dragomir Z. Dokovic:
Hadamard matrices of order 764 exist. Comb. 28(4): 487-489 (2008) - 2000
- [j15]Dragomir Z. Dokovic:
The Irreducible Six-Dimensional Complex Representations of Aut(F2) That Are Nontrivial-on F2. Exp. Math. 9(3): 457-465 (2000) - [j14]Dragomir Z. Dokovic, David Doniz:
The Complex Indecomposable Representations of Aut(F2) of Degree Less Than Six. Int. J. Algebra Comput. 10(2): 229-260 (2000) - 1998
- [j13]Dragomir Z. Dokovic:
Note on Periodic Complementary Sets of Binary Sequences. Des. Codes Cryptogr. 13(3): 251-256 (1998) - [j12]Dragomir Z. Dokovic:
Equivalence classes and representatives of Golay sequences. Discret. Math. 189(1-3): 79-93 (1998) - 1997
- [j11]Dragomir Z. Ðokovic:
Some new D-optimal designs. Australas. J Comb. 15: 221-232 (1997) - 1996
- [j10]J. Bell, Dragomir Z. Djokovic:
Construction of Baumert-Hall-Welch arrays and T-matrices. Australas. J Comb. 14: 93-108 (1996) - 1994
- [j9]Dragomir Z. Djokovic:
Five new orders for Hadamard matrices of skew type. Australas. J Comb. 10: 259-264 (1994) - [j8]Dragomir Z. Dokovic:
Two Hadamard Matrices of Order 956 of Goethals-Seidel Type. Comb. 14(3): 375-377 (1994) - 1993
- [j7]Dragomir Z. Dokovic:
Williamson matrices of order 4n for n=33, 35, 39. Discret. Math. 115(1-3): 267-271 (1993) - 1992
- [j6]Dragomir Z. Dokovic:
Ten hadamard matrices of order 1852 of Goethals-Seidel type. Eur. J. Comb. 13(4): 245-248 (1992) - [j5]Dragomir Z. Dokovic:
Williamson Matrices of Orders 4.29 and 4.31. J. Comb. Theory A 59(2): 309-311 (1992) - [j4]Dragomir Z. Dokovic:
Skew Hadamard Matrices of Order 4 x 37 and 4 x 43. J. Comb. Theory A 61(2): 319-321 (1992) - 1980
- [j3]Dragomir Z. Djokovic, Gary L. Miller:
Regular groups of automorphisms of cubic graphs. J. Comb. Theory B 29(2): 195-230 (1980) - 1979
- [j2]Dragomir Z. Djokovic:
On regular graphs, V. J. Comb. Theory B 26(3): 300-308 (1979) - [j1]Dragomir Z. Djokovic:
On regular graphs, VI. J. Comb. Theory B 26(3): 309-316 (1979)
Conference and Workshop Papers
- 2019
- [c1]Curtis Bright, Dragomir Z. Ðokovic, Ilias S. Kotsireas, Vijay Ganesh:
A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples. AAAI 2019: 1435-1442
Informal and Other Publications
- 2019
- [i3]Curtis Bright, Dragomir Z. Dokovic, Ilias S. Kotsireas, Vijay Ganesh:
The SAT+CAS Method for Combinatorial Search with Applications to Best Matrices. CoRR abs/1907.04987 (2019) - 2018
- [i2]Curtis Bright, Dragomir Z. Djokovic, Ilias S. Kotsireas, Vijay Ganesh:
A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples. CoRR abs/1811.05094 (2018) - 2007
- [i1]Dragomir Z. Dokovic:
Periodic complementary sets of binary sequences. CoRR abs/0708.0053 (2007)
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-07-02 21:27 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:
