| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula |
Self-stabilizing leader election in optimal space under an arbitrary scheduler.  |
Theor. Comput. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 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 | Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore |
Self-Stabilizing k-out-of-ℓ Exclusion in Tree Networks. |
Int. J. Found. 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 | Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula |
An O(n)-time self-stabilizing leader election algorithm. |
J. Parallel Distrib. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore |
Un algorithme autostabilisant pour le problème du K-partitionnement sur graphe pondéré. |
Technique et Science Informatiques |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eddy Caron, Benjamin Depardon, Ajoy Kumar Datta, Lawrence L. Larmore |
On-Line Optimization of Publish/Subscribe Overlays. |
IPDPS Workshops |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Bui, Simon Clavière, Ajoy Kumar Datta, Lawrence L. Larmore, Devan Sohier |
Self-stabilizing Hierarchical Construction of Bounded Size Clusters. |
SIROCCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes |
Sorting on Skip Chains. |
ICNC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, François Kawala, Maria Potop-Butucaru |
Multi-resource Allocation with Unknown Participants. |
ICNC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre, Ajoy Kumar Datta, Lawrence L. Larmore |
Self-Stabilizing Small k-Dominating Sets. |
ICNC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ajoy Kumar Datta, Anne-Marie Kermarrec, Lawrence L. Larmore, Erwan Le Merrer |
Brief Announcement: A Stable and Robust Membership Protocol. |
SSS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore |
Brief Announcement: Sorting on Skip Chains. |
SSS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre |
Self-stabilizing Labeling and Ranking in Ordered Trees. |
SSS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore |
A self-stabilizing k-clustering algorithm for weighted graphs. |
J. Parallel Distrib. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula |
A Self-Stabilizing O(k)-Time k-Clustering Algorithm. |
Comput. J. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ajoy Kumar Datta, Lawrence L. Larmore, Hema Piniganti |
Self-stabilizing Leader Election in Dynamic Networks. |
SSS |
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, 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 | Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore |
A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric. |
Euro-Par |
2009 |
DBLP DOI BibTeX RDF |
K-clustering, self-stabilization, weighted graph |
| 1 | Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore |
Self-Stabilizing k-out-of-l exclusion on tree networks. |
IPDPS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore |
A Self-Stabilizing O(n)-Round k-Clustering Algorithm. |
SRDS |
2009 |
DBLP DOI BibTeX RDF |
K-dominating set, K-clustering, silent, self-stabilization, unfair scheduler |
| 1 | Christian Boulinier, Ajoy Kumar Datta, Lawrence L. Larmore, Franck Petit |
Space efficient and time optimal distributed BFS tree construction. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore |
Synchronization Algorithms on Oriented Chains. |
Sci. Ann. Comp. Sci. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore |
Self-stabilizing K-out-of-L exclusion on tree network |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore |
Self-stabilizing algorithms for sorting and heapification. |
IPDPS |
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 | Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula |
Self-Stabilizing Leader Election in Optimal Space. |
SSS |
2008 |
DBLP DOI BibTeX RDF |
Distributed algorithm, self-stabilization, leader election |
| 1 | Doina Bein, Ajoy Kumar Datta, Chitwan K. Gupta, Lawrence L. Larmore |
Local Synchronization on Oriented Rings. |
SSS |
2008 |
DBLP DOI BibTeX RDF |
Local mutual exclusion, oriented ring, synchronization, transformer, self-stabilization |
| 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, 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 | Lawrence L. Larmore, James A. Oravec |
T-Theory Applications to Online Algorithms for the Server Problem |
CoRR |
2006 |
DBLP 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 | Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore |
Self-stabilizing Space Optimal Synchronization Algorithms on Trees. |
SIROCCO |
2006 |
DBLP DOI BibTeX RDF |
local mutual exclusion, self-stabilization, heap |
| 1 | Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore |
On Self-stabilizing Search Trees. |
DISC |
2006 |
DBLP DOI BibTeX RDF |
min-max heap, Distributed algorithm, self-stabilization, search tree |
| 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 | T. C. Hu, Lawrence L. Larmore, J. David Morgenthaler |
Optimal Integer Alphabetic Trees in Linear Time. |
ESA |
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, 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 | Marek Karpinski, Lawrence L. Larmore, Yakov Nekrich |
Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes. |
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, 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 | Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter |
Faster Algorithms for k-Medians in Trees. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Michel X. Goemans (eds.) |
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA |
STOC |
2003 |
DBLP 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 | Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter |
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. |
J. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter |
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. |
J. Comput. Syst. 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 | Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter |
The k-Median Problem for Directed Trees. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 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 | Yair Bartal, Marek Chrobak, Lawrence L. Larmore |
A Randomized Algorithm for Two Servers on the Line. |
Inf. Comput. |
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 | Jeffrey Scott Vitter, Lawrence L. Larmore, Frank Thomson Leighton (eds.) |
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, USA |
STOC |
1999 |
DBLP BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Wojciech Rytter |
Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Teresa M. Przytycka |
The Optimal Alphabetic Tree Problem Revisited. |
J. Algorithms |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Marek Chrobak, Lawrence L. Larmore |
A Randomized Algorithm for Two Servers on the Line (Extended Abstract). |
ESA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter |
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. |
ESA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Lawrence L. Larmore, Carsten Lund, Nick Reingold |
A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter |
Correctness of Constructing Optimal Alphabetic Trees Revisited. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook |
Page Migration Algorithms Using Work Functions. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter |
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. |
CPM |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Teresa M. Przytycka |
A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees. |
J. Parallel Distrib. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter |
Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. |
SODA |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Lawrence L. Larmore |
Metrical Task Systems, the Server Problem and the Work Function Algorithm. |
Online Algorithms |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Teresa M. Przytycka |
Constructing Huffman Trees in Parallel. |
SIAM J. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Wojciech Rytter |
An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Lawrence L. Larmore |
Generosity Helps or an 11-Competitive Algorithm for Three Servers. |
J. Algorithms |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Teresa M. Przytycka |
A Fast Algorithm for Optimum Height-Limited Alphabetic Binary Trees. |
SIAM J. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Teresa M. Przytycka, Lawrence L. Larmore |
The Optimal Alphabetic Tree Problem Revisited. |
ICALP |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Teresa M. Przytycka, Wojciech Rytter |
Parallel Construction of Optimal Alphabetic Trees. |
SPAA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook |
Page Migration Algorithms Using Work Functions. |
ISAAC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Lawrence L. Larmore |
Harmonic is 3-Competitive for Two Servers. |
Theor. Comput. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Daniel D. Gajski, Allen C.-H. Wu |
Layout placement for sliced architecture. |
IEEE Trans. on CAD of Integrated Circuits and Systems |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel S. Hirschberg, Lawrence L. Larmore |
The Traveler's Problem. |
J. Algorithms |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Lawrence L. Larmore |
Generosity Helps, or an 11-Competitive Algorithm for Three Servers. |
SODA |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Wojciech Rytter |
Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition. |
STACS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Lawrence L. Larmore |
A Note on the Server Problem and a Benevolent Adversary. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Lawrence L. Larmore |
On Fast Algorithms for Two Servers. |
J. Algorithms |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Baruch Schieber |
On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. |
J. Algorithms |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Lawrence L. Larmore |
A New Approach to the Server Problem. |
SIAM J. Discrete Math. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Lawrence L. Larmore |
An Optimal On-Line Algorithm for k-Servers on Trees. |
SIAM J. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Teresa M. Przytycka |
Parallel Construction of Trees with Optimal Weighted Path Length. |
SPAA |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence L. Larmore |
An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching. |
Inf. Process. Lett. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Daniel S. Hirschberg |
A Fast Algorithm for Optimal Length-Limited Huffman Codes |
J. ACM |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Apostolico, Mikhail J. Atallah, Lawrence L. Larmore, Scott McFaddin |
Efficient Parallel Algorithms for String Editing and Related Problems. |
SIAM J. Comput. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Daniel S. Hirschberg |
Length-Limited Coding. |
SODA |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Baruch Schieber |
On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. |
SODA |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Lawrence L. Larmore |
On Fast Algorithms for Two Servers. |
MFCS |
1990 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")