Philippe Clauss
- 1.A. I. Barvinok. A polynomial-time algorithm for counting integral points in polyhedra when the dimension is fixed. In Proc. of the $Jth Syrup. on the Foundations of Computer Science (FOCS'9$), pages 566-572. IEEE Computer Society Press, New York, 1993.Google Scholar
- 2.A. I. Barvinok. Computing the Ehrhart Polynomial of a Convex Lattice Polytope. Discrete Comput. Geom., 12:35-48,1994.Google ScholarDigital Library
- 3.Ph. Clauss. The volume of a lattice polyhedron to enumerate processors and parallelism. Research Report ICPS 95-11, Submitted to publication, 1995. http://icps, u-strasbg, fr/pub-95/pub-95-11, ps. gzGoogle Scholar
- 4.M. Dyer and A. M. Frieze. On the complexity of computing the volume of a polyhedron. SIAM J. Uomput., 17(5):967-974, 1988. Google ScholarDigital Library
- 5.E. Ehrhart. Sur les poly~dres rationnels homothdtiques n dimensions. C.R. Acad. Sci. Paris, 254:616-618, 1962.Google Scholar
- 6.E. Ehrhart. Sur un probl~me de gdomdtrie diophantienne lin~aire I. J. Re~ne Angew. Math., 226:1-29, 1967.Google Scholar
- 7.E. Ehrhart. Sur un probl~me de g~om~trie diophantienne lindaire II. J. Reine Angew. Math., 227:25-49, 1967.Google Scholar
- 8.E. Ehrhart. Polynt~mes arithm~tiques et M~thode des Poly~dres en Uombznatoire. International Series of Numerical Mathematics, vol.35, Birkh~iuser Verlag, Basel/Stuttgart, 1977.Google Scholar
- 9.J. Ferrante, V. Sarkar and W. Thrash. On estimating and enhancing cache effectiveness. Advances in Languages and Compilers for Parallel Processing, pages 328-343. The MIT Press, 1991. Google ScholarDigital Library
- 10.P.M. Gruber and C.G. Lekkerkerker. Geometry of Numbers. North-Holland, Amsterdam, 1987.Google Scholar
- 11.M. Haghighat and C. Polychronopoulos. Symbo}tic analysis: A basis for parallelization, optimization and scheduling of programs. U. Banerjee et al., ed., Languages and Compilers for Parallel Computi~,.g. Springer-Verlag, Aug. 1993. LNCS 768, Proc. of the 6th annual worshop on Programming Languages and Compzlers for Parallel Computing. Google ScholarDigital Library
- 12.M. Haghighat and C. Polychronopoulos. Symbolic analysis: A basis for parallelization, optimization and scheduling of programs. Technical Report 1317, CSRD, Univ. of Illinois, Aug. 1993.Google Scholar
- 13.V. Loechner and D. K. Wilde. Parameterized polyhedra and their vertices. Research Report ICPS 95-16, Submitted to publication, 1995. http://lops, u-strasbg, fr/pub-95/pub-95-16, ps. gzGoogle Scholar
- 14.I. G. Macdonald. The volume of a lattice polyhedron. Proc. Camb. Phil. Soc., 59:719-726, 1963.Google ScholarCross Ref
- 15.I. G. Macdonald. Polynomials associated with finite cell-complexes. J. London Math. Soc., 4(2):181-192, 1971.Google ScholarCross Ref
- 16.W. Pugh. Counting Solutions to Presburger Formulas: How and Why. Proc. of the 199d A UM SIGPLAN Conf. on Programming Language Deszgn and implementation, 1994. Google ScholarDigital Library
- 17.A. Schrijver. Theory of Linear and Integer Programruing. Wiley, New York, 1986. Google ScholarDigital Library
- 18.H. S. Stone and D. Thiebaut. Footprints in the cache. Proc. A CM SIGMETRICS 1986, pp. 4-8, May 1986. Google ScholarDigital Library
- 19.R. P. Stanley. Combinatorics and Commutative Algebra. Birkh~iuser, Boston, 1983.Google ScholarCross Ref
- 20.R. P. Stanley. Enumerative Combinatorics Volume I. Wadsworth & Brooks/Cole, Monterey, California, 1986. Google ScholarDigital Library
- 21.N. Tawbi. Estimation of nested loop execution time by integer arithmetics in convex polyhedra. Proc. of the 199J Int. Parallel Processing Syrup., Apr. 1994. Google ScholarDigital Library
- 22.N. Tawbi and P. Feautrier. Processor allocation and loop scheduling on multiprocessor computers. Proc. of the 1992 Int. Conf. on Supercomputing, pages 63-71, july 1992. Google ScholarDigital Library
- 23.D. K. Wilde. A library for doing polyhedral operation~. Master's thesis, Oregon State Univ., Corvallis, Oregon, december 1993. Also published as IRISA technical report PI 785, Rennes, France, dec. 1993.Google Scholar
Index Terms
- Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs
Recommendations
Author retrospective for counting solutions to linear and nonlinear constraints through ehrhart polynomials: applications to analyze and transform scientific programs
ACM International Conference on Supercomputing 25th Anniversary VolumeEhrhart polynomials are amazing mathematical objects that I discovered in the early 90's and that have many applications in computer science. This retrospective relates my personal and scientific experience regarding this research work, my meeting with ...
Lagrangean decomposition for integer nonlinear programming with linear constraints
We present a Lagrangean decomposition to study integer nonlinear programming problems. Solving the dual Lagrangean relaxation we have to obtain at each iteration the solution of a nonlinear programming with continuous variables and an integer linear ...
On linear programs with linear complementarity constraints
The paper is a manifestation of the fundamental importance of the linear program with linear complementarity constraints (LPCC) in disjunctive and hierarchical programming as well as in some novel paradigms of mathematical programming. In addition to ...
Comments