![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/lmsjcm/lmsjcm7.bht:"
@article{DBLP:journals/lmsjcm/AnW04, author = {Jianbei An and Robert A. Wilson}, title = {The Alperin Weight Conjecture and Uno's Conjecture for the Baby Monster B, \({}_{\mbox{p}}\) Odd}, journal = {{LMS} J. Comput. Math.}, volume = {7}, pages = {120--166}, year = {2004}, url = {https://doi.org/10.1112/s1461157000001078}, doi = {10.1112/S1461157000001078}, timestamp = {Wed, 03 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmsjcm/AnW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmsjcm/BatesR04, author = {Chris J. Bates and Peter Rowley}, title = {Involutions in Conway's Largest Simple Group}, journal = {{LMS} J. Comput. Math.}, volume = {7}, pages = {337--351}, year = {2004}, url = {https://doi.org/10.1112/s1461157000001157}, doi = {10.1112/S1461157000001157}, timestamp = {Wed, 03 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmsjcm/BatesR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmsjcm/CampbellHRR04, author = {Colin M. Campbell and George Havas and Colin Ramsay and Edmund F. Robertson}, title = {Nice Efficient Presentions for all Small Simple Groups and their Covers}, journal = {{LMS} J. Comput. Math.}, volume = {7}, pages = {266--283}, year = {2004}, url = {https://doi.org/10.1112/s1461157000001121}, doi = {10.1112/S1461157000001121}, timestamp = {Wed, 03 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmsjcm/CampbellHRR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmsjcm/Cipu04, author = {Mihai Cipu}, title = {Upper Bounds for Norms of Products of Binomials}, journal = {{LMS} J. Comput. Math.}, volume = {7}, pages = {37--49}, year = {2004}, url = {https://doi.org/10.1112/s1461157000001030}, doi = {10.1112/S1461157000001030}, timestamp = {Wed, 03 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmsjcm/Cipu04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmsjcm/Davies04, author = {E. Brian Davies}, title = {Computing the Decay of a Simple Reversible Sub-Markov Semigroup}, journal = {{LMS} J. Comput. Math.}, volume = {7}, pages = {1--20}, year = {2004}, url = {https://doi.org/10.1112/s1461157000001017}, doi = {10.1112/S1461157000001017}, timestamp = {Wed, 03 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmsjcm/Davies04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmsjcm/GalbraithR04, author = {Steven D. Galbraith and Victor Rotger}, title = {Easy Decision Diffie-Hellman Groups}, journal = {{LMS} J. Comput. Math.}, volume = {7}, pages = {201--218}, year = {2004}, url = {https://doi.org/10.1112/s1461157000001108}, doi = {10.1112/S1461157000001108}, timestamp = {Wed, 03 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmsjcm/GalbraithR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmsjcm/Hess04, author = {F. Hess}, title = {Generalising the {GHS} Attack on the Elliptic Curve Discrete Logarithm Problem}, journal = {{LMS} J. Comput. Math.}, volume = {7}, pages = {167--192}, year = {2004}, url = {https://doi.org/10.1112/s146115700000108x}, doi = {10.1112/S146115700000108X}, timestamp = {Wed, 03 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmsjcm/Hess04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmsjcm/JacobsL04, author = {Pascale Jacobs and Dimitri Leemans}, title = {An Algorithmic Analysis of the Intersection Property}, journal = {{LMS} J. Comput. Math.}, volume = {7}, pages = {284--299}, year = {2004}, url = {https://doi.org/10.1112/s1461157000001133}, doi = {10.1112/S1461157000001133}, timestamp = {Sat, 27 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmsjcm/JacobsL04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmsjcm/Le04, author = {Huiling Le}, title = {Estimation of Riemannian Barycentres}, journal = {{LMS} J. Comput. Math.}, volume = {7}, pages = {193--200}, year = {2004}, url = {https://doi.org/10.1112/s1461157000001091}, doi = {10.1112/S1461157000001091}, timestamp = {Wed, 03 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmsjcm/Le04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmsjcm/Matthews04, author = {P. C. Matthews}, title = {Automating Symmetry-Breaking Calculations}, journal = {{LMS} J. Comput. Math.}, volume = {7}, pages = {101--119}, year = {2004}, url = {https://doi.org/10.1112/s1461157000001066}, doi = {10.1112/S1461157000001066}, timestamp = {Wed, 03 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmsjcm/Matthews04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmsjcm/McMurdy04, author = {Ken McMurdy}, title = {Stable Model of \emph{X}\({}_{\mbox{0}}\)(125)}, journal = {{LMS} J. Comput. Math.}, volume = {7}, pages = {21--36}, year = {2004}, url = {https://doi.org/10.1112/s1461157000001029}, doi = {10.1112/S1461157000001029}, timestamp = {Wed, 03 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmsjcm/McMurdy04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmsjcm/MuzereauSV04, author = {A. Muzereau and Nigel P. Smart and Frederik Vercauteren}, title = {The Equivalence between the {DHP} and {DLP} for Elliptic Curves Used in Practical Applications}, journal = {{LMS} J. Comput. Math.}, volume = {7}, pages = {50--72}, year = {2004}, url = {https://doi.org/10.1112/s1461157000001042}, doi = {10.1112/S1461157000001042}, timestamp = {Wed, 03 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmsjcm/MuzereauSV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmsjcm/NeumannP04, author = {Peter M. Neumann and Cheryl E. Praeger}, title = {On Tensor-Factorisation Problems, {I:} The Combinatorial Problem}, journal = {{LMS} J. Comput. Math.}, volume = {7}, pages = {73--100}, year = {2004}, url = {https://doi.org/10.1112/s1461157000001054}, doi = {10.1112/S1461157000001054}, timestamp = {Wed, 03 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmsjcm/NeumannP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmsjcm/Rowley04, author = {Peter Rowley}, title = {Cross Orbits}, journal = {{LMS} J. Comput. Math.}, volume = {7}, pages = {219--265}, year = {2004}, url = {https://doi.org/10.1112/s146115700000111x}, doi = {10.1112/S146115700000111X}, timestamp = {Wed, 03 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmsjcm/Rowley04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmsjcm/Vsemirnov04, author = {Maxim Vsemirnov}, title = {Hurwitz Groups of Intermediate Rank}, journal = {{LMS} J. Comput. Math.}, volume = {7}, pages = {300--336}, year = {2004}, url = {https://doi.org/10.1112/s1461157000001145}, doi = {10.1112/S1461157000001145}, timestamp = {Wed, 03 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmsjcm/Vsemirnov04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.