Nelly Litvak

Publications

• Routing in queues with delayed information
• A survey on performance analysis of warehouse carousel systems
• Order picking in carousel systems under the nearest item heuristic
• On a class of order pick strategies in paternosters
• The travel time in carousel systems under the nearest item heuristic
• Collecting n items randomly located on a circle
• The travel time in carousel systems under the nearest item heuristic
• On a class of order pick strategies in paternosters
• Order picking in carousel systems under the nearest item heuristic
• Routing in queues with delayed information
• Degree-degree correlations in random graphs with heavy-tailed degrees
• The nearest item heuristic for carousel systems
• Some peculiarities of exponential random variables
• Some peculiarities of exponential random variables
• A survey on performance analysis of warehouse carousel systems
• A survey on performance analysis of warehouse carousel systems
• On the minimal travel time needed to collect n items on a circle
• Increasing detection performance of surveillance sensor networks
• Uncovering disassortativity in large scale-free networks
• Degree-degree correlations in random graphs with heavy-tailed degrees
• Predicting the long-term citation impact of recent publications
• Predicting the long-term citation impact of recent publications
• Algorithms and models for the Web graph : 12th international workshop, WAW 2015, Eindhoven, The Netherlands, December 10-11, 2015 : proceedings
• Fascinating random networks
• Queuing network models for panel sizing in oncology
• Average nearest neighbor degrees in scale-free networks
• Mean field analysis of Personalized PageRank with implications for local graph clustering
• Designing cyclic appointment schedules for outpatient clinics with scheduled and unscheduled patient arrivals
• ORchestra: an online reference database of OR/MS literature in health care
• Learning clusters through information diffusion
• Phase transitions for scaling of structural correlations in directed networks
• Degree-degree dependencies in directed networks with heavy-tailed degrees
• Limit theorems for assortativity and clustering in null models for scale-free networks
• Upper bounds for number of removed edges in the erased configuration model
• Convergence of rank based degree-degree correlations in random directed networks
• Local weak convergence for pagerank
• Trade-offs between mobility restrictions and transmission of SARS-CoV-2
• The role of inter-regional mobility in forecasting SARS-CoV-2 transmission
• Red Light Green Light Method for Solving Large Markov Chains
• No exam
• Look back, look around
• New ways of solving large Markov chains
• The Hyperspherical Geometry of Community Detection
• Conceptualizing the Sample Mean
• Learning the mechanisms of network growth
• Fairness Rising from the Ranks
• The prior knowledge problem
• How students learn
• Correcting for Granularity Bias in Modularity-Based Community Detection Methods
• The projection method
• Mathematics for Big Data