Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
9202 Publications
2019 |Published| Conference Paper | IST-REx-ID: 6648 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 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)
N. Zenmyo et al., “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, vol. 92, no. 5. Bulletin of the Chemical Society of Japan, pp. 995–1000, 2019.
[Published Version]
View
| Files available
| DOI
2019 |Published| Journal Article | IST-REx-ID: 6662 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Mondelli and A. Montanari, “Fundamental limits of weak recovery with applications to phase retrieval,” Foundations of Computational Mathematics, vol. 19, no. 3. Springer, pp. 703–773, 2019.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 6672 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
J.-D. Boissonnat, M. Rouxel-Labbé, and M. Wintraecken, “Anisotropic triangulations via discrete Riemannian Voronoi diagrams,” SIAM Journal on Computing, vol. 48, no. 3. Society for Industrial & Applied Mathematics (SIAM), pp. 1046–1097, 2019.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6725 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th International Colloquium on Automata, Languages and Programming, Patras, Greece, 2019, vol. 132, p. 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)
M. Walter, “Sampling the integers with low relative error,” in Progress in Cryptology – AFRICACRYPT 2019, vol. 11627, J. Buchmann, A. Nitaj, and T. Rachidi, Eds. Cham: Springer Nature, 2019, pp. 157–180.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2019 |Published| Journal Article | IST-REx-ID: 6663 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Mondelli, H. Hassani, and R. Urbanke, “Construction of polar codes with sublinear complexity,” IEEE, vol. 65, no. 5. IEEE, pp. 2782–2791, 2019.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6747 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Mondelli and A. Montanari, “On the connection between learning two-layers neural networks and tensor decomposition,” in Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, Naha, Okinawa, Japan, 2019, vol. 89, pp. 1051–1060.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 6750 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
S. A. Hashemi, C. Condo, M. Mondelli, and W. J. Gross, “Rate-flexible fast polar decoders,” IEEE Transactions on Signal Processing, vol. 67, no. 22. IEEE, 2019.
[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)
V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” Electronic Journal of Combinatorics, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019.
[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)
G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 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)
K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140.
[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)
M. Lechner, R. Hasani, M. Zimmer, T. A. Henzinger, and R. Grosu, “Designing worm-inspired neural networks for interpretable robotic control,” in Proceedings - IEEE International Conference on Robotics and Automation, Montreal, QC, Canada, 2019, vol. 2019–May.
[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)
M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.
[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)
K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.
[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)
K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.
[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)
T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd International Symposium on Distributed Computing, Budapest, Hungary, 2019, vol. 146, p. 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)
R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, and D. Rus, “Response characterization for auditing cell dynamics in long short-term memory networks,” in Proceedings of the International Joint Conference on Neural Networks, Budapest, Hungary, 2019.
[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)
M. Mondelli, S. H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive relay channel,” Algorithms, vol. 12, no. 10. MDPI, 2019.
[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)
G. P. Geher, T. Titkos, and D. Virosztek, “Dirac masses and isometric rigidity,” in Kyoto RIMS Kôkyûroku, Kyoto, Japan, 2019, vol. 2125, pp. 34–41.
[Submitted Version]
View
| Download Submitted Version (ext.)