Boris S. Veroy

According to our database, Boris S. Veroy authored at least 6 papers between 1986 and 1989.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

1989

Optimal search algorithm for extrema of a discrete periodic bimodal function.

Boris S. Veroy

J. Complex., 1989

1988

Capacity Expansion for Information Flow Distribution in Multi-Path Computer Communication Networks.

Vladimir Zwass, Boris S. Veroy

J. Manag. Inf. Syst., 1988

Embedding a Point-to-Point Network in the Expansion of Infrastructure for Information Systems.

Boris S. Veroy, Vladimir Zwass

J. Manag. Inf. Syst., 1988

Average Complexity of Divide-and-Conquer Algorithms.

Boris S. Veroy

Inf. Process. Lett., 1988

Optimal Search Algorithm for a Minimum of a Discrete Periodic Bimodal Function.

Boris S. Veroy

Inf. Process. Lett., 1988

1986

An optimal algorithm for search of extrema of a bimodal function.

Boris S. Veroy

J. Complex., 1986