Volume 3,
1993
- Detlef Sieling, Ingo Wegener:
NC-Algorithms for Operations on Binary Decision Diagrams.
3-12
- Lih-Hsing Hsu:
Matching Polynomials of Series-Parallel Graphs.
13-18
- Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber:
An Optimal Algorithm for computing Census Functions in Message-Passing Systems.
19-23
- John Tromp:
On Update-Last Schemes.
25-28
- Henri-Pierre Charles, Pierre Fraigniaud:
Scheduling a Scattering-Gathering Sequence on Hypercubes.
29-42
- Ján Glasa:
Bit-Level Systolic Arrays for Digital Contour Smoothing by Abel-Poisson Kernel.
43-51
- Hesham H. Ali, Hesham El-Rewini:
The Time complexity of Scheduling Interval Orders with Communication Is Polynomial.
53-58
- Rong Lin, Stephan Olariu, James L. Schwing, Jingyuan Zhang:
Simulating Enhanced Meshes, with Applications.
59-70
- Paraskevi Fragopoulou:
On the Efficient Summation of N Numbers on an N-Processor Reconfigurable Mesh.
71-78
- Stephan Olariu, Wenhui Shen, Larry Wilson:
Sub-Logarithmic Algorithms for the Largest Empty Rectangle Problem.
79-85
- Paul Gastin, Vincent Villain:
An Efficient Crash-tolerant Sequential Traversal.
87-97
- Irina Virbitskaite:
Some characteristics of Nondeterministic Processes.
99-106
- Danny Krizanc, Sanguthevar Rajasekaran, Sunil M. Shende:
A Comparison of Meshes with Static Buses and Half-Duplex Wrap-Arounds.
109-114
- Dominique Barth:
Embedding Meshes of d-Ary Trees into de Bruijn Graphs.
115-127
- Steven Cheung, Francis C. M. Lau:
Time Lower Bounds for Permutation Routing on Multi-Dimensional Bused Meshes.
129-138
- Peter J. Looges, Stephan Olariu:
A Practical Platform for Crew Emulation.
139-145
- Hartmut Schmeck, Heiko Schröder, Jørgen Staunstrup, Martin Middendorf:
Problem Heaps and Their Evaluation.
147-155
- Palanivel Thangavel, Vasantha P. Muthuswamy:
A Parallel Algorithm to generate N-Ary Reflected Gray Codes in a Linear Array with Reconfigurable Bus System.
157-164
- N. Chandrasekharan, Laks V. S. Lakshmanan, Muralidhar Medidi:
Efficient Parallel Algorithms for Finding Chordless Cycles in Graphs.
165-170
- B. Pradeep, C. Siva Ram Murthy:
A Constant Time Algorithm for Redundancy Elimination in Task Graphs on Processor Arrays with Reconfigurable Bus Systems.
171-177
- Oscar G. Plata, Tomás F. Pena, Francisco F. Rivera, Emilio L. Zapata:
An Efficient Processor Allocation for Nested Parallel Loops on Distributed Memory Hypercubes.
179-187
- Kuo-Liang Chung, Hsun-Wen Chang:
Novel Pipelining and Processor Allocation Strategy for Monoid Computations on Unshuffle-Exchange Networks.
189-193
- Anindya Das, Krishnaiyan Thulasiraman, K. B. Lakshmanan, Vinod K. Agarwal:
Distributed Fault diagnosis of a Ring of Processors.
195-204
- Raymond Greenlaw:
Breadth-Depth Search is P-Complete.
209-222
- Edson Cáceres, Narsingh Deo, Shivakumar Sastry, Jayme Luiz Szwarcfiter:
On Finding Euler Tours in Parallel.
223-231
- Arjun Raman, C. Pandu Rangan:
A Unified Approach to Parallel Algorithms for the Domatic Partition Problem on Special Classes of Perfect Graphs.
233-241
- Rajendra Kulkarni, Shashank Date, Bhavna Kulkarni, Urmila Kulkarni-Kale, Ashok S. Kolaskar:
PRAS: Parallel Alignment of Sequences Algorithm.
243-252
- Dmitry Fon-Der-Flaass, Ivan Rival:
Collecting Information in Graded Ordered Sets.
253-260
- Eric J. Schwabe:
Optimality of a VLSI Decomposition Scheme for the Debruijn Graph.
261-265
- Paul C. Xirouchakis, Pearl Y. Wang, Ophir Frieder:
Data Parallel Visual Reconstruction and Partitioning Algorithms.
267-277
- P. S. P. Wang:
Parallel Object Representation and Recognition.
279-290
- Lisa Higham, Eric Schenk:
Pram Memory Allocation and Initialization.
291-299
- Paraskevi Fragopoulou:
On the Comparative Powers of the 2D-Parbs and the CRCW-Pram Models.
301-304
- Abdelmadjid Bouabdallah, Jean-Claude König:
An Improvement of the Maekawa's Mutual Exclusion Algorithm to Make it Fault-Tolerant.
305
- Yu-Chen Kuo, Shing-Tsaan Huang:
An Improvement of the Maekawa's Mutual Exclusion Algorithm to Make it Fault-Tolerant.
307-308
- Philip D. MacKenzie:
A Lower Bound for Order-Preserving Broadcast in the Postal Model.
313-320
- José Duato:
On the Design of Deadlock-Free Adaptive Multicast Routing Algorithms.
321-333
- Jehoshua Bruck, Ching-Tien Ho:
Efficient Global Combine Operations in Multi-Port Message-Passing Systems.
335-346
- Arthur L. Liestman, Dana S. Richards:
Perpetual Gossiping.
347-355
- Satoshi Fujita, Masafumi Yamashita:
Optimal Gossiping in Mesh-Bus Computers.
357-361
- Frederic Daniel, Gerard Authié:
Shortest Paths Multiplicity in Generalized de Bruijn and Kautz Networks.
363-374
- Robert A. Rowley, Bella Bose:
On the Number of Arc-Disjoint Hamiltonian Circuits in the de Bruijn Graph.
375-380
- Arthur M. Farley, Andrzej Proskurowski:
Self-Repairing Networks.
381-391
- Vincenzo Auletta, Adele Anna Rescigno, Vittorio Scarano:
Fault Tolerant Routing in the Supercube.
393-405
- Ramesh Subramonian, Narayan Venkatasubramanyan:
Efficient Multiple-Item Broadcase in the LogP Model.
407-417
- Joël M. Malard, Christopher C. Paige:
Data Replication in Dense Matrix Factorization.
419-430
- François Pellegrini:
Bounds for the Bandwidth of the d-Ary de Bruijn Graph.
431-443
- Miguel Angel Fiol, Josep Fàbrega, Oriol Serra, J. Luis A. Yebra:
A Unified Approach to the design and Control of Dynamic Memory Networks.
445-456
- Leizhen Cai, J. Mark Keil:
Degree-Bounded Spanners.
457-468
- Agustin Arruabarrena, Ramón Beivide, Cruz Izu, José Miguel-Alonso:
A Perfomance Evaluation of Adaptive Routing in Bidimensional Cut-Through Networks.
469-484
- Chris R. Jesshope:
Latency Reduction in VLSI Routers.
485-494
- Pierre Fiorini:
The Xomega & the Omega Pyramids, a New Family of Competitive Interconnection Networks.
495-506
- Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau:
Open Problems.
507-524
Copyright © Mon Dec 21 00:43:46 2009
by Michael Ley (ley@uni-trier.de)
