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.

126 Publications


2013 | Conference Paper | IST-REx-ID: 11791 | OA
Valuation compressions in VCG-based combinatorial auctions
P. Dütting, M.H. Henzinger, M. Starnberger, in:, 9th International Conference on Web and Internet Economics, Springer Nature, 2013, pp. 146–159.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2013 | Conference Paper | IST-REx-ID: 11792 | OA
Maximizing a submodular function with viability constraints
W. Dvořák, M.H. Henzinger, D.P. Williamson, in:, 21st Annual European Symposium on Algorithms, Springer Nature, 2013, pp. 409–420.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2013 | Book Chapter | IST-REx-ID: 5747 | OA
Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates
C. Dragoi, A. Gupta, T.A. Henzinger, in:, Computer Aided Verification, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 174–190.
View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 10902
How to travel between languages
K. Chatterjee, S. Chaubal, S. Rubin, in:, 7th International Conference on Language and Automata Theory and Applications, Springer Nature, Berlin, Heidelberg, 2013, pp. 214–225.
View | DOI
 

2013 | Conference Paper | IST-REx-ID: 10897
Persistent homology in image processing
H. Edelsbrunner, in:, Graph-Based Representations in Pattern Recognition, Springer Nature, Berlin, Heidelberg, 2013, pp. 182–183.
View | DOI
 

2012 | Conference Paper | IST-REx-ID: 11794 | OA
Auctions with heterogeneous items and budget limits
P. Dütting, M.H. Henzinger, M. Starnberger, in:, 8th International Workshop on Internet and Network Economics, Springer Nature, 2012, pp. 44–57.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2012 | Conference Paper | IST-REx-ID: 10904
Strategy synthesis for multi-dimensional quantitative objectives
K. Chatterjee, M. Randour, J.-F. Raskin, in:, M. Koutny, I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory, Springer, Berlin, Heidelberg, 2012, pp. 115–131.
[Preprint] View | Files available | DOI | arXiv
 

2012 | Conference Paper | IST-REx-ID: 10903
Accurate invariant checking for programs manipulating lists and arrays with infinite data
A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Automated Technology for Verification and Analysis, Springer, Berlin, Heidelberg, 2012, pp. 167–182.
View | DOI
 

2012 | Conference Paper | IST-REx-ID: 10905 | OA
Polynomial-time algorithms for energy games with special weight structures
K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, Algorithms – ESA 2012, Springer, 2012, pp. 301–312.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2012 | Conference Paper | IST-REx-ID: 10906 | OA
HSF(C): A software verifier based on Horn clauses
S. Grebenshchikov, A. Gupta, N.P. Lopes, C. Popeea, A. Rybalchenko, in:, C. Flanagan, B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems, Springer, Berlin, Heidelberg, 2012, pp. 549–551.
[Published Version] View | DOI | Download Published Version (ext.)
 

2012 | Book Chapter | IST-REx-ID: 5745 | OA
Improved Single Pass Algorithms for Resolution Proof Reduction
A. Gupta, in:, Automated Technology for Verification and Analysis, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 107–121.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 11796
Multi-parameter mechanism design under budget and matroid constraints
M.H. Henzinger, A. Vidali, in:, 19th Annual European Symposium on Algorithms, Springer Nature, 2011, pp. 192–202.
View | DOI
 

2011 | Conference Paper | IST-REx-ID: 10907
Spatio-temporal extraction of articulated models in a graph pyramid
N.M. Artner, A. Ion, W.G. Kropatsch, in:, X. Jiang, M. Ferrer, A. Torsello (Eds.), Graph-Based Representations in Pattern Recognition, Springer, Berlin, Heidelberg, 2011, pp. 215–224.
View | DOI
 

2010 | Conference Paper | IST-REx-ID: 10908 | OA
ABC: Algebraic Bound Computation for loops
R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2010 | Conference Paper | IST-REx-ID: 11797 | OA
Online stochastic packing applied to display ad allocation
J. Feldman, M.H. Henzinger, N. Korula, V.S. Mirrokni, C. Stein, in:, 18th Annual European Symposium on Algorithms, Springer Nature, 2010, pp. 182–194.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2010 | Conference Paper | IST-REx-ID: 11798
Mechanisms for the marriage and the assignment game
P. Dütting, M.H. Henzinger, in:, 7th International Conference on Algorithms and Complexity, Springer Nature, 2010, pp. 6–12.
View | DOI
 

2010 | Book Chapter | IST-REx-ID: 5940
Instance Deadlock: A Mystery behind Frozen Programs
G. Juhás, I. Kazlov, A. Juhásová, in:, Applications and Theory of Petri Nets, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010, pp. 1–17.
View | DOI
 

2009 | Conference Paper | IST-REx-ID: 11799
Bidder optimal assignments for general utilities
P. Dütting, M.H. Henzinger, I. Weber, in:, 5th International Workshop on Internet and Network Economics, Springer Nature, 2009, pp. 575–582.
View | Files available | DOI
 

2004 | Conference Paper | IST-REx-ID: 11801
Algorithmic aspects of web search engines
M.H. Henzinger, in:, 2th Annual European Symposium on Algorithms, Springer Nature, 2004, p. 3.
View | DOI
 

2004 | Conference Paper | IST-REx-ID: 11800
The past, present, and future of web search engines
M.H. Henzinger, in:, 31st International Colloquium on Automata, Languages and Programming, Springer Nature, 2004, p. 3.
View | DOI
 

2000 | Conference Paper | IST-REx-ID: 11802
Web information retrieval - an algorithmic perspective
M.H. Henzinger, in:, 8th Annual European Symposium on Algorithms, Springer Nature, 2000, pp. 1–8.
View | DOI
 

1997 | Conference Paper | IST-REx-ID: 11803
Maintaining minimum spanning trees in dynamic graphs
M.H. Henzinger, V. King, in:, 24th International Colloquium on Automata, Languages and Programming, Springer Nature, 1997, pp. 594–604.
View | DOI
 

1996 | Conference Paper | IST-REx-ID: 11804
Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
M.H. Henzinger, J.A. Telle, in:, 5th Scandinavian Workshop on Algorithm Theory, Springer Nature, 1996, pp. 16–27.
View | DOI
 

1996 | Conference Paper | IST-REx-ID: 11910
Improved sampling with applications to dynamic graph algorithms
M.H. Henzinger, M. Thorup, in:, 23rd International Colloquium on Automata, Languages, and Programming, Springer Nature, 1996, pp. 290–299.
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11806
Approximating minimum cuts under insertions
M.H. Henzinger, in:, 22nd International Colloquium on Automata, Languages and Programming, Springer Nature, 1995, pp. 280–291.
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11805
Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
M.H. Henzinger, H. Poutré, in:, 3rd Annual European Symposium on Algorithms, Springer Nature, 1995, pp. 171–184.
View | DOI
 

Filters and Search Terms

issn%3D1611-3349

Search

Filter Publications