Results 211 to 220 of about 122,989 (258)
Some of the next articles are maybe not open access.
Journal of Algorithms, 2002
Summary: Near-optimal gossiping algorithms are given for two-dimensional and higher dimensional tori, assuming the full-port store-and-forward communication model. For two-dimensional tori, a previous algorithm achieved optimality in an intricate way, with an adaptive routing pattern.
Meyer, U., Sibeyn, J.
openaire +4 more sources
Summary: Near-optimal gossiping algorithms are given for two-dimensional and higher dimensional tori, assuming the full-port store-and-forward communication model. For two-dimensional tori, a previous algorithm achieved optimality in an intricate way, with an adaptive routing pattern.
Meyer, U., Sibeyn, J.
openaire +4 more sources
Bulletin of the London Mathematical Society, 1986
We give a largely group-theoretic proof of Borel's theorem that the maximal tori of a connected soluble algebraic linear group are all conjugate; the usual proofs are more geometric. The trick is to reduce the problem, essentially to a consideration of finite groups, and then to use the Schur-Zassenhaus theorem.
openaire +2 more sources
We give a largely group-theoretic proof of Borel's theorem that the maximal tori of a connected soluble algebraic linear group are all conjugate; the usual proofs are more geometric. The trick is to reduce the problem, essentially to a consideration of finite groups, and then to use the Schur-Zassenhaus theorem.
openaire +2 more sources
Even Hamiltonian systems on Tori and cotangent spaces of Tori
Nonlinear Analysis: Theory, Methods & Applications, 1997This paper deals with \(2\pi\)-periodic solutions of Hamiltonian systems and reviews some results and ideas of proofs. The details can be found in the authors' papers [\textit{T. Bartsch} and \textit{Z.-Q. Wang}, Math. Z. 224, No. 1, 65-76 (1997; Zbl 0870.34046) and J. Differ. Equations 135, No. 1, 103-128 (1997; Zbl 0872.58050)].
Bartsch, Thomas, Wang, Zhi-Qiang
openaire +1 more source