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.
110 Publications
2014 | 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 | 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 | Conference Paper | IST-REx-ID: 10894
Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “PHAT – Persistent Homology Algorithms Toolbox.” In ICMS 2014: International Congress on Mathematical Software, 8592:137–43. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. https://doi.org/10.1007/978-3-662-44199-2_24.
View
| Files available
| DOI
2013 | Book Chapter | IST-REx-ID: 5747 | 
Dragoi, Cezara, Ashutosh Gupta, and Thomas A Henzinger. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.” In Computer Aided Verification, 8044:174–90. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-39799-8_11.
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 10902
Chatterjee, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel between Languages.” In 7th International Conference on Language and Automata Theory and Applications, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature, 2013. https://doi.org/10.1007/978-3-642-37064-9_20.
View
| DOI
2013 | Conference Paper | IST-REx-ID: 10897
Edelsbrunner, Herbert. “Persistent Homology in Image Processing.” In Graph-Based Representations in Pattern Recognition, 7877:182–83. LNCS. Berlin, Heidelberg: Springer Nature, 2013. https://doi.org/10.1007/978-3-642-38221-5_19.
View
| DOI
2012 | Conference Paper | IST-REx-ID: 10903
Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.” In Automated Technology for Verification and Analysis, 7561:167–82. LNCS. Berlin, Heidelberg: Springer, 2012. https://doi.org/10.1007/978-3-642-33386-6_14.
View
| DOI
2012 | Conference Paper | IST-REx-ID: 10905 |
Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” In Algorithms – ESA 2012, 7501:301–12. Springer, 2012. https://doi.org/10.1007/978-3-642-33090-2_27.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 10906 |
Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.” In Tools and Algorithms for the Construction and Analysis of Systems, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012. https://doi.org/10.1007/978-3-642-28756-5_46.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2012 | Book Chapter | IST-REx-ID: 5745 |
Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” In Automated Technology for Verification and Analysis, 7561:107–21. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. https://doi.org/10.1007/978-3-642-33386-6_10.
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 10907
Artner, Nicole M., Adrian Ion, and Walter G. Kropatsch. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.” In Graph-Based Representations in Pattern Recognition, edited by Xiaoyi Jiang, Miquel Ferrer, and Andrea Torsello, 6658:215–24. LNIP. Berlin, Heidelberg: Springer, 2011. https://doi.org/10.1007/978-3-642-20844-7_22.
View
| DOI
2010 | Conference Paper | IST-REx-ID: 10908 |
Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács. “ABC: Algebraic Bound Computation for Loops.” In Logic for Programming, Artificial Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov, 6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010. https://doi.org/10.1007/978-3-642-17511-4_7.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2004 | Conference Paper | IST-REx-ID: 11801
Henzinger, Monika H. “Algorithmic Aspects of Web Search Engines.” In 2th Annual European Symposium on Algorithms, 3221:3. Springer Nature, 2004. https://doi.org/10.1007/978-3-540-30140-0_2.
View
| DOI
2004 | Conference Paper | IST-REx-ID: 11800
Henzinger, Monika H. “The Past, Present, and Future of Web Search Engines.” In 31st International Colloquium on Automata, Languages and Programming, 3142:3. Springer Nature, 2004. https://doi.org/10.1007/978-3-540-27836-8_2.
View
| DOI
2000 | Conference Paper | IST-REx-ID: 11802
Henzinger, Monika H. “Web Information Retrieval - an Algorithmic Perspective.” In 8th Annual European Symposium on Algorithms, 1879:1–8. Springer Nature, 2000. https://doi.org/10.1007/3-540-45253-2_1.
View
| DOI
1997 | Conference Paper | IST-REx-ID: 11803
Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.” In 24th International Colloquium on Automata, Languages and Programming, 1256:594–604. Springer Nature, 1997. https://doi.org/10.1007/3-540-63165-8_214.
View
| DOI
1996 | Conference Paper | IST-REx-ID: 11804
Henzinger, Monika H, and Jan Arne Telle. “Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning.” In 5th Scandinavian Workshop on Algorithm Theory, 1097:16–27. Springer Nature, 1996. https://doi.org/10.1007/3-540-61422-2_117.
View
| DOI
1996 | Conference Paper | IST-REx-ID: 11910
Henzinger, Monika H, and Mikkel Thorup. “Improved Sampling with Applications to Dynamic Graph Algorithms.” In 23rd International Colloquium on Automata, Languages, and Programming, 1099:290–99. Springer Nature, 1996. https://doi.org/10.1007/3-540-61440-0_136.
View
| DOI
1995 | Conference Paper | IST-REx-ID: 11806
Henzinger, Monika H. “Approximating Minimum Cuts under Insertions.” In 22nd International Colloquium on Automata, Languages and Programming, 944:280–291. Springer Nature, 1995. https://doi.org/10.1007/3-540-60084-1_81.
View
| DOI
1995 | Conference Paper | IST-REx-ID: 11805
Henzinger, Monika H, and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.” In 3rd Annual European Symposium on Algorithms, 979:171–184. Springer Nature, 1995. https://doi.org/10.1007/3-540-60313-1_142.
View
| DOI