Volume 4,
1994
- Jens Clausen, Jesper Larsson Träff:
Do Inherently Sequential Branch-and-Bound Algorithms Exist?
3-13
- Sajal K. Das, Ranette H. Halverson:
Simple Deterministic and Randomized Algorithms for Linked List Ranking on the Erew Pram Model.
15-27
- S. B. Yang, Sudarshan K. Dhall, S. Lakshmivarahan:
A Processor Efficient Connectivity Algorithm on Random Graphs.
29-36
- Christos Levcopoulos, Teresa M. Przytycka:
A Work-Time Trade-off in Parallel Computation of Huffman Trees and Concave Least Weight Subsequence Problem.
37-43
- Yi Pan:
A More Efficient Constant Time Algorithm for Computing the Hough Transform.
45-52
- Emina I. Milovanovic, Igor Z. Milovanovic, Mile K. Stojcev:
Solving Tridiagonal Linear Systems on MIMD Computers.
53-64
- Ming-Shin Tsai, Shing-Tsaan Huang:
A Self-Stabilizing Algorith for the Shortest Paths Problem with a Fully Distributed Demon.
65-72
- Dharmavani Bhagavathi, Stephan Olariu, W. Shen, Larry Wilson:
A Unifying Look at Semigroup Computations on Meshes with Multiple Broadcasting.
73-82
- Laxmi Gewali, Ivan Stojmenovic:
Computing External Watchman Routes on Pram, BSR, and Interconnection Network Models of Parallel Computation.
83-93
- Fotios Barlos, Ophir Frieder:
Join Workload Partitioning under Uniform and Skewed Input Relations.
95-104
- Hussein M. Alnuweiri:
A Fast Reconfigurable Network for Graph Connectivity and Transitive Closure.
105-115
- Jerry L. Trahan, Hosangadi Bhanukumar:
Parallel Random Access Machines without Boolean Operations.
117-124
- José Duato:
A Theory to Increase the Effective Redundancy in Wormhole Networks.
125-138
- Cheng-Zhong Xu, Francis C. M. Lau:
Optimal Parameters for Load Balancing with the Diffusion Method in Mesh Networks.
139-147
- Hesham H. Ali, Hesham El-Rewini:
On the Intractability of Task Allocation in Distributed Systems.
149-157
- Paul Beame, Miroslaw Kutylowski, Marcin Kik:
Information Broadcasting by Exclusive-Read Prams.
159-169
- Ramesh Rao:
R2M: A Reconfigurable Rewrite Machine.
171-180
- Giuseppe Persiano:
An Optimal Algorithm for the Dining Philosophers Problem.
181-187
- Christian Heckler, Lothar Thiele:
Computing Linear Data Dependencies in Nested Loop Programs.
193-204
- Wayne Kelly, William Pugh:
Selecting Affine Mappings Based on Performance Estimation.
205-219
- Martin Griebl, Christian Lengauer:
On the Space-Time Mapping of While-Loops.
221-232
- Paul Feautrier:
Toward Automatic Distribution.
233-244
- Catherine Mongenet:
Data Compiling for Systems of Uniform Recurrence Equations.
245-257
- Alain Darte, Yves Robert:
On the Alignment Problem.
259-270
- Florin Balasa, Frank H. M. Franssen, Francky Catthoor, Hugo De Man:
Transformation of Nested Loops with Modulo Indexing to Affine Recurrences.
271-280
- Richard J. Anderson, Barbara B. Simons:
A Fast Heuristiv for Loop Parallelization.
281-299
- Vincent Van Dongen:
Compiling Distributed Loops onto SPMD Code.
301-312
- Eric Violard:
A Mathematical Theory and Its Environment for Parallel Programming.
313-328
- John T. O'Donnell:
A Correctness Proof of Parallel Scan.
329-338
- Kumar N. Ganapathy, Benjamin W. Wah:
Optimal Synthesis of Processor Arrays with Pipelined Arithmetic Units.
339-350
- Maher K. Rahmouni, Kevin O'Brien, Ahmed Amine Jerraya:
A Loop-Based Scheduling Algorithm for Hardware Description Languages.
351-364
- Cécile Germain, Franck Delaplace, R. Carlier:
A Static Execution Model for Data Parallelism.
367-378
- Francesc Comellas, Miguel Angel Fiol, José Gómez:
On Large Vertex Symmetric 2-Reachable Digraphs.
379-384
- Ray-Shyng Chou, Lih-Hsing Hsu:
1-Edge Fault-Tolerant designs for Meshes.
385-389
- Franco Gasperoni, Uwe Schwiegelshohn:
Generating Close to Optimum Loop Schedules on Parallel Processors.
391-403
- Mateo Valero, Eduard Ayguadé, Montse Peiron:
Network Synchronization and Out-of-Order Access to Vectors.
405-415
- Krzysztof Diks, Adam Malinowski, Andrzej Pelc:
Reliable Token Despersal with Random Faults.
417-427
- Sanjeev Saxena, Pramod Chandra P. Bhatt, V. C. Prasad:
On Parallel Prefix Computation.
429-436
- Clive N. Galley, Costas S. Iliopoulos:
A Simple Parallel Algorithm for the Single Function Coarsest Partition Problem.
437-445
- L. K. Swift, Theodore Johnson, Panos E. Livadas:
Parallel Creation of Linear Octress from Quadtree Slices.
447-453
- Maurice Nivat, G. D. S. Ramkumar, C. Pandu Rangan, Ahmed Saoudi, Ravi Sundaram:
Efficient Parallel Shuffle Recognition.
455-463
- Rong Lin, Stephan Olariu, James L. Schwing, Jingyuan Zhang:
Computing on Reconfigurable Buses - A New Computational Paradigm.
465-476
- Sandeep K. S. Gupta, Chua-Huang Huang, P. Sadayappan, Rodney W. Johnson:
Implementing Fast Fourier Transforms on Distributed-Memory Multiprocessors Using Data Redistributions.
477-488
Copyright © Sun Nov 15 05:56:51 2009
by Michael Ley (ley@uni-trier.de)
