Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
5736 Publications
2018 | Published | Journal Article | IST-REx-ID: 690 | 
Lee J, Schnelli K. 2018. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 171(1–2), 543–616.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 608 |
Avni G, Kupferman O. 2018. Synthesis from component libraries with costs. Theoretical Computer Science. 712, 50–72.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 133 |
Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 118, 21.
[Published Version]
View
| Files available
| DOI
2018 | Published | Conference Paper | IST-REx-ID: 182 |
Bakhirkin, Alexey, Efficient parametric identification for STL. Proceedings of the 21st International Conference on Hybrid Systems. 2018
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 | Conference Paper | IST-REx-ID: 5679 |
Huang M, Fu H, Chatterjee K. 2018. New approaches for almost-sure termination of probabilistic programs. 16th Asian Symposium on Programming Languages and Systems, APLAS, LNCS, vol. 11275, 181–201.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 325 |
Agrawal S, Chatterjee K, Novotný P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2, 34.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 142 |
Kong H, Bartocci E, Henzinger TA. 2018. Reachable set over-approximation for nonlinear systems using piecewise barrier tubes. CAV: Computer Aided Verification, LNCS, vol. 10981, 449–467.
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 78 |
Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. 2018. Online timed pattern matching using automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 215–232.
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 5959 |
Bakhirkin, Alexey, Keynote: The first-order logic of signals. 2018 International Conference on Embedded Software. 2018
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 160 |
Kragl B, Qadeer S. 2018. Layered Concurrent Programs. CAV: Computer Aided Verification, LNCS, vol. 10981, 79–102.
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 156 |
Ferrere, Thomas, The compound interest in relaxing punctuality. 10951. 2018
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 | Published | Journal Article | IST-REx-ID: 434
Jiang Y, Liu H, Song H, Kong H, Wang R, Guan Y, Sha L. 2018. Safety-assured model-driven design of the multifunction vehicle bus controller. IEEE Transactions on Intelligent Transportation Systems. 19(10), 3320–3333.
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 140 |
Frehse G, Giacobbe M, Henzinger TA. 2018. Space-time interpolants. CAV: Computer Aided Verification, LNCS, vol. 10981, 468–486.
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Conference Paper | IST-REx-ID: 5788 |
Avni G, Henzinger TA, Ibsen-Jensen R. 2018. Infinite-duration poorman-bidding games. 14th International Conference on Web and Internet Economics, WINE, LNCS, vol. 11316, 21–36.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 25 |
Horák K, Bošanský B, Chatterjee K. 2018. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July, 4764–4770.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 24 |
Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 310 |
Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2018. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. SODA: Symposium on Discrete Algorithms, 2341–2356.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 35 |
Chatterjee, Krishnendu, Algorithms and conditional lower bounds for planning problems. 28th International Conference on Automated Planning and Scheduling . 2018
[Preprint]
View
| Files available
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 297 |
Brázdil T, Chatterjee K, Kretinsky J, Toman V. 2018. Strategy representation by decision trees in reactive synthesis. TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10805, 385–407.
[Published Version]
View
| Files available
| DOI
| WoS