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.
137 Publications
2019 | Conference Paper | IST-REx-ID: 7231 |
H. Kong, E. Bartocci, Y. Jiang, and T. A. Henzinger, “Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty,” in 17th International Conference on Formal Modeling and Analysis of Timed Systems, Amsterdam, The Netherlands, 2019, vol. 11750, pp. 123–141.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 7230 |
A. M. Arroyo Guevara, M. Derka, and I. Parada, “Extending simple drawings,” in 27th International Symposium on Graph Drawing and Network Visualization, Prague, Czech Republic, 2019, vol. 11904, pp. 230–243.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 7411 |
H. M. Abusalah, C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “Reversible proofs of sequential work,” in Advances in Cryptology – EUROCRYPT 2019, Darmstadt, Germany, 2019, vol. 11477, pp. 277–291.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2019 | Conference Paper | IST-REx-ID: 6482 |
R. Sun and C. Lampert, “KS(conf): A light-weight test if a ConvNet operates outside of Its specifications,” presented at the GCPR: Conference on Pattern Recognition, Stuttgart, Germany, 2019, vol. 11269, pp. 244–259.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 6941 |
S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak, “SpaceMint: A cryptocurrency based on proofs of space,” in 22nd International Conference on Financial Cryptography and Data Security, Nieuwpoort, Curacao, 2018, vol. 10957, pp. 480–499.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Conference Paper | IST-REx-ID: 12571 |
S. Bhattacharya, D. Chakrabarty, and M. H. Henzinger, “Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time,” in 19th International Conference on Integer Programming and Combinatorial Optimization, Waterloo, ON, Canada, 2017, vol. 10328, pp. 86–98.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Book Chapter | IST-REx-ID: 625 |
K. Chatterjee, L. Doyen, and T. A. Henzinger, “The cost of exactness in quantitative reachability,” in Models, Algorithms, Logics and Tools, vol. 10460, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, and R. Mardare, Eds. Springer, 2017, pp. 367–381.
[Submitted Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 13160 |
J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record for transforming Rabin automata into parity automata,” in Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 443–460.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Conference Paper | IST-REx-ID: 11774 |
Y. K. Cheung, M. H. Henzinger, M. Hoefer, and M. Starnberger, “Combinatorial auctions with conflict-based externalities,” in 11th International Conference on Web and Internet Economics, Amsterdam, Netherlands, 2015, vol. 9470, pp. 230–243.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Conference Paper | IST-REx-ID: 11773 |
O. Ben-Zwi, M. H. Henzinger, and V. Loitzenbauer, “Ad exchange: Envy-free auctions with mediators,” in 11th International Conference on Web and Internet Economics, Amsterdam, Netherlands, 2015, vol. 9470, pp. 104–117.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Conference Paper | IST-REx-ID: 11785 |
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Improved algorithms for decremental single-source reachability on directed graphs,” in 42nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 725–736.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Conference Paper | IST-REx-ID: 11787 |
M. H. Henzinger, S. Krinninger, and V. Loitzenbauer, “Finding 2-edge and 2-vertex strongly connected components in quadratic time,” in 2nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 713–724.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Conference Paper | IST-REx-ID: 11788 |
W. Dvořák and M. H. Henzinger, “Online ad assignment with an ad exchange,” in 12th International Workshop of Approximation and Online Algorithms, Wroclaw, Poland, 2015, vol. 8952, pp. 156–167.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Conference Paper | IST-REx-ID: 11786 |
S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Design of dynamic algorithms via primal-dual method,” in 42nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 206–218.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Conference Paper | IST-REx-ID: 1675 |
S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, “Proofs of space,” in 35th Annual Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 585–605.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2014 | Conference Paper | IST-REx-ID: 10884 |
B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking of token-passing systems,” in Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2014 | Conference Paper | IST-REx-ID: 11789 |
M. Charikar, M. H. Henzinger, and H. L. Nguyễn, “Online bipartite matching with decomposable weights,” in 22nd Annual European Symposium on Algorithms, Wroclaw, Poland, 2014, vol. 8737, pp. 260–271.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2014 | Conference Paper | IST-REx-ID: 11790
L. Cigler, W. Dvořák, M. H. Henzinger, and M. Starnberger, “Limiting price discrimination when selling products with positive network externalities,” in 10th International Conference of Web and Internet Economics, Beijing, China, 2014, vol. 8877, pp. 44–57.
View
| DOI
2014 | Conference Paper | IST-REx-ID: 10793
R. Fulek, J. Kynčl, I. Malinović, and D. Pálvölgyi, “Clustered planarity testing revisited,” in International Symposium on Graph Drawing, 2014, vol. 8871, pp. 428–436.
[Preprint]
View
| Files available
| DOI
| arXiv
2014 | Conference Paper | IST-REx-ID: 10892
T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” in 25th International Symposium, ISAAC 2014, Jeonju, Korea, 2014, vol. 8889, pp. 117–127.
View
| Files available
| DOI
2014 | Conference Paper | IST-REx-ID: 10885
K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria for omega-regular games,” in VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 78–97.
[Preprint]
View
| Files available
| DOI
| arXiv
2014 | Conference Paper | IST-REx-ID: 10894
U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “PHAT – Persistent Homology Algorithms Toolbox,” in ICMS 2014: International Congress on Mathematical Software, Seoul, South Korea, 2014, vol. 8592, pp. 137–143.
View
| Files available
| DOI
2013 | Book Chapter | IST-REx-ID: 5747 |
C. Dragoi, A. Gupta, and T. A. Henzinger, “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates,” in Computer Aided Verification, vol. 8044, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 174–190.
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 11795
R. Colini-Baldeschi, M. H. Henzinger, S. Leonardi, and M. Starnberger, “On multiple keyword sponsored search auctions with budgets,” in 39th International Colloquium on Automata, Languages, and Programming, Warwick, United Kingdom, 2012, vol. 7392, pp. 1–12.
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 10904
K. Chatterjee, M. Randour, and J.-F. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” in CONCUR 2012 - Concurrency Theory, Newcastle upon Tyne, United Kingdom, 2012, vol. 7454, pp. 115–131.
[Preprint]
View
| Files available
| DOI
| arXiv
2012 | Conference Paper | IST-REx-ID: 10903
A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Accurate invariant checking for programs manipulating lists and arrays with infinite data,” in Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 167–182.
View
| DOI
2012 | Conference Paper | IST-REx-ID: 10905 |
K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” in Algorithms – ESA 2012, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 10906 |
S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko, “HSF(C): A software verifier based on Horn clauses,” in Tools and Algorithms for the Construction and Analysis of Systems, Tallinn, Estonia, 2012, vol. 7214, pp. 549–551.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2012 | Book Chapter | IST-REx-ID: 5745 |
A. Gupta, “Improved Single Pass Algorithms for Resolution Proof Reduction,” in Automated Technology for Verification and Analysis, vol. 7561, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 107–121.
View
| Files available
| DOI
2010 | Conference Paper | IST-REx-ID: 10908 |
R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound Computation for loops,” in Logic for Programming, Artificial Intelligence, and Reasoning, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)