Alexey V. Lebedev

Orcid: 0000-0001-5292-9661

According to our database1, Alexey V. Lebedev authored at least 19 papers between 2003 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Nonlinear approximation of characteristics of a fork-join queueing system with Pareto service as a model of parallel structure of data processing.
Math. Comput. Simul., December, 2023

Correcting One Error in Non-Binary Channels with Feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Two-Stage Coding Over the Z-Channel.
IEEE Trans. Inf. Theory, 2022

Correcting a Single Error in Feedback Channels.
Probl. Inf. Transm., 2022

Nontransitivity of tuples of random variables with polynomial density and its effects in Bayesian models.
Math. Comput. Simul., 2022

Non-adaptive and two-stage coding over the Z-channel.
CoRR, 2022

2021
Non-Adaptive and Adaptive Two-Sided Search with Fast Objects.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Bivariate Distributions of Maximum Remaining Service Times in Fork-Join Infinite-Server Queues.
Probl. Inf. Transm., 2020

Queueing System with Two Input Flows, Preemptive Priority, and Stochastic Dropping.
Autom. Remote. Control., 2020

2019
Search for a Moving Element with the Minimum Total Cardinality of Tests.
Probl. Inf. Transm., 2019

The Nontransitivity Problem for Three Continuous Random Variables.
Autom. Remote. Control., 2019

2018
Maximum Remaining Service Time in Infinite-Server Queues.
Probl. Inf. Transm., 2018

2017
Stochastic Operation Induced by Group Allocation of Particles and Generalized Branching Processes.
Probl. Inf. Transm., 2017

2015
Activity maxima in some models of information networks with random weights and heavy tails.
Probl. Inf. Transm., 2015

2009
On one top news list model.
Probl. Inf. Transm., 2009

2008
Activity maxima in random networks in the heavy tail case.
Probl. Inf. Transm., 2008

2005
Maxima of Waiting Times for the Random Order Service <i>M</i>|<i>M</i>|1 Queue.
Probl. Inf. Transm., 2005

2004
Gated Infinite-Server Queue with Heavy Traffic and Power Tail.
Probl. Inf. Transm., 2004

2003
The Gated Infinite-Server Queue with Unbounded Service Times and Heavy Traffic.
Probl. Inf. Transm., 2003


  Loading...