dblp.uni-trier.dewww.uni-trier.de

Harout K. Aydinian

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
23EERudolf Ahlswede, Harout K. Aydinian: On diagnosability of large multiprocessor networks. Discrete Applied Mathematics 156(18): 3464-3474 (2008)
22EEHarout K. Aydinian: Levon H. Khachatrian: 1954-2002. Discrete Applied Mathematics 156(9): 1346-1347 (2008)
21EERudolf Ahlswede, Harout K. Aydinian: Error Control Codes for Parallel Asymmetric Channels. IEEE Transactions on Information Theory 54(2): 831-836 (2008)
2007
20EEHarout K. Aydinian, Péter L. Erdös: All Maximum Size Two-Part Sperner Systems: In Short. Combinatorics, Probability & Computing 16(4): 553-555 (2007)
2006
19 Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout K. Aydinian, Vladimir Blinovsky, Christian Deppe, Haik Mashurian: General Theory of Information Transfer and Combinatorics Springer 2006
18EERudolf Ahlswede, Harout K. Aydinian: Sparse Asymmetric Connectors in Communication Networks. GTIT-C 2006: 1056-1062
17EEHarout K. Aydinian: Generalized Anticodes in Hamming Spaces. GTIT-C 2006: 1073-1074
16EERudolf 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)
15EEHarout K. Aydinian: An extremal problem on graphs. Electronic Notes in Discrete Mathematics 25: 19 (2006)
14EERudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian: Intersection theorems under dimension constraints. J. Comb. Theory, Ser. A 113(3): 483-519 (2006)
13EERudolf Ahlswede, Harout K. Aydinian: Construction of asymmetric connectors of depth two. J. Comb. Theory, Ser. A 113(8): 1614-1620 (2006)
2005
12EERudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian: Forbidden (0, 1)-vectors in Hyperplanes of Rn: The unrestricted case. Des. Codes Cryptography 37(1): 151-167 (2005)
11EERudolf Ahlswede, Harout K. Aydinian: On diagnosability of large multiprocessor networks. Electronic Notes in Discrete Mathematics 21: 101-104 (2005)
10EERudolf Ahlswede, Harout K. Aydinian: Sparse asymmetric connectors in communication networks. Electronic Notes in Discrete Mathematics 21: 105-109 (2005)
2004
9EERudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian: On Shadows Of Intersecting Families. Combinatorica 24(4): 555-566 (2004)
2003
8EERudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian: Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace. Combinatorica 23(1): 5-22 (2003)
7EERudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian: Forbidden (0, 1)-Vectors in Hyperplanes of Rn: The Restricted Case. Des. Codes Cryptography 29(1-3): 17-28 (2003)
6EERudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian: Maximal antichains under dimension constraints. Discrete Mathematics 273(1-3): 23-29 (2003)
5EERudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian: Extremal problems under dimension constraints. Discrete Mathematics 273(1-3): 9-21 (2003)
4EERudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian: More about shifting techniques. Eur. J. Comb. 24(5): 551-556 (2003)
2001
3 Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian: On Perfect Codes and Related Concepts. Des. Codes Cryptography 22(3): 221-237 (2001)
2EERudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian: Extremal problems under dimension constraints. Electronic Notes in Discrete Mathematics 10: 154-156 (2001)
1998
1EERudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian: The Intersection Theorem for Direct Products. Eur. J. Comb. 19(6): 649-661 (1998)

Coauthor Index

1Rudolf Ahlswede [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [16] [18] [19] [21] [23]
2Lars Bäumer [19]
3Vladimir Blinovsky [19]
4Ning Cai [19]
5Christian Deppe [19]
6Péter L. Erdös [20]
7Levon H. Khachatrian [1] [2] [3] [4] [5] [6] [7] [8] [9] [12] [14] [16]
8Haik Mashurian [19]
9Ludo M. G. M. Tolhuizen [16]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)