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.
1481 Publications
2017 |Published| Conference Paper | IST-REx-ID: 5801
S. Dwivedi, A. Gupta, S. Roy, R. Biswas, and P. Bhowmick, “Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space,” in 20th IAPR International Conference, Vienna, Austria, 2017, vol. 10502, pp. 347–359.
View
| DOI
2017 |Published| Journal Article | IST-REx-ID: 610 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result,” Israel Journal of Mathematics, vol. 222, no. 2. Springer, pp. 841–866, 2017.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2017 |Published| Book Chapter | IST-REx-ID: 623
E. Hill Yardin, S. Mckeown, G. Novarino, and A. Grabrucker, “Extracerebral dysfunction in animal models of autism spectrum disorder,” in Translational Anatomy and Cell Biology of Autism Spectrum Disorder, vol. 224, M. Schmeisser and T. Boekers, Eds. Springer, 2017, pp. 159–187.
View
| DOI
2017 |Published| Book Chapter | IST-REx-ID: 625 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, L. Doyen, and T. A. Henzinger, “The cost of exactness in quantitative reachability,” in Models, Algorithms, Logics and Tools, vol. 10460, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, and R. Mardare, Eds. Springer, 2017, pp. 367–381.
[Submitted Version]
View
| Files available
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 628 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, H. Fu, and A. Murhekar, “Automated recurrence analysis for almost linear expected runtime bounds,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 118–139.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Journal Article | IST-REx-ID: 632 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Lewin, P. Nam, and N. Rougerie, “A note on 2D focusing many boson systems,” Proceedings of the American Mathematical Society, vol. 145, no. 6. American Mathematical Society, pp. 2441–2454, 2017.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Technical Report | IST-REx-ID: 6426 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
T. A. Henzinger, B. Kragl, and S. Qadeer, Synchronizing the asynchronous. IST Austria, 2017.
[Published Version]
View
| Files available
| DOI
2017 |Published| Journal Article | IST-REx-ID: 643
W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, and C. Jiang, “Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats,” Chinese Journal of Physiology, vol. 60, no. 4. Chinese Physiological Society, pp. 207–214, 2017.
[Published Version]
View
| DOI
| PubMed | Europe PMC
2017 |Published| Conference Paper | IST-REx-ID: 645 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 6519 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82.
[Published Version]
View
| Files available
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 6729 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Mondelli, S. H. Hassani, and R. Urbanke, “Construction of polar codes with sublinear complexity,” in 2017 IEEE International Symposium on Information Theory , Aachen, Germany, 2017, pp. 1853–1857.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2017 |Published| Conference Paper | IST-REx-ID: 6731 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Mondelli, H. Hassani, I. Maric, D. Hui, and S.-N. Hong, “Capacity-achieving rate-compatible polar codes for general channels,” in 2017 IEEE Wireless Communications and Networking Conference Workshops , San Francisco, CA, USA, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 |Published| Journal Article | IST-REx-ID: 693 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
T. Miki et al., “Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses,” PNAS, vol. 114, no. 26. National Academy of Sciences, pp. E5246–E5255, 2017.
[Published Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2017 |Published| Conference Paper | IST-REx-ID: 697 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Z. Pietrzak and M. Skórski, “Non uniform attacks against pseudoentropy,” presented at the ICALP: International Colloquium on Automata, Languages, and Programming, Warsaw, Poland, 2017, vol. 80.
[Published Version]
View
| Files available
| DOI
2017 |Published| Journal Article | IST-REx-ID: 701 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
J. Kynčl and Z. Patakova, “On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4,” The Electronic Journal of Combinatorics, vol. 24, no. 3. International Press, pp. 1–44, 2017.
[Submitted Version]
View
| Files available
2017 |Published| Conference Paper | IST-REx-ID: 710 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Obremski and M. Skórski, “Renyi entropy estimation revisited,” presented at the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, Berkeley, USA, 2017, vol. 81.
[Published Version]
View
| Files available
| DOI
2017 |Published| Journal Article | IST-REx-ID: 716 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee and Y. Velner, “The complexity of mean-payoff pushdown games,” Journal of the ACM, vol. 64, no. 5. ACM, p. 34, 2017.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv