Aaron Archer
Orcid: 0000-0002-7761-2000
According to our database1,
Aaron Archer
authored at least 25 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation, 2024
Proceedings of the Forty-first International Conference on Machine Learning, 2024
2023
CoRR, 2023
2019
2018
Proceedings of the Nineteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2018
2017
Proceedings of the 26th International Conference on World Wide Web, 2017
2013
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
Proceedings of the NETWORKING 2012, 2012
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
Proceedings of the 2010 ACM Conference on Emerging Networking Experiments and Technology, 2010
2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
2008
SIAM J. Comput., 2008
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008
Proceedings of the Integer Programming and Combinatorial Optimization, 2008
2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
2003
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003
An approximate truthful mechanism for combinatorial auctions with single parameter agents.
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
2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
2001
Two O (log<sup>*</sup> k)-Approximation Algorithms for the Asymmetric k-Center Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001
2000