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.
5250 Publications
2019 |Published| Conference Paper | IST-REx-ID: 6628 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Vegter G, Wintraecken M. 2019. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. The 31st Canadian Conference in Computational Geometry. CCCG: Canadian Conference in Computational Geometry, 275–279.
[Submitted Version]
View
| Files available
2019 |Published| Conference Paper | IST-REx-ID: 6648 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Edelsbrunner H, Virk Z, Wagner H. 2019. Topological data analysis in information space. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 31:1-31:14.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 6659 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Zenmyo N, Tokumaru H, Uchinomiya S, Fuchida H, Tabata S, Hamachi I, Shigemoto R, Ojida A. 2019. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 92(5), 995–1000.
[Published Version]
View
| Files available
| DOI
2019 |Published| Conference Paper | IST-REx-ID: 6725 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th International Colloquium on Automata, Languages and Programming. ICALP 2019: International Colloquim on Automata, Languages and Programming, LIPIcs, vol. 132, 77:1-77:12.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Book Chapter | IST-REx-ID: 6726 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Walter M. 2019.Sampling the integers with low relative error. In: Progress in Cryptology – AFRICACRYPT 2019. vol. 11627, 157–180.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2019 |Published| Journal Article | IST-REx-ID: 6750 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Hashemi SA, Condo C, Mondelli M, Gross WJ. 2019. Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. 67(22), 8854897.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 6759 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 26(3), P3.17.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6822 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov decision processes. Proceedings of the 13th International Conference of Reachability Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.
[Submitted Version]
View
| Files available
| DOI
2019 |Published| Conference Paper | IST-REx-ID: 6887 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 7.
[Published Version]
View
| Files available
| DOI
2019 |Published| Conference Paper | IST-REx-ID: 6888 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. 2019. Designing worm-inspired neural networks for interpretable robotic control. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, vol. 2019–May, 8793840.
[Submitted Version]
View
| Files available
| DOI
2019 |Published| Conference Paper | IST-REx-ID: 6886 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Aghajohari M, Avni G, Henzinger TA. 2019. Determinacy in discrete-bidding infinite-duration games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 20.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6885 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 27.
[Published Version]
View
| Files available
| DOI
2019 |Published| Conference Paper | IST-REx-ID: 6889 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.
[Published Version]
View
| Files available
| DOI
2019 |Published| Conference Paper | IST-REx-ID: 6931 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Nowak T, Rybicki J. 2019. Byzantine approximate agreement on graphs. 33rd International Symposium on Distributed Computing. DISC: International Symposium on Distributed Computing, LIPIcs, vol. 146, 29:1--29:17.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6985 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. 2019. Response characterization for auditing cell dynamics in long short-term memory networks. Proceedings of the International Joint Conference on Neural Networks. IJCNN: International Joint Conference on Neural Networks, 8851954.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 7007 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Mondelli M, Hassani SH, Urbanke R. 2019. A new coding paradigm for the primitive relay channel. Algorithms. 12(10), 218.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 7035 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Geher GP, Titkos T, Virosztek D. 2019. Dirac masses and isometric rigidity. Kyoto RIMS Kôkyûroku. Research on isometries as preserver problems and related topics vol. 2125, 34–41.
[Submitted Version]
View
| Download Submitted Version (ext.)
2019 |Published| Book (Editor) | IST-REx-ID: 7171
Kersting K, Lampert C, Rothkopf C eds. 2019. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt 1st ed., Wiesbaden: Springer Nature, XIV, 245p.
View
| Files available
| DOI
2019 |Published| Conference Paper | IST-REx-ID: 7401 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Fulek R, Kyncl J. 2019. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. 35th International Symposium on Computational Geometry (SoCG 2019). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129, 39.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Book Chapter | IST-REx-ID: 7453 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. 2019.Continuous-time models for system design and analysis. In: Computing and Software Science. Lecture Notes in Computer Science, vol. 10000, 452–477.
[Published Version]
View
| DOI
| Download Published Version (ext.)