default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLevon H. Khachatrian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2006
[j27]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Intersection theorems under dimension constraints. J. Comb. Theory A 113(3): 483-519 (2006)- 2005
- [j26]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) - [j25]Rudolf Ahlswede, Levon H. Khachatrian:
On attractive and friendly sets in sequence spaces. Electron. Notes Discret. Math. 21: 193-198 (2005) - 2004
- [j24]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
On Shadows Of Intersecting Families. Comb. 24(4): 555-566 (2004) - [j23]Rudolf Ahlswede, Levon H. Khachatrian:
Katona's Intersection Theorem: Four Proofs. Comb. 25(1): 105-110 (2004) - 2003
- [j22]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) - [j21]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) - [j20]Rudolf Ahlswede, Levon H. Khachatrian:
Cone Dependence - A Basic Combinatorial Concept. Des. Codes Cryptogr. 29(1-3): 29-40 (2003) - [j19]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Extremal problems under dimension constraints. Discret. Math. 273(1-3): 9-21 (2003) - [j18]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Maximal antichains under dimension constraints. Discret. Math. 273(1-3): 23-29 (2003) - [j17]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
More about shifting techniques. Eur. J. Comb. 24(5): 551-556 (2003) - [j16]Rudolf Ahlswede, Levon H. Khachatrian, Christian Mauduit, András Sárközy:
A complexity measure for families of binary sequences. Period. Math. Hung. 46(2): 107-118 (2003) - 2002
- [j15]Rudolf Ahlswede, Christian Bey, Konrad Engel, Levon H. Khachatrian:
The t-intersection Problem in the Truncated Boolean Lattice. Eur. J. Comb. 23(5): 471-487 (2002) - 2001
- [j14]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
On Perfect Codes and Related Concepts. Des. Codes Cryptogr. 22(3): 221-237 (2001) - [j13]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Extremal problems under dimension constraints. Electron. Notes Discret. Math. 10: 154-156 (2001) - [j12]Rudolf Ahlswede, Levon H. Khachatrian, András Sárközy:
On primitive sets of squarefree integers. Period. Math. Hung. 42(1-2): 99-115 (2001) - 1999
- [j11]Rudolf Ahlswede, Levon H. Khachatrian:
A Pushing-Pulling Method: New Proofs of Intersection Theorems. Comb. 19(1): 1-15 (1999) - 1998
- [j10]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
The Intersection Theorem for Direct Products. Eur. J. Comb. 19(6): 649-661 (1998) - 1997
- [j9]Rudolf Ahlswede, Levon H. Khachatrian:
Counterexample to the Frankl-Pach Conjecture for Uniform, Dense Families. Comb. 17(2): 299-301 (1997) - [j8]Rudolf Ahlswede, Levon H. Khachatrian:
The Complete Intersection Theorem for Systems of Finite Sets. Eur. J. Comb. 18(2): 125-136 (1997) - 1996
- [j7]Rudolf Ahlswede, Levon H. Khachatrian:
A counterexample to Aharoni's strongly maximal matching conjecture. Discret. Math. 149(1-3): 289 (1996) - [j6]Rudolf Ahlswede, Levon H. Khachatrian:
Optimal pairs of incomparable clouds in multisets. Graphs Comb. 12(1): 97-137 (1996) - [j5]Rudolf Ahlswede, Levon H. Khachatrian:
The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets. J. Comb. Theory A 76(1): 121-138 (1996) - 1995
- [j4]Rudolf Ahlswede, Levon H. Khachatrian:
Towards characterizing equality in correlation inequalities. Eur. J. Comb. 16(4): 315-328 (1995) - 1994
- [j3]Rudolf Ahlswede, Levon H. Khachatrian:
The maximal length of cloud-antichains. Discret. Math. 131(1-3): 9-15 (1994) - 1993
- [j2]Levon H. Khachatrian:
The Lower bound of the Quadratic Spans of DeBruijn Sequences. Des. Codes Cryptogr. 3(1): 29-32 (1993) - [j1]Mario Blaum, Jehoshua Bruck
, Levon H. Khachatrian:
Constructions of skew-tolerant and skew-detecting codes. IEEE Trans. Inf. Theory 39(5): 1751-1757 (1993)
Conference and Workshop Papers
- 2006
- [c1]Rudolf Ahlswede, Levon H. Khachatrian:
On Attractive and Friendly Sets in Sequence Spaces. GTIT-C 2006: 955-970
Parts in Books or Collections
- 2013
- [p1]Rudolf Ahlswede, Levan H. Khachatrian:
Classical Results on Primitive and Recent Results on Cross-Primitive Sequences. The Mathematics of Paul Erdős I 2013: 119-132
Informal and Other Publications
- 2006
- [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)
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:26 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:
