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.
5655 Publications
2018 | Published | Journal Article | IST-REx-ID: 556 |

Betea, D., Bouttier, J., Nejjar, P., & Vuletic, M. (2018). The free boundary Schur process and applications I. Annales Henri Poincare. Springer Nature. https://doi.org/10.1007/s00023-018-0723-1
[Published Version]
View
| Files available
| DOI
| arXiv
2018 | Draft | Preprint | IST-REx-ID: 6183 |

Alt, J., Erdös, L., & Krüger, T. H. (n.d.). The Dyson equation with linear self-energy: Spectral bands, edges and cusps. arXiv. https://doi.org/10.48550/arXiv.1804.07752
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 70 |

Nejjar, P. (2018). Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. Instituto Nacional de Matematica Pura e Aplicada. https://doi.org/10.30757/ALEA.v15-49
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 5971 |

Erdös, L., & Mühlbacher, P. (2018). Bounds on the norm of Wigner-type random matrices. Random Matrices: Theory and Applications. World Scientific Publishing. https://doi.org/10.1142/s2010326319500096
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
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. Springer. https://doi.org/10.1007/s00440-017-0787-8
[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. Elsevier. https://doi.org/10.1016/j.tcs.2017.11.001
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 133 |

Kragl, B., Qadeer, S., & Henzinger, T. A. (2018). Synchronizing the asynchronous (Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.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. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer. https://doi.org/10.1007/978-3-030-02768-1_11
[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 (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 142 |

Kong, H., Bartocci, E., & Henzinger, T. A. (2018). Reachable set over-approximation for nonlinear systems using piecewise barrier tubes (Vol. 10981, pp. 449–467). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96145-3_24
[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 (Vol. 11022, pp. 215–232). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China: Springer. https://doi.org/10.1007/978-3-030-00151-3_13
[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 (Vol. 10981, pp. 79–102). Presented at the CAV: Computer Aided Verification, Oxford, UK: Springer. https://doi.org/10.1007/978-3-319-96145-3_5
[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. IEEE. https://doi.org/10.1109/TITS.2017.2778077
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 140 |

Frehse, G., Giacobbe, M., & Henzinger, T. A. (2018). Space-time interpolants (Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96145-3_25
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Conference Paper | IST-REx-ID: 5788 |

Avni, G., Henzinger, T. A., & Ibsen-Jensen, R. (2018). Infinite-duration poorman-bidding games (Vol. 11316, pp. 21–36). Presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK: Springer. https://doi.org/10.1007/978-3-030-04612-5_2
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 143 |

Brázdil, T., Chatterjee, K., Kučera, A., Novotný, P., Velan, D., & Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE. https://doi.org/10.1145/3209108.3209191
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS