Volume 8, Number 1, March 1997
- Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa:
Geometric Transformations on Language Families: The Power of Symmetry.
1-14
- Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann:
Classifying Predicates and Languages.
15-42
- Lucian Finta, Zhen Liu:
Complexity of Task Graph Scheduling with Fixed Communication Capacity.
43-66
- Sorina Dumitrescu, Gheorghe Paun, Arto Salomaa:
Pattern Languages Versus Parallel Communicating Grammar Systems.
67-80
- Oscar H. Ibarra, Pedro C. Diniz, Martin C. Rinard:
On the Complexity of Commutativity Analysis.
81-94
- Lane A. Hemaspaandra, Zhigen Jiang:
Logspace Reducibility: Models and Equivalences.
95-
Volume 8, Number 2, June 1997
- Jean-Claude Bermond, Hovhannes A. Harutyunyan, Arthur L. Liestman, Stephane Perennes:
A Note on the Dimensionality of Modified Knö;del Graphs.
109-116
- Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
Hop-Congestion Trade-Offs for High-Speed Networks.
117-126
- S.-C. Hu, C.-B. Yang:
Fault Tolerance on Star Graphs.
127-142
- Pascal Berthomé, Afonso Ferreira:
Communication Issues in Parallel Systems with Optical Interconnections.
143-162
- Sajal K. Das, Dirk H. Hohndel, Maximilian Ibel, Sabine R. Öhring:
Efficient Communication in Folded Petersen Networks.
163-185
- Jie Wu, Haifeng Qian:
Multitriangle: A Constant Node Degree Interconnection Network.
187-210
- Christophe Calvin, Laurent Colombet, Philippe Michallon:
Methods to Overlap Communications in Parallel Numerical Algorithms.
211-236
Volume 8, Number 3, September 1997
- H. K. Dai:
The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties.
237-252
- Y. W. Keum, H. Rim:
Design and Analysis of the Symmetric Banyan Network(SBN): A Min with High Performance and High Fault Tolerance.
253-268
- Jop F. Sibeyn:
Routing or Triangles, Tori and Honeycombs.
269-287
- Marc Baumslag, Bojana Obrenic:
Index-Shuffle Graphs.
289-304
- X. Jia, W. Su:
Triple Loop Networks with Minimal Transmission Delay.
305-328
- A. Heirich:
A Scalable Diffusion Algorithm for Dynamic Mapping and Load Balancing on Networks of Arbitrary Topology.
329-346
- Burkhard Monien, Ralf Diekmann, Reinhard Lüling:
The Construction of Large Scale Reconfigurable Parallel Computing Systems (The Architecture of the SC320).
347-361
Volume 8, Number 4, December 1997
- P. Krishnan:
A Process Algebraic Approach to Time Granularity Semantics.
363-378
- Twan Basten:
Parsing Partially Ordered Multisets.
379-407
- Mark Changizi:
Learning with Natural Imprecision.
409-424
- B. Martin:
Embedding Torus Automata into a Ring of Automata.
425-432
- Vikraman Arvind:
Constructivizing Membership Proofs in Complexity Classes.
433-442
- Glenn K. Manacher, Terrance A. Mankus:
Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications.
469-
Last update Mon May 20 17:43:47 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
