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.
1966 Publications
2011 | Published | Conference Paper | IST-REx-ID: 3327
Boker, U., & Kupferman, O. (2011). Co-Büching them all. In M. Hofmann (Ed.) (Vol. 6604, pp. 184–198). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Saarbrücken, Germany: Springer. https://doi.org/10.1007/978-3-642-19805-2_13
View
| DOI
2011 | Published | Book Chapter | IST-REx-ID: 3335 | 
Van De Weygaert, R., Vegter, G., Edelsbrunner, H., Jones, B., Pranav, P., Park, C., … Teillaud, M. (2011). Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In M. Gavrilova, K. Tan, & M. Mostafavi (Eds.), Transactions on Computational Science XIV (Vol. 6970, pp. 60–101). Springer. https://doi.org/10.1007/978-3-642-25249-5_3
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3343 |
Chatterjee, K., & Henzinger, M. (2011). Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification (pp. 1318–1336). Presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States: SIAM. https://doi.org/10.1137/1.9781611973082.101
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3357
Chatterjee, K., Henzinger, T. A., & Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, & C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_17
View
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3365 |
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. https://doi.org/10.1007/978-3-642-19835-9_24
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Book Chapter | IST-REx-ID: 3796 |
Edelsbrunner, H., & Kerber, M. (2011). Covering and packing with spheres by diagonal distortion in R^n. In C. Calude, G. Rozenberg, & A. Salomaa (Eds.), Rainbow of Computer Science (Vol. 6570, pp. 20–35). Springer. https://doi.org/10.1007/978-3-642-19391-0_2
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Journal Article | IST-REx-ID: 3965
Wang, B., Edelsbrunner, H., & Morozov, D. (2011). Computing elevation maxima by searching the Gauss sphere. Journal of Experimental Algorithmics. ACM. https://doi.org/10.1145/1963190.1970375
View
| DOI
2011 | Published | Journal Article | IST-REx-ID: 1050 |
Bai J, Ahmed E, Beser B, Guan Y, Kotochigova S, Lyyra M, Ashman S, Wolfe C, Huennekens J, Xie F, Li D, Li L, Tamanis M, Ferber R, Drozdova A, Pazyuk E, Stolyarov A, Danzl JG, Nägerl H, Bouloufa N, Dulieu O, Amiot C, Salami H, Bergeman T. 2011. Global analysis of data on the spin-orbit-coupled A 1Σu+ and b 3Πu inf states of Cs2. Physical Review A - Atomic, Molecular, and Optical Physics. 83(3).
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Journal Article | IST-REx-ID: 1054 |
Haller, E., Rabie, M., Mark, M., Danzl, J. G., Hart, R., Lauber, K., … Nägerl, H. (2011). Three-body correlation functions and recombination rates for bosons in three dimensions and one dimension. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.107.230404
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 9648 |
Gonzalez-Diaz, R., Ion, A., Jimenez, M. J., & Poyatos, R. (2011). Incremental-decremental algorithm for computing AT-models and persistent homology. In Computer Analysis of Images and Patterns (Vol. 6854, pp. 286–293). Seville, Spain: Springer Nature. https://doi.org/10.1007/978-3-642-23672-3_35
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 9943 |
Sommer, C. M., Straehle, C., Köthe, U., & Hamprecht, F. A. (2011). Ilastik: Interactive learning and segmentation toolkit. In 2011 IEEE International Symposium on Biomedical Imaging: from Nano to Micro. Chicago, Illinois, USA: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/isbi.2011.5872394
[Preprint]
View
| DOI
| Download Preprint (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3326 |
Almagor, S., Boker, U., & Kupferman, O. (2011). What’s decidable about weighted automata (Vol. 6996, pp. 482–491). Presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan: Springer. https://doi.org/10.1007/978-3-642-24372-1_37
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3362 |
Fisher, J., Henzinger, T. A., Nickovic, D., Piterman, N., Singh, A., & Vardi, M. (2011). Dynamic reactive modules (Vol. 6901, pp. 404–418). Presented at the CONCUR: Concurrency Theory, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-23217-6_27
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3264
Gupta, A., Popeea, C., & Rybalchenko, A. (2011). Solving recursion-free Horn clauses over LI+UIF. In H. Yang (Ed.) (Vol. 7078, pp. 188–203). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan: Springer. https://doi.org/10.1007/978-3-642-25318-8_16
View
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3366 |
Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_20
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3347 |
Chatterjee, K., & Fijalkow, N. (2011). Finitary languages (Vol. 6638, pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_16
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3345 |
Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland: Springer. https://doi.org/10.1007/978-3-642-22993-0_21
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3350
Chatterjee, K., & Majumdar, R. (2011). Minimum attention controller synthesis for omega regular objectives. In U. Fahrenberg & S. Tripakis (Eds.) (Vol. 6919, pp. 145–159). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark: Springer. https://doi.org/10.1007/978-3-642-24310-3_11
View
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3238
Kiltz, E., Pietrzak, K. Z., Cash, D., Jain, A., & Venturi, D. (2011). Efficient authentication from hard learning problems (Vol. 6632, pp. 7–26). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Tallinn, Estonia: Springer. https://doi.org/10.1007/978-3-642-20465-4_3
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3344
Chatterjee, K. (2011). Graph games with reachability objectives. In 5th International Workshop on Reachability Problems (Vol. 6945, pp. 1–1). Genoa, Italy: Springer. https://doi.org/10.1007/978-3-642-24288-5_1
View
| DOI