default search action
Simon Omlor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j1]Kristóf Bérczi
, Tamás Király, Simon Omlor:
Scheduling with non-renewable resources: minimizing the sum of completion times. J. Sched. 27(2): 151-164 (2024) - [c7]Alexander Munteanu, Simon Omlor:
Optimal bounds for ℓp sensitivity sampling via ℓ2 augmentation. ICML 2024 - [c6]Alexander Munteanu, Simon Omlor:
Turnstile ℓp leverage score sampling with applications. ICML 2024 - [i8]Alexander Munteanu, Simon Omlor:
Optimal bounds for ℓp sensitivity sampling via ℓ2 augmentation. CoRR abs/2406.00328 (2024) - [i7]Alexander Munteanu, Simon Omlor:
Turnstile ℓp leverage score sampling with applications. CoRR abs/2406.00339 (2024) - 2023
- [c5]Alexander Munteanu, Simon Omlor, David P. Woodruff:
Almost Linear Constant-Factor Sketching for $\ell_1$ and Logistic Regression. ICLR 2023 - [i6]Alexander Munteanu, Simon Omlor, David P. Woodruff:
Almost Linear Constant-Factor Sketching for 𝓁1 and Logistic Regression. CoRR abs/2304.00051 (2023) - 2022
- [c4]Alexander Munteanu, Simon Omlor, Christian Peters:
p-Generalized Probit Regression and Scalable Maximum Likelihood Estimation via Sketching and Coresets. AISTATS 2022: 2073-2100 - [c3]Alexander Munteanu, Simon Omlor, Zhao Song, David P. Woodruff:
Bounding the Width of Neural Networks via Coupled Initialization A Worst Case Analysis. ICML 2022: 16083-16122 - [i5]Alexander Munteanu, Simon Omlor, Christian Peters:
p-Generalized Probit Regression and Scalable Maximum Likelihood Estimation via Sketching and Coresets. CoRR abs/2203.13568 (2022) - [i4]Alexander Munteanu, Simon Omlor, Zhao Song, David P. Woodruff:
Bounding the Width of Neural Networks via Coupled Initialization - A Worst Case Analysis. CoRR abs/2206.12802 (2022) - 2021
- [c2]Alexander Munteanu, Simon Omlor, David P. Woodruff:
Oblivious Sketching for Logistic Regression. ICML 2021: 7861-7871 - [i3]Alexander Munteanu, Simon Omlor, David P. Woodruff:
Oblivious sketching for logistic regression. CoRR abs/2107.06615 (2021) - 2020
- [c1]Kristóf Bérczi, Tamás Király, Simon Omlor:
Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times. ISCO 2020: 167-178
2010 – 2019
- 2019
- [i2]Kristóf Bérczi, Tamás Király, Simon Omlor:
Scheduling with Non-Renewable Resources: Minimizing the Sum of Completion Times. CoRR abs/1911.12138 (2019) - [i1]Danny Hermelin, Matthias Mnich
Single Machine Batch Scheduling to Minimize the Weighted Number of Tardy Jobs. CoRR abs/1911.12350 (2019)
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-09-04 00:27 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: