Wolfgang W. Bein

Available identifiers

zbMath Open bein.wolfgang-wMaRDI QIDQ1006042

List of research outcomes

Publication	Date of Publication	Type
Breaking the 2-competitiveness barrier for two servers in a tree	2023-10-17	Paper
Randomized competitive analysis for two server problems	2018-08-20	Paper
Time-Based Estimation of Vulnerable Points in the Munich Subway Network	2017-12-01	Paper
https://portal.mardi4nfdi.de/entity/Q3185841	2016-08-05	Paper
Black and White Bin Packing Revisited	2016-02-05	Paper
R-LINE: a better randomized 2-server algorithm on the line	2015-10-30	Paper
In memoriam Peter Brucker	2014-08-18	Paper
R–LINE: A Better Randomized 2-Server Algorithm on the Line	2013-09-13	Paper
An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems	2012-07-16	Paper
Knowledge state algorithms	2011-06-30	Paper
A randomized algorithm for two servers in cross polytope spaces	2011-02-21	Paper
The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity	2010-08-16	Paper
Uniform metrical task systems with a limited number of states	2010-03-24	Paper
Optimally competitive list batching	2009-09-10	Paper
KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS	2009-04-14	Paper
A quadratic time 2-approximation algorithm for block sorting	2009-03-17	Paper
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection	2009-03-03	Paper
Randomized Competitive Analysis for Two-Server Problems	2008-11-25	Paper
Equitable Revisited	2008-09-25	Paper
A fast asymptotic approximation scheme for bin packing with rejection	2008-04-15	Paper
A Randomized Algorithm for Two Servers in Cross Polytope Spaces	2008-02-20	Paper
Knowledge State Algorithms and the 2-Server Problem	2007-05-29	Paper
Fundamentals of Computation Theory	2006-10-20	Paper
Fundamentals of Computation Theory	2006-10-20	Paper
Computational Science – ICCS 2005	2005-11-30	Paper
Block Sorting is Hard	2005-10-19	Paper
Algorithm Theory - SWAT 2004	2005-09-07	Paper
The algebraic Monge property and path problems	2005-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q4708562	2003-06-18	Paper
The 3-server problem in the plane.	2003-01-21	Paper
Trackless online algorithms for the server problem	2002-07-25	Paper
Limited bookmark randomized online algorithms for the paging problem	2002-07-25	Paper
A CHARACTERIZATION OF THE MONGE PROPERTY AND ITS CONNECTION TO STATISTICS	1998-08-05	Paper
A Monge property for the \(d\)-dimensional transportation problem	1996-03-18	Paper
Series parallel composition of greedy linear programming problem	1994-04-28	Paper
Surface intersection using parallelism	1994-04-17	Paper
Optimal Reduction of Two-Terminal Directed Acyclic Graphs	1993-03-09	Paper
A characterization of network representable polymatroids	1991-01-01	Paper
An O(n log n)-algorithm for solving a special class of linear programs	1989-01-01	Paper
Greedy concepts for network flow problems	1986-01-01	Paper
Minimum cost flow algorithms for series-parallel networks	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3662948	1983-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Wolfgang W. Bein