Skip to main content
Journal ArticleOPEN ACCESS

Periodic polyhedra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 2985 134-149
DOI: 10.1007/978-3-540-24723-4_10
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a new method for computing the integer hull of a parameterized rational polyhedron by introducing the concept of periodic polyhedron. Besides concerning generally parametric combinatorial optimization, the method has many applications for the analysis, optimization and parallelization of loop nests, especially in compilers. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Meister, B. (2004). Periodic polyhedra. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2985, 134–149. https://doi.org/10.1007/978-3-540-24723-4_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free