Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarWolfgang W. Bein
Person information
- affiliation: University of Nevada, Las Vegas, School of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2017
[j30]Wolfgang W. Bein, Stefan Wolfgang Pickl, Fei Tao:
Call for Papers Issue 3/2019 - Data Analytics and Optimization for Decision Support. Business & Information Systems Engineering 59(6): 483-484 (2017)- 2015
- [j29]Lucas Bang, Wolfgang W. Bein, Lawrence L. Larmore:
R-LINE: A better randomized 2-server algorithm on the line. Theor. Comput. Sci. 605: 106-118 (2015) - [c33]Jing Chen, Xin Han, Wolfgang W. Bein, Hing-Fung Ting:
Black and White Bin Packing Revisited. COCOA 2015: 45-59 - [c32]Wolfgang W. Bein, Clinton Jeffery, Megan Squire:
Introduction to Open Movements: FLOSS, Open Contents, Open Access, and Open Communities Minitrack. HICSS 2015: 5270 - [c31]Marian Sorin Nistor, Doina Bein, Wolfgang W. Bein, Matthias Dehmer, Stefan Pickl:
Time-Based Estimation of Vulnerable Points in the Munich Subway Network. OR 2015: 355-360 - 2014
- [j28]Wolfgang W. Bein, Johann Hurink, Sigrid Knust:
In Memoriam Peter Brucker. J. Scheduling 17(1): 3 (2014) - [c30]
- 2013
- [c29]Kevin Crowston, Wolfgang W. Bein, Clinton Jeffery:
Introduction to Open Movements Minitrack. HICSS 2013: 3147 - 2012
- [c28]Lucas Bang, Wolfgang W. Bein, Lawrence L. Larmore:
R-LINE: A Better Randomized 2-Server Algorithm on the Line. WAOA 2012: 120-130 - 2011
- [j27]Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk:
Knowledge State Algorithms. Algorithmica 60(3): 653-678 (2011) - [j26]Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec:
A randomized algorithm for two servers in cross polytope spaces. Theor. Comput. Sci. 412(7): 563-572 (2011) - [c27]Doina Bein, Wolfgang W. Bein, Swathi Venigella:
Cloud Storage and Online Bin Packing. IDC 2011: 63-68 - [c26]Wolfgang W. Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara, Jun Kawahara:
An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems. WAOA 2011: 35-48 - 2010
- [c25]Wolfgang W. Bein, Clinton Jeffery:
Towards an Openness Rating System for Open Source Software. HICSS 2010: 1-8 - [c24]Doina Bein, Wolfgang W. Bein, Shashi Phoha:
Efficient Data Centers, Cloud Computing in the Future of Distributed Computing. ITNG 2010: 70-75
2000 – 2009
- 2009
- [j25]Wolfgang 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) - [j24]Wolfgang W. Bein, Doina Bein, Srilaxmi Malladi:
Reliability and fault tolerance of coverage models for sensor networks. IJSNet 5(4): 199-209 (2009) - [j23]Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang:
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. ACM Trans. Algorithms 6(1): 17:1-17:22 (2009) - [j22]Wolfgang 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) - [j21]Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga:
Optimally competitive list batching. Theor. Comput. Sci. 410(38-40): 3631-3639 (2009) - [c23]Wolfgang W. Bein, Shahram Latifi, Linda Morales, Ivan Hal Sudborough:
Bounding the Size of k-Tuple Covers. HICSS 2009: 1-8 - [i2]Wolfgang 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) - 2008
- [j20]Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara:
Randomized Competitive Analysis for Two Server Problems. Algorithms 1(1): 30-42 (2008) - [j19]Wolfgang 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) - [c22]Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara:
Randomized Competitive Analysis for Two-Server Problems. ESA 2008: 161-172 - [c21]Kumar Adusumilli, Doina Bein, Wolfgang W. Bein:
A Genetic Algorithm for the Two Machine Flow Shop Problem. HICSS 2008: 64 - [c20]Doina Bein, Linda Morales, Wolfgang W. Bein, C. O. Shields Jr., Z. Meng, Ivan Hal Sudborough:
Clustering and the Biclique Partition Problem. HICSS 2008: 475 - [c19]Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk:
Knowledge States: A Tool for Randomized Online Algorithms. HICSS 2008: 476 - [c18]
- 2007
- [j18]Wolfgang W. Bein, John Noga, Jeff Wiegley:
Approximation for Batching via Priorities. Sci. Ann. Comp. Sci. 17: 1-18 (2007) - [j17]Wolfgang 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) - [c17]
- [c16]Wolfgang W. Bein, José R. Correa, Xin Han:
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection. ESCAPE 2007: 209-218 - [c15]Wolfgang 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 - [i1]Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk:
Knowledge State Algorithms: Randomization with Limited Information. CoRR abs/cs/0701142 (2007) - 2006
- [c14]Wolfgang 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
- [j16]Wolfgang 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) - [c13]Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough:
A Faster and Simpler 2-Approximation Algorithm for Block Sorting. FCT 2005: 115-124 - [c12]Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga:
The Delayed k-Server Problem. FCT 2005: 281-292 - [c11]Doina Bein, Wolfgang W. Bein, Srilaxmi Malladi:
Fault Tolerant Coverage Model for Sensor Networks. International Conference on Computational Science (2) 2005: 535-542 - [c10]Wolfgang W. Bein, Lawrence L. Larmore, John Noga:
A Better Algorithm for Uniform Metrical Task Systems with Few States. ISPAN 2005: 94-99 - 2004
- [j15]Wolfgang W. Bein:
Knowledge State Algorithms and the 2-Server Problem. Electronic Notes in Discrete Mathematics 17: 49 (2004) - [j14]Wolfgang 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) - [j13]Doina Bein, Wolfgang W. Bein, Natasa Brajkovska, Shahram Latifi:
Optimal embedding of honeycomb networks into hypercubes. Parallel Processing Letters 14(3-4): 367-375 (2004) - [c9]
- [c8]Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk:
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. ISPAN 2004: 307-312 - [c7]Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga:
Optimally Competitive List Batching. SWAT 2004: 77-89 - 2003
- [j12]Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough:
Block Sorting is Hard. Int. J. Found. Comput. Sci. 14(3): 425-437 (2003) - [c6]Wolfgang W. Bein, Jeffrey S. Coombs, Kazem Taghva:
A Method for Calculating Term Similarity on Large Document Collections. ITCC 2003: 199- - 2002
- [j11]Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore:
The 3-server problem in the plane. Theor. Comput. Sci. 289(1): 335-354 (2002) - [c5]Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough:
Fixed Layer Embeddings of Binary Trees. ISPAN 2002: 281- - [c4]Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough:
Block Sorting is Hard. ISPAN 2002: 349-354 - [c3]Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park:
Fast Algorithms with Algebraic Monge Properties. MFCS 2002: 104-117 - 2000
- [j10]Wolfgang W. Bein, Lawrence L. Larmore:
Trackless online algorithms for the server problem. Inf. Process. Lett. 74(1-2): 73-79 (2000) - [j9]Wolfgang 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) - [c2]Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough:
Three-Dimensional Embedding of Binary Trees. ISPAN 2000: 140-147
1990 – 1999
- 1999
- [c1]Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore:
The 3-Server Problem in the Plane. ESA 1999: 301-312 - 1995
- [j8]Wolfgang 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
- [j7]Long Chyr Chang, Wolfgang W. Bein, Edward Angel:
Surface intersection using parallelism. Computer Aided Geometric Design 11(1): 39-69 (1994) - 1993
- [j6]Wolfgang W. Bein, Peter Brucker, Alan J. Hoffman:
Series parallel composition of greedy linear programming problems. Math. Program. 62: 1-14 (1993) - 1992
- [j5]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) - 1991
- [j4]Wolfgang W. Bein, Peter Brucker, Matthias F. M. Stallmann:
A characterization of network representable polymatroids. ZOR - Meth. & Mod. of OR 35(4): 267-272 (1991)
1980 – 1989
- 1989
- [j3]Wolfgang W. Bein, Peter Brucker:
AnO (n logn)-algorithm for solving a special class of linear programs. Computing 42(4): 309-313 (1989) - 1987
- [b1]Wolfgang W. Bein:
Netflows, polymatroids, and greedy structures. University of Osnabrück, Germany 1987 - 1986
- [j2]Wolfgang W. Bein, Peter Brucker:
Greedy concepts for network flow problems. Discrete Applied Mathematics 15(2-3): 135-144 (1986) - 1985
- [j1]Wolfgang W. Bein, Peter Brucker, Arie Tamir:
Minimum cost flow algorithms for series-parallel networks. Discrete Applied Mathematics 10(2): 117-124 (1985)
Coauthor Index
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-02-10 20:23 CET by the dblp team