Aaron Archer

Orcid: 0000-0002-7761-2000

According to our database1, Aaron Archer authored at least 24 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Load is not what you should balance: Introducing Prequal.
Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation, 2024

2023
Pipeline Parallelism for DNN Inference with Practical Performance Guarantees.
CoRR, 2023

2019
Cache-aware load balancing of data center applications.
Proc. VLDB Endow., 2019

2018
Wireless coverage prediction via parametric shortest paths.
Proceedings of the Nineteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2018

2017
Indexing Public-Private Graphs.
Proceedings of the 26th International Conference on World Wide Web, 2017

2016
Optimal Content Placement for a Large-Scale VoD System.
IEEE/ACM Trans. Netw., 2016

2014
Truthful germs are contagious: A local-to-global characterization of truthfulness.
Games Econ. Behav., 2014

2013
Content Placement via the Exponential Potential Function Method.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012
Combining Predictors for Recommending Music: the False Positives' approach to KDD Cup track 2.
Proceedings of KDD Cup 2011 competition, San Diego, CA, USA, 2011, 2012

Leveraging Video Viewing Patterns for Optimal Content Placement.
Proceedings of the NETWORKING 2012, 2012

2011
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP.
SIAM J. Comput., 2011

2010
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2008
Characterizing truthful mechanisms with convex type spaces.
SIGecom Exch., 2008

A Faster, Better Approximation Algorithm for the Minimum Latency Problem.
SIAM J. Comput., 2008

Importance Sampling via Load-Balanced Facility Location.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007
Frugal path mechanisms.
ACM Trans. Algorithms, 2007

2004
Approximation and collusion in multicast cost sharing.
Games Econ. Behav., 2004

Approximate classification via earthmover metrics.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents.
Internet Math., 2003

Faster approximation algorithms for the minimum latency problem.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties.
Proceedings of the Algorithms, 2003

2001
Two O (log<sup>*</sup> k)-Approximation Algorithms for the Asymmetric k-Center Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001

Truthful Mechanisms for One-Parameter Agents.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
On the upper chromatic numbers of the reals.
Discret. Math., 2000


  Loading...