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.
112 Publications
2017 | Published | Conference Paper | IST-REx-ID: 688 | 
Edelsbrunner, H., & Wagner, H. (2017). Topological data analysis with Bregman divergences (Vol. 77, pp. 391–3916). Presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2017.39
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 697 |
Pietrzak, K. Z., & Skórski, M. (2017). Non uniform attacks against pseudoentropy (Vol. 80). Presented at the ICALP: Automata, Languages and Programming, Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2017.39
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 710 |
Obremski, M., & Skórski, M. (2017). Renyi entropy estimation revisited (Vol. 81). Presented at the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, Berkeley, USA: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 711 |
Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Bidirectional nested weighted automata (Vol. 85). Presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2017.5
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 963 |
Avni, G., Guha, S., & Kupferman, O. (2017). Timed network games with clocks (Vol. 83). Presented at the MFCS: Mathematical Foundations of Computer Science, Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.37
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 1175 |
Alwen, J. F., De Rezende, S., Nordstrom, J., & Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2017.38
[Published Version]
View
| Files available
| DOI
| WoS
2016 | Published | Conference Paper | IST-REx-ID: 11834 |
Goranci, G., Henzinger, M., & Thorup, M. (2016). Incremental exact min-cut in poly-logarithmic amortized update time. In 24th Annual European Symposium on Algorithms (Vol. 57). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2016.46
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 11835 |
Henzinger, M., & Neumann, S. (2016). Incremental and fully dynamic subgraph connectivity for emergency planning. In 24th Annual European Symposium on Algorithms (Vol. 57). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2016.48
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 11836 |
Cheung, Y. K., Goranci, G., & Henzinger, M. (2016). Graph minors for preserving terminal distances approximately - lower and upper bounds. In 43rd International Colloquium on Automata, Languages, and Programming (Vol. 55). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2016.131
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2015 | Published | Conference Paper | IST-REx-ID: 11837 |
Bhattacharya, S., Dvorák, W., Henzinger, M., & Starnberger, Martin. (2015). Welfare maximization with friends-of-friends network externalities. In 32nd International Symposium on Theoretical Aspects of Computer Science (Vol. 30, pp. 90–102). Garching, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.STACS.2015.90
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2010 | Published | Conference Paper | IST-REx-ID: 11838 |
Dütting, P., Henzinger, M., & Weber, I. (2010). Sponsored search, market equilibria, and the Hungarian Method. In 27th International Symposium on Theoretical Aspects of Computer Science (Vol. 5, pp. 287–298). Nancy, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.STACS.2010.2463
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2009 | Published | Conference Paper | IST-REx-ID: 11912 |
Baykan, Eda, Henzinger, M., Keller, S. F., de Castelberg, S., & Kinzler, M. (2009). A comparison of techniques for sampling web pages. In 26th International Symposium on Theoretical Aspects of Computer Science (Vol. 3, pp. 13–30). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.STACS.2009.1809
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv