The complexity of classical and quantum branching programs: A communication complexity approach technique for classical (deterministic, nondeterministic and randomized) and quantum
models of branching
Constructing a Neural-Net Model of Network Traffic Using the Topologic Analysis of Its Time Series Complexity of building a predicting neural-net
model of the time sequence of network traffic. Topological data analysis
Computer simulation of forward-backward scattering meteor trails analytically and by
computer simulation. Using the developed simulation
model, a daily variation of share
Spectra of algebraic fields and subfields and
computability when F is seen as a subfield of F. © 2009 Springer Berlin Heidelberg.
COMPUTATIONAL MODELING OF AMORPHOUS SILICA .3. MODELING THE INITIAL STRUCTURES - SILICA-GELA qualitative algorithm for construction of large clusters of silica gel
model structures is used
COMPUTATIONAL MODELING OF AMORPHOUS SILICA .4. MODELING THE INITIAL STRUCTURES - AEROGELA qualitative classification algorithm for constructing large clusters of aerogel
model structures
In Memory of Vladimir GerdtCenter for
Computational Methods in Applied Mathematics of RUDN, Professor V.P. Gerdt, whose
Quantum online algorithms for a model of the request-answer game with a buffer of the buffer. For the
model, quantum and classical (deterministic or randomized) algorithms were a focus