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 | OA
Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182.
[Published Version] View | Files available | DOI
 

2012 |Published| Conference Paper | IST-REx-ID: 3165 | OA
An O(n2) time algorithm for alternating Büchi games
K. Chatterjee, M.H. Henzinger, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–1399.
View | Files available | DOI | Download None (ext.) | arXiv
 

2012 |Published| Conference Paper | IST-REx-ID: 2956
Mean payoff pushdown games
K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
View | Files available | DOI
 

2012 |Published| Technical Report | IST-REx-ID: 5377 | OA
Mean-payoff pushdown games
K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.
[Published Version] View | Files available | DOI
 

2012 |Published| Technical Report | IST-REx-ID: 5378 | OA
Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.
[Published Version] View | Files available | DOI
 

2012 |Published| Conference Paper | IST-REx-ID: 2955 | OA
Partial-observation stochastic games: How to win when belief fails
K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2012 |Published| Conference Paper | IST-REx-ID: 3341 | OA
Robustness of structurally equivalent concurrent parity games
K. Chatterjee, in:, Springer, 2012, pp. 270–285.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2012 |Published| Conference Paper | IST-REx-ID: 2957 | OA
Decidable problems for probabilistic automata on infinite words
K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2012 |Published| Journal Article | IST-REx-ID: 3249
Simulation distances
P. Cerny, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 413 (2012) 21–35.
View | Files available | DOI
 

2012 |Published| Conference Paper | IST-REx-ID: 3124 | OA
Approximating marginals using discrete energy minimization
F. Korc, V. Kolmogorov, C. Lampert, in:, ICML, 2012.
[Submitted Version] View | Files available
 

2012 |Published| Technical Report | IST-REx-ID: 5396 | OA
Approximating marginals using discrete energy minimization
F. Korc, V. Kolmogorov, C. Lampert, Approximating Marginals Using Discrete Energy Minimization, IST Austria, 2012.
[Published Version] View | Files available | DOI
 

2012 |Published| Report | IST-REx-ID: 5398 | OA
Actual state of research data @ ISTAustria
J. Porsche, Actual State of Research Data @ ISTAustria, IST Austria, 2012.
[Published Version] View | Files available
 

2012 |Published| Journal Article | IST-REx-ID: 5839 | OA
An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets
R. Biswas, J. Sil, Procedia Technology 4 (2012) 820–824.
[Published Version] View | Files available | DOI
 

2012 |Published| Journal Article | IST-REx-ID: 596 | OA View | DOI | Download None (ext.)
 

2012 |Published| Journal Article | IST-REx-ID: 6136 | OA
Tonic signaling from O2 sensors sets neural circuit activity and behavioral state
K.E. Busch, P. Laurent, Z. Soltesz, R.J. Murphy, O. Faivre, B. Hedwig, M. Thomas, H.L. Smith, M. de Bono, Nature Neuroscience 15 (2012) 581–591.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 

2012 |Published| Conference Paper | IST-REx-ID: 762
On the cost of composing shared-memory algorithms
D.-A. Alistarh, R. Guerraoui, P. Kuznetsov, G. Losa, in:, ACM, 2012, pp. 298–307.
View | DOI
 

2012 |Published| Conference Paper | IST-REx-ID: 763
Early deciding synchronous renaming in O(log f) rounds or less
D.-A. Alistarh, H. Attiya, R. Guerraoui, C. Travers, in:, Springer, 2012, pp. 195–206.
View | DOI
 

2012 |Published| Journal Article | IST-REx-ID: 764
Of choices, failures and asynchrony: the many faces of set agreement
D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, Algorithmica (New York) 62 (2012) 595–629.
View | DOI
 

2012 |Published| Conference Paper | IST-REx-ID: 766
How to allocate tasks asynchronously
D.-A. Alistarh, M. Bender, S. Gilbert, R. Guerraoui, in:, IEEE, 2012, pp. 331–340.
View | DOI
 

2012 |Published| Journal Article | IST-REx-ID: 767
Generating Fast Indulgent Algorithms
D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, Theory of Computing Systems 51 (2012) 404–424.
View | DOI
 

Filters and Search Terms

supervisor%3D38DB5788-F248-11E8-B48F-1D18A9856A87

Search

Filter Publications