The SCEAS System
| |||||||

## Search the dblp DataBase
René Beier:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- René Beier, Berthold Vöcking
**An Experimental Study of Random Knapsack Problems.**[Citation Graph (0, 0)][DBLP] ESA, 2004, pp:616-627 [Conf] - René Beier, Peter Sanders, Naveen Sivadasan
**Energy Optimal Routing in Radio Networks Using Geometric Data Structures.**[Citation Graph (0, 0)][DBLP] ICALP, 2002, pp:366-376 [Conf] - Cyril Banderier, René Beier, Kurt Mehlhorn
**Smoothed Analysis of Three Combinatorial Problems.**[Citation Graph (0, 0)][DBLP] MFCS, 2003, pp:198-207 [Conf] - René Beier, Jop F. Sibeyn
**A powerful heuristic for telephone gossiping.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2000, pp:17-35 [Conf] - René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
**Computing equilibria for congestion games with (im)perfect information.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:746-755 [Conf] - René Beier, Berthold Vöcking
**Probabilistic analysis of knapsack core algorithms.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:468-477 [Conf] - René Beier, Berthold Vöcking
**Random knapsack in expected polynomial time.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:232-241 [Conf] - René Beier, Berthold Vöcking
**Typical properties of winners and losers in discrete optimization.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:343-352 [Conf] - René Beier, Berthold Vöcking
**An Experimental Study of Random Knapsack Problems.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:45, n:1, pp:121-136 [Journal] - René Beier, Berthold Vöcking
**Random knapsack in expected polynomial time.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:69, n:3, pp:306-329 [Journal] - René Beier, Berthold Vöcking
**Typical Properties of Winners and Losers in Discrete Optimization.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:35, n:4, pp:855-881 [Journal] - René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
**Computing equilibria for a service provider game with (Im)perfect information.**[Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2006, v:2, n:4, pp:679-706 [Journal] - René Beier, Heiko Röglin, Berthold Vöcking
**The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization.**[Citation Graph (0, 0)][DBLP] IPCO, 2007, pp:53-67 [Conf]
Search in 0.002secs, Finished in 0.002secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |