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.

129 Publications


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 | OA
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 | OA
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 | OA
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
 

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

2011 | Conference Paper | IST-REx-ID: 10907
N. M. Artner, A. Ion, and W. G. Kropatsch, “Spatio-temporal extraction of articulated models in a graph pyramid,” in Graph-Based Representations in Pattern Recognition, Münster, Germany, 2011, vol. 6658, pp. 215–224.
View | DOI
 

2010 | Conference Paper | IST-REx-ID: 10908 | OA
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.)
 

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

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

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

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

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

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

2000 | Conference Paper | IST-REx-ID: 11802
M. H. Henzinger, “Web information retrieval - an algorithmic perspective,” in 8th Annual European Symposium on Algorithms, Saarbrücken, Germany, 2000, vol. 1879, pp. 1–8.
View | DOI
 

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

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

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

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

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

Filters and Search Terms

issn%3D1611-3349

Search

Filter Publications