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, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” In 25th International Symposium, ISAAC 2014, 8889:117–27. Springer Nature, 2014. https://doi.org/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,” 8634:1–4. Springer, 2014. https://doi.org/10.1007/978-3-662-44522-8_1.
View | Files available | DOI
 

2014 |Published| Journal Article | IST-REx-ID: 2211 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic (TOCL). ACM, 2014. https://doi.org/10.1145/2579821.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 |Published| Conference Paper | IST-REx-ID: 2162 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,” 8573:122–33. Springer, 2014. https://doi.org/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 | OA
Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. “The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies,” 8412:242–57. Springer, 2014. https://doi.org/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, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. “Perfect-Information Stochastic Mean-Payoff Parity Games,” 8412:210–25. Springer, 2014. https://doi.org/10.1007/978-3-642-54830-7_14.
View | Files available | DOI
 

2014 |Published| Conference Paper | IST-REx-ID: 2163 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” In Lecture Notes in Computer Science, 8573:110–21. Springer, 2014. https://doi.org/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 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-187-v1-1.
[Published Version] View | Files available | DOI
 

2014 |Published| Technical Report | IST-REx-ID: 5420 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-191-v1-1.
[Published Version] View | Files available | DOI
 

2014 |Published| Technical Report | IST-REx-ID: 5427 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-314-v1-1.
[Published Version] View | Files available | DOI
 

2014 |Published| Technical Report | IST-REx-ID: 5425 | OA
Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. 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.” Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2014. https://doi.org/10.1007/978-3-319-09955-2_33.
View | DOI
 

2014 |Published| Conference Paper | IST-REx-ID: 6740 | OA
Mondelli, Marco, Rudiger Urbanke, and Hamed Hassani. “How to Achieve the Capacity of Asymmetric Channels.” In 52nd Annual Allerton Conference on Communication, Control, and Computing, 789–96. IEEE, 2014. https://doi.org/10.1109/allerton.2014.7028535.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 |Published| Journal Article | IST-REx-ID: 6744
Mondelli, Marco, Qi Zhou, Vincenzo Lottici, and Xiaoli Ma. “Joint Power Allocation and Path Selection for Multi-Hop Noncoherent Decode and Forward UWB Communications.” IEEE Transactions on Wireless Communications. IEEE, 2014. https://doi.org/10.1109/twc.2014.020914.130669.
View | DOI
 

2014 |Published| Conference Paper | IST-REx-ID: 10885
Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.” In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, 8318:78–97. Springer Nature, 2014. https://doi.org/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. SpringerBriefs in Applied Sciences and Technology. Cham: Springer Nature, 2014. https://doi.org/10.1007/978-3-319-05957-0.
View | Files available | DOI
 

2014 |Published| Journal Article | IST-REx-ID: 7301
Li, Chunmei, Olivier Fontaine, Stefan Alexander Freunberger, Lee Johnson, Sylvie Grugeon, Stéphane Laruelle, Peter G. Bruce, and Michel Armand. “Aprotic Li–O2 Battery: Influence of Complexing Agents on Oxygen Reduction in an Aprotic Solvent.” The Journal of Physical Chemistry C. ACS, 2014. https://doi.org/10.1021/jp4093805.
View | DOI
 

2014 |Published| Journal Article | IST-REx-ID: 7455
Costanzo, Tommaso, Federico Benzi, Paolo Ghigna, Sonia Pin, Giorgio Spinolo, and Francesco d’Acapito. “Studying the Surface Reaction between NiO and Al2O3viatotal Reflection EXAFS (ReflEXAFS).” Journal of Synchrotron Radiation. International Union of Crystallography, 2014. https://doi.org/10.1107/s1600577513031299.
View | DOI
 

2014 |Published| Conference Paper | IST-REx-ID: 773
Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient Randomized Consensus.” edited by Fabian Kuhn, 8784:61–75. Springer, 2014. https://doi.org/10.1007/978-3-662-45174-8_5.
View | DOI
 

2014 |Published| Journal Article | IST-REx-ID: 9594 | OA
Greenhill, Catherine, Matthew Alan Kwan, and David Wind. “On the Number of Spanning Trees in Random Regular Graphs.” The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics, 2014. https://doi.org/10.37236/3752.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

Filters and Search Terms

isbn%3D978-3-030-00150-6

Search

Filter Publications