|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 20 occurrences of 16 keywords
|
|
|
|
|
Results
Found 52 publication records. Showing 52 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk |
Knowledge State Algorithms.  |
Algorithmica  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Doina Bein, Wolfgang W. Bein, Swathi Venigella |
Cloud Storage and Online Bin Packing.  |
IDC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Doina Bein, Wolfgang W. Bein, Shashi Phoha |
Efficient Data Centers, Cloud Computing in the Future of Distributed Computing.  |
ITNG  |
2010 |
DBLP DOI BibTeX RDF |
storage request, storage request, online algorithm, data center, server, bin packing |
| 1 | Wolfgang W. Bein, Clinton Jeffery |
Towards an Openness Rating System for Open Source Software.  |
HICSS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga |
Optimally competitive list batching.  |
Theor. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough |
A quadratic time 2-approximation algorithm for block sorting.  |
Theor. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Doina Bein, Srilaxmi Malladi |
Reliability and fault tolerance of coverage models for sensor networks.  |
IJSNet  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang |
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity.  |
ACM Transactions on Algorithms  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Shahram Latifi, Linda Morales, Ivan Hal Sudborough |
Bounding the Size of k-Tuple Covers.  |
HICSS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, José R. Correa, Xin Han |
A fast asymptotic approximation scheme for bin packing with rejection.  |
Theor. Comput. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara |
Randomized Competitive Analysis for Two Server Problems.  |
Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara |
Randomized Competitive Analysis for Two-Server Problems.  |
ESA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kumar Adusumilli, Doina Bein, Wolfgang W. Bein |
A Genetic Algorithm for the Two Machine Flow Shop Problem.  |
HICSS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk |
Knowledge States: A Tool for Randomized Online Algorithms.  |
HICSS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, John Noga, Jeff Wiegley |
Priority Approximation for Batching.  |
HICSS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Doina Bein, Linda Morales, Wolfgang W. Bein, C. O. Shields Jr., Z. Meng, Ivan Hal Sudborough |
Clustering and the Biclique Partition Problem.  |
HICSS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, John Noga |
Uniform metrical task systems with a limited number of states.  |
Inf. Process. Lett.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, John Noga, Jeff Wiegley |
Approximation for Batching via Priorities.  |
Sci. Ann. Comp. Sci.  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk |
Knowledge State Algorithms: Randomization with Limited Information  |
CoRR  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, John Noga |
Equitable Revisited.  |
ESA  |
2007 |
DBLP DOI BibTeX RDF |
Online Algorithms, Randomization, Paging, Design of Algorithms |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, José R. Correa, Xin Han |
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection.  |
ESCAPE  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park |
The algebraic Monge property and path problems.  |
Discrete Applied Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Doina Bein, Wolfgang W. Bein, Srilaxmi Malladi |
Fault Tolerant Coverage Model for Sensor Networks.  |
International Conference on Computational Science  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga |
The Delayed k-Server Problem.  |
FCT  |
2005 |
DBLP DOI BibTeX RDF |
approximation and randomized algorithms, Design and analysis of algorithms |
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough |
A Faster and Simpler 2-Approximation Algorithm for Block Sorting.  |
FCT  |
2005 |
DBLP DOI BibTeX RDF |
approximation algori- thms, block sorting, transposition sorting, optical character recognition, Design and analysis of algorithms |
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, John Noga |
A Better Algorithm for Uniform Metrical Task Systems with Few States.  |
ISPAN  |
2005 |
DBLP DOI BibTeX RDF |
randomized algorithms, online algorithms, task systems |
| 1 | Wolfgang W. Bein |
Knowledge State Algorithms and the 2-Server Problem.  |
Electronic Notes in Discrete Mathematics  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Doina Bein, Wolfgang W. Bein, Natasa Brajkovska, Shahram Latifi |
Optimal embedding of honeycomb networks into hypercubes.  |
Parallel Processing Letters  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga |
Optimally Competitive List Batching.  |
SWAT  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein |
Knowledge State Algorithms and the 2-Server Problem.  |
CTW  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk |
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems.  |
ISPAN  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough |
Block Sorting is Hard.  |
Int. J. Found. Comput. Sci.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Jeffrey S. Coombs, Kazem Taghva |
A Method for Calculating Term Similarity on Large Document Collections.  |
ITCC  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore |
The 3-server problem in the plane.  |
Theor. Comput. Sci.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park |
Fast Algorithms with Algebraic Monge Properties.  |
MFCS  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough |
Fixed Layer Embeddings of Binary Trees. (PDF / PS)  |
ISPAN  |
2002 |
DBLP DOI BibTeX RDF |
grid parallel computer architecture, VLSI, Embedding, binary tree |
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough |
Block Sorting is Hard. (PDF / PS)  |
ISPAN  |
2002 |
DBLP DOI BibTeX RDF |
Optical Character Recognition, Sorting, Permutations |
| 1 | Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore |
Limited bookmark randomized online algorithms for the paging problem.  |
Inf. Process. Lett.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Lawrence L. Larmore |
Trackless online algorithms for the server problem.  |
Inf. Process. Lett.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough |
Three-Dimensional Embedding of Binary Trees.  |
ISPAN  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore |
The 3-Server Problem in the Plane.  |
ESA  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Peter Brucker, James K. Park, Pramod K. Pathak |
A Monge Property for the D-dimensional Transportation Problem.  |
Discrete Applied Mathematics  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Long Chyr Chang, Wolfgang W. Bein, Edward Angel |
Surface intersection using parallelism.  |
Computer Aided Geometric Design  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Peter Brucker, Alan J. Hoffman |
Series parallel composition of greedy linear programming problems.  |
Math. Program.  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Jerzy Kamburowski, Matthias F. M. Stallmann |
Optimal Reductions of Two-Terminal Directed Acyclic Graphs.  |
SIAM J. Comput.  |
1992 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #52 of 52 (100 per page; Change: )
|
|