default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnthony Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c11]Anthony Kim, Jeffery A. Pitcock, Justin Zhang:
Efficient Computation of Causality in Globally Hyperbolic Spacetimes Using Link Invariants and Relevant Applications to Quantum Computing. QCE 2023: 54-55- 2021
- [j5]Santiago R. Balseiro
, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni:
Budget-Management Strategies in Repeated Auctions. Oper. Res. 69(3): 859-876 (2021) - [j4]Anthony Kim, Vahab S. Mirrokni, Hamid Nazerzadeh:
Deals or No Deals: Contract Design for Online Advertising. Oper. Res. 69(5): 1450-1467 (2021) - [j3]Santiago R. Balseiro, Anthony Kim, Daniel Russo:
On the Futility of Dynamics in Robust Mechanism Design. Oper. Res. 69(6): 1767-1783 (2021) - [c10]Abdurrahman Alshareef, Chungman Seo, Anthony Kim, Bernard P. Zeigler:
DEVS Markov Modeling and Simulation of Activity-Based Models for MBSE Application. WSC 2021: 1-12 - 2020
- [c9]Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni:
Budget-Constrained Incentive Compatibility for Stationary Mechanisms. EC 2020: 607-608
2010 – 2019
- 2019
- [j2]Zhiyi Huang, Anthony Kim:
Welfare maximization with production costs: A primal dual approach. Games Econ. Behav. 118: 648-667 (2019) - 2018
- [b1]Anthony Kim:
Optimization and decision-making under uncertainty. Stanford University, USA, 2018 - [c8]Abhimanyu Das, Sreenivas Gollapudi, Anthony Kim, Debmalya Panigrahi, Chaitanya Swamy:
Minimizing Latency in Online Ride and Delivery Services. WWW 2018: 379-388 - [i8]Abhimanyu Das, Sreenivas Gollapudi, Anthony Kim, Debmalya Panigrahi, Chaitanya Swamy:
Minimizing Latency in Online Ride and Delivery Services. CoRR abs/1802.02744 (2018) - 2017
- [c7]Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni:
Budget Management Strategies in Repeated Auctions. WWW 2017: 15-23 - [i7]Anthony Kim, Sung Hyun Chen, Chen Zheng:
Depth First Always On Routing Trace Algorithm. CoRR abs/1711.04172 (2017) - 2016
- [c6]Anthony Kim, Vahid Liaghat, Junjie Qin, Amin Saberi:
Online Energy Storage Management: an Algorithmic Approach. APPROX-RANDOM 2016: 12:1-12:23 - 2015
- [j1]Constantinos Daskalakis, Alan Deckelbaum, Anthony Kim:
Near-optimal no-regret algorithms for zero-sum games. Games Econ. Behav. 92: 327-348 (2015) - [c5]Anthony Kim:
Welfare Maximization with Deferred Acceptance Auctions in Reallocation Problems. ESA 2015: 804-815 - [c4]Zhiyi Huang, Anthony Kim:
Welfare Maximization with Production Costs: A Primal Dual Approach. SODA 2015: 59-72 - [i6]Anthony Kim:
Welfare Maximization with Deferred Acceptance Auctions in Reallocation Problems. CoRR abs/1507.01353 (2015) - 2014
- [c3]Smriti Bhagat, Anthony Kim, S. Muthukrishnan, Udi Weinsberg:
The Shapley Value in Knapsack Budgeted Games. WINE 2014: 106-119 - [i5]Smriti Bhagat, Anthony Kim, S. Muthukrishnan, Udi Weinsberg:
The Shapley Value in Knapsack Budgeted Games. CoRR abs/1409.5200 (2014) - [i4]Zhiyi Huang, Anthony Kim:
Welfare Maximization with Production Costs: A Primal Dual Approach. CoRR abs/1411.4384 (2014) - 2011
- [c2]Anthony Kim, Muriel Médard:
Computing bounds on network capacity regions as a polytope reconstruction problem. ISIT 2011: 588-592 - [c1]Constantinos Daskalakis, Alan Deckelbaum, Anthony Kim:
Near-Optimal No-Regret Algorithms for Zero-Sum Games. SODA 2011: 235-254 - [i3]Anthony Kim:
On Network Coding Capacity - Matroidal Networks and Network Capacity Regions. CoRR abs/1103.0358 (2011) - [i2]Anthony Kim, Muriel Médard:
Computing Bounds on Network Capacity Regions as a Polytope Reconstruction Problem. CoRR abs/1103.0361 (2011) - 2010
- [i1]Anthony Kim, Muriel Médard:
Scalar-linear Solvability of Matroidal Networks Associated with Representable Matroids. CoRR abs/1004.0727 (2010)
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 2024-05-08 21:50 CEST 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:
