The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wolfgang W. Bein: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore
    The 3-Server Problem in the Plane. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:301-312 [Conf]
  2. Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga
    The Delayed k-Server Problem. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:281-292 [Conf]
  3. Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough
    A Faster and Simpler 2-Approximation Algorithm for Block Sorting. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:115-124 [Conf]
  4. Doina Bein, Wolfgang W. Bein, Srilaxmi Malladi
    Fault Tolerant Coverage Model for Sensor Networks. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2005, pp:535-542 [Conf]
  5. Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
    Block Sorting is Hard. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2002, pp:349-354 [Conf]
  6. Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
    Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:307-312 [Conf]
  7. Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough
    Three-Dimensional Embedding of Binary Trees. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2000, pp:140-147 [Conf]
  8. Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough
    Fixed Layer Embeddings of Binary Trees. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2002, pp:281-0 [Conf]
  9. Wolfgang W. Bein, Jeffrey S. Coombs, Kazem Taghva
    A Method for Calculating Term Similarity on Large Document Collections. [Citation Graph (0, 0)][DBLP]
    ITCC, 2003, pp:199-0 [Conf]
  10. Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
    Fast Algorithms with Algebraic Monge Properties. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:104-117 [Conf]
  11. Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang
    The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:31-40 [Conf]
  12. Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
    Optimally Competitive List Batching. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:77-89 [Conf]
  13. Long Chyr Chang, Wolfgang W. Bein, Edward Angel
    Surface intersection using parallelism. [Citation Graph (0, 0)][DBLP]
    Computer Aided Geometric Design, 1994, v:11, n:1, pp:39-69 [Journal]
  14. Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
    The algebraic Monge property and path problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:3, pp:455-464 [Journal]
  15. Wolfgang W. Bein, Peter Brucker, James K. Park, Pramod K. Pathak
    A Monge Property for the D-dimensional Transportation Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:58, n:2, pp:97-109 [Journal]
  16. Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
    Block Sorting is Hard. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:3, pp:425-437 [Journal]
  17. Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore
    Limited bookmark randomized online algorithms for the paging problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:4-6, pp:155-162 [Journal]
  18. Wolfgang W. Bein, Lawrence L. Larmore
    Trackless online algorithms for the server problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:73-79 [Journal]
  19. Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough
    Embedding A Complete Binary Tree Into A Three-Dimensional Grid. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2004, v:5, n:2, pp:111-130 [Journal]
  20. Wolfgang W. Bein, Peter Brucker, Alan J. Hoffman
    Series parallel composition of greedy linear programming problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:1-14 [Journal]
  21. Doina Bein, Wolfgang W. Bein, Natasa Brajkovska, Shahram Latifi
    Optimal embedding of honeycomb networks into hypercubes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2004, v:14, n:3-4, pp:367-375 [Journal]
  22. Wolfgang W. Bein, Jerzy Kamburowski, Matthias F. M. Stallmann
    Optimal Reductions of Two-Terminal Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:6, pp:1112-1129 [Journal]
  23. Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore
    The 3-server problem in the plane. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:335-354 [Journal]
  24. Wolfgang W. Bein, Lawrence L. Larmore, John Noga
    Equitable Revisited. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:419-426 [Conf]
  25. Wolfgang W. Bein, José R. Correa, Xin Han
    A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:209-218 [Conf]
  26. Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
    Knowledge State Algorithms: Randomization with Limited Information [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  27. Wolfgang W. Bein, Lawrence L. Larmore, John Noga
    Uniform metrical task systems with a limited number of states. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:4, pp:123-128 [Journal]

  28. Randomized Competitive Analysis for Two-Server Problems. [Citation Graph (, )][DBLP]


  29. A Genetic Algorithm for the Two Machine Flow Shop Problem. [Citation Graph (, )][DBLP]


  30. Bounding the Size of k-Tuple Covers. [Citation Graph (, )][DBLP]


  31. Clustering and the Biclique Partition Problem. [Citation Graph (, )][DBLP]


  32. Priority Approximation for Batching. [Citation Graph (, )][DBLP]


  33. Knowledge States: A Tool for Randomized Online Algorithms. [Citation Graph (, )][DBLP]


  34. Towards an Openness Rating System for Open Source Software. [Citation Graph (, )][DBLP]


  35. A Better Algorithm for Uniform Metrical Task Systems with Few States. [Citation Graph (, )][DBLP]


  36. Efficient Data Centers, Cloud Computing in the Future of Distributed Computing. [Citation Graph (, )][DBLP]


  37. A Randomized Algorithm for Two Servers in Cross Polytope Spaces. [Citation Graph (, )][DBLP]


  38. A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs [Citation Graph (, )][DBLP]


Search in 0.057secs, Finished in 0.059secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002