scientific article; zbMATH DE number 1142307
From MaRDI portal
zbMath0900.68257MaRDI QIDQ4385523
Publication date: 4 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items
Methods for message routing in parallel machines, An external-memory algorithm for string graph construction, Implementing an ODE code on distributed memory computers, PRAM's towards realistic parallelism: BRAM's, Direct bulk-synchronous parallel algorithms, Towards a better understanding of pure packet routing, Exploiting storage redundancy to speed up randomized shared memory simulations, Efficient parallel graph algorithms for coarse grained multicomputers and BSP, Efficient PRAM simulation on a distributed memory machine, The bulk-synchronous parallel random access machine, ERCW PRAMs and optical communication, Architecture independent parallel selection with applications to parallel priority queues, Communication and energy efficient routing protocols for single-hop radio networks, On the theory of interconnection networks for parallel computers, Data independence of read, write, and control structures in PRAM computations, Thinning protocols for routing \(h\)-relations over shared media, Communication primitives for BSP computers, A lower bound for communication on the crossbar, An architecture independent study of parallel segment trees, Efficient parallel algorithms can be made robust, Randomized parallel list ranking for distributed memory multiprocessors., A scalable record locking scheme for parallel file access, Efficient automatic simulation of parallel computation on networks of workstations, Sync/Async parallel search for the efficient design and construction of web search engines, Tight bounds for oblivious routing in the hypercube, Recursive information transducers: Computation models, Algorithms for the parallel alternating direction access machine, The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms, Space-efficient parallel merging
