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.
1850 Publications
2014 |Published| Conference Paper | IST-REx-ID: 10892
Planar matchings for weighted straight skeletons
T. Biedl, S. Huber, P. Palfrader, in:, 25th International Symposium, ISAAC 2014, Springer Nature, 2014, pp. 117–127.
View
| Files available
| DOI
T. Biedl, S. Huber, P. Palfrader, in:, 25th International Symposium, ISAAC 2014, Springer Nature, 2014, pp. 117–127.
2014 |Published| Conference Paper | IST-REx-ID: 1903
Partial-observation stochastic reachability and parity games
K. Chatterjee, in:, Springer, 2014, pp. 1–4.
View
| Files available
| DOI
K. Chatterjee, in:, Springer, 2014, pp. 1–4.
2014 |Published| Journal Article | IST-REx-ID: 2211 | 
Partial-observation stochastic games: How to win when belief fails
K. Chatterjee, L. Doyen, ACM Transactions on Computational Logic (TOCL) 15 (2014).
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, L. Doyen, ACM Transactions on Computational Logic (TOCL) 15 (2014).
2014 |Published| Conference Paper | IST-REx-ID: 2162 |
The complexity of ergodic mean payoff games
K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.
2014 |Published| Conference Paper | IST-REx-ID: 2213 |
The complexity of partial-observation stochastic parity games with finite-memory strategies
K. Chatterjee, L. Doyen, S. Nain, M. Vardi, in:, Springer, 2014, pp. 242–257.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, L. Doyen, S. Nain, M. Vardi, in:, Springer, 2014, pp. 242–257.
2014 |Published| Conference Paper | IST-REx-ID: 2212
Perfect-information stochastic mean-payoff parity games
K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, in:, Springer, 2014, pp. 210–225.
View
| Files available
| DOI
K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, in:, Springer, 2014, pp. 210–225.
2014 |Published| Conference Paper | IST-REx-ID: 2163 |
Games with a weak adversary
K. Chatterjee, L. Doyen, in:, Lecture Notes in Computer Science, Springer, 2014, pp. 110–121.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, L. Doyen, in:, Lecture Notes in Computer Science, Springer, 2014, pp. 110–121.
2014 |Published| Technical Report | IST-REx-ID: 5419 |
Improved algorithms for reachability and shortest path on low tree-width graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014.
2014 |Published| Technical Report | IST-REx-ID: 5420 |
The value 1 problem for concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff Games, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff Games, IST Austria, 2014.
2014 |Published| Technical Report | IST-REx-ID: 5427 |
Optimal tree-decomposition balancing and reachability on low treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs, IST Austria, 2014.
2014 |Published| Technical Report | IST-REx-ID: 5425 |
Optimal cost almost-sure reachability in POMDPs
1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Optimal Cost Almost-Sure Reachability in POMDPs, IST Austria, 2014.
[Published Version]
View
| Files available
1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Optimal Cost Almost-Sure Reachability in POMDPs, IST Austria, 2014.
2014 |Published| Conference Paper | IST-REx-ID: 5810
On Finding Spherical Geodesic Paths and Circles in ℤ3
R. Biswas, P. Bhowmick, 8668 (2014) 396–409.
View
| DOI
R. Biswas, P. Bhowmick, 8668 (2014) 396–409.
2014 |Published| Conference Paper | IST-REx-ID: 6740 |
How to achieve the capacity of asymmetric channels
M. Mondelli, R. Urbanke, H. Hassani, in:, 52nd Annual Allerton Conference on Communication, Control, and Computing, IEEE, 2014, pp. 789–796.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
M. Mondelli, R. Urbanke, H. Hassani, in:, 52nd Annual Allerton Conference on Communication, Control, and Computing, IEEE, 2014, pp. 789–796.
2014 |Published| Journal Article | IST-REx-ID: 6744
Joint power allocation and path selection for multi-hop noncoherent decode and forward UWB communications
M. Mondelli, Q. Zhou, V. Lottici, X. Ma, IEEE Transactions on Wireless Communications 13 (2014) 1397–1409.
View
| DOI
M. Mondelli, Q. Zhou, V. Lottici, X. Ma, IEEE Transactions on Wireless Communications 13 (2014) 1397–1409.
2014 |Published| Conference Paper | IST-REx-ID: 10885
Doomsday equilibria for omega-regular games
K. Chatterjee, L. Doyen, E. Filiot, J.-F. Raskin, in:, VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 78–97.
[Preprint]
View
| Files available
| DOI
| arXiv
K. Chatterjee, L. Doyen, E. Filiot, J.-F. Raskin, in:, VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 78–97.
2014 |Published| Book | IST-REx-ID: 6853
A Short Course in Computational Geometry and Topology
H. Edelsbrunner, A Short Course in Computational Geometry and Topology, 1st ed., Springer Nature, Cham, 2014.
View
| Files available
| DOI
H. Edelsbrunner, A Short Course in Computational Geometry and Topology, 1st ed., Springer Nature, Cham, 2014.
2014 |Published| Journal Article | IST-REx-ID: 7301
Aprotic Li–O2 battery: Influence of complexing agents on oxygen reduction in an aprotic solvent
C. Li, O. Fontaine, S.A. Freunberger, L. Johnson, S. Grugeon, S. Laruelle, P.G. Bruce, M. Armand, The Journal of Physical Chemistry C 118 (2014) 3393–3401.
View
| DOI
C. Li, O. Fontaine, S.A. Freunberger, L. Johnson, S. Grugeon, S. Laruelle, P.G. Bruce, M. Armand, The Journal of Physical Chemistry C 118 (2014) 3393–3401.
2014 |Published| Journal Article | IST-REx-ID: 7455
Studying the surface reaction between NiO and Al2O3viatotal reflection EXAFS (ReflEXAFS)
T. Costanzo, F. Benzi, P. Ghigna, S. Pin, G. Spinolo, F. d’Acapito, Journal of Synchrotron Radiation 21 (2014) 395–400.
View
| DOI
T. Costanzo, F. Benzi, P. Ghigna, S. Pin, G. Spinolo, F. d’Acapito, Journal of Synchrotron Radiation 21 (2014) 395–400.
2014 |Published| Conference Paper | IST-REx-ID: 773
Communication-efficient randomized consensus
D.-A. Alistarh, J. Aspnes, V. King, J. Saia, in:, F. Kuhn (Ed.), Springer, 2014, pp. 61–75.
View
| DOI
D.-A. Alistarh, J. Aspnes, V. King, J. Saia, in:, F. Kuhn (Ed.), Springer, 2014, pp. 61–75.
2014 |Published| Journal Article | IST-REx-ID: 9594 |
On the number of spanning trees in random regular graphs
C. Greenhill, M.A. Kwan, D. Wind, The Electronic Journal of Combinatorics 21 (2014).
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
C. Greenhill, M.A. Kwan, D. Wind, The Electronic Journal of Combinatorics 21 (2014).