Alexander A. Sapozhenko

From MaRDI portal
Person:941372

Available identifiers

zbMath Open sapozhenko.aleksandr-aMaRDI QIDQ941372

List of research outcomes

PublicationDate of PublicationType
The number of sumsets in abelian group2021-01-08Paper
Asymptotics for the logarithm of the number of \(k\)-solution-free sets in abelian groups2020-01-17Paper
The Number of k-Sumsets in an Abelian Group2019-12-02Paper
Asymptotics for the Logarithm of the Number of (k, l)-Solution-Free Collections in an Interval of Naturals2019-12-02Paper
Independent sets in graphs2017-01-10Paper
https://portal.mardi4nfdi.de/entity/Q29314722014-11-25Paper
https://portal.mardi4nfdi.de/entity/Q28574402013-11-01Paper
Conditions for the existence of continuous schedules of duration five2012-11-20Paper
Asymptotics of the number of sum-free sets in groups of prime order2012-11-15Paper
https://portal.mardi4nfdi.de/entity/Q31156262012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q30131792011-07-18Paper
Solution of the Cameron-Erdös problem for groups of prime order2009-12-17Paper
https://portal.mardi4nfdi.de/entity/Q36042742009-02-24Paper
Upper bound for the number of independent sets in graphs2009-01-19Paper
https://portal.mardi4nfdi.de/entity/Q35415162008-11-25Paper
The Cameron-Erdős conjecture2008-09-04Paper
https://portal.mardi4nfdi.de/entity/Q52941542007-07-24Paper
https://portal.mardi4nfdi.de/entity/Q34408962007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34410002007-05-29Paper
Asymptotics of the number of sum-free sets in abelian groups of even order.2007-01-12Paper
Independent sets in quasi-regular graphs2006-11-15Paper
Stochastic Algorithms: Foundations and Applications2006-10-20Paper
On the number of independent sets in expanders2004-08-30Paper
https://portal.mardi4nfdi.de/entity/Q48095822004-08-30Paper
On the number and structure of sum-free sets in a segment of positive integers2004-08-30Paper
The number of sum-free sets in abelian groups2004-03-21Paper
On the possibility of constructing macromodels for RC-circuits2003-12-10Paper
https://portal.mardi4nfdi.de/entity/Q47931942003-06-26Paper
On the number of connected sets with the neighborhood of a given size in a graph2002-01-30Paper
Estimation of the number of connected sets in a graph and the structure of components of random subsets2001-01-28Paper
On computing boundary functional sums2000-09-10Paper
https://portal.mardi4nfdi.de/entity/Q48914771996-09-10Paper
https://portal.mardi4nfdi.de/entity/Q48883821996-08-15Paper
https://portal.mardi4nfdi.de/entity/Q42846101994-03-24Paper
Radius and diameter of random subgraphs of the hypercube1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40296201993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40271681993-02-21Paper
https://portal.mardi4nfdi.de/entity/Q39968561993-01-23Paper
The search of a maximum upper zero of a monotone function on ranked sets1992-09-27Paper
Lower bounds on the area complexity of Boolean circuits1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39981101992-09-17Paper
On the number of databases and closure operations1991-01-01Paper
The number of antichains in ranked posets1991-01-01Paper
On the number of antichains in multilevelled ranked posets1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33624801991-01-01Paper
Boolean function minimization in the class of disjunctive normal forms1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30353471989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34873961987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38183701987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30410791983-01-01Paper
Estimation of the length and the number of dead-end disjunctive normal forms for almost all partial Boolean functions1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47399071981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38840161980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38984401977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41949751977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32070021975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40459551973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51812421972-01-01Paper
On the greatest length of a dead-end disjunctive normal form for almost all Boolean functions1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55557031968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55975331968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55366521967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55620021967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56467881967-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Alexander A. Sapozhenko