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.
7047 Publications
2012 |Published| Conference Paper | IST-REx-ID: 497 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement Relations. Vol. 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–82, doi:10.4230/LIPIcs.CSL.2012.167.
[Published Version]
View
| Files available
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 3165 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu, and Monika H. Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–99, doi:10.1137/1.9781611973099.109.
View
| Files available
| DOI
| Download None (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 2956
Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280438, IEEE, 2012, doi:10.1109/LICS.2012.30.
View
| Files available
| DOI
2012 |Published| Technical Report | IST-REx-ID: 5377 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games. IST Austria, 2012, doi:10.15479/AT:IST-2012-0002.
[Published Version]
View
| Files available
| DOI
2012 |Published| Technical Report | IST-REx-ID: 5378 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement Relations. IST Austria, 2012, doi:10.15479/AT:IST-2012-0001.
[Published Version]
View
| Files available
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 2955 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280436, IEEE, 2012, doi:10.1109/LICS.2012.28.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 3341 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. Vol. 7213, Springer, 2012, pp. 270–85, doi:10.1007/978-3-642-28729-9_18.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 2957 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280437, IEEE, 2012, doi:10.1109/LICS.2012.29.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 |Published| Journal Article | IST-REx-ID: 3249
Cerny, Pavol, et al. “Simulation Distances.” Theoretical Computer Science, vol. 413, no. 1, Elsevier, 2012, pp. 21–35, doi:10.1016/j.tcs.2011.08.002.
View
| Files available
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 3124 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. ICML, 2012.
[Submitted Version]
View
| Files available
2012 |Published| Technical Report | IST-REx-ID: 5396 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. IST Austria, 2012, doi:10.15479/AT:IST-2012-0003.
[Published Version]
View
| Files available
| DOI
2012 |Published| Report | IST-REx-ID: 5398 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Porsche, Jana. Actual State of Research Data @ ISTAustria. IST Austria, 2012.
[Published Version]
View
| Files available
2012 |Published| Journal Article | IST-REx-ID: 5839 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Biswas, Ranita, and Jaya Sil. “An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets.” Procedia Technology, vol. 4, Elsevier, 2012, pp. 820–24, doi:10.1016/j.protcy.2012.05.134.
[Published Version]
View
| Files available
| DOI
2012 |Published| Journal Article | IST-REx-ID: 596 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Bernecky, Carrie, and Dylan Taatjes. “Activator-Mediator Binding Stabilizes RNA Polymerase II Orientation within the Human Mediator-RNA Polymerase II-TFIIF Assembly.” Journal of Molecular Biology, vol. 417, no. 5, Elsevier, 2012, pp. 387–94, doi:10.1016/j.jmb.2012.02.014.
View
| DOI
| Download None (ext.)
2012 |Published| Journal Article | IST-REx-ID: 6136 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Busch, Karl Emanuel, et al. “Tonic Signaling from O2 Sensors Sets Neural Circuit Activity and Behavioral State.” Nature Neuroscience, vol. 15, no. 4, Springer Nature, 2012, pp. 581–91, doi:10.1038/nn.3061.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2012 |Published| Conference Paper | IST-REx-ID: 762
Alistarh, Dan-Adrian, et al. On the Cost of Composing Shared-Memory Algorithms. ACM, 2012, pp. 298–307, doi:10.1145/2312005.2312057.
View
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 763
Alistarh, Dan-Adrian, et al. Early Deciding Synchronous Renaming in O(Log f) Rounds or Less. Vol. 7355 LNCS, Springer, 2012, pp. 195–206, doi:10.1007/978-3-642-31104-8_17.
View
| DOI
2012 |Published| Journal Article | IST-REx-ID: 764
Alistarh, Dan-Adrian, et al. “Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.” Algorithmica (New York), vol. 62, no. 1–2, Springer, 2012, pp. 595–629, doi:10.1007/s00453-011-9581-7.
View
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 766
Alistarh, Dan-Adrian, et al. How to Allocate Tasks Asynchronously. IEEE, 2012, pp. 331–40, doi:10.1109/FOCS.2012.41.
View
| DOI
2012 |Published| Journal Article | IST-REx-ID: 767
Alistarh, Dan-Adrian, et al. “Generating Fast Indulgent Algorithms.” Theory of Computing Systems, vol. 51, no. 4, Elsevier, 2012, pp. 404–24, doi:10.1007/s00224-012-9407-2.
View
| DOI