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.
1953 Publications
2019 |Published| Conference Paper | IST-REx-ID: 11826 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Ancona, Bertie, et al. “Algorithms and Hardness for Diameter in Dynamic Graphs.” 46th International Colloquium on Automata, Languages, and Programming, vol. 132, 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ICALP.2019.13.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 11850 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Henzinger, Monika H., et al. “Efficient Distributed Workload (Re-)Embedding.” SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2019, pp. 43–44, doi:10.1145/3309697.3331503.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 11853 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Bhattacharya, Sayan, et al. “A New Deterministic Algorithm for Dynamic Set Cover.” 60th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2019, pp. 406–23, doi:10.1109/focs.2019.00033.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 11851
Henzinger, Monika H., et al. “Shared-Memory Exact Minimum Cuts.” 33rd International Parallel and Distributed Processing Symposium, 8820968, Institute of Electrical and Electronics Engineers, 2019, doi:10.1109/ipdps.2019.00013.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 11871 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” 30th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019, pp. 1899–918, doi:10.1137/1.9781611975482.115.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 11984 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Guberman, Mónica, et al. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” Organic Process Research and Development, vol. 23, no. 12, American Chemical Society, 2019, pp. 2764–70, doi:10.1021/acs.oprd.9b00456.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2019 |Published| Journal Article | IST-REx-ID: 170 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Browning, Timothy D., and Efthymios Sofos. “Counting Rational Points on Quartic Del Pezzo Surfaces with a Rational Conic.” Mathematische Annalen, vol. 373, no. 3–4, Springer Nature, 2019, pp. 977–1016, doi:10.1007/s00208-018-1716-6.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Book Chapter | IST-REx-ID: 5793
Asaoka, Yoichi, et al. “Studying YAP-Mediated 3D Morphogenesis Using Fish Embryos and Human Spheroids.” The Hippo Pathway, edited by Alexander Hergovich, vol. 1893, Springer, 2019, pp. 167–81, doi:10.1007/978-1-4939-8910-2_14.
View
| DOI
2019 |Published| Conference Paper | IST-REx-ID: 6163
Biswas, Ranita, et al. “Rhombic Dodecahedron Grid—Coordinate System and 3D Digital Object Definitions.” 21st IAPR International Conference on Discrete Geometry for Computer Imagery, vol. 11414, Springer Berlin Heidelberg, 2019, pp. 27–37, doi:10.1007/978-3-030-14085-4_3.
View
| DOI
2019 |Published| Conference Paper | IST-REx-ID: 6528 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” 10th Innovations in Theoretical Computer Science Conference, vol. 124, 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ITCS.2019.60.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2019 |Published| Conference Paper | IST-REx-ID: 6628 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–79.
[Submitted Version]
View
| Files available
2019 |Published| Journal Article | IST-REx-ID: 6672 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Boissonnat, Jean-Daniel, et al. “Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.” SIAM Journal on Computing, vol. 48, no. 3, Society for Industrial & Applied Mathematics (SIAM), 2019, pp. 1046–97, doi:10.1137/17m1152292.
[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)
Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77.
[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, Michael. “Sampling the Integers with Low Relative Error.” Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann et al., vol. 11627, Springer Nature, 2019, pp. 157–80, doi:10.1007/978-3-030-23696-0_9.
[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)
Mondelli, Marco, et al. “Construction of Polar Codes with Sublinear Complexity.” IEEE, vol. 65, no. 5, IEEE, 2019, pp. 2782–91, doi:10.1109/tit.2018.2889667.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6822 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1.
[Submitted 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, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” 33rd International Symposium on Distributed Computing, vol. 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi:10.4230/LIPICS.DISC.2019.29.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 7150 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Censor-Hillel, Keren, et al. “Algebraic Methods in the Congested Clique.” Distributed Computing, vol. 32, no. 6, Springer Nature, 2019, pp. 461–78, doi:10.1007/s00446-016-0270-2.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 |Published| Book (Editor) | IST-REx-ID: 7171
Kersting, Kristian, et al., editors. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed., Springer Nature, 2019, doi:10.1007/978-3-658-26763-6.
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, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.” 35th International Symposium on Computational Geometry (SoCG 2019), vol. 129, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.SOCG.2019.39.
[Published Version]
View
| Files available
| DOI
| arXiv