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.
132 Publications
2010 |Published| Conference Paper | IST-REx-ID: 11797 |
Feldman J, Henzinger MH, Korula N, Mirrokni VS, Stein C. 2010. Online stochastic packing applied to display ad allocation. 18th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS, vol. 6346, 182–194.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2009 |Published| Conference Paper | IST-REx-ID: 11799
Dütting P, Henzinger MH, Weber I. 2009. Bidder optimal assignments for general utilities. 5th International Workshop on Internet and Network Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 5929, 575–582.
View
| Files available
| DOI
2004 |Published| Conference Paper | IST-REx-ID: 11800
Henzinger MH. 2004. The past, present, and future of web search engines. 31st International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 3142, 3.
View
| DOI
1997 |Published| Conference Paper | IST-REx-ID: 11803
Henzinger MH, King V. 1997. Maintaining minimum spanning trees in dynamic graphs. 24th International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 1256, 594–604.
View
| DOI
1996 |Published| Conference Paper | IST-REx-ID: 11804
Henzinger MH, Telle JA. 1996. Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning. 5th Scandinavian Workshop on Algorithm Theory. SWAT: Scandinavian Workshop on Algorithm Theory, LNCS, vol. 1097, 16–27.
View
| DOI
1996 |Published| Conference Paper | IST-REx-ID: 11910
Henzinger MH, Thorup M. 1996. Improved sampling with applications to dynamic graph algorithms. 23rd International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 1099, 290–299.
View
| DOI