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, Herbert, and Hubert Wagner. Topological Data Analysis with Bregman Divergences. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916, doi:10.4230/LIPIcs.SoCG.2017.39.
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 697 |
Pietrzak, Krzysztof Z., and Maciej Skórski. Non Uniform Attacks against Pseudoentropy. Vol. 80, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.ICALP.2017.39.
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 710 |
Obremski, Maciej, and Maciej Skórski. Renyi Entropy Estimation Revisited. Vol. 81, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.APPROX-RANDOM.2017.20.
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 711 |
Chatterjee, Krishnendu, et al. Bidirectional Nested Weighted Automata. Vol. 85, 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.5.
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 963 |
Avni, Guy, et al. Timed Network Games with Clocks. Vol. 83, 37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.37.
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 1175 |
Alwen, Joel F., et al. Cumulative Space in Black-White Pebbling and Resolution. Edited by Christos Papadimitriou, vol. 67, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21, doi:10.4230/LIPIcs.ITCS.2017.38.
[Published Version]
View
| Files available
| DOI
| WoS
2016 | Published | Conference Paper | IST-REx-ID: 11834 |
Goranci, Gramoz, et al. “Incremental Exact Min-Cut in Poly-Logarithmic Amortized Update Time.” 24th Annual European Symposium on Algorithms, vol. 57, 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPICS.ESA.2016.46.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 11835 |
Henzinger, Monika, and Stefan Neumann. “Incremental and Fully Dynamic Subgraph Connectivity for Emergency Planning.” 24th Annual European Symposium on Algorithms, vol. 57, 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPICS.ESA.2016.48.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 11836 |
Cheung, Yun Kuen, et al. “Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.” 43rd International Colloquium on Automata, Languages, and Programming, vol. 55, 131, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPICS.ICALP.2016.131.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2015 | Published | Conference Paper | IST-REx-ID: 11837 |
Bhattacharya, Sayan, et al. “Welfare Maximization with Friends-of-Friends Network Externalities.” 32nd International Symposium on Theoretical Aspects of Computer Science, vol. 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 90–102, doi: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, Paul, et al. “Sponsored Search, Market Equilibria, and the Hungarian Method.” 27th International Symposium on Theoretical Aspects of Computer Science, vol. 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 287–98, doi: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, et al. “A Comparison of Techniques for Sampling Web Pages.” 26th International Symposium on Theoretical Aspects of Computer Science, vol. 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2009, pp. 13–30, doi:10.4230/LIPICS.STACS.2009.1809.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv