default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikita D. Vvedenskaya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j7]Artem Logachov, Yuri M. Suhov, Nikita D. Vvedenskaya, Anatoly Yambartsev:
A large-deviation principle for birth-death processes with a linear rate of downward jumps. J. Appl. Probab. 61(3): 781-801 (2024)- 2018
- [j6]Nikita D. Vvedenskaya, A. V. Logachov, Yuri M. Suhov, Anatoly Yambartsev:
A Local Large Deviation Principle for Inhomogeneous Birth-Death Processes. Probl. Inf. Transm. 54(3): 263-280 (2018) - 2011
- [j5]Nikita D. Vvedenskaya:
Configuration of overloaded servers with dynamic routing. Probl. Inf. Transm. 47(3): 289 (2011) - 2008
- [j4]Nikita D. Vvedenskaya, E. A. Pechersky:
Circle of interacting servers: Spontaneous collective behavior in the case of large fluctuations. Probl. Inf. Transm. 44(4): 370-384 (2008) - 2007
- [j3]Nikita D. Vvedenskaya, Yuri M. Suhov:
Multi-access system with many users: Stability and metastability. Probl. Inf. Transm. 43(3): 263-269 (2007) - 2002
- [j2]Yuri M. Suhov, Nikita D. Vvedenskaya:
Fast Jackson Networks with Dynamic Routing. Probl. Inf. Transm. 38(2): 136-153 (2002) - [j1]Khaldoun Al Agha, Philippe Jacquet, Nikita D. Vvedenskaya:
Analysis of the priority stack random-access protocol in W-CDMA systems. IEEE Trans. Veh. Technol. 51(3): 588-596 (2002)
Conference and Workshop Papers
- 2011
- [c8]Nikita D. Vvedenskaya, Yuri M. Suhov, Vladimir Belitsky:
A non-linear model of limit order book dynamics. ISIT 2011: 1260-1262 - 2004
- [c7]E. A. Pechersky, Yuri M. Suhov, Nikita D. Vvedenskaya:
Large deviation in a two-servers system with dynamic routing. ISIT 2004: 114 - 2000
- [c6]Petra Berenbrink, Artur Czumaj, Tom Friedetzky, Nikita D. Vvedenskaya:
Infinite parallel job allocation (extended abstract). SPAA 2000: 99-108 - [c5]Khaldoun Al Agha, Philippe Jacquet, Nikita D. Vvedenskaya:
W-CDMA random access with priority resolution. WCNC 2000: 1152-1156 - 1996
- [c4]Nikita D. Vvedenskaya, Jean-Paul M. G. Linnartz
:
Single-Frequency Packet Network Using Stack Algorithm and Multiple Base Stations. International Zurich Seminar on Digital Communications 1996: 289-298 - 1994
- [c3]Nikita D. Vvedenskaya, Jens C. Arnbak, Boris S. Tsybakov:
Improved Performance of Mobile Data Networks Using Stack Algorithms and Receiver Capture. Mobile Communications 1994: 464-475 - [c2]Nikita D. Vvedenskaya:
Multiple access stack algorithm with imperfect feedback. PIMRC 1994: 1126-1128 - [c1]Nikita D. Vvedenskaya, Jean-Paul M. G. Linnartz:
Effect of CDMA transmission on performance of wireless networks with stack algorithm for collision resolution. PIMRC 1994: 1129-1132
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
