default search action
Aleck C. Johnsen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Jason D. Hartline, Aleck C. Johnsen:
Equivocal Blends: Prior Independent Lower Bounds. ITCS 2024: 59:1-59:21 - [i11]Jason D. Hartline, Aleck C. Johnsen, Anant Shah:
Subgame Optimal and Prior-Independent Online Algorithms. CoRR abs/2403.10451 (2024) - 2023
- [c7]Hedyeh Beyhaghi, Modibo K. Camara, Jason D. Hartline, Aleck C. Johnsen, Sheng Long
:
Screening with Disadvantaged Agents. FORC 2023: 6:1-6:20 - [i10]Hedyeh Beyhaghi, Modibo K. Camara, Jason D. Hartline, Aleck C. Johnsen, Sheng Long:
Screening with Disadvantaged Agents. CoRR abs/2305.18068 (2023) - [i9]Jason D. Hartline, Aleck C. Johnsen:
Extension of Minimax for Algorithmic Lower Bounds. CoRR abs/2311.17038 (2023) - 2022
- [c6]Yiding Feng
Bias-Variance Games. EC 2022: 328-329 - 2021
- [i8]Jason D. Hartline, Aleck C. Johnsen:
Lower Bounds for Prior Independent Algorithms. CoRR abs/2107.04754 (2021) - 2020
- [c5]Modibo K. Camara, Jason D. Hartline, Aleck C. Johnsen:
Mechanisms for a No-Regret Agent: Beyond the Common Prior. FOCS 2020: 259-270 - [c4]Jason D. Hartline, Aleck C. Johnsen, Yingkai Li:
Benchmark Design and Prior-independent Optimization. FOCS 2020: 294-305 - [c3]Jason D. Hartline, Aleck C. Johnsen, Denis Nekipelov, Zihe Wang:
Inference from Auction Prices. SODA 2020: 2472-2491 - [i7]Jason D. Hartline, Aleck C. Johnsen, Yingkai Li:
Benchmark Design and Prior-independent Optimization. CoRR abs/2001.10157 (2020) - [i6]Modibo Camara, Jason D. Hartline, Aleck C. Johnsen:
Mechanisms for a No-Regret Agent: Beyond the Common Prior. CoRR abs/2009.05518 (2020)
2010 – 2019
- 2019
- [c2]Jason D. Hartline, Aleck C. Johnsen, Denis Nekipelov, Onno Zoeter:
Dashboard Mechanisms for Online Marketplaces. EC 2019: 591-592 - [i5]Jason D. Hartline, Aleck C. Johnsen, Denis Nekipelov, Zihe Wang:
Inference from Auction Prices. CoRR abs/1902.06908 (2019) - [i4]Jason D. Hartline, Aleck C. Johnsen, Denis Nekipelov, Onno Zoeter:
Dashboard Mechanisms for Online Marketplaces. CoRR abs/1905.05750 (2019) - [i3]Yiding Feng, Ronen Gradwohl, Jason D. Hartline, Aleck C. Johnsen, Denis Nekipelov:
Bias-Variance Games. CoRR abs/1909.03618 (2019) - 2017
- [j1]Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis. J. Comb. Optim. 33(2): 496-529 (2017) - 2014
- [i2]Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki:
Computing Minimum Tile Sets to Self-Assemble Colors Patterns. CoRR abs/1404.2962 (2014) - [i1]Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki:
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tile set synthesis. CoRR abs/1409.1619 (2014) - 2013
- [c1]Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki:
Computing Minimum Tile Sets to Self-Assemble Color Patterns. ISAAC 2013: 699-710
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-12-17 21: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: