dblp.uni-trier.dewww.uni-trier.de

Wolfgang W. Bein

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
40EEWolfgang W. Bein, Shahram Latifi, Linda Morales, Ivan Hal Sudborough: Bounding the Size of k-Tuple Covers. HICSS 2009: 1-8
39EEWolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga: A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs CoRR abs/0904.1002: (2009)
38EEWolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk: Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. Int. J. Found. Comput. Sci. 20(1): 167-183 (2009)
37EEWolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough: A quadratic time 2-approximation algorithm for block sorting. Theor. Comput. Sci. 410(8-10): 711-717 (2009)
2008
36EEWolfgang W. Bein, Kazuo Iwama, Jun Kawahara: Randomized Competitive Analysis for Two-Server Problems. ESA 2008: 161-172
35EEDoina Bein, Linda Morales, Wolfgang W. Bein, C. O. Shields Jr., Z. Meng, Ivan Hal Sudborough: Clustering and the Biclique Partition Problem. HICSS 2008: 475
34EEWolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk: Knowledge States: A Tool for Randomized Online Algorithms. HICSS 2008: 476
33EEWolfgang W. Bein, John Noga, Jeff Wiegley: Priority Approximation for Batching. HICSS 2008: 477
32EEKumar Adusumilli, Doina Bein, Wolfgang W. Bein: A Genetic Algorithm for the Two Machine Flow Shop Problem. HICSS 2008: 64
31EEWolfgang W. Bein, José R. Correa, Xin Han: A fast asymptotic approximation scheme for bin packing with rejection. Theor. Comput. Sci. 393(1-3): 14-22 (2008)
2007
30EEWolfgang W. Bein, Lawrence L. Larmore, John Noga: Equitable Revisited. ESA 2007: 419-426
29EEWolfgang W. Bein, José R. Correa, Xin Han: A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection. ESCAPE 2007: 209-218
28EEWolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec: A Randomized Algorithm for Two Servers in Cross Polytope Spaces. WAOA 2007: 246-259
27EEWolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk: Knowledge State Algorithms: Randomization with Limited Information CoRR abs/cs/0701142: (2007)
26EEWolfgang W. Bein, Lawrence L. Larmore, John Noga: Uniform metrical task systems with a limited number of states. Inf. Process. Lett. 104(4): 123-128 (2007)
2006
25EEWolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang: The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. SODA 2006: 31-40
2005
24EEWolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough: A Faster and Simpler 2-Approximation Algorithm for Block Sorting. FCT 2005: 115-124
23EEWolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga: The Delayed k-Server Problem. FCT 2005: 281-292
22EEWolfgang W. Bein, Lawrence L. Larmore, John Noga: A Better Algorithm for Uniform Metrical Task Systems with Few States. ISPAN 2005: 94-99
21EEDoina Bein, Wolfgang W. Bein, Srilaxmi Malladi: Fault Tolerant Coverage Model for Sensor Networks. International Conference on Computational Science (2) 2005: 535-542
20EEWolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park: The algebraic Monge property and path problems. Discrete Applied Mathematics 145(3): 455-464 (2005)
2004
19EEWolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk: Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. ISPAN 2004: 307-312
18EEWolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga: Optimally Competitive List Batching. SWAT 2004: 77-89
17EEWolfgang W. Bein: Knowledge State Algorithms and the 2-Server Problem. Electronic Notes in Discrete Mathematics 17: 49 (2004)
16EEWolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough: Embedding A Complete Binary Tree Into A Three-Dimensional Grid. Journal of Interconnection Networks 5(2): 111-130 (2004)
15EEDoina Bein, Wolfgang W. Bein, Natasa Brajkovska, Shahram Latifi: Optimal embedding of honeycomb networks into hypercubes. Parallel Processing Letters 14(3-4): 367-375 (2004)
2003
14EEWolfgang W. Bein, Jeffrey S. Coombs, Kazem Taghva: A Method for Calculating Term Similarity on Large Document Collections. ITCC 2003: 199-
13EEWolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough: Block Sorting is Hard. Int. J. Found. Comput. Sci. 14(3): 425-437 (2003)
2002
12EEWolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough: Fixed Layer Embeddings of Binary Trees. ISPAN 2002: 281-
11EEWolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough: Block Sorting is Hard. ISPAN 2002: 349-354
10EEWolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park: Fast Algorithms with Algebraic Monge Properties. MFCS 2002: 104-117
9 Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore: The 3-server problem in the plane. Theor. Comput. Sci. 289(1): 335-354 (2002)
2000
8EEWolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough: Three-Dimensional Embedding of Binary Trees. ISPAN 2000: 140-147
7EEWolfgang W. Bein, Lawrence L. Larmore: Trackless online algorithms for the server problem. Inf. Process. Lett. 74(1-2): 73-79 (2000)
6EEWolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore: Limited bookmark randomized online algorithms for the paging problem. Inf. Process. Lett. 76(4-6): 155-162 (2000)
1999
5EEWolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore: The 3-Server Problem in the Plane. ESA 1999: 301-312
1995
4EEWolfgang W. Bein, Peter Brucker, James K. Park, Pramod K. Pathak: A Monge Property for the D-dimensional Transportation Problem. Discrete Applied Mathematics 58(2): 97-109 (1995)
1994
3EELong Chyr Chang, Wolfgang W. Bein, Edward Angel: Surface intersection using parallelism. Computer Aided Geometric Design 11(1): 39-69 (1994)
1993
2 Wolfgang W. Bein, Peter Brucker, Alan J. Hoffman: Series parallel composition of greedy linear programming problems. Math. Program. 62: 1-14 (1993)
1992
1 Wolfgang W. Bein, Jerzy Kamburowski, Matthias F. M. Stallmann: Optimal Reductions of Two-Terminal Directed Acyclic Graphs. SIAM J. Comput. 21(6): 1112-1129 (1992)

Coauthor Index

1Kumar Adusumilli [32]
2Edward Angel [3]
3Doina Bein [15] [21] [32] [35]
4Natasa Brajkovska [15]
5Peter Brucker [2] [4] [10] [20]
6Long Chyr Chang [3]
7Marek Chrobak [5] [9]
8Jeffrey S. Coombs [14]
9José R. Correa [29] [31]
10Leah Epstein [18] [39]
11Rudolf Fleischer [6]
12Mordecai J. Golin [25]
13Xin Han [29] [31]
14Alan J. Hoffman [2]
15Kazuo Iwama [23] [28] [36]
16Jerzy Kamburowski [1]
17Jun Kawahara [28] [36]
18Lawrence L. Larmore [5] [6] [7] [8] [9] [10] [11] [12] [13] [16] [18] [19] [20] [22] [23] [24] [25] [26] [27] [28] [30] [34] [37] [38] [39]
19Shahram Latifi [11] [13] [15] [40]
20Srilaxmi Malladi [21]
21Z. Meng [35]
22Linda Morales [24] [35] [37] [40]
23John Noga [18] [22] [23] [26] [30] [33] [39]
24James A. Oravec [28]
25James K. Park [4] [10] [20]
26Pramod K. Pathak [4]
27Rüdiger Reischuk [19] [27] [34] [38]
28C. O. Shields Jr. [35]
29Charles Shields Jr. [8] [12] [16]
30Matthias F. M. Stallmann [1]
31Ivan Hal Sudborough [8] [11] [12] [13] [16] [24] [35] [37] [40]
32Kazem Taghva [14]
33Jeff Wiegley [33]
34Yan Zhang [25]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)