Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSophie Huiberts
Person information
- affiliation: Centrum voor Wiskunde & Informatica, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j2]Sander Borst
, Daniel Dadush, Sophie Huiberts, Samarth Tiwari:
On the integrality gap of binary integer programs with Gaussian data. Math. Program. 197(2): 1221-1263 (2023)- 2020
- [j1]Daniel Dadush, Sophie Huiberts:
A Friendly Smoothed Analysis of the Simplex Method. SIAM J. Comput. 49(5) (2020)
Conference and Workshop Papers
- 2023
- [c7]Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev:
A Nearly Optimal Randomized Algorithm for Explorable Heap Selection. IPCO 2023: 29-43 - [c6]Sophie Huiberts, Yin Tat Lee, Xinzhi Zhang:
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method. STOC 2023: 1904-1917 - 2022
- [c5]Gilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, Galyna Livshyts:
Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes. SoCG 2022: 18:1-18:15 - [c4]Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge:
A Simple Method for Convex Optimization in the Oracle Model. IPCO 2022: 154-167 - 2021
- [c3]Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari:
On the Integrality Gap of Binary Integer Programs with Gaussian Data. IPCO 2021: 427-442 - 2020
- [c2]Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh:
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. STOC 2020: 761-774 - 2018
- [c1]Daniel Dadush, Sophie Huiberts:
A friendly smoothed analysis of the simplex method. STOC 2018: 390-403
Parts in Books or Collections
- 2020
- [p1]Daniel Dadush, Sophie Huiberts:
Smoothed Analysis of the Simplex Method. Beyond the Worst-Case Analysis of Algorithms 2020: 309-333
Informal and Other Publications
- 2022
- [i7]Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev:
A nearly optimal randomized algorithm for explorable heap selection. CoRR abs/2210.05982 (2022) - [i6]Sophie Huiberts, Yin Tat Lee, Xinzhi Zhang:
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method. CoRR abs/2211.11860 (2022) - 2021
- [i5]Gilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, Galyna Livshyts:
Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes. CoRR abs/2112.13027 (2021) - 2020
- [i4]Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge:
Simple Iterative Methods for Linear Optimization over Convex Sets. CoRR abs/2011.08557 (2020) - [i3]Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari:
On the Integrality Gap of Binary Integer Programs with Gaussian Data. CoRR abs/2012.08346 (2020) - 2019
- [i2]Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh:
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. CoRR abs/1912.06252 (2019) - 2017
- [i1]Daniel Dadush, Sophie Huiberts:
A Friendly Smoothed Analysis of the Simplex Method. CoRR abs/1711.05667 (2017)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 2023-06-05 02:05 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:
