Login (DCU Staff Only)
Login (DCU Staff Only)

DORAS | DCU Research Repository

Explore open access research and scholarly works from DCU

Advanced Search

Browse by Author

[up] Up a level
[Atom feed] Atom [RSS feed] RSS 1.0 [RSS2 feed] RSS 2.0
Group by: Date | No Grouping
Number of items: 4.

Ben-Amram, Amir M. and Hamilton, Geoff orcid logoORCID: 0000-0001-5954-6444 (2020) Tight polynomial worst-case bounds for loop programs. Logical Methods in Computer Science, 16 (2). ISSN 1860-5974

Ben-Amram, Amir M. and Hamilton, Geoff orcid logoORCID: 0000-0001-5954-6444 (2020) Tight polynomial worst-case bounds for loop programs. Logical Methods in Computer Science, 16 (2). 4:1-4:39. ISSN 1860-5974

Ben-Amram, Amir M. and Hamilton, Geoff orcid logoORCID: 0000-0001-5954-6444 (2019) Tight Worst-Case Bounds for Polynomial Loop Programs. In: International Conference on Foundations of Software Science and Computation Structures, 8-11 April 2019, Prague, Czech Republic. ISBN 978-3-030-17126-1

Ben-Amram, Amir M. and Hamilton, Geoff orcid logoORCID: 0000-0001-5954-6444 (2019) Tight polynomial bounds for Loop programs in polynomial space. In: International Conference on Foundations of Software Science and Computation Structures, 8-11 Apr 2019, Prague, Czech Republic. ISBN 978-3-030-17126-1

This list was generated on Mon Feb 17 02:18:28 2025 UTC.