@inproceedings{ben2019tight,
  title={Tight worst-case bounds for polynomial loop programs},
  author={Ben-Amram, Amir M and Hamilton, Geoff W},
  booktitle={Foundations of Software Science and Computation Structures: 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6--11, 2019, Proceedings 22},
  pages={80--97},
  year={2019},
  organization={Springer}
}

{"_id":"fHCaH9sfkSuDxMdYc","bibbaseid":"benamram-hamilton-tightworstcaseboundsforpolynomialloopprograms-2019","author_short":["Ben-Amram, A. M","Hamilton, G. W"],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Tight worst-case bounds for polynomial loop programs","author":[{"propositions":[],"lastnames":["Ben-Amram"],"firstnames":["Amir","M"],"suffixes":[]},{"propositions":[],"lastnames":["Hamilton"],"firstnames":["Geoff","W"],"suffixes":[]}],"booktitle":"Foundations of Software Science and Computation Structures: 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings 22","pages":"80–97","year":"2019","organization":"Springer","bibtex":"@inproceedings{ben2019tight,\r\n title={Tight worst-case bounds for polynomial loop programs},\r\n author={Ben-Amram, Amir M and Hamilton, Geoff W},\r\n booktitle={Foundations of Software Science and Computation Structures: 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6--11, 2019, Proceedings 22},\r\n pages={80--97},\r\n year={2019},\r\n organization={Springer}\r\n}\r\n\r\n","author_short":["Ben-Amram, A. M","Hamilton, G. W"],"key":"ben2019tight","id":"ben2019tight","bibbaseid":"benamram-hamilton-tightworstcaseboundsforpolynomialloopprograms-2019","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/gPphjBYBLpLzBPCcQ","dataSources":["4G5r4SmwZBdMjH3KL"],"keywords":[],"search_terms":["tight","worst","case","bounds","polynomial","loop","programs","ben-amram","hamilton"],"title":"Tight worst-case bounds for polynomial loop programs","year":2019}