Harout Aydinian

From MaRDI portal
(Redirected from Person:516771)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Optimal strategies for a model of combinatorial two-sided search2020-03-12Paper
A Combinatorial Model of Two-Sided Search
International Journal of Foundations of Computer Science
2018-07-24Paper
On Generic Erasure Correcting Sets and Related Problems
IEEE Transactions on Information Theory
2017-07-12Paper
A subspace covering problem in the \(n\)-cube
Discrete Applied Mathematics
2017-03-15Paper
A combinatorial model of two-sided search
Lecture Notes in Computer Science
2016-03-10Paper
Maximizing the Number of Nonnegative Subsets
SIAM Journal on Discrete Mathematics
2014-09-26Paper
AZ-identities and strict 2-part Sperner properties of product posets
Order
2014-06-12Paper
AZ-identities and strict 2-part Sperner properties of product posets
Order
2014-06-12Paper
On two-part Sperner systems for regular posets (extended abstract)2013-11-01Paper
New Construction of Error-Tolerant Pooling Designs
Information Theory, Combinatorics, and Search Theory
2013-04-09Paper
Mixed orthogonal arrays, \(k\)-dimensional \(M\)-part Sperner multifamilies, and full multitransversals
Information Theory, Combinatorics, and Search Theory
2013-04-09Paper
A remark on the problem of nonnegative \(k\)-subset sums
Problems of Information Transmission
2013-04-03Paper
On security of statistical databases
SIAM Journal on Discrete Mathematics
2012-03-15Paper
A note on full transversals and mixed orthogonal arrays2011-05-31Paper
A tour of \(M\)-part \(L\)-Sperner families
Journal of Combinatorial Theory. Series A
2011-01-14Paper
Interactive Communication, Diagnosis and Error Control in Networks
Algorithmics of Large and Complex Networks
2009-07-09Paper
On diagnosability of large multiprocessor networks
Discrete Applied Mathematics
2009-03-04Paper
Error Control Codes for Parallel Asymmetric Channels
IEEE Transactions on Information Theory
2009-02-24Paper
Generalized Anticodes in Hamming Spaces
Lecture Notes in Computer Science
2009-01-22Paper
Sparse Asymmetric Connectors in Communication Networks
Lecture Notes in Computer Science
2009-01-22Paper
Levon H. Khachatrian: 1954-2002
Discrete Applied Mathematics
2008-09-29Paper
All Maximum Size Two-Part Sperner Systems: In Short
Combinatorics, Probability and Computing
2008-01-18Paper
Extremal problems under dimension constraints
Electronic Notes in Discrete Mathematics
2007-05-29Paper
On diagnosability of large multiprocessor networks
Electronic Notes in Discrete Mathematics
2007-05-29Paper
Sparse asymmetric connectors in communication networks
Electronic Notes in Discrete Mathematics
2007-05-29Paper
An extremal problem on graphs
Electronic Notes in Discrete Mathematics
2007-05-29Paper
Construction of asymmetric connectors of depth two
Journal of Combinatorial Theory. Series A
2006-12-07Paper
Intersection theorems under dimension constraints
Journal of Combinatorial Theory. Series A
2006-04-28Paper
Forbidden \((0,1)\)-vectors in hyperplanes of \(\mathbb R^n\): the unrestricted case
Designs, Codes and Cryptography
2005-11-07Paper
On shadows of intersecting families
Combinatorica
2005-10-04Paper
Maximum number of constant weight vertices of the unit \(n\)-cube contained in a \(k\)-dimensional subspace
Combinatorica
2004-09-07Paper
On Bohman’s conjecture related to a sum packing problem of Erdos
Proceedings of the American Mathematical Society
2004-02-12Paper
Extremal problems under dimension constraints.
Discrete Mathematics
2004-01-05Paper
Maximal antichains under dimension constraints
Discrete Mathematics
2004-01-05Paper
Forbidden (0, 1)-vectors in hyperplanes of \(\mathbb{R}^n\): The restricted case
Designs, Codes and Cryptography
2003-08-21Paper
More about shifting techniques
European Journal of Combinatorics
2003-07-30Paper
On perfect codes and related concepts
Designs, Codes and Cryptography
2001-11-02Paper
The intersection theorem for direct products
European Journal of Combinatorics
1999-04-23Paper


Research outcomes over time


This page was built for person: Harout Aydinian