1. New (n, r)-arcs in PG(2, 17), PG(2, 19), and PG(2, 23)

   • R. Daskalov
   • E. Metodieva

   Coding Theory 11 October 2011 Pages: 217 - 223

2. Classification of optimal (v, 4, 1) binary cyclically permutable constant-weight codes and cyclic 2-(v, 4, 1) designs with v ≤ 76

   • T. Baicheva
   • S. Topalova

   Coding Theory 11 October 2011 Pages: 224 - 231

3. Method of Lyapunov functions for analysis of absorption and explosion in Markov chains

   • P. -L. Chow
   • R. Z. Khasminskii

   Large Systems 11 October 2011 Pages: 232 - 250

4. On a sequence of random distance graphs subject to the zero-one law

   • M. E. Zhukovskii

   Large Systems 11 October 2011 Pages: 251 - 268

5. Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph

   • M. A. Babenko
   • T. A. Urbanovich

   Large Systems 11 October 2011 Pages: 269 - 273

6. The tree nearest on average to a given set of trees

   • K. Yu. Gorbunov
   • V. A. Lyubetsky

   Large Systems 11 October 2011 Pages: 274 - 288

7. Configuration of overloaded servers with dynamic routing

   • N. D. Vvedenskaya

   Communication Network Theory 11 October 2011 Pages: 289 - 303