An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints (Q2803820): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q261361 / rank
Normal rank
 
Property / author
 
Property / author: Piotr J. Wojciechowski / rank
Normal rank
 
Property / author
 
Property / author: K. Subramani and Vahan Mkrtchyan / rank
 
Normal rank
Property / author
 
Property / author: Piotr J. Wojciechowski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-30139-6_13 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2495050057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric dispatching of hard real-time tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frontiers of Combining Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The octagon abstract domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graphical Theorem of the Alternative for UTVPI Constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:35, 11 July 2024

scientific article
Language Label Description Also known as
English
An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints
scientific article

    Statements

    An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints (English)
    0 references
    3 May 2016
    0 references
    UTVPI constraints
    0 references
    relaxation
    0 references
    Dijkstra steps
    0 references
    optimal
    0 references
    closure
    0 references

    Identifiers