✦ LIBER ✦

One-to-one mappings defined by finite transformers

✍ Scribed by L. P. Lisovik

Publisher: Springer US
Year: 1995
Tongue: English
Weight: 587 KB
Volume: 31
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf02366312

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A group of one-to-one transformations de

A group of one-to-one transformations defined by finite automata

✍ F. Geceg 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 190 KB

Finite-to-one mappings and large transfi

Finite-to-one mappings and large transfinite dimension

✍ Yasunao Hattori; Kohzo Yamada 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 841 KB

Pol (1996) and Arenas (1996) independently introduced transfinite extensions of finite order of mappings by the use of the length of a partially ordered set and Borst's order, respectively. By use of the transfinite order of mappings, Arenas introduced a transfinite dimension O-dim based on the Mori

On structures defined by mapping filters

✍ Erwin Engeler 📂 Article 📅 1966 🏛 Springer 🌐 English ⚖ 529 KB

On one modulus inequality for mappings w

On one modulus inequality for mappings with finite length distortion

✍ E. A. Sevost’yanov 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 126 KB

Transformation of functionally defined s

Transformation of functionally defined shapes by extended space mappings

✍ V. Savchenko; A. Pasko 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 582 KB

Random Data Accesses on a Coarse-Grained

Random Data Accesses on a Coarse-Grained Parallel Machine I. One-to-One Mappings

✍ Ravi V. Shankar; Sanjay Ranka 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 271 KB

This paper describes deterministic communication-efficient algorithms for performing dynamic permutations on a coarsegrained parallel machine. Our analysis shows that the general permutation operation can be completed in Cµn/p (+ lower order terms) time and is optimal and scalable provided n >> p 3