default search action
Wolfgang W. Bein
- > Home > Persons > Wolfgang W. Bein
Publications
- 2023
- [j34]Wolfgang Bein, Lawrence L. Larmore:
Breaking the 2-competitiveness barrier for two servers in a tree. Theor. Comput. Sci. 977: 114152 (2023) - 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) - 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) - 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) - [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) - [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
- [c19]Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk:
Knowledge States: A Tool for Randomized Online Algorithms. HICSS 2008: 476 - 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]Wolfgang W. Bein, Lawrence L. Larmore, John Noga:
Equitable Revisited. ESA 2007: 419-426 - [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. Discret. Appl. Math. 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 - [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
- [j14]Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough:
Embedding A Complete Binary Tree Into A Three-Dimensional Grid. J. Interconnect. Networks 5(2): 111-130 (2004) - [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) - 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 O. 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 O. Shields Jr., Ivan Hal Sudborough:
Three-Dimensional Embedding of Binary Trees. ISPAN 2000: 140-147 - 1999
- [c1]Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore:
The 3-Server Problem in the Plane. ESA 1999: 301-312
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint