Finding Sylow normalizers in polynomial time
- 作者William M Kantor
- 卷第11卷
- 期第4期
- 印刷ISSN0196-6774
- 电子ISSN1090-2678
- 文件大小2415.10KB
- 发表时间1990
- DOI10.1016/0196-6774(90)90009-4
- 页码523-563
The Optimal Alphabetic Tree Problem RevisitedLawrence L Larmore; Teresa M Przytycka · 1998
On fast algorithms for two serversMarek Chrobak; Lawrence L Larmore · 1991
Constructing Huffman Trees in ParallelLarmore, Lawrence L.; Przytycka, Teresa M. · SIAM Journal on Computing · 1995
Block Sorting is HardBein, Wolfgang W.; Larmore, Lawrence L.; Latifi, Shahram; Sudborough, I. Hal · International Journal of Foundations of Computer Science · 2003
Page Migration Algorithms Using Work FunctionsMarek Chrobak; Lawrence L Larmore; Nick Reingold; Jeffery Westbrook · 1997
A Randomized Algorithm for Two Servers on the LineYair Bartal; Marek Chrobak; Lawrence L Larmore · 2000
Competitive self-stabilizing k-clusteringDatta, Ajoy K.; Devismes, Stéphane; Heurtefeux, Karel; Larmore, Lawrence L.; Rivierre, Yvan · Theoretical Computer Science · 2016