The following pages link to Wolfgang W. Bein (Q1006042):
Displaying 45 items.
- (Q398888) (redirect page) (← links)
- In memoriam Peter Brucker (Q398889) (← links)
- Knowledge state algorithms (Q548658) (← links)
- A randomized algorithm for two servers in cross polytope spaces (Q627107) (← links)
- (Q756928) (redirect page) (← links)
- An O(n log n)-algorithm for solving a special class of linear programs (Q756930) (← links)
- Optimally competitive list batching (Q837154) (← links)
- R-LINE: a better randomized 2-server algorithm on the line (Q888438) (← links)
- A quadratic time 2-approximation algorithm for block sorting (Q1006043) (← links)
- Minimum cost flow algorithms for series-parallel networks (Q1061597) (← links)
- Greedy concepts for network flow problems (Q1088884) (← links)
- Surface intersection using parallelism (Q1315806) (← links)
- Series parallel composition of greedy linear programming problem (Q1321658) (← links)
- Trackless online algorithms for the server problem (Q1607049) (← links)
- Limited bookmark randomized online algorithms for the paging problem (Q1607066) (← links)
- Randomized competitive analysis for two server problems (Q1662430) (← links)
- The algebraic Monge property and path problems (Q1765525) (← links)
- A Monge property for the \(d\)-dimensional transportation problem (Q1805449) (← links)
- The 3-server problem in the plane. (Q1853532) (← links)
- Uniform metrical task systems with a limited number of states (Q2380010) (← links)
- A fast asymptotic approximation scheme for bin packing with rejection (Q2481948) (← links)
- R–LINE: A Better Randomized 2-Server Algorithm on the Line (Q2848919) (← links)
- An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems (Q2896376) (← links)
- The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity (Q2930293) (← links)
- (Q3185841) (← links)
- Knowledge State Algorithms and the 2-Server Problem (Q3439126) (← links)
- Black and White Bin Packing Revisited (Q3467833) (← links)
- Equitable Revisited (Q3527231) (← links)
- Randomized Competitive Analysis for Two-Server Problems (Q3541083) (← links)
- The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity (Q3583432) (← links)
- A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection (Q3611910) (← links)
- KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS (Q3620620) (← links)
- (Q3662948) (← links)
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs (Q4027859) (← links)
- A CHARACTERIZATION OF THE MONGE PROPERTY AND ITS CONNECTION TO STATISTICS (Q4389834) (← links)
- Time-Based Estimation of Vulnerable Points in the Munich Subway Network (Q4596236) (← links)
- (Q4708562) (← links)
- A characterization of network representable polymatroids (Q5202490) (← links)
- Algorithm Theory - SWAT 2004 (Q5315404) (← links)
- A Randomized Algorithm for Two Servers in Cross Polytope Spaces (Q5443387) (← links)
- Fundamentals of Computation Theory (Q5492921) (← links)
- Fundamentals of Computation Theory (Q5492935) (← links)
- Block Sorting is Hard (Q5696919) (← links)
- Computational Science – ICCS 2005 (Q5709464) (← links)
- Breaking the 2-competitiveness barrier for two servers in a tree (Q6052700) (← links)
