default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAaron Archer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Aaron Archer, Matthew Fahrbach, Kuikui Liu, Prakash Prabhu:
Practical Performance Guarantees for Pipelined DNN Inference. ICML 2024- [c18]Bartek Wydrowski, Robert Kleinberg, Stephen M. Rumble, Aaron Archer:
Load is not what you should balance: Introducing Prequal. NSDI 2024 - 2023
- [i3]Aaron Archer, Matthew Fahrbach, Kuikui Liu, Prakash Prabhu:
Pipeline Parallelism for DNN Inference with Practical Performance Guarantees. CoRR abs/2311.03703 (2023) - [i2]Bartek Wydrowski, Robert Kleinberg, Stephen M. Rumble, Aaron Archer:
Load is not what you should balance: Introducing Prequal. CoRR abs/2312.10172 (2023)
2010 – 2019
- 2019
- [j10]Aaron Archer, Kevin Aydin, MohammadHossein Bateni, Vahab S. Mirrokni, Aaron Schild, Ray Yang, Richard Zhuang:
Cache-aware load balancing of data center applications. Proc. VLDB Endow. 12(6): 709-723 (2019) - 2018
- [c17]David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup
, Ger Yang:
Wireless coverage prediction via parametric shortest paths. MobiHoc 2018: 221-230 - [i1]David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup, Ger Yang:
Wireless coverage prediction via parametric shortest paths. CoRR abs/1805.06420 (2018) - 2017
- [c16]Aaron Archer, Silvio Lattanzi, Peter Likarish, Sergei Vassilvitskii:
Indexing Public-Private Graphs. WWW 2017: 1461-1470 - 2016
- [j9]David L. Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K. K. Ramakrishnan:
Optimal Content Placement for a Large-Scale VoD System. IEEE/ACM Trans. Netw. 24(4): 2114-2127 (2016) - 2014
- [j8]Aaron Archer, Robert Kleinberg:
Truthful germs are contagious: A local-to-global characterization of truthfulness. Games Econ. Behav. 86: 340-366 (2014) - 2013
- [c15]David L. Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K. K. Ramakrishnan:
Content Placement via the Exponential Potential Function Method. IPCO 2013: 49-61 - 2012
- [c14]Kyung-Wook Hwang, David L. Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, Vishal Misra, K. K. Ramakrishnan, Deborah F. Swayne:
Leveraging Video Viewing Patterns for Optimal Content Placement. Networking (2) 2012: 44-58 - [c13]Suhrid Balakrishnan, Rensheng Wang, Carlos Eduardo Scheidegger, Angus MacLellan, Yifan Hu, Aaron Archer, Shankar Krishnan, David L. Applegate, Guangqin Ma, S. Tom Au:
Combining Predictors for Recommending Music: the False Positives' approach to KDD Cup track 2. KDD Cup 2012: 199-213 - 2011
- [j7]Aaron Archer, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Howard J. Karloff:
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP. SIAM J. Comput. 40(2): 309-332 (2011) - 2010
- [c12]David L. Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K. K. Ramakrishnan:
Optimal content placement for a large-scale VoD system. CoNEXT 2010: 4 - [c11]Aaron Archer, Anna Blasiak:
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls. SODA 2010: 429-447
2000 – 2009
- 2009
- [c10]Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff:
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP. FOCS 2009: 427-436 - 2008
- [j6]Aaron Archer, Asaf Levin, David P. Williamson:
A Faster, Better Approximation Algorithm for the Minimum Latency Problem. SIAM J. Comput. 37(5): 1472-1498 (2008) - [j5]Aaron Archer, Robert Kleinberg:
Characterizing truthful mechanisms with convex type spaces. SIGecom Exch. 7(3) (2008) - [c9]Aaron Archer, Shankar Krishnan:
Importance Sampling via Load-Balanced Facility Location. IPCO 2008: 316-330 - [c8]Aaron Archer, Robert Kleinberg:
Truthful germs are contagious: a local to global characterization of truthfulness. EC 2008: 21-30 - 2007
- [j4]Aaron Archer, Éva Tardos:
Frugal path mechanisms. ACM Trans. Algorithms 3(1): 3:1-3:22 (2007) - 2004
- [j3]Aaron Archer, Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker:
Approximation and collusion in multicast cost sharing. Games Econ. Behav. 47(1): 36-71 (2004) - [c7]Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos:
Approximate classification via earthmover metrics. SODA 2004: 1079-1087 - 2003
- [j2]Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos:
An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents. Internet Math. 1(2): 129-150 (2003) - [c6]Aaron Archer, Ranjithkumar Rajagopalan, David B. Shmoys:
Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties. ESA 2003: 31-42 - [c5]Aaron Archer, David P. Williamson:
Faster approximation algorithms for the minimum latency problem. SODA 2003: 88-96 - [c4]Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos:
An approximate truthful mechanism for combinatorial auctions with single parameter agents. SODA 2003: 205-214 - 2002
- [c3]Aaron Archer, Éva Tardos:
Frugal path mechanisms. SODA 2002: 991-999 - 2001
- [c2]Aaron Archer, Éva Tardos:
Truthful Mechanisms for One-Parameter Agents. FOCS 2001: 482-491 - [c1]Aaron Archer:
Two O (log* k)-Approximation Algorithms for the Asymmetric k-Center Problem. IPCO 2001: 1-14 - 2000
- [j1]Aaron Archer:
On the upper chromatic numbers of the reals. Discret. Math. 214(1-3): 65-75 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
