![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Daniel Dadush
aka: Dan Dadush
Centrum Wiskunde & Informatica, Amsterdam, The Netherlands
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 103 matches
- 2024
- 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. Math. Program. 204(1): 135-206 (2024) - Daniel Dadush
, Martin Milanic
, Tami Tamir
:
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue. ACM Trans. Algorithms 20(3): 21 (2024) - Daniel Dadush, Akshay Ramachandran:
Strongly Polynomial Frame Scaling to High Precision. SODA 2024: 962-981 - Daniel Dadush
, Zhuan Khye Koh
, Bento Natura
, Neil Olver
, László A. Végh
:
A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column. STOC 2024: 1561-1572 - Daniel Dadush, Akshay Ramachandran:
Strongly Polynomial Frame Scaling to High Precision. CoRR abs/2402.04799 (2024) - 2023
- 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) - Sander Borst
, Daniel Dadush
, Sophie Huiberts
, Danish Kashaev
:
A Nearly Optimal Randomized Algorithm for Explorable Heap Selection. IPCO 2023: 29-43 - Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss:
From Approximate to Exact Integer Programming. IPCO 2023: 100-114 - Daniel Dadush, Arthur Léonard, Lars Rohwedder
, José Verschae:
Optimizing Low Dimensional Functions over the Integers. IPCO 2023: 115-126 - Sander Borst, Daniel Dadush, Dan Mikulincer:
Integrality Gaps for Random Integer Programs via Discrepancy. SODA 2023: 1692-1733 - Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae:
Optimizing Low Dimensional Functions over the Integers. CoRR abs/2303.02474 (2023) - 2022
- 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 - Xavier Allamigeon, Daniel Dadush, Georg Loho
, Bento Natura, László A. Végh:
Interior point methods are not worse than Simplex. FOCS 2022: 267-277 - Daniel Dadush, Christopher Hojny
, Sophie Huiberts, Stefan Weltge
:
A Simple Method for Convex Optimization in the Oracle Model. IPCO 2022: 154-167 - Daniel Dadush
, Zhuan Khye Koh
, Bento Natura
, László A. Végh
:
On Circuit Diameter Bounds via Circuit Imbalances. IPCO 2022: 140-153 - Daniel Dadush, László A. Végh
, Giacomo Zambelli:
On finding exact solutions of linear programs in the oracle model. SODA 2022: 2700-2722 - Daniel Dadush, Haotian Jiang, Victor Reis:
A new framework for matrix discrepancy: partial coloring bounds via mirror descent. STOC 2022: 649-658 - Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh:
Interior point methods are not worse than Simplex. CoRR abs/2206.08810 (2022) - Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev:
A nearly optimal randomized algorithm for explorable heap selection. CoRR abs/2210.05982 (2022) - Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss:
From approximate to exact integer programming. CoRR abs/2211.03859 (2022) - 2021
- Dan Dadush, László A. Végh
, Giacomo Zambelli
:
Geometric Rescaling Algorithms for Submodular Function Minimization. Math. Oper. Res. 46(3): 1081-1108 (2021) - Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
:
An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. ESA 2021: 36:1-36:15 - Sander Borst
, Daniel Dadush, Neil Olver, Makrand Sinha:
Majorizing Measures for the Optimizer. ITCS 2021: 73:1-73:20 - Sander Borst
, Daniel Dadush, Sophie Huiberts, Samarth Tiwari:
On the Integrality Gap of Binary Integer Programs with Gaussian Data. IPCO 2021: 427-442 - Daniel Dadush, Haotian Jiang, Victor Reis:
A New Framework for Matrix Discrepancy: Partial Coloring Bounds via Mirror Descent. CoRR abs/2111.03171 (2021) - Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh:
On Circuit Diameter Bounds via Circuit Imbalances. CoRR abs/2111.07913 (2021) - 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
- Daniel Dadush
, László A. Végh
, Giacomo Zambelli
:
Rescaling Algorithms for Linear Conic Feasibility. Math. Oper. Res. 45(2): 732-754 (2020) - Daniel Dadush, Sophie Huiberts:
A Friendly Smoothed Analysis of the Simplex Method. SIAM J. Comput. 49(5) (2020) - Daniel Dadush, Samarth Tiwari:
On the Complexity of Branching Proofs. CCC 2020: 34:1-34:35
skipping 73 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 05:03 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint