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
Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” 25th International Symposium, ISAAC 2014, vol. 8889, Springer Nature, 2014, pp. 117–27, doi:10.1007/978-3-319-13075-0_10.
View
| Files available
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 1903
Chatterjee, Krishnendu. Partial-Observation Stochastic Reachability and Parity Games. Vol. 8634, no. PART 1, Springer, 2014, pp. 1–4, doi:10.1007/978-3-662-44522-8_1.
View
| Files available
| DOI
2014 |Published| Journal Article | IST-REx-ID: 2211 | 
Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2, 16, ACM, 2014, doi:10.1145/2579821.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 2162 |
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Mean Payoff Games. Vol. 8573, no. Part 2, Springer, 2014, pp. 122–33, doi:10.1007/978-3-662-43951-7_11.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 2213 |
Chatterjee, Krishnendu, et al. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. Vol. 8412, Springer, 2014, pp. 242–57, doi:10.1007/978-3-642-54830-7_16.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 2212
Chatterjee, Krishnendu, et al. Perfect-Information Stochastic Mean-Payoff Parity Games. Vol. 8412, Springer, 2014, pp. 210–25, doi:10.1007/978-3-642-54830-7_14.
View
| Files available
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 2163 |
Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” Lecture Notes in Computer Science, vol. 8573, no. Part 2, Springer, 2014, pp. 110–21, doi:10.1007/978-3-662-43951-7_10.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Technical Report | IST-REx-ID: 5419 |
Chatterjee, Krishnendu, et al. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-187-v1-1.
[Published Version]
View
| Files available
| DOI
2014 |Published| Technical Report | IST-REx-ID: 5420 |
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-191-v1-1.
[Published Version]
View
| Files available
| DOI
2014 |Published| Technical Report | IST-REx-ID: 5427 |
Chatterjee, Krishnendu, et al. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-314-v1-1.
[Published Version]
View
| Files available
| DOI
2014 |Published| Technical Report | IST-REx-ID: 5425 |
Anonymous, 1, et al. Optimal Cost Almost-Sure Reachability in POMDPs. IST Austria, 2014.
[Published Version]
View
| Files available
2014 |Published| Conference Paper | IST-REx-ID: 5810
Biswas, Ranita, and Partha Bhowmick. On Finding Spherical Geodesic Paths and Circles in ℤ3. Vol. 8668, Springer, 2014, pp. 396–409, doi:10.1007/978-3-319-09955-2_33.
View
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 6740 |
Mondelli, Marco, et al. “How to Achieve the Capacity of Asymmetric Channels.” 52nd Annual Allerton Conference on Communication, Control, and Computing, IEEE, 2014, pp. 789–96, doi:10.1109/allerton.2014.7028535.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Journal Article | IST-REx-ID: 6744
Mondelli, Marco, et al. “Joint Power Allocation and Path Selection for Multi-Hop Noncoherent Decode and Forward UWB Communications.” IEEE Transactions on Wireless Communications, vol. 13, no. 3, IEEE, 2014, pp. 1397–409, doi:10.1109/twc.2014.020914.130669.
View
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 10885
Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.” VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 78–97, doi:10.1007/978-3-642-54013-4_5.
[Preprint]
View
| Files available
| DOI
| arXiv
2014 |Published| Book | IST-REx-ID: 6853
Edelsbrunner, Herbert. A Short Course in Computational Geometry and Topology. 1st ed., Springer Nature, 2014, doi:10.1007/978-3-319-05957-0.
View
| Files available
| DOI
2014 |Published| Journal Article | IST-REx-ID: 7301
Li, Chunmei, et al. “Aprotic Li–O2 Battery: Influence of Complexing Agents on Oxygen Reduction in an Aprotic Solvent.” The Journal of Physical Chemistry C, vol. 118, no. 7, ACS, 2014, pp. 3393–401, doi:10.1021/jp4093805.
View
| DOI
2014 |Published| Journal Article | IST-REx-ID: 7455
Costanzo, Tommaso, et al. “Studying the Surface Reaction between NiO and Al2O3viatotal Reflection EXAFS (ReflEXAFS).” Journal of Synchrotron Radiation, vol. 21, no. 2, International Union of Crystallography, 2014, pp. 395–400, doi:10.1107/s1600577513031299.
View
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 773
Alistarh, Dan-Adrian, et al. Communication-Efficient Randomized Consensus. Edited by Fabian Kuhn, vol. 8784, Springer, 2014, pp. 61–75, doi:10.1007/978-3-662-45174-8_5.
View
| DOI
2014 |Published| Journal Article | IST-REx-ID: 9594 |
Greenhill, Catherine, et al. “On the Number of Spanning Trees in Random Regular Graphs.” The Electronic Journal of Combinatorics, vol. 21, no. 1, P1.45, The Electronic Journal of Combinatorics, 2014, doi:10.37236/3752.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv