The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ilan Adler: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ilan Adler, Peter A. Beling
    Polynomial Algorithms for LP over a Subring of the Algebraic Integers with Applications to LP with Circulant Matrices [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:480-487 [Conf]
  2. Jian Yao, Shmuel Oren, Ilan Adler
    Computing Cournot Equilibria in Two Settlement Electricity Markets with Transmission Constraints. [Citation Graph (0, 0)][DBLP]
    HICSS, 2004, pp:- [Conf]
  3. Jian Yao, Bert Willems, Shmuel Oren, Ilan Adler
    Cournot Equilibrium in Price-Capped Two-Settlement Electricity Markets. [Citation Graph (0, 0)][DBLP]
    HICSS, 2005, pp:- [Conf]
  4. Ilan Adler, Peter A. Beling
    Polynomial Algorithms for Linear Programming over the Algebraic Numbers [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:483-494 [Conf]
  5. Ilan Adler, Nimrod Megiddo
    A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:312-323 [Conf]
  6. Ilan Adler, Peter A. Beling
    Polynomial Algorithms for Linear Programming over the Algebraic Numbers. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:6, pp:436-457 [Journal]
  7. Ilan Adler, Renato D. C. Monteiro
    A Geometric View of Parametric Linear Programming. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:2, pp:161-176 [Journal]
  8. Ilan Adler, Alan J. Hoffman, Ron Shamir
    Monge and Feasibility Sequences in General Flow Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:21-38 [Journal]
  9. Ilan Adler, Nimrod Megiddo
    A Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:4, pp:871-895 [Journal]
  10. 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. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1987, v:3, n:4, pp:372-387 [Journal]
  11. Ilan Adler, Peter A. Beling
    Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:121-143 [Journal]
  12. Ilan Adler, Richard W. Cottle, Sushil Verma
    Sufficient matrices belong to L. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:106, n:2, pp:391-401 [Journal]
  13. Ilan Adler, Renato D. C. Monteiro
    Limiting behavior of the affine scaling continuous trajectories for linear programming problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:29-51 [Journal]
  14. Ilan Adler, Ron Shamir
    A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:61, n:, pp:39-52 [Journal]
  15. Ilan Adler, Hyun-soo Ahn, Richard M. Karp, Sheldon M. Ross
    Coalescing times for IID random variables with applications to population biology. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:2, pp:155-166 [Journal]
  16. Ilan Adler, Noga Alon, Sheldon M. Ross
    On the maximum number of Hamiltonian paths in tournaments. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:18, n:3, pp:291-296 [Journal]
  17. Ilan Adler, Steven Cosares
    Advantageous Properties of Dual Transhipment Polyhedra. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:2, pp:157-167 [Journal]
  18. Andrés Ramos, Ilan Adler
    A further step in decision support models for energy markets. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:181, n:3, pp:1243-1244 [Journal]
  19. Jian Yao, Shmuel S. Oren, Ilan Adler
    Two-settlement electricity markets with price caps and Cournot generation firms. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:181, n:3, pp:1279-1296 [Journal]

  20. A Note on Strictly Competitive Games. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002