default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarout K. Aydinian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c12]Anna Frank, Harout K. Aydinian, Holger Boche:
Delay Optimal Coding for Secure Transmission over a Burst Erasure Wiretap Channel. WCNC 2019: 1-7- 2018
- [j29]Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir S. Lebedev:
A Combinatorial Model of Two-Sided Search. Int. J. Found. Comput. Sci. 29(4): 481-504 (2018) - 2017
- [j28]Harout K. Aydinian:
A subspace covering problem in the n-cube. Discret. Appl. Math. 216: 513-517 (2017) - [c11]Harout K. Aydinian, Holger Boche:
Fractional repetition codes based on partially ordered sets. ITW 2017: 51-55 - 2016
- [c10]Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe
, Vladimir S. Lebedev:
A Combinatorial Model of Two-Sided Search. SOFSEM 2016: 148-160 - [c9]Anna Frank, Harout K. Aydinian, Holger Boche:
Type II wiretap channel with an active eavesdropper in finite blocklength regime. WCNC 2016: 1-6 - [c8]Anna Frank, Harout K. Aydinian, Holger Boche:
Type II wiretap channel with an active eavesdropper in finite blocklength regime. WCNC Workshops 2016: 258-263 - 2014
- [j27]Harout K. Aydinian, Péter L. Erdös:
AZ-Identities and Strict 2-Part Sperner Properties of Product Posets. Order 31(1): 1-14 (2014) - [j26]Noga Alon, Harout K. Aydinian, Hao Huang:
Maximizing the Number of Nonnegative Subsets. SIAM J. Discret. Math. 28(2): 811-816 (2014) - 2013
- [c7]Harout K. Aydinian, Éva Czabarka, László A. Székely:
Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals. Information Theory, Combinatorics, and Search Theory 2013: 371-401 - [c6]Rudolf Ahlswede, Harout K. Aydinian:
New Construction of Error-Tolerant Pooling Designs. Information Theory, Combinatorics, and Search Theory 2013: 534-542 - [e2]Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe:
Information Theory, Combinatorics, and Search Theory - In Memory of Rudolf Ahlswede. Lecture Notes in Computer Science 7777, Springer 2013, ISBN 978-3-642-36898-1 [contents] - 2012
- [j25]Harout K. Aydinian, Vladimir M. Blinovsky:
A remark on the problem of nonnegative k-subset sums. Probl. Inf. Transm. 48(4): 347-351 (2012) - [j24]Rudolf Ahlswede, Harout K. Aydinian:
On Generic Erasure Correcting Sets and Related Problems. IEEE Trans. Inf. Theory 58(2): 501-508 (2012) - 2011
- [j23]Harout K. Aydinian, Péter L. Erdös:
On two-part Sperner systems for regular posets (Extended Abstract). Electron. Notes Discret. Math. 38: 87-92 (2011) - [j22]Harout K. Aydinian, Éva Czabarka, Péter L. Erdös, László A. Székely:
A tour of M-part L-Sperner families. J. Comb. Theory A 118(2): 702-725 (2011) - [j21]Rudolf Ahlswede, Harout K. Aydinian:
On Security of Statistical Databases. SIAM J. Discret. Math. 25(4): 1778-1791 (2011) - [i2]Rudolf Ahlswede, Harout K. Aydinian:
On generic erasure correcting sets and related problems. CoRR abs/1108.1161 (2011) - 2010
- [j20]Harout K. Aydinian, Éva Czabarka, Konrad Engel, Péter L. Erdös, László A. Székely:
A note on full transversals and mixed orthogonal arrays. Australas. J Comb. 48: 133-142 (2010)
2000 – 2009
- 2009
- [c5]Rudolf Ahlswede, Harout K. Aydinian:
Interactive Communication, Diagnosis and Error Control in Networks. Algorithmics of Large and Complex Networks 2009: 197-226 - 2008
- [j19]Harout K. Aydinian:
Levon H. Khachatrian: 1954-2002. Discret. Appl. Math. 156(9): 1346-1347 (2008) - [j18]Rudolf Ahlswede, Harout K. Aydinian:
On diagnosability of large multiprocessor networks. Discret. Appl. Math. 156(18): 3464-3474 (2008) - [j17]Rudolf Ahlswede, Harout K. Aydinian:
Error Control Codes for Parallel Asymmetric Channels. IEEE Trans. Inf. Theory 54(2): 831-836 (2008) - 2007
- [j16]Harout K. Aydinian, Péter L. Erdös:
All Maximum Size Two-Part Sperner Systems: In Short. Comb. Probab. Comput. 16(4): 553-555 (2007) - 2006
- [j15]Harout K. Aydinian:
An extremal problem on graphs. Electron. Notes Discret. Math. 25: 19 (2006) - [j14]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Intersection theorems under dimension constraints. J. Comb. Theory A 113(3): 483-519 (2006) - [j13]Rudolf Ahlswede, Harout K. Aydinian:
Construction of asymmetric connectors of depth two. J. Comb. Theory A 113(8): 1614-1620 (2006) - [c4]Rudolf Ahlswede, Harout K. Aydinian:
Sparse Asymmetric Connectors in Communication Networks. GTIT-C 2006: 1056-1062 - [c3]Harout K. Aydinian:
Generalized Anticodes in Hamming Spaces. GTIT-C 2006: 1073-1074 - [c2]Rudolf Ahlswede, Harout K. Aydinian:
On security of statistical databases. ISIT 2006: 506-508 - [c1]Rudolf Ahlswede, Harout K. Aydinian:
Error control codes for parallel asymmetric channels. ISIT 2006: 1768-1772 - [e1]Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout K. Aydinian, Vladimir M. Blinovsky, Christian Deppe, Haik Mashurian:
General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science 4123, Springer 2006, ISBN 3-540-46244-9 [contents] - [i1]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian, Ludo M. G. M. Tolhuizen:
On q-ary codes correcting all unidirectional errors of a limited magnitude. CoRR abs/cs/0607132 (2006) - 2005
- [j12]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Forbidden (0, 1)-vectors in Hyperplanes of Rn: The unrestricted case. Des. Codes Cryptogr. 37(1): 151-167 (2005) - [j11]Rudolf Ahlswede, Harout K. Aydinian:
On diagnosability of large multiprocessor networks. Electron. Notes Discret. Math. 21: 101-104 (2005) - [j10]Rudolf Ahlswede, Harout K. Aydinian:
Sparse asymmetric connectors in communication networks. Electron. Notes Discret. Math. 21: 105-109 (2005) - 2004
- [j9]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
On Shadows Of Intersecting Families. Comb. 24(4): 555-566 (2004) - 2003
- [j8]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace. Comb. 23(1): 5-22 (2003) - [j7]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Forbidden (0, 1)-Vectors in Hyperplanes of Rn: The Restricted Case. Des. Codes Cryptogr. 29(1-3): 17-28 (2003) - [j6]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Extremal problems under dimension constraints. Discret. Math. 273(1-3): 9-21 (2003) - [j5]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Maximal antichains under dimension constraints. Discret. Math. 273(1-3): 23-29 (2003) - [j4]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
More about shifting techniques. Eur. J. Comb. 24(5): 551-556 (2003) - 2001
- [j3]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
On Perfect Codes and Related Concepts. Des. Codes Cryptogr. 22(3): 221-237 (2001) - [j2]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Extremal problems under dimension constraints. Electron. Notes Discret. Math. 10: 154-156 (2001)
1990 – 1999
- 1998
- [j1]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
The Intersection Theorem for Direct Products. Eur. J. Comb. 19(6): 649-661 (1998)
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-06-10 21:25 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:
