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 K, Chaubal S, Kamath P. Faster algorithms for alternating refinement relations. In: Vol 16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:167-182. 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 K, Henzinger MH. An O(n2) time algorithm for alternating Büchi games. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM; 2012:1386-1399. doi:10.1137/1.9781611973099.109
View
| Files available
| DOI
| Download None (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 2956
Chatterjee K, Velner Y. Mean payoff pushdown games. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. 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 K, Velner Y. 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 K, Chaubal S, Kamath P. 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 K, Doyen L. Partial-observation stochastic games: How to win when belief fails. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. 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 K. Robustness of structurally equivalent concurrent parity games. In: Vol 7213. Springer; 2012:270-285. 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 K, Tracol M. Decidable problems for probabilistic automata on infinite words. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. 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 P, Henzinger TA, Radhakrishna A. Simulation distances. Theoretical Computer Science. 2012;413(1):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 F, Kolmogorov V, Lampert C. Approximating marginals using discrete energy minimization. In: 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 F, Kolmogorov V, Lampert C. 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 J. 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 R, Sil J. An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets. Procedia Technology. 2012;4:820-824. 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 C, Taatjes D. Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly. Journal of Molecular Biology. 2012;417(5):387-394. 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 KE, Laurent P, Soltesz Z, et al. Tonic signaling from O2 sensors sets neural circuit activity and behavioral state. Nature Neuroscience. 2012;15(4):581-591. 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 D-A, Guerraoui R, Kuznetsov P, Losa G. On the cost of composing shared-memory algorithms. In: ACM; 2012:298-307. doi:10.1145/2312005.2312057
View
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 763
Alistarh D-A, Attiya H, Guerraoui R, Travers C. Early deciding synchronous renaming in O(log f) rounds or less. In: Vol 7355 LNCS. Springer; 2012:195-206. doi:10.1007/978-3-642-31104-8_17
View
| DOI
2012 |Published| Journal Article | IST-REx-ID: 764
Alistarh D-A, Gilbert S, Guerraoui R, Travers C. Of choices, failures and asynchrony: the many faces of set agreement. Algorithmica (New York). 2012;62(1-2):595-629. doi:10.1007/s00453-011-9581-7
View
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 766
Alistarh D-A, Bender M, Gilbert S, Guerraoui R. How to allocate tasks asynchronously. In: IEEE; 2012:331-340. doi:10.1109/FOCS.2012.41
View
| DOI
2012 |Published| Journal Article | IST-REx-ID: 767
Alistarh D-A, Gilbert S, Guerraoui R, Travers C. Generating Fast Indulgent Algorithms. Theory of Computing Systems. 2012;51(4):404-424. doi:10.1007/s00224-012-9407-2
View
| DOI