default search action
Ilan Adler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i4]Ilan Adler, Martin Bullinger, Vijay V. Vazirani:
A Generalization of von Neumann's Reduction from the Assignment Problem to Zero-Sum Games. CoRR abs/2410.10767 (2024) - 2021
- [j32]Ilan Adler, Jesús A. De Loera, Steven Klee, Zhenyang Zhang:
Diameters of Cocircuit Graphs of Oriented Matroids: An Update. Electron. J. Comb. 28(4) (2021) - 2020
- [c8]Ilan Adler, Zhiyue Tom Hu, Tianyi Lin:
New Proximal Newton-Type Methods for Convex Optimization. CDC 2020: 4828-4835
2010 – 2019
- 2017
- [j31]Ilan Adler, Yang Cao, Richard M. Karp, Erol A. Peköz
, Sheldon M. Ross:
Random Knockout Tournaments. Oper. Res. 65(6): 1589-1596 (2017) - 2016
- [j30]Ilan Adler, Richard W. Cottle, Jong-Shi Pang:
Some LCPs solvable in strongly polynomial time with Lemke's algorithm. Math. Program. 160(1-2): 477-493 (2016) - 2014
- [c7]Ilan Adler, Christos H. Papadimitriou, Aviad Rubinstein:
On Simplex Pivoting Rules and Complexity Theory. IPCO 2014: 13-24 - [i3]Ilan Adler, Christos H. Papadimitriou, Aviad Rubinstein:
On Simplex Pivoting Rules and Complexity Theory. CoRR abs/1404.3320 (2014) - 2013
- [j29]Ilan Adler:
The equivalence of linear programs and zero-sum games. Int. J. Game Theory 42(1): 165-177 (2013) - [i2]Ilan Adler, Sushil Verma:
A direct reduction of PPAD Lemke-verified linear complementarity problems to bimatrix games. CoRR abs/1302.0067 (2013) - 2011
- [i1]Ilan Adler, Dorit S. Hochbaum:
Benchmark Problems for Totally Unimodular Set System Auction. CoRR abs/1102.3499 (2011)
2000 – 2009
- 2009
- [j28]Alan Weinstein, Harold Kuhn, Leo A. Goodman, Dan McFadden, Joel Sobel, Ilan Adler, Jacob Feldman, Ahmet Alkan, Katharine Gale, Elizabeth Dunning, Samara Watkiss, Roger Gilbert, Jonathan Birt, Graham Ingham, Sandra M. Gilbert:
The Berkeley Memorial. Games Econ. Behav. 66(2): 582-593 (2009) - [c6]Ilan Adler, Constantinos Daskalakis, Christos H. Papadimitriou:
A Note on Strictly Competitive Games. WINE 2009: 471-474 - 2008
- [j27]Jian Yao, Ilan Adler, Shmuel S. Oren:
Modeling and Computing Two-Settlement Oligopolistic Equilibrium in a Congested Electricity Network. Oper. Res. 56(1): 34-47 (2008) - 2007
- [j26]Andrés Ramos
A further step in decision support models for energy markets. Eur. J. Oper. Res. 181(3): 1243-1244 (2007) - [j25]Jian Yao, Shmuel S. Oren, Ilan Adler:
Two-settlement electricity markets with price caps and Cournot generation firms. Eur. J. Oper. Res. 181(3): 1279-1296 (2007) - [j24]Jian Yao, Shmuel S. Oren, Ilan Adler:
Cournot equilibria in two-settlement electricity markets with system contingencies. Int. J. Crit. Infrastructures 3(1/2): 142-160 (2007) - 2006
- [j23]Ilan Adler, Richard W. Cottle, Sushil Verma:
Sufficient matrices belong to L. Math. Program. 106(2): 391-401 (2006) - 2005
- [c5]Jian Yao, Bert Willems, Shmuel S. Oren, Ilan Adler:
Cournot Equilibrium in Price-Capped Two-Settlement Electricity Markets. HICSS 2005 - 2004
- [c4]Jian Yao, Shmuel S. Oren, Ilan Adler:
Computing Cournot Equilibria in Two Settlement Electricity Markets with Transmission Constraints. HICSS 2004 - 2003
- [j22]Ilan Adler, Hyun-Soo Ahn, Richard M. Karp, Sheldon M. Ross:
Coalescing times for IID random variables with applications to population biology. Random Struct. Algorithms 23(2): 155-166 (2003) - 2002
- [j21]Ilan Adler, Alan L. Erera, Dorit S. Hochbaum, Eli V. Olinick:
Baseball, Optimization, and the World Wide Web. Interfaces 32(2): 12-22 (2002) - 2001
- [j20]Ilan Adler, Noga Alon, Sheldon M. Ross:
On the maximum number of Hamiltonian paths in tournaments. Random Struct. Algorithms 18(3): 291-296 (2001)
1990 – 1999
- 1994
- [j19]Ilan Adler, Peter A. Beling:
Polynomial Algorithms for Linear Programming over the Algebraic Numbers. Algorithmica 12(6): 436-457 (1994) - 1993
- [j18]Ilan Adler, Alan J. Hoffman, Ron Shamir
Monge and Feasibility Sequences in General Flow Problems. Discret. Appl. Math. 44(1-3): 21-38 (1993) - [j17]Ilan Adler, Ron Shamir
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio. Math. Program. 61: 39-52 (1993) - 1992
- [j16]Ilan Adler, Renato D. C. Monteiro:
A Geometric View of Parametric Linear Programming. Algorithmica 8(2): 161-176 (1992) - [j15]Ilan Adler, Peter A. Beling:
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices. Math. Program. 57: 121-143 (1992) - [c3]Ilan Adler, Peter A. Beling:
Polynomial Algorithms for Linear Programming over the Algebraic Numbers. STOC 1992: 483-494 - 1991
- [j14]Ilan Adler, Steven Cosares:
A Strongly Polynomial Algorithm for a Special Class of Linear Programs. Oper. Res. 39(6): 955-960 (1991) - [j13]Ilan Adler, Renato D. C. Monteiro:
Limiting behavior of the affine scaling continuous trajectories for linear programming problems. Math. Program. 50: 29-51 (1991) - [c2]Ilan Adler, Peter A. Beling:
Polynomial Algorithms for LP over a Subring of the Algebraic Integers with Applications to LP with Circulant Matrices. FOCS 1991: 480-487 - 1990
- [j12]Renato D. C. Monteiro, Ilan Adler, Mauricio G. C. Resende:
A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension. Math. Oper. Res. 15(2): 191-214 (1990) - [j11]Renato D. C. Monteiro, Ilan Adler:
An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence. Math. Oper. Res. 15(3): 408-422 (1990) - [j10]Ilan Adler, Steven Cosares:
Advantageous Properties of Dual Transhipment Polyhedra. SIAM J. Discret. Math. 3(2): 157-167 (1990)
1980 – 1989
- 1989
- [j9]Ilan Adler, Narendra Karmarkar, Mauricio G. C. Resende, Geraldo Veiga:
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm. INFORMS J. Comput. 1(2): 84-106 (1989) - [j8]Renato D. C. Monteiro, Ilan Adler:
Interior path following primal-dual algorithms. part I: Linear programming. Math. Program. 44(1-3): 27-41 (1989) - [j7]Renato D. C. Monteiro, Ilan Adler:
Interior path following primal-dual algorithms. part II: Convex quadratic programming. Math. Program. 44(1-3): 43-66 (1989) - [j6]Ilan Adler, Mauricio G. C. Resende, Geraldo Veiga, Narendra Karmarkar:
An implementation of Karmarkar's algorithm for linear programming. Math. Program. 44(1-3): 297-335 (1989) - 1987
- [j5]Ilan Adler, Richard M. Karp, Ron Shamir
A simplex variant solving an m times d linear program in O(min(m2, d2) expected number of pivot steps. J. Complex. 3(4): 372-387 (1987) - 1986
- [j4]Ilan Adler, Richard M. Karp, Ron Shamir
A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only. Math. Oper. Res. 11(4): 570-590 (1986) - 1985
- [j3]Ilan Adler, Nimrod Megiddo:
A Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension. J. ACM 32(4): 871-895 (1985) - 1984
- [c1]Ilan Adler, Nimrod Megiddo:
A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension. STOC 1984: 312-323
1970 – 1979
- 1979
- [j2]Janet Somers, Ilan Adler:
The max-flow problem with parametric capacities. Discret. Appl. Math. 1(4): 287-300 (1979) - 1976
- [j1]Ilan Adler, Romesh Saigal:
Long Monotone Paths in Abstract Polytopes. Math. Oper. Res. 1(1): 89-95 (1976)
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-22 19:46 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: