default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMax Springer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Max Springer, MohammadTaghi Hajiaghayi, Hadi Yami:
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements. AAAI 2024: 9901-9908- [c7]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz Rafal Kowalski, Jan Olkowski, Max Springer:
Dynamic Metric Embedding into lp Space. ICML 2024 - [i8]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski, Max Springer:
Dynamic Metric Embedding into ℓp Space. CoRR abs/2406.17210 (2024) - [i7]MohammadTaghi Hajiaghayi, Shayan Chashm Jahan, Mohammad Sharifi, Suho Shin, Max Springer:
Fairness and Efficiency in Online Class Matching. CoRR abs/2410.19163 (2024) - 2023
- [c6]Kiarash Banihashem, Mohammad Hajiaghayi, Max Springer:
Optimal Sparse Recovery with Decision Stumps. AAAI 2023: 6745-6752 - [c5]MohammadTaghi Hajiaghayi, Max Springer:
Analysis of a Learning Based Algorithm for Budget Pacing. AAMAS 2023: 2709-2711 - [c4]Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi:
Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost. ICML 2023: 17218-17242 - [c3]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Suho Shin, Max Springer:
An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits. NeurIPS 2023 - [c2]Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi:
Fair, Polylog-Approximate Low-Cost Hierarchical Clustering. NeurIPS 2023 - [i6]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Max Springer:
Optimal Sparse Recovery with Decision Stumps. CoRR abs/2303.04301 (2023) - [i5]MohammadTaghi Hajiaghayi, Max Springer, Hadi Yami:
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements. CoRR abs/2305.16081 (2023) - [i4]Kiarash Banihashem, Mohammad Taghi Hajiaghayi, Suho Shin, Max Springer:
An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits. CoRR abs/2310.19025 (2023) - [i3]Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi:
Fair Polylog-Approximate Low-Cost Hierarchical Clustering. CoRR abs/2311.12501 (2023) - 2022
- [c1]Max Springer, MohammadTaghi Hajiaghayi, Debmalya Panigrahi, Mohammad Reza Khani:
Online Algorithms for the Santa Claus Problem. NeurIPS 2022 - [i2]MohammadTaghi Hajiaghayi, Max Springer:
Analysis of a Learning Based Algorithm for Budget Pacing. CoRR abs/2205.13330 (2022) - [i1]MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Debmalya Panigrahi, Max Springer:
Online Algorithms for the Santa Claus Problem. CoRR abs/2210.07333 (2022) - 2021
- [j1]Rong Li, Jun Hwan Ryu, Peter Vincent, Max Springer
, Dan Kluger, Erik A. Levinsohn, Yu Chen, Huafu Chen, Hal Blumenfeld:
The pulse: transient fMRI signal increases in subcortical arousal systems during transitions in attention. NeuroImage 232: 117873 (2021)
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-11-30 01:13 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:
