Proc. ACM Meas. Anal. Comput. Syst 2019

35 papers

Top Research Directions

The 15 research directions with Proc. ACM Meas. Anal. Comput. Syst 2019 papers, ranked by paper count, next to 2018. Share is the fraction of the edition’s papers in the direction.

#Direction20192018Share 2019Share 20182018 rank
1Asymmetric Cost Optimization for Safety Critical Machine Learning102.9%0.0%—
2Fundamental Limits of Byzantine Robust Distributed Learning102.9%0.0%—
3Generalizing Network Algorithms to Arbitrary Topologies102.9%0.0%—
4How Initial Bias Drives Fast Distributed Consensus102.9%0.0%—
5How Network Topology Governs Decentralized Learning Convergence102.9%0.0%—
6Landscape Inheritance via Uniform Gradient Convergence102.9%0.0%—
7Learning Augmented Online Algorithms102.9%0.0%—
8Moving Beyond Binary Classification Frameworks102.9%0.0%—
9Multi-Agent Decision Making with Bounded Memory102.9%0.0%—
10Non-Linear Demand Modeling for Dynamic Pricing102.9%0.0%—
11Online Allocation of Reusable Resources102.9%0.0%—
12Randomization vs Determinism in Online Competitive Analysis102.9%0.0%—
13Regularizing Federated Learning Under Extreme Local Data Scarcity102.9%0.0%—
14Robust Geometric Aggregation in Distributed Learning102.9%0.0%—
15Scaling Personalized PageRank for Massive Graphs102.9%0.0%—

Download all directions as CSV

Institutions

Institutions credited by Proc. ACM Meas. Anal. Comput. Syst 2019 papers: a paper credits every institution named in its affiliations, once. 26 institutions share 15 credited papers.

#InstitutionPapersShare20182018 rank
1Massachusetts Institute of Technology 320.0%22
2Carnegie Mellon University 213.3%23
3Northwestern University 213.3%0—
4Apple (United States) 16.7%0—
5Arizona State University 16.7%0—
6California Institute of Technology 16.7%0—
7Carnegie Mellon University Qatar 16.7%0—
8CentraleSupélec 16.7%0—
9Chinese University of Hong Kong 16.7%0—
10Columbia University 16.7%0—
11Cornell University 16.7%19
12Duke University 16.7%0—
13Florida Institute of Technology 16.7%0—
14Georgia Institute of Technology 16.7%0—
15North Carolina State University 16.7%0—
16Oracle (United States) 16.7%0—
17Orange (France) 16.7%0—
18Princeton University 16.7%0—
19The Ohio State University 16.7%21
20The University of Texas at Austin 16.7%0—
21University of Bristol 16.7%0—
22University of Florida 16.7%0—
23University of Hawaiʻi at Mānoa 16.7%0—
24University of Illinois Urbana-Champaign 16.7%16
25University of Vienna 16.7%0—
26École Polytechnique Fédérale de Lausanne 16.7%0—

Download all institutions as CSV

About this data

Papers. Proc. ACM Meas. Anal. Comput. Syst 2019 lists 35 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.

Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers. Comparisons with 2018 use shares, since the edition went from 20 to 35 papers.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 15 of 35 papers (42.9%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.

Data. Counts come from Lacuna’s data build of 2026-11-19 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “Proc. ACM Meas. Anal. Comput. Syst 2019”, https://lacuna.tiptreesystems.com/venue/proc-acm-meas-anal-comput-syst/2019.

Top Authors

AuthorPapers
Adam Wierman2
Atilla Eryilmaz2
Daniel Cullina2
Lili Su2
Negar Kiyavash2
Vijay G Subramanian2
Abishek Sankararaman1
Alan Liu1
Ankur Mallick1
Ayalvadi Ganesh1
Christina Yu1
Chul-Ho Lee1
Chuming Li1
Constantine Caramanis1
Devavrat Shah1
Do Young Eun1
Ermin Wei1
Ganesh Palanikumar1
Gauri Joshi1
Gil Einziger1

Impactful Papers

Papers from Proc. ACM Meas. Anal. Comput. Syst 2019 that shaped research clusters.

Foundational

Influential

Papers

Title
Achieving Efficient Routing in Reconfigurable DCNs
Adaptive Discretization for Episodic Reinforcement Learning in Metric Spaces
A Distributed Algorithm to Calculate Max-Min Fair Rates Without Per-Flow State
Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdos-Rényi Graphs
Analyzing Location-Based Advertising for Vehicle Service Providers Using Effective Resistances
App in the Middle: Demystify Application Virtualization in Android and its Security Threats
Architecture-Aware Approximate Computing
A Structural Result for Personalized PageRank and its Algorithmic Consequences
A TTL-based Approach for Data Aggregation in Geo-distributed Streaming Analytics
Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory
Competitive Online Optimization under Inventory Constraints
Computationally Efficient Estimation of the Spectral Gap of a Markov Chain
Demystifying Complex Workload-DRAM Interactions: An Experimental Study
Efficient Distributed Workload (Re-)Embedding
Forecasting with Alternative Data
Fundamental Limits of Approximate Gradient Coding
Generalized Sketch Families for Network Traffic Measurement
I Know What You Did Last Summer: Network Monitoring using Interval Queries
Learning Graphs from Noisy Epidemic Cascades
Learning to Control Renewal Processes with Bandit Feedback
Logarithmic Communication for Distributed Optimization in Multi-Agent Systems
Mean Field Analysis of Join-Below-Threshold Load Balancing for Resource Sharing Servers
mRSC: Multi-dimensional Robust Synthetic Control
Network Resilience Assessment via QoS Degradation Metrics: An Algorithmic Approach
Non-Markovian Monte Carlo on Directed Graphs
On the Bottleneck Structure of Congestion-Controlled Networks
On the Value of Look-Ahead in Competitive Online Convex Optimization
Partial Recovery of Erdðs-Rényi Graph Alignment via k-Core Alignment
Proactive Caching for Low Access-Delay Services under Uncertain Predictions
QuickStop: A Markov Optimal Stopping Approach for Quickest Misinformation Detection
Random Walk Based Sampling for Load Balancing in Multi-Server Systems
Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication
Securing Distributed Gradient Descent in High Dimensional Statistical Learning
Social Learning in Multi Agent Multi Armed Bandits
Understanding the Networking Performance of Wear OS