Alexander A. Sapozhenko

According to our database, Alexander A. Sapozhenko authored at least 12 papers between 1987 and 2013.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2013

Merrifield-Simmons index and minimum Number of Independent Sets in Short Trees.

Allan Frendrup, Anders Sune Pedersen, Alexander A. Sapozhenko, Preben D. Vestergaard

Ars Comb., 2013

2011

Upper bound for the number of perfect (n, 3)-codes.

Alexander A. Sapozhenko

Electron. Notes Discret. Math., 2011

2008

The Cameron-Erdös conjecture.

Alexander A. Sapozhenko

Discret. Math., 2008

2006

Independent sets in quasi-regular graphs.

Alexander A. Sapozhenko

Eur. J. Comb., 2006

2005

Systems of Containers and Enumeration Problems.

Alexander A. Sapozhenko

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2005

2001

On the number of connected sets with the neighborhood of a given size in a graph.

Alexander A. Sapozhenko

Discret. Appl. Math., 2001

2000

On computing boundary functional sums.

Alexander A. Sapozhenko

Discret. Math., 2000

1993

Radius and Diameter of Random Subgraphs of the Hypercube.

Alexandr V. Kostochka, Alexander A. Sapozhenko, K. Weber

Random Struct. Algorithms, 1993

1992

Lower Bounds on the Area Complexity of Boolean Circuits.

Juraj Hromkovic, Sergej A. Lozkin, Andrej I. Rybko, Alexander A. Sapozhenko, Nadezda A. Skalikova

Theor. Comput. Sci., 1992

1991

On the Number of Databases and Closure Operations.

Gustav Burosch, János Demetrovics, Gyula O. H. Katona, Daniel J. Kleitman, Alexander A. Sapozhenko

Theor. Comput. Sci., 1991

1987

The Number of Fuzzy Monotone Functions.

Alexander A. Sapozhenko

Proceedings of the Fundamentals of Computation Theory, 1987

On Some Operations of Partial Monotone Boolean Function Simplifying.

L. M. Karahanjan, Alexander A. Sapozhenko

Proceedings of the Fundamentals of Computation Theory, 1987