default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKonstantin Avrachenkov
Konstantin E. Avrachenkov
Person information
- affiliation: INRIA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j85]S. Haleh S. Dizaji, Kishor Patil, Konstantin Avrachenkov:
Influence Maximization in Dynamic Networks Using Reinforcement Learning. SN Comput. Sci. 5(1): 169 (2024)- [j84]Konstantin Avrachenkov
, Maximilien Dreveton, Lasse Leskelä:
Recovering Static and Time-Varying Communities Using Persistent Edges. IEEE Trans. Netw. Sci. Eng. 11(2): 2087-2099 (2024) - [j83]Francisco Robledo Relaño, Vivek S. Borkar, Urtzi Ayesta, Konstantin Avrachenkov:
Tabular and Deep Learning for the Whittle Index. ACM Trans. Model. Perform. Evaluation Comput. Syst. 9(3): 11:1-11:21 (2024) - [c115]Francisco Robledo, Urtzi Ayesta, Konstantin Avrachenkov:
Deep Reinforcement Learning for Weakly Coupled MDP's with Continuous Actions. ASMTA 2024: 67-80 - [c114]Louis Hauseux, Konstantin Avrachenkov, Josiane Zerubia:
Benefits of Hypergraphs for Density-Based Clustering. EUSIPCO 2024: 2302-2306 - [i65]Francisco Robledo, Urtzi Ayesta, Konstantin Avrachenkov:
Deep reinforcement learning for weakly coupled MDP's with continuous actions. CoRR abs/2406.01099 (2024) - [i64]Francisco Robledo Relaño, Vivek S. Borkar, Urtzi Ayesta, Konstantin Avrachenkov:
Tabular and Deep Learning for the Whittle Index. CoRR abs/2406.02057 (2024) - [i63]Khushboo Agarwal, Konstantin Avrachenkov, Veeraruna Kavitha, Raghupati Vyas:
Balancing rationality and social influence: Alpha-rational Nash equilibrium in games with herding. CoRR abs/2406.03928 (2024) - 2023
- [j82]Konstantin Avrachenkov, Vivek S. Borkar, U. Jayakrishnan Nair:
Special Issue : Multi-Agent Dynamic Decision Making and Learning. Dyn. Games Appl. 13(1): 1-2 (2023) - [j81]Konstantin Avrachenkov, Evsey Morozov, Ruslana Nekrasova:
Stability analysis of two-class retrial systems with constant retrial rates and general service times. Perform. Evaluation 159: 102330 (2023) - [j80]Konstantin Avrachenkov, Phillipa Gill, Bhuvan Urgaonkar:
POMACS V7, N1, March 2023 Editorial. Proc. ACM Meas. Anal. Comput. Syst. 7(1): 1:1 (2023) - [j79]Konstantin Avrachenkov, Phillipa Gill, Bhuvan Urgaonkar:
POMACS V7, N2, June 2023 Editorial. Proc. ACM Meas. Anal. Comput. Syst. 7(2): 28:1-28:2 (2023) - [c113]Louis Hauseux, Konstantin Avrachenkov, Josiane Zerubia:
Graph Based Approach for Galaxy Filament Extraction. COMPLEX NETWORKS (3) 2023: 384-396 - [c112]Tejas Pagare, Vivek S. Borkar, Konstantin Avrachenkov:
Full Gradient Deep Reinforcement Learning for Average-Reward Criterion. L4DC 2023: 235-247 - [c111]Kalle Alaluusua, Konstantin Avrachenkov, B. R. Vinay Kumar, Lasse Leskelä:
Multilayer Hypergraph Clustering Using the Aggregate Similarity Matrix. WAW 2023: 83-98 - [e4]Evgenia Smirni, Konstantin Avrachenkov, Phillipa Gill, Bhuvan Urgaonkar:
Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2023, Orlando, FL, USA, June 19-23, 2023. ACM 2023 [contents] - [i62]Kalle Alaluusua, Konstantin Avrachenkov, B. R. Vinay Kumar, Lasse Leskelä:
Multilayer hypergraph clustering using the aggregate similarity matrix. CoRR abs/2301.11657 (2023) - [i61]Tejas Pagare, Vivek S. Borkar, Konstantin Avrachenkov:
Full Gradient Deep Reinforcement Learning for Average-Reward Criterion. CoRR abs/2304.03729 (2023) - 2022
- [j78]Konstantin E. Avrachenkov, Vivek S. Borkar:
Whittle index based Q-learning for restless bandits with average reward. Autom. 139: 110186 (2022) - [j77]Konstantin Avrachenkov, Patrick Brown, Nelly Litvak:
Red Light Green Light Method for Solving Large Markov Chains. J. Sci. Comput. 93(1): 18 (2022) - [j76]Konstantin Avrachenkov, Kishor Patil, Gugan Thoppe:
Online algorithms for estimating change rates of web pages. Perform. Evaluation 153: 102261 (2022) - [j75]Konstantin Avrachenkov:
Stability and partial instability of multi-class retrial queues. Queueing Syst. Theory Appl. 100(3-4): 177-179 (2022) - [j74]Francisco Robledo, Vivek S. Borkar, Urtzi Ayesta, Konstantin Avrachenkov:
QWI: Q-learning with Whittle Index. SIGMETRICS Perform. Evaluation Rev. 49(2): 47-50 (2022) - [j73]Konstantin E. Avrachenkov, Vivek S. Borkar, Sharayu Moharir, Suhail Mohmad Shah:
Dynamic Social Learning Under Graph Constraints. IEEE Trans. Control. Netw. Syst. 9(3): 1435-1446 (2022) - 2021
- [j72]Xutong Liu, Yu-Zhen Janice Chen, John C. S. Lui, Konstantin Avrachenkov:
Learning to count: A deep learning framework for graphlet count estimation. Netw. Sci. 9(S1): S23-S60 (2021) - [j71]Konstantin Avrachenkov, Phillipa Gill, Bhuvan Urgaonkar:
POMACS V6, N3 December 2022 Editorial. Proc. ACM Meas. Anal. Comput. Syst. 6(3): 42:1 (2021) - [c110]Konstantin Avrachenkov, Maximilien Dreveton, Lasse Leskelä:
Recovering Communities in Temporal Networks Using Persistent Edges. CSoNet 2021: 243-254 - [c109]Konstantin Avrachenkov, Vladimir Gaitsgory, Lucas Gamertsfelder:
LP Based Bounds for Cesàro and Abel Limits of the Optimal Values in Non-ergodic Stochastic Systems. ECC 2021: 2444-2449 - [c108]Konstantin Avrachenkov, Aurélie Boisbunon, Mikhail Kamalov:
Graph Diffusion & PCA Framework for Semi-supervised Learning. LION 2021: 25-39 - [i60]Konstantin Avrachenkov, Vivek S. Borkar, H. P. Dolhare, K. Patil:
Full Gradient DQN Reinforcement Learning: A Provably Convergent Scheme. CoRR abs/2103.05981 (2021) - [i59]Konstantin Avrachenkov, Evsey Morozov, Ruslana Nekrasova:
Stability analysis of two-class retrial systems with constant retrial rates and general service times. CoRR abs/2110.09840 (2021) - 2020
- [j70]Konstantin E. Avrachenkov, Andrei Bobu:
Cliques in high-dimensional random geometric graphs. Appl. Netw. Sci. 5(1): 92 (2020) - [c107]Yuzhou Chen, Yulia R. Gel, Konstantin Avrachenkov:
LFGCN: Levitating over Graphs with Levy Flights. ICDM 2020: 960-965 - [c106]Konstantin Avrachenkov, Maksim Mironov:
Cluster-size constrained network partitioning. ICPR 2020: 10058-10065 - [c105]Konstantin Avrachenkov, Kishor Patil, Gugan Thoppe:
Change Rate Estimation and Optimal Freshness in Web Page Crawling. VALUETOOLS 2020: 3-10 - [i58]Konstantin Avrachenkov, Kishor Patil, Gugan Thoppe:
Change Rate Estimation and Optimal Freshness in Web Page Crawling. CoRR abs/2004.02167 (2020) - [i57]Konstantin Avrachenkov, Vivek S. Borkar:
Whittle index based Q-learning for restless bandits with average reward. CoRR abs/2004.14427 (2020) - [i56]Konstantin Avrachenkov, Vivek S. Borkar, Sharayu Moharir, Suhail M. Shah:
Dynamic social learning under graph constraints. CoRR abs/2007.03983 (2020) - [i55]Konstantin Avrachenkov, Maximilien Dreveton:
Almost exact recovery in noisy semi-supervised learning. CoRR abs/2007.14717 (2020) - [i54]Konstantin Avrachenkov, Patrick Brown, Nelly Litvak:
Red Light Green Light Method for Solving Large Markov Chains. CoRR abs/2008.02710 (2020) - [i53]Konstantin Avrachenkov, Maximilien Dreveton, Lasse Leskelä:
Estimation of Static Community Memberships from Temporal Network Data. CoRR abs/2008.04790 (2020) - [i52]Yuzhou Chen, Yulia R. Gel, Konstantin Avrachenkov:
LFGCN: Levitating over Graphs with Levy Flights. CoRR abs/2009.02365 (2020) - [i51]Konstantin Avrachenkov, Kishor Patil, Gugan Thoppe:
Online Algorithms for Estimating Change Rates of Web Pages. CoRR abs/2009.08142 (2020) - [i50]Konstantin Avrachenkov, Andrei Bobu, Maximilien Dreveton:
Higher-Order Spectral Clustering for Geometric Graphs. CoRR abs/2009.11353 (2020)
2010 – 2019
- 2019
- [j69]Konstantin Avrachenkov, Vivek S. Borkar:
Metastability in Stochastic Replicator Dynamics. Dyn. Games Appl. 9(2): 366-390 (2019) - [j68]Konstantin Avrachenkov, Vladimir Ejov, Jerzy A. Filar, Amir Moghaddam:
Zero-Sum Stochastic Games over the Field of Real Algebraic Numbers. Dyn. Games Appl. 9(4): 1026-1041 (2019) - [j67]Konstantin Avrachenkov, Pavel Chebotarev, Dmytro Rubanov:
Similarities on graphs: Kernels versus proximity measures. Eur. J. Comb. 80: 47-56 (2019) - [c104]Mounia Hamidouche, Laura Cottatellucci, Konstantin Avrachenkov:
Spectral Analysis of the Adjacency Matrix of Random Geometric Graphs. Allerton 2019: 208-214 - [c103]Konstantin Avrachenkov, Vivek S. Borkar:
A learning algorithm for the Whittle index policy for scheduling web crawlers. Allerton 2019: 1001-1006 - [c102]Konstantin Avrachenkov, Andrei Bobu:
Cliques in High-Dimensional Random Geometric Graphs. COMPLEX NETWORKS (1) 2019: 591-600 - [c101]Konstantin Avrachenkov, Laura Cottatellucci, Mounia Hamidouche:
Eigenvalues and Spectral Dimension of Random Geometric Graphs in Thermodynamic Regime. COMPLEX NETWORKS (1) 2019: 965-975 - [c100]Konstantin Avrachenkov, Alexandra Borodina:
On the Escape Probability Estimation in Large Graphs. FRUCT 2019: 24-30 - [c99]Konstantin Avrachenkov, Jasper Goseling, Berksan Serbetci:
Distributed Cooperative Caching for Utility Maximization of VoD Systems. SPAWC 2019: 1-5 - [c98]Konstantin Avrachenkov, Maximilien Dreveton:
Almost Exact Recovery in Label Spreading. WAW 2019: 30-43 - [c97]Konstantin Avrachenkov, Jasper Goseling, Berksan Serbetci:
Distributed Cooperative Caching for VoD with Geographic Constraints. WiOpt 2019: 1-8 - [e3]Konstantin Avrachenkov, Longbo Huang, Jason R. Marden, Marceau Coupechoux, Anastasios Giovanidis:
Game Theory for Networks - 8th International EAI Conference, GameNets 2019, Paris, France, April 25-26, 2019, Proceedings. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 277, Springer 2019, ISBN 978-3-030-16988-6 [contents] - [e2]Konstantin Avrachenkov, Pawel Pralat, Nan Ye:
Algorithms and Models for the Web Graph - 16th International Workshop, WAW 2019, Brisbane, QLD, Australia, July 6-7, 2019, Proceedings. Lecture Notes in Computer Science 11631, Springer 2019, ISBN 978-3-030-25069-0 [contents] - [i49]Konstantin Avrachenkov, Jasper Goseling, Berksan Serbetci:
Distributed Cooperative Caching for VoD with Geographic Constraints. CoRR abs/1903.02406 (2019) - [i48]Konstantin Avrachenkov, Laura Cottatellucci, Mounia Hamidouche:
Eigenvalues and Spectral Dimension of Random Geometric Graphs in Thermodynamic Regime. CoRR abs/1910.08869 (2019) - [i47]Mounia Hamidouche, Laura Cottatellucci, Konstantin Avrachenkov:
Spectral Analysis of the Adjacency Matrix of Random Geometric Graphs. CoRR abs/1910.08871 (2019) - [i46]Mounia Hamidouche, Laura Cottatellucci, Konstantin Avrachenkov:
Spectral bounds of the regularized normalized Laplacian for random geometric graphs. CoRR abs/1910.08873 (2019) - 2018
- [j66]Zaid Allybokus, Konstantin Avrachenkov, Jeremie Leguay, Lorenzo Maggi:
Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software-Defined Networks. IEEE J. Sel. Areas Commun. 36(12): 2655-2666 (2018) - [j65]Konstantin Avrachenkov, Tejas Bodas:
On the equivalence between multiclass processor sharing and random order scheduling policies. SIGMETRICS Perform. Evaluation Rev. 45(4): 2-6 (2018) - [j64]Konstantin E. Avrachenkov, Vivek S. Borkar:
Whittle Index Policy for Crawling Ephemeral Content. IEEE Trans. Control. Netw. Syst. 5(1): 446-455 (2018) - [j63]Arun Kadavankandy, Konstantin Avrachenkov, Laura Cottatellucci, Rajesh Sundaresan:
The Power of Side-Information in Subgraph Detection. IEEE Trans. Signal Process. 66(7): 1905-1919 (2018) - [c96]Konstantin Avrachenkov, Alexei B. Piunovskiy, Yi Zhang:
Impulsive Control for G-AIMD Dynamics with Relaxed and Hard Constraints. CDC 2018: 880-887 - [c95]Konstantin Avrachenkov, Ilya Bogdanov:
Analysis of Relaxation Time in Random Walk with Jumps. WAW 2018: 70-82 - [i45]Konstantin Avrachenkov, Vivek S. Borkar:
Metastability in Stochastic Replicator Dynamics. CoRR abs/1801.02161 (2018) - [i44]Zaid Allybokus, Konstantin Avrachenkov, Jérémie Leguay, Lorenzo Maggi:
Lower Bounds for the Fair Resource Allocation Problem. CoRR abs/1802.02932 (2018) - [i43]Konstantin Avrachenkov, Alexei B. Piunovskiy, Yi Zhang:
Impulsive Control for G-AIMD Dynamics with Relaxed and Hard Constraints. CoRR abs/1803.07127 (2018) - [i42]Konstantin Avrachenkov, Ilya Bogdanov:
Analysis of Relaxation Time in Random Walk with Jumps. CoRR abs/1805.03260 (2018) - [i41]Konstantin Avrachenkov, Arun Kadavankandy, Nelly Litvak:
Mean Field Analysis of Personalized PageRank with Implications for Local Graph Clustering. CoRR abs/1806.07640 (2018) - [i40]Zaid Allybokus, Konstantin Avrachenkov, Jérémie Leguay, Lorenzo Maggi:
Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software Defined Networks. CoRR abs/1809.01050 (2018) - [i39]Xutong Liu, Yu-Zhen Janice Chen, John C. S. Lui, Konstantin Avrachenkov:
Graphlet Count Estimation via Convolutional Neural Networks. CoRR abs/1810.03078 (2018) - 2017
- [j62]Vladimir V. Mazalov, Anna N. Rettieva, Konstantin E. Avrachenkov:
Linear-quadratic discrete-time dynamic potential games. Autom. Remote. Control. 78(8): 1537-1544 (2017) - [j61]Konstantin Avrachenkov, Pavel Yu. Chebotarev, Alexey Mishenin:
Semi-supervised learning with regularized Laplacian. Optim. Methods Softw. 32(2): 222-236 (2017) - [j60]Konstantin Avrachenkov, Xinwei Bai, Jasper Goseling:
Optimization of caching devices with geometric constraints. Perform. Evaluation 113: 68-82 (2017) - [j59]Konstantin Avrachenkov, Jasper Goseling, Berksan Serbetci:
A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints. Proc. ACM Meas. Anal. Comput. Syst. 1(1): 27:1-27:25 (2017) - [j58]Zaid Allybokus, Konstantin Avrachenkov, Jérémie Leguay, Lorenzo Maggi:
Lower Bounds for the Fair Resource Allocation Problem. SIGMETRICS Perform. Evaluation Rev. 45(3): 167-173 (2017) - [c94]Konstantin E. Avrachenkov, Vivek S. Borkar, Sarath Pattathil:
Controlling G-AIMD by index policy. CDC 2017: 120-125 - [c93]Konstantin E. Avrachenkov, Aleksei Yu. Kondratev, Vladimir V. Mazalov:
Cooperative Game Theory Approaches for Network Partitioning. COCOON 2017: 591-602 - [c92]Sarah de Nigris, Esteban Bautista, Patrice Abry, Konstantin Avrachenkov, Paulo Gonçalves:
Fractional graph-based semi-supervised learning. EUSIPCO 2017: 356-360 - [c91]Arun Kadavankandy, Konstantin Avrachenkov, Laura Cottatellucci, Rajesh Sundaresan:
Belief propagation for subgraph detection with imperfect side-information. ISIT 2017: 1603-1607 - [c90]Konstantin Avrachenkov, Philippe Jacquet, Jithin K. Sreedharan:
Hamiltonian system approach to distributed spectral decomposition in networks. nDS 2017: 1-6 - [c89]Konstantin Avrachenkov, Jasper Goseling, Berksan Serbetci:
A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints. SIGMETRICS (Abstracts) 2017: 2 - [c88]Zaid Allybokus, Konstantin Avrachenkov, Jeremie Leguay, Lorenzo Maggi:
Real-Time Fair Resource Allocation in Distributed Software Defined Networks. ITC 2017: 19-27 - [c87]Konstantin Avrachenkov, Pavel Chebotarev, Dmytro Rubanov:
Kernels on Graphs as Proximity Measures. WAW 2017: 27-41 - [i38]Konstantin Avrachenkov, Tejas Bodas:
On the equivalence between multiclass PS-type scheduling policies. CoRR abs/1704.01722 (2017) - [i37]Konstantin Avrachenkov, Jasper Goseling, Berksan Serbetci:
A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints. CoRR abs/1704.04465 (2017) - [i36]Konstantin Avrachenkov, Aleksei Y. Kondratev, Vladimir V. Mazalov:
Cooperative Game Theory Approaches for Network Partitioning. CoRR abs/1707.03587 (2017) - [i35]Zaid Allybokus, Konstantin Avrachenkov, Jérémie Leguay, Lorenzo Maggi:
Real-Time Fair Resource Allocation in Distributed Software Defined Networks. CoRR abs/1711.09690 (2017) - 2016
- [j57]Konstantin Avrachenkov, Vikas Vikram Singh:
Stochastic coalitional better-response dynamics and stable equilibrium. Autom. Remote. Control. 77(12): 2227-2238 (2016) - [j56]Konstantin Avrachenkov, Ali Eshragh, Jerzy A. Filar:
On transition matrices of Markov chains corresponding to Hamiltonian cycles. Ann. Oper. Res. 243(1-2): 19-35 (2016) - [j55]Vladimir V. Mazalov, Konstantin Avrachenkov, L. I. Trukhina, Bulat T. Tsynguev:
Game-Theoretic Centrality Measures for Weighted Graphs. Fundam. Informaticae 145(3): 341-358 (2016) - [j54]Konstantin Avrachenkov, Jerzy A. Filar, Vladimir Gaitsgory, Andrew Stillman:
Singularly perturbed linear programs and Markov decision processes. Oper. Res. Lett. 44(3): 297-301 (2016) - [j53]Konstantin Avrachenkov, Evsey Morozov, Bart Steyaert:
Sufficient stability conditions for multi-class constant retrial rate systems. Queueing Syst. Theory Appl. 82(1-2): 149-171 (2016) - [c86]Konstantin Avrachenkov, Giovanni Neglia, Alina Tuholukova:
Subsampling for Chain-Referral Methods. ASMTA 2016: 17-31 - [c85]Arun Kadavankandy, Laura Cottatellucci, Konstantin Avrachenkov:
Characterization of L1-norm statistic for anomaly detection in Erdős Rényi graphs. CDC 2016: 4600-4605 - [c84]Konstantin Avrachenkov, Vivek S. Borkar, Arun Kadavankandy, Jithin Kazuthuveettil Sreedharan:
Comparison of Random Walk Based Techniques for Estimating Network Averages. CSoNet 2016: 27-38 - [c83]Konstantin Avrachenkov, Philippe Jacquet, Jithin K. Sreedharan:
Distributed spectral decomposition in networks by complex diffusion and quantum random walk. INFOCOM 2016: 1-9 - [c82]Konstantin Avrachenkov, Bruno F. Ribeiro, Jithin Kazuthuveettil Sreedharan:
Inference in OSNs via Lightweight Partial Crawls. SIGMETRICS 2016: 165-177 - [c81]Konstantin Avrachenkov, Vivek S. Borkar, Krishnakant V. Saboo:
Distributed and Asynchronous Methods for Semi-supervised Learning. WAW 2016: 34-46 - [c80]Konstantin Avrachenkov, Lenar Iskhakov, Maksim Mironov:
On Mixing in Pairwise Markov Random Fields with Application to Social Networks. WAW 2016: 127-139 - [i34]Konstantin Avrachenkov, Xinwei Bai, Jasper Goseling:
Optimization of Caching Devices with Geometric Constraints. CoRR abs/1602.03635 (2016) - [i33]Arun Kadavankandy, Konstantin Avrachenkov, Laura Cottatellucci, Rajesh Sundaresan:
Subgraph Detection with cues using Belief Propagation. CoRR abs/1611.04847 (2016) - [i32]Konstantin Avrachenkov, Lenar Iskhakov, Maksim Mironov:
On Mixing in Pairwise Markov Random Fields with Application to Social Networks. CoRR abs/1611.09189 (2016) - 2015
- [j52]Konstantin Avrachenkov, Jocelyne Elias, Fabio Martignon, Giovanni Neglia, Leon A. Petrosyan:
Cooperative network design: A Nash bargaining solution approach. Comput. Networks 83: 265-279 (2015) - [j51]Konstantin Avrachenkov, Oussama Habachi, Alexei B. Piunovskiy, Yi Zhang:
Infinite horizon optimal impulsive control with applications to Internet congestion control. Int. J. Control 88(4): 703-716 (2015) - [j50]Mahmoud El Chamie, Giovanni Neglia, Konstantin Avrachenkov:
Distributed Weight Selection in Consensus Protocols by Schatten Norm Minimization. IEEE Trans. Autom. Control. 60(5): 1350-1355 (2015) - [c79]Arun Kadavankandy, Laura Cottatellucci, Konstantin Avrachenkov:
Characterization of random matrix eigenvectors for stochastic block model. ACSSC 2015: 861-865 - [c78]Konstantin Avrachenkov, Vivek S. Borkar:
Whittle index policy for crawling ephemeral content. CDC 2015: 6755-6760 - [c77]Konstantin Avrachenkov, Vladimir V. Mazalov, Bulat T. Tsynguev:
Beta Current Flow Centrality for Weighted Networks. CSoNet 2015: 216-227 - [c76]Konstantin Avrachenkov, Evsey Morozov, Ruslana Nekrasova:
Optimal and Equilibrium Retrial Rates in Single-Server Multi-orbit Retrial Systems. MACOM 2015: 135-146 - [c75]Konstantin Avrachenkov, Arun Kadavankandy, Liudmila Ostroumova Prokhorenkova, Andrei M. Raigorodskii:
PageRank in Undirected Random Graphs. WAW 2015: 151-163 - [c74]Konstantin Avrachenkov, Laura Cottatellucci, Arun Kadavankandy:
Spectral properties of random matrices for stochastic block model. WiOpt 2015: 537-544 - [i31]Konstantin Avrachenkov, Alexei B. Piunovskiy, Yi Zhang:
Hitting with Restart: A Reason for Sisyphus Labour. CoRR abs/1503.08548 (2015) - [i30]Konstantin Avrachenkov, Vivek S. Borkar:
Whittle Index Policy for Crawling Ephemeral Content. CoRR abs/1503.08558 (2015) - [i29]Konstantin Avrachenkov, Vikas Vikram Singh:
Stochastic Coalitional Better-response Dynamics and Strong Nash Equilibrium. CoRR abs/1506.03311 (2015) - [i28]Konstantin Avrachenkov, Pavel Chebotarev, Alexey Mishenin:
Semi-supervised Learning with Regularized Laplacian. CoRR abs/1508.04906 (2015) - [i27]Konstantin Avrachenkov, Vivek S. Borkar, Krishnakant V. Saboo:
Parallel and Distributed Approaches for Graph Based Semi-supervised Learning. CoRR abs/1509.01349 (2015) - [i26]Konstantin Avrachenkov, Bruno F. Ribeiro, Jithin Kazuthuveettil Sreedharan:
Bayesian Inference of Online Social Network Statistics via Lightweight Random Walk Crawls. CoRR abs/1510.05407 (2015) - [i25]Arun Kadavankandy, Konstantin Avrachenkov, Liudmila Ostroumova Prokhorenkova, Andrei M. Raigorodskii:
PageRank in undirected random graphs. CoRR abs/1511.04925 (2015) - 2014
- [j49]Konstantin Avrachenkov, Evsey Morozov, Ruslana Nekrasova, Bart Steyaert:
Stability Analysis and Simulation of n-class retrial System with Constant retrial rates and Poisson inputs. Asia Pac. J. Oper. Res. 31(2) (2014) - [j48]Konstantin Avrachenkov, Laura Cottatellucci, Lorenzo Maggi:
Confidence Intervals for the Shapley-Shubik Power Index in Markovian Games. Dyn. Games Appl. 4(1): 10-31 (2014) - [j47]Konstantin Avrachenkov, Nelly Litvak, Marina Sokol, Don Towsley:
Quick Detection of Nodes with Large Degrees. Internet Math. 10(1-2): 1-19 (2014) - [j46]Konstantin Avrachenkov, Evsey Morozov:
Stability analysis of GI/GI/c/K retrial queue with constant retrial rate. Math. Methods Oper. Res. 79(3): 273-291 (2014) - [j45]Konstantin Avrachenkov, Philippe Nain, Uri Yechiali:
A retrial system with two input streams and two orbit queues. Queueing Syst. Theory Appl. 77(1): 1-31 (2014) - [c73]Konstantin Avrachenkov, Mahmoud El Chamie, Giovanni Neglia:
Graph clustering based on mixing time of random walks. ICC 2014: 4089-4094 - [c72]Konstantin Avrachenkov, Nelly Litvak, Liudmila Ostroumova Prokhorenkova, Eugenia Suyargulova:
Quick Detection of High-Degree Entities in Large Directed Networks. ICDM 2014: 20-29 - [c71]Konstantin Avrachenkov, Prithwish Basu, Giovanni Neglia, Bruno F. Ribeiro, Donald F. Towsley:
Pay few, influence most: Online myopic network covering. INFOCOM Workshops 2014: 813-818 - [c70]Eitan Altman, Konstantin Avrachenkov, Jasper Goseling:
Distributed storage in the plane. Networking 2014: 1-9 - [c69]Konstantin Avrachenkov, Natalia M. Markovich, Jithin Kazuthuveettil Sreedharan:
Distribution and Dependence of Extremes in Network Sampling Processes. SITIS 2014: 331-338 - [c68]Konstantin Avrachenkov, Remco van der Hofstad, Marina Sokol:
Personalized PageRank with Node-Dependent Restart. WAW 2014: 23-33 - [i24]Konstantin Avrachenkov, Remco van der Hofstad, Marina Sokol:
Personalized PageRank with Node-dependent Restart. CoRR abs/1408.0719 (2014) - [i23]Konstantin Avrachenkov, Natalia M. Markovich, Jithin Kazuthuveettil Sreedharan:
Distribution and Dependence of Extremes in Network Sampling Processes. CoRR abs/1408.2529 (2014) - [i22]Konstantin Avrachenkov, Nelly Litvak, Liudmila Ostroumova Prokhorenkova, Eugenia Suyargulova:
Quick Detection of High-degree Entities in Large Directed Networks. CoRR abs/1410.0571 (2014) - 2013
- [b1]Konstantin Avrachenkov, Jerzy A. Filar, Phil G. Howlett:
Analytic Perturbation Theory and Its Applications. SIAM 2013, ISBN 978-1-611973-13-6, pp. I-XII, 1-372 - [j44]Konstantin Avrachenkov, Urtzi Ayesta, Josu Doncel, Peter Jacko:
Congestion control of TCP flows in Internet routers by means of index policy. Comput. Networks 57(17): 3463-3478 (2013) - [j43]Konstantin Avrachenkov, Laura Cottatellucci, Lorenzo Maggi:
Cooperative Markov decision processes: time consistency, greedy players satisfaction, and cooperation maintenance. Int. J. Game Theory 42(1): 239-262 (2013) - [j42]Konstantin Avrachenkov, Alexey B. Piunovskiy, Yi Zhang:
Markov Processes with Restart. J. Appl. Probab. 50(4): 960-968 (2013) - [c67]Mahmoud El Chamie, Giovanni Neglia, Konstantin Avrachenkov:
Reducing communication overhead for average consensus. Networking 2013: 1-9 - [c66]Konstantin Avrachenkov, Paulo Gonçalves, Marina Sokol:
On the Choice of Kernel and Labelled Data in Semi-supervised Learning Methods. WAW 2013: 56-67 - [c65]Konstantin Avrachenkov, Nelly Litvak, Vasily Medyanikov, Marina Sokol:
Alpha Current Flow Betweenness Centrality. WAW 2013: 106-117 - [c64]Konstantin Avrachenkov, Laura Cottatellucci, Lorenzo Maggi:
Dynamic rate allocation in Markovian quasi-static multiple access channels: A game theoretic approach. WiOpt 2013: 162-169 - [i21]Konstantin Avrachenkov, Nelly Litvak, Vasily Medyanikov, Marina Sokol:
Alpha current flow betweenness centrality. CoRR abs/1308.2591 (2013) - [i20]Eitan Altman, Konstantin Avrachenkov, Jasper Goseling:
Coding for Caches in the Plane. CoRR abs/1309.0604 (2013) - [i19]Konstantin Avrachenkov, Koen De Turck, Dieter Fiems, Balakrishna J. Prabhu:
Information dissemination processes in directed social networks. CoRR abs/1311.2023 (2013) - [i18]Konstantin Avrachenkov, Oussama Habachi, Alexei B. Piunovskiy, Yi Zhang:
Infinite Horizon Optimal Impulsive Control Theory with Application to Internet Congestion Control. CoRR abs/1311.7093 (2013) - 2012
- [j41]Eitan Altman, Konstantin Avrachenkov, Sreenath Ramanath:
Multiscale fairness and its application to resource allocation in wireless networks. Comput. Commun. 35(7): 820-828 (2012) - [j40]Konstantin Avrachenkov, Regina Sandra Burachik, Jerzy A. Filar, Vladimir Gaitsgory:
Constraint augmentation in pseudo-singularly perturbed linear programs. Math. Program. 132(1-2): 179-208 (2012) - [j39]Konstantin Avrachenkov, Laura Cottatellucci, Lorenzo Maggi:
Algorithms for uniform optimal strategies in two-player zero-sum stochastic games with perfect information. Oper. Res. Lett. 40(1): 56-60 (2012) - [j38]Konstantin Avrachenkov, Urtzi Ayesta, Josu Doncel, Peter Jacko:
Optimal congestion control of TCP flows for internet routers. SIGMETRICS Perform. Evaluation Rev. 40(3): 62-64 (2012) - [c63]Konstantin Avrachenkov, Laura Cottatellucci, Lorenzo Maggi:
Slow fading channel selection: A restless multi-armed bandit formulation. ISWCS 2012: 1083-1087 - [c62]Konstantin Avrachenkov, Paulo Gonçalves, Arnaud Legout, Marina Sokol:
Classification of content and users in BitTorrent by semi-supervised learning methods. IWCMC 2012: 625-630 - [c61]Konstantin Avrachenkov, Peter Jacko:
CCN interest forwarding strategy as Multi-Armed Bandit model with delays. NetGCooP 2012: 38-43 - [c60]Marina Sokol, Konstantin Avrachenkov, Paulo Gonçalves, Alexey Mishenin:
Generalized Optimization Framework for Graph-based Semi-supervised Learning. SDM 2012: 966-974 - [c59]Konstantin Avrachenkov, Nelly Litvak, Marina Sokol, Don Towsley:
Quick Detection of Nodes with Large Degrees. WAW 2012: 54-65 - [i17]Konstantin Avrachenkov, Alexander N. Dudin, Valentina I. Klimenok, Philippe Nain, Olga V. Semenova:
Optimal Threshold Control by the Robots of Web Search Engines with Obsolescence of Documents. CoRR abs/1201.4150 (2012) - [i16]Konstantin Avrachenkov, Nelly Litvak, Marina Sokol, Don Towsley:
Quick Detection of Nodes with Large Degrees. CoRR abs/1202.3261 (2012) - [i15]Konstantin Avrachenkov, Peter Jacko:
CCN Interest Forwarding Strategy as Multi-Armed Bandit Model with Delays. CoRR abs/1204.0416 (2012) - [i14]Konstantin Avrachenkov, Philippe Nain, Uri Yechiali:
A retrial system with two input streams and two orbit queues. CoRR abs/1206.5673 (2012) - [i13]Konstantin Avrachenkov, Alexei B. Piunovskiy, Yi Zhang:
Markov Processes with Restart. CoRR abs/1206.5674 (2012) - [i12]Josu Doncel, Urtzi Ayesta, Konstantin Avrachenkov, Peter Jacko:
Congestion Control of TCP Flows in Internet Routers by Means of Index Policy. CoRR abs/1209.3638 (2012) - [i11]Konstantin Avrachenkov, Prithwish Basu, Giovanni Neglia, Bruno F. Ribeiro, Don Towsley:
Online Myopic Network Covering. CoRR abs/1212.5035 (2012) - 2011
- [j37]Jocelyne Elias, Fabio Martignon, Konstantin Avrachenkov, Giovanni Neglia:
A game theoretic analysis of network design with socially-aware users. Comput. Networks 55(1): 106-118 (2011) - [j36]Konstantin Avrachenkov, Alexander N. Dudin, Valentina I. Klimenok, Philippe Nain, Olga V. Semenova:
Optimal threshold control by the robots of web search engines with obsolescence of documents. Comput. Networks 55(8): 1880-1893 (2011) - [j35]Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
Jamming in Wireless Networks Under Uncertainty. Mob. Networks Appl. 16(2): 246-254 (2011) - [j34]Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
Closed form solutions for water-filling problems in optimization and game frameworks. Telecommun. Syst. 47(1-2): 153-164 (2011) - [c58]Konstantin Avrachenkov, Mahmoud El Chamie, Giovanni Neglia:
A local average consensus algorithm for wireless sensor networks. DCOSS 2011: 1-6 - [c57]Andrey Garnaev, Yezekael Hayel, Eitan Altman, Konstantin Avrachenkov:
Jamming Game in a Dynamic Slotted ALOHA Network. GAMENETS 2011: 429-443 - [c56]Xiao Lei, Laura Cottatellucci, Konstantin Avrachenkov:
Equilibriums in slow fading interfering channels with partial knowledge of the channels. INFOCOM 2011: 481-485 - [c55]Imed Lassoued, Amir Krifa, Chadi Barakat, Konstantin Avrachenkov:
Network-wide monitoring through self-configuring adaptive system. INFOCOM 2011: 1826-1834 - [c54]Eitan Altman, Konstantin Avrachenkov, Sreenath Ramanath:
Multiscale Fairness and Its Application to Resource Allocation in Wireless Networks. Networking (2) 2011: 225-237 - [c53]Konstantin Avrachenkov, Jocelyne Elias, Fabio Martignon, Giovanni Neglia, Leon A. Petrosyan:
A Nash Bargaining Solution for Cooperative Network Formation Games. Networking (1) 2011: 307-318 - [c52]Andrey Garnaev, Yezekael Hayel, Konstantin Avrachenkov, Eitan Altman:
Throughput and QoS pricing in wireless communication. VALUETOOLS 2011: 362-371 - [c51]Konstantin Avrachenkov, Ali Eshragh, Jerzy A. Filar:
Hamiltonian transition matrices. VALUETOOLS 2011: 463-466 - [c50]Konstantin Avrachenkov, Nelly Litvak, Danil Nemirovsky, Elena Smirnova, Marina Sokol:
Quick Detection of Top-k Personalized PageRank Lists. WAW 2011: 50-61 - [c49]Sreenath Ramanath, Eitan Altman, Konstantin Avrachenkov:
A heterogeneous approach to fair resource allocation and its application in femtocell networks. WiOpt 2011: 440-444 - [i10]Konstantin Avrachenkov, Paulo Gonçalves, Alexey Mishenin, Marina Sokol:
Generalized Optimization Framework for Graph-based Semi-supervised Learning. CoRR abs/1110.4278 (2011) - 2010
- [j33]Yi Zhang, Alexei B. Piunovskiy, Urtzi Ayesta, Konstantin Avrachenkov:
Convergence of trajectories and optimal buffer sizing for MIMD congestion control. Comput. Commun. 33(2): 149-159 (2010) - [j32]Konstantin Avrachenkov, Uri Yechiali:
On tandem blocking queues with a common retrial queue. Comput. Oper. Res. 37(7): 1174-1180 (2010) - [j31]Konstantin Avrachenkov, Vivek S. Borkar, Danil Nemirovsky:
Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph. J. Comput. Appl. Math. 234(11): 3075-3090 (2010) - [j30]Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
Fair resource allocation in wireless networks in the presence of a jammer. Perform. Evaluation 67(4): 338-349 (2010) - [j29]Konstantin Avrachenkov, Urtzi Ayesta, Alexei B. Piunovskiy:
Convergence of trajectories and optimal buffer sizing for AIMD congestion control. Perform. Evaluation 67(7): 501-527 (2010) - [c48]Elena Smirnova, Konstantin Avrachenkov, Brigitte Trousse:
Using Web Graph Structure for Person Name Disambiguation. CLEF (Notebook Papers/LABs/Workshops) 2010 - [c47]Jocelyne Elias, Fabio Martignon, Konstantin Avrachenkov, Giovanni Neglia:
Socially-Aware Network Design Games. INFOCOM 2010: 41-45 - [c46]Konstantin Avrachenkov, Alexander N. Dudin, Valentina I. Klimenok:
Retrial Queueing Model MMAP/M2/1 with Two Orbits. MACOM 2010: 107-118 - [c45]Damiano Carra, Konstantin Avrachenkov, Sara Alouf, Alberto Blanc, Philippe Nain, Georg Post:
Passive Online RTT Estimation for Flow-Aware Routers Using One-Way Traffic. Networking 2010: 109-121 - [c44]Konstantin Avrachenkov, Bruno F. Ribeiro, Donald F. Towsley:
Improving Random Walk Estimation Accuracy with Uniform Restarts. WAW 2010: 98-109 - [c43]Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
Taxation for green communication. WiOpt 2010: 108-112 - [c42]Xiao Lei, Konstantin Avrachenkov, Laura Cottatellucci, Andrey Garnaev:
Competitive Unlicensed Spectrum Sharing with Partial Information on Slow Fading Channels. WWIC 2010: 158-169 - [i9]Konstantin Avrachenkov, Evsey Morozov:
Stability Analysis of GI/G/c/K Retrial Queue with Constant Retrial Rate. CoRR abs/1007.1548 (2010) - [i8]Konstantin Avrachenkov, Nelly Litvak, Danil Nemirovsky, Elena Smirnova, Marina Sokol:
Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation. CoRR abs/1008.3775 (2010) - [i7]Mark Allman, Konstantin Avrachenkov, Urtzi Ayesta, Josh Blanton, Per Hurtig:
Early Retransmit for TCP and Stream Control Transmission Protocol (SCTP). RFC 5827: 1-15 (2010)
2000 – 2009
- 2009
- [j28]Konstantin Avrachenkov, Patrick Brown, Natalia Osipova:
Optimal choice of threshold in Two Level Processor Sharing. Ann. Oper. Res. 170(1): 21-39 (2009) - [j27]Konstantin Avrachenkov, Debora Donato, Nelly Litvak:
Special Issue on Algorithms and Models for the Web Graph. Internet Math. 6(3): 255-256 (2009) - [j26]Eitan Altman, Konstantin Avrachenkov, Ishai Menache, Gregory B. Miller, Balakrishna J. Prabhu, Adam Shwartz:
Dynamic Discrete Power Control in Cellular Networks. IEEE Trans. Autom. Control. 54(10): 2328-2340 (2009) - [c41]Alberto Blanc, Denis Collange, Konstantin Avrachenkov:
Modelling an Isolated Compound TCP Connection. AICT 2009: 435-440 - [c40]Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
Jamming in wireless networks: The case of several jammers. GAMENETS 2009: 585-592 - [c39]Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
Alpha-Fair Resource Allocation under Incomplete Information and Presence of a Jammer. NET-COOP 2009: 219-233 - [c38]Alberto Blanc, Konstantin Avrachenkov, Denis Collange, Giovanni Neglia:
Compound TCP with Random Losses. Networking 2009: 482-494 - [c37]Eitan Altman, Konstantin Avrachenkov, Laura Cottatellucci, Mérouane Debbah, Gaoning He, Alberto Suárez:
Operating point selection in multiple access rate regions. ITC 2009: 1-8 - [c36]Natalia Osipova, Urtzi Ayesta, Konstantin Avrachenkov:
Optimal policy for multi-class scheduling in a single server queue. ITC 2009: 1-8 - [c35]Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
Jamming game with incomplete information about the jammer. VALUETOOLS 2009: 65 - [c34]Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
Jamming in wireless networks under uncertainty. WiOpt 2009: 1-7 - [e1]Konstantin Avrachenkov, Debora Donato, Nelly Litvak:
Algorithms and Models for the Web-Graph, 6th International Workshop, WAW 2009, Barcelona, Spain, February 12-13, 2009. Proceedings. Lecture Notes in Computer Science 5427, Springer 2009, ISBN 978-3-540-95994-6 [contents] - 2008
- [j25]Konstantin Avrachenkov, Nelly Litvak, Kim Son Pham:
A Singular Perturbation Approach for Choosing the PageRank Damping Factor. Internet Math. 5(1): 47-69 (2008) - [j24]Eitan Altman, Konstantin Avrachenkov, Nicolas Bonneau, Mérouane Debbah, Rachid El Azouzi, Daniel Sadoc Menasché:
Constrained cost-coupled stochastic games with independent state processes. Oper. Res. Lett. 36(2): 160-164 (2008) - [c33]Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
Generalized a-fair resource allocation in wireless networks. CDC 2008: 2414-2419 - [c32]Natalia Osipova, Alberto Blanc, Konstantin Avrachenkov:
Improving TCP fairness with the MarkMax policy. ICT 2008: 1-7 - [c31]Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
Closed Form Solutions for Symmetric Water Filling Games. INFOCOM 2008: 673-681 - [c30]Alberto Blanc, Denis Collange, Konstantin Avrachenkov:
Oscillations of the Sending Window in Compound TCP. NET-COOP 2008: 95-102 - [c29]Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
Transmission Power Control Game with SINR as Objective Function. NET-COOP 2008: 112-120 - [c28]Konstantin Avrachenkov, Vladimir Dobrynin, Danil Nemirovsky, Kim Son Pham, Elena Smirnova:
Pagerank based clustering of hypertext document collections. SIGIR 2008: 873-874 - [c27]Danil Nemirovsky, Konstantin Avrachenkov:
Weighted PageRank: Cluster-Related Weights. TREC 2008 - [c26]Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
Fair resource allocation in wireless networks in the presence of a jammer. VALUETOOLS 2008: 33 - 2007
- [j23]Konstantin Avrachenkov, Dmitri Lebedev:
PageRank of Scale-Free Growing Networks. Internet Math. 3(2): 207-231 (2007) - [j22]Konstantin Avrachenkov, Nelly Litvak, Danil Nemirovsky, Natalia Osipova:
Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient. SIAM J. Numer. Anal. 45(2): 890-904 (2007) - [c25]Eitan Altaian, Konstantin Avrachenkov, Nicolas Bonneau, Mérouane Debbah, Rachid El Azouzi, Daniel S. Menasché:
Constrained Stochastic Games in Wireless Networks. GLOBECOM 2007: 315-320 - [c24]Eitan Altman, Konstantin Avrachenkov, Gregory B. Miller, Balakrishna J. Prabhu:
Discrete Power Control: Cooperative and Non-Cooperative Optimization. INFOCOM 2007: 37-45 - [c23]Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
A Jamming Game in Wireless Networks with Transmission Cost. NET-COOP 2007: 1-12 - [c22]Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
Closed form solutions for water-filling problems in optimization and game frameworks. VALUETOOLS 2007: 5 - [c21]Konstantin Avrachenkov, Danil Nemirovsky, Kim Son Pham:
A survey on distributed approaches to graph based reputation measures. VALUETOOLS 2007: 82 - [c20]Konstantin Avrachenkov, Nelly Litvak, Kim Son Pham:
Distribution of PageRank Mass Among Principle Components of the Web. WAW 2007: 16-28 - [c19]Roman Dunaytsev, Konstantin Avrachenkov, Yevgeni Koucheryavy, Jarmo Harju:
An Analytical Comparison of the Slow-but-Steady and Impatient Variants of TCP New Reno. WWIC 2007: 30-42 - [i6]Konstantin Avrachenkov, Patrick Brown, Natalia Osipova:
Optimal Choice of Threshold in Two Level Processor Sharing. CoRR abs/0706.1563 (2007) - [i5]Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev:
Closed form solutions for symmetric water filling games. CoRR abs/0707.3936 (2007) - [i4]Konstantin Avrachenkov, Vivek S. Borkar, Danil Nemirovsky:
Quasi-stationary distributions as centrality measures of reducible graphs. CoRR abs/0708.0522 (2007) - [i3]Konstantin Avrachenkov, Nelly Litvak, Kim Son Pham:
Distribution of PageRank Mass Among Principle Components of the Web. CoRR abs/0709.2016 (2007) - [i2]Konstantin Avrachenkov, Urtzi Ayesta, Alexei B. Piunovskiy:
Convergence and Optimal Buffer Sizing for Window Based AIMD Congestion Control. CoRR abs/cs/0703063 (2007) - [i1]Eitan Altman, Konstantin Avrachenkov, Nicolas Bonneau, Mérouane Debbah, Rachid El Azouzi, Daniel Sadoc Menasché:
Constrained Cost-Coupled Stochastic Games with Independent State Processes. CoRR abs/cs/0703099 (2007) - 2006
- [j21]Konstantin Avrachenkov:
Discussion on: "A Gradient-based Repetitive Control Algorithm Combining ILC and Pole Placement". Eur. J. Control 12(3): 293-295 (2006) - [j20]Eitan Altman, Konstantin Avrachenkov, Urtzi Ayesta:
A survey on discriminatory processor sharing. Queueing Syst. Theory Appl. 53(1-2): 53-63 (2006) - [c18]Konstantin Avrachenkov, Luke Finlay, Vladimir Gaitsgory:
Analysis of TCP-AQM Interaction Via Periodic Optimization and Linear Programming: The Case of Sigmoidal Utility Function. NEW2AN 2006: 517-529 - [c17]Konstantin Avrachenkov, Danil Nemirovsky, Natalia Osipova:
Web graph analyzer tool. VALUETOOLS 2006: 54 - 2005
- [j19]Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, Parijat Dube:
Performance analysis of AIMD mechanisms over a multi-state Markovian path. Comput. Networks 47(3): 307-326 (2005) - [j18]Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, Arzad Alam Kherani, B. J. Prabhu:
Analysis of MIMD congestion control algorithm for high speed networks. Comput. Networks 48(6): 972-989 (2005) - [j17]Eitan Altman, Konstantin Avrachenkov, Richard Marquez, Gregory B. Miller:
Zero-sum constrained stochastic games with independent state processes. Math. Methods Oper. Res. 62(3): 375-386 (2005) - [j16]Konstantin Avrachenkov, Nikita O. Vilchevsky, Georgy L. Shevlyakov:
Priority queueing with finite buffer size and randomized push-out mechanism. Perform. Evaluation 61(1): 1-16 (2005) - [j15]Boris M. Miller, Konstantin Avrachenkov, Karen V. Stepanyan, Gregory B. Miller:
Flow Control as a Stochastic Optimal Control Problem with Incomplete Information. Probl. Inf. Transm. 41(2): 150-170 (2005) - [j14]Konstantin Avrachenkov, Urtzi Ayesta, Patrick Brown:
Batch Arrival Processor-Sharing with Application to Multi-Level Processor-Sharing Scheduling. Queueing Syst. Theory Appl. 50(4): 459-480 (2005) - [j13]Arzad Alam Kherani, B. J. Prabhu, Konstantin Avrachenkov, Eitan Altman:
Comparative Study of Different Adaptive Window Protocols. Telecommun. Syst. 30(4): 321-350 (2005) - [j12]Eitan Altman, Konstantin Avrachenkov, B. J. Prabhu:
Fairness in MIMD Congestion Control Algorithms. Telecommun. Syst. 30(4): 387-415 (2005) - [j11]Eitan Altman, Konstantin Avrachenkov, Chadi Barakat:
A stochastic model of TCP/IP with stationary random losses. IEEE/ACM Trans. Netw. 13(2): 356-369 (2005) - [c16]Konstantin Avrachenkov, Urtzi Ayesta, Alexei B. Piunovskiy:
Optimal choice of the buffer size in the Internet routers. CDC/ECC 2005: 1143-1148 - [c15]Konstantin Avrachenkov, Urtzi Ayesta, Patrick Brown, R. Núñez Queija:
Discriminatory processor sharing revisited. INFOCOM 2005: 784-795 - [c14]Eitan Altman, Konstantin Avrachenkov, Arzad Alam Kherani, B. J. Prabhu:
Performance analysis and stochastic stability of congestion control protocols. INFOCOM 2005: 1316-1327 - [c13]Boris M. Miller, Konstantin Avrachenkov, Karen V. Stepanyan, Gregory B. Miller:
Flow control as stochastic optimal control problem with incomplete information. INFOCOM 2005: 1328-1337 - [c12]Eitan Altman, Konstantin Avrachenkov, B. J. Prabhu:
Fairness in MIMD congestion control algorithms. INFOCOM 2005: 1350-1361 - 2004
- [j10]Sven Östring, Konstantin Avrachenkov, Jon Crowcroft, Anthony Ephremides:
Guest Editor's Introduction. Mob. Networks Appl. 9(6): 555-556 (2004) - [c11]Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, Arzad Alam Kherani, B. J. Prabhu:
Analysis of Scalable TCP. HSNMC 2004: 51-62 - [c10]Konstantin Avrachenkov, Wojciech Paszke:
State-Dependent Delay System Model for Congestion Control. ICINCO (3) 2004: 276-281 - [c9]Konstantin Avrachenkov, Urtzi Ayesta, Patrick Brown, Eeva Nyberg:
Differentiation Between Short and Long TCP Flows: Predictability of the Response Time. INFOCOM 2004: 762-773 - 2003
- [c8]Phil G. Howlett, Vladimir Ejov, Konstantin Avrachenkov:
Inversion of perturbed linear operators that are singular at the origin. CDC 2003: 5628-5631 - [c7]Konstantin Avrachenkov, Nikita O. Vilchevsky, Georgy L. Shevlyakov:
Priority queueing with finite buffer size and randomized push-out mechanism. SIGMETRICS 2003: 324-325 - 2002
- [j9]Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, R. Núñez Queija:
State-dependent M/G/1 type queueing analysis for congestion control in data networks. Comput. Networks 39(6): 789-808 (2002) - [j8]Konstantin Avrachenkov, Elie Sanchez:
Fuzzy Markov Chains and Decision-Making. Fuzzy Optim. Decis. Mak. 1(2): 143-159 (2002) - [j7]Konstantin Avrachenkov, Homayoon S. M. Beigi, Richard W. Longman:
Updating Procedures For Iterative Learning Control In Hilbert Space. Intell. Autom. Soft Comput. 8(2): 183-189 (2002) - [j6]Jerzy A. Filar, Eitan Altman, Konstantin Avrachenkov:
An asymptotic simplex method for singularly perturbed linear programs. Oper. Res. Lett. 30(5): 295-307 (2002) - [j5]Konstantin Avrachenkov, Jean B. Lasserre:
Analytic perturbation of Sylvester matrix equations. IEEE Trans. Autom. Control. 47(7): 1116-1119 (2002) - [c6]Eitan Altman, Konstantin Avrachenkov, Chadi Barakat:
TCP Network Calculus: The case of large delay-bandwidth product. INFOCOM 2002: 417-426 - [c5]Nidhi Hegde, Konstantin Avrachenkov:
Service Differentiation and Guarantees for TCP-based Elastic Traffic. QofIS 2002: 159-168 - 2001
- [j4]Konstantin Avrachenkov, Moshe Haviv, Phil G. Howlett:
Inversion of Analytic Matrix Functions That are Singular at the Origin. SIAM J. Matrix Anal. Appl. 22(4): 1175-1189 (2001) - [j3]Jean B. Lasserre, Konstantin Avrachenkov:
The Multi-Dimensional Version of ∫b a xp dx. Am. Math. Mon. 108(2): 151-154 (2001) - [c4]Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, R. Núñez Queija:
State-dependent M/G/1 Type Queueing Analysis for Congestion Control in Data Networks. INFOCOM 2001: 1350-1359 - 2000
- [j2]Eitan Altman, Konstantin Avrachenkov, Chadi Barakat:
TCP in presence of bursty losses. Perform. Evaluation 42(2-3): 129-147 (2000) - [c3]Konstantin E. Avrachenkov, Jean B. Lasserre:
Analytic perturbation of Sylvester and Lyapunov matrix equations. CDC 2000: 1968-1973 - [c2]Eitan Altman, Konstantin Avrachenkov, Chadi Barakat:
A stochastic model of TCP/IP with stationary random. SIGCOMM 2000: 231-242 - [c1]Eitan Altman, Konstantin Avrachenkov, Chadi Barakat:
TCP in presence of bursty losses. SIGMETRICS 2000: 124-133
1990 – 1999
- 1999
- [j1]Eitan Altman, Konstantin Avrachenkov, Jerzy A. Filar:
Asymptotic linear programming and policy improvement for singularly perturbed Markov decision processes. Math. Methods Oper. Res. 49(1): 97-109 (1999)
Coauthor Index
Alexei B. Piunovskiy
aka: Alexey B. Piunovskiy
aka: Alexey B. Piunovskiy
Jithin Kazuthuveettil Sreedharan
aka: Jithin K. Sreedharan
aka: Jithin K. Sreedharan
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-11-07 21:29 CET 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:
