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.
2032 Publications
2017 |Published| Journal Article | IST-REx-ID: 632 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Lewin M, Nam P, Rougerie N. 2017. A note on 2D focusing many boson systems. Proceedings of the American Mathematical Society. 145(6), 2441–2454.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 645 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426, 201–221.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 650 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Skórski M. 2017. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 586–599.
[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)
Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82, 18.
[Published Version]
View
| Files available
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 6526 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Skórski M. 2017. On the complexity of estimating Rènyi divergences. 2017 IEEE International Symposium on Information Theory (ISIT). ISIT: International Symposium on Information Theory, 8006529.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 |Published| Journal Article | IST-REx-ID: 669 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Synek L, Vukašinović N, Kulich I, Hála M, Aldorfová K, Fendrych M, Žárský V. 2017. EXO70C2 is a key regulatory factor for optimal tip growth of pollen. Plant Physiology. 174(1), 223–240.
[Submitted Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2017 |Published| Conference Paper | IST-REx-ID: 6679 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Hashemi SA, Mondelli M, Hassani H, Urbanke R, Gross W. 2017. Partitioned list decoding of polar codes: Analysis and improvement of finite length performance. 2017 IEEE Global Communications Conference. GLOBECOM: Global Communications Conference, 1–7.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 |Published| Conference Paper | IST-REx-ID: 6729 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Mondelli M, Hassani SH, Urbanke R. 2017. Construction of polar codes with sublinear complexity. 2017 IEEE International Symposium on Information Theory . ISIT: International Symposium on Information Theory, 1853–1857.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2017 |Published| Journal Article | IST-REx-ID: 6730 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kudekar S, Kumar S, Mondelli M, Pfister HD, Sasoglu E, Urbanke RL. 2017. Reed–Muller codes achieve capacity on erasure channels. IEEE Transactions on Information Theory. 63(7), 4298–4316.
[Preprint]
View
| 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)
Mondelli M, Hassani H, Maric I, Hui D, Hong S-N. 2017. Capacity-achieving rate-compatible polar codes for general channels. 2017 IEEE Wireless Communications and Networking Conference Workshops . WCNCW: Wireless communications and networking conference workshops, 7919107.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 |Published| Journal Article | IST-REx-ID: 684 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Piterman N. 2017. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 82(2), 420–452.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Journal Article | IST-REx-ID: 693 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Miki T, Kaufmann W, Malagon G, Gomez L, Tabuchi K, Watanabe M, Shigemoto R, Marty A. 2017. Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses. PNAS. 114(26), E5246–E5255.
[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)
Pietrzak KZ, Skórski M. 2017. Non uniform attacks against pseudoentropy. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 80, 39.
[Published Version]
View
| Files available
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 710 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Obremski M, Skórski M. 2017. Renyi entropy estimation revisited. 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, LIPIcs, vol. 81, 20.
[Published Version]
View
| Files available
| DOI
2017 |Published| Journal Article | IST-REx-ID: 714 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Brailoiu G, Deliu E, Barr J, Console Bram L, Ciuciu A, Abood M, Unterwald E, Brǎiloiu E. 2017. HIV Tat excites D1 receptor-like expressing neurons from rat nucleus accumbens. Drug and Alcohol Dependence. 178, 7–14.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2017 |Published| Journal Article | IST-REx-ID: 716 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Velner Y. 2017. The complexity of mean-payoff pushdown games. Journal of the ACM. 64(5), 34.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 |Published| Journal Article | IST-REx-ID: 717 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Velner Y. 2017. Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. 88, 236–259.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2017 |Published| Journal Article | IST-REx-ID: 720 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Humplik J, Tkačik G. 2017. Probabilistic models for neural populations that naturally capture global coupling and criticality. PLoS Computational Biology. 13(9), e1005763.
[Published Version]
View
| Files available
| DOI