{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:28:28Z","timestamp":1781893708380,"version":"3.54.5"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/lics.2017.8005090","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T16:43:24Z","timestamp":1502383404000},"page":"1-12","source":"Crossref","is-referenced-by-count":2,"title":["Computing quantiles in Markov chains with multi-dimensional costs"],"prefix":"10.1109","author":[{"given":"Christoph","family":"Haase","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Kiefer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08342-1_37"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_94"},{"key":"ref31","first-page":"1","article-title":"Variations on the stochastic shortest path problem","author":"randour","year":"2015","journal-title":"Proc VMCAI 2015 volume 8931 of LNCS"},{"key":"ref30","first-page":"123","article-title":"Percentile queries in multidimensional Markov decision processes","author":"randour","year":"2015","journal-title":"Proc CAV 2015 Part I volume 9206 of LNCS"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37075-5_23"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116858"},{"key":"ref35","first-page":"249","article-title":"A temporal logic with mean-payoff constraints","author":"tomita","year":"2012","journal-title":"Proc ICFEM 2012 volume 7635 of LNCS"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/0220053"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2629686"},{"key":"ref11","first-page":"259","article-title":"Counting eulerian circuits is #P-complete","author":"brightwell","year":"2005","journal-title":"Proc ALENEX \/ ANALCO 2005"},{"key":"ref12","first-page":"199","article-title":"Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games","author":"bruy\u00e8re","year":"2014","journal-title":"Proc STACS 2014 volume 25 of LIPlcs"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0260-x"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.32"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.33"},{"key":"ref16","first-page":"454","article-title":"How to specify and verify the long-run average behavior of probabilistic systems","author":"de alfaro","year":"1998","journal-title":"Proc LICS 1998"},{"key":"ref17","first-page":"337","article-title":"Z3: an efficient SMT solver","author":"de moura","year":"2008","journal-title":"Proc TACAS 2008 volume 4963 of LNCS"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_19"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.ipl.2015.09.015","article-title":"The complexity of the Kth largest subset problem and related problems","volume":"116","author":"haase","year":"2016","journal-title":"Inf Process Lett"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref4","first-page":"182","article-title":"Counting hierarchies: Polynomial time and constant depth circuits","volume":"40","author":"allender","year":"1990","journal-title":"Bulletin of the EATCS"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31982-5_9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/070697926"},{"key":"ref6","author":"baier","year":"2008","journal-title":"Principles of Model Checking"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-53904-2_94"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06200-6_24"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17142-5_26"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603162"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44465-8_2"},{"key":"ref9","first-page":"246","article-title":"Counting Euler tours in undirected bounded treewidth graphs","author":"balaji","year":"2015","journal-title":"Proc FSTTCS 2015 volume 45 of LIPlcs"},{"key":"ref1","author":"aigner","year":"2007","journal-title":"A Course in Enumeration volume 238 of Graduate Texts in Mathematics"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_60"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49498-1_15"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00025-9"},{"key":"ref24","first-page":"349","article-title":"Advances in symbolic probabilistic model checking with PRISM","author":"klein","year":"2016","journal-title":"Proc TACAS 2016 volume 9636 of LNCS"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2010.04.001"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/0218073"},{"key":"ref25","first-page":"585","article-title":"PRISM 4. 0: Verification of probabilistic real-time systems","author":"kwiatkowska","year":"2011","journal-title":"Proc CAV 2011 volume 6806 of LNCS"}],"event":{"name":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Reykjavik, Iceland","start":{"date-parts":[[2017,6,20]]},"end":{"date-parts":[[2017,6,23]]}},"container-title":["2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999337\/8005055\/08005090.pdf?arnumber=8005090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T03:39:11Z","timestamp":1569987551000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8005090\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/lics.2017.8005090","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}