776 citations · 1.7k across the 13 of their papers we have counts for
13 papers
Hard Optimization Problems have Soft Edges
Raffaele Marino, Scott Kirkpatrick
Finding a Maximum Clique is a classic property test from graph theory; find any one of the largest complete subgraphs in an Erdös-Rényi G(N, p) random graph. We use Maximum Clique…
From Megabits to CPU~Ticks: Enriching a Demand Trace in the Age of MEC
Francesco Malandrino, Carla Fabiana Chiasserini, Giuseppe Avino +2
All the content consumed by mobile users, be it a web page or a live stream, undergoes some processing along the way; as an example, web pages and videos are transcoded to fit each…
Revisiting the Challenges of MaxClique
Raffaele Marino, Scott Kirkpatrick
The MaxClique problem, finding the largest complete subgraph in an Erd{ö}s-R{é}nyi random graph in the large limit, is a well-known example of a simple problem for whi…
Mining the Air -- for Research in Social Science and Networking Measurement
Scott Kirkpatrick, Ron Bekkerman, Adi Zmirli +1
Smartphone apps provide a vitally important opportunity for monitoring human mobility, human experience of ubiquitous information aids, and human activity in our increasingly well-…
Cellular Network Traces Towards 5G: Usage, Analysis and Generation
Francesco Malandrino, Carla-Fabiana Chiasserini, Scott Kirkpatrick
Deployment and demand traces are a crucial tool to study today's LTE systems, as well as their evolution toward 5G. In this paper, we use a set of real-world, crowdsourced traces,…
How Close to the Edge? Delay/utilization tradeoffs in MEC
Francesco Malandrino, Scott Kirkpatrick, Carla-Fabiana Chiasserini
Virtually all of the rapidly increasing data traffic consumed by mobile users requires some kind of processing, normally performed at cloud servers. A recent thrust, {\em mobile ed…