PolyLib

swMATH9923MaRDI QIDQ21902FDOQ21902

Author name not available (Why is that?)

Cited In (46)

• Two variations of graph test in double description method
• Verification, Model Checking, and Abstract Interpretation
• Geometrical Analysis of Model Predictive Control: A Parameterized Polyhedra Approach
• Mostly automated formal verification of loop dependencies with applications to distributed stencil algorithms
• A 3D unsplit forward/backward volume-of-fluid approach and coupling to the level set method
• Optimal systolic array algorithms for tensor product
• Title not available (Why is that?)
• Title not available (Why is that?)
• Precise data locality optimization of nested loops
• Necessary and sufficient conditions for reachability on a simplex
• A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
• Linear Vector Optimization and European Option Pricing Under Proportional Transaction Costs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Petri net realization of context-free graphs
• A control problem for affine dynamical systems on a full-dimensional polytope.
• isl: An Integer Set Library for the Polyhedral Model
• Mostly Automated Formal Verification of Loop Dependencies with Applications to Distributed Stencil Algorithms
• Applications of polyhedral computations to the analysis and verification of hardware and software systems
• Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets
• Predictive control for hybrid systems. Implications of polyhedral pre-computations
• Title not available (Why is that?)
• An example of probability computations under the IAC assumption: the stability of scoring rules
• Title not available (Why is that?)
• On Ehrhart polynomials and probability calculations in voting theory
• Hybrid abstractions of affine systems
• Counting integer points in parametric polytopes using Barvinok's rational functions
• On highly robust efficient solutions to uncertain multiobjective linear programs
• The two variable per inequality abstract domain
• Correct Hardware Design and Verification Methods
• A complexity perspective on entailment of parameterized linear constraints
• Efficient Elimination of Redundancies in Polyhedra by Raytracing
• Enumeration of $4 \times 4$ magic squares
• An improved algorithm for combinatorial multi-parametric quadratic programming
• Elementary Functions
• Automatic implementation of affine iterative algorithms: Design flow and communication synthesis
• Title not available (Why is that?)
• Some ways to reduce the space dimension in polyhedra computations
• Guaranteed active failure detection and isolation for linear dynamical systems
• Combinatorial optimization and small polytopes
• Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method?
• Title not available (Why is that?)
• Computing machine-efficient polynomial approximations
• Solving strong controllability of temporal problems with uncertainty using SMT
• Grids: A Domain for Analyzing the Distribution of Numerical Values
• Ranking Functions for Linear-Constraint Loops

This page was built for software: PolyLib