Volume 9, Number 1, March 1998

• 
  D. Frank Hsu, Michael A. Palis, David S. L. Wei: Editor's Foreword. 1-
• 
  S. Okawa: The Permutational Graph: A New Network Topology. 3-12
• 
  Luz R. Nochefranca, Polly W. Sy: The Diameter and Hamiltonian Cycle of the Generalized De Bruijn Graphs UG_B(n, n(n+1)). 13-24
• 
  T. J. Cortina, Z.-W. Xu: The Cube-of-Rings Interconnection Network. 25-38
• 
  Ayan Banerjee, Emmanouel A. Varvarigos: A Dynamic Scheduling Communication Protocol and Its Analysis for Hypercube Networks. 39-56
• 
  Arthur L. Liestman, Jaroslav Opatrny, Marisa Zaragozá: Network Properties of Double and Triple Fixed Step Graphs. 57-76
• 
  Guihai Chen, Francis C. M. Lau: Shuffle-Ring: A New Constant-Degree Network. 77-98
• 
  Sandy Pavel, Selim G. Akl: Integer Sorting and Routing in Arrays with Reconfigurable Optical Buses. 99-120

Volume 9, Number 2, June 1998

• 
  Miltos D. Grammatikakis, Eric Fleury, Miro Kraetzl: Continuous Routing in Packet Switches. 121-138
• 
  Román García, José Duato: Suboptimal-Optimal Routing for LAN Internetworking Using Transparent Bridges. 139-156
• 
  Fabrizio Petrini, Marco Vanneschi: Performance Analysis of Wormhole Routed K-Ary N-Trees. 157-178
• 
  Paola Flocchini, Nicola Santoro: Topological Constraints for Sense of Direction. 179-198
• 
  Sanguthevar Rajasekaran, T. McKendall: Permutation Routing and Sorting on the Reconfigurable Mesh. 199-212
• 
  Claude G. Diderich, Marc Gengler: An Extended Dimension Order Token Distribution Algorithm on k-Ary d-Cubes and Its Complexity. 213-234
• 
  Wei-Kuo Chiang, Rong-Jaye Chen: Topological Properties of the (n, k)-Star Graph. 235-248

Volume 9, Number 3, September 1998

• 
  Hervé Le Verge, Yannick Saouter: New Results on Computability of Recurrence Equations. 249-276
• 
  Hans-Jörg Burtschick, Heribert Vollmer: Lindström Quantifiers and Leaf Language Definability. 277-294
• 
  Manfred Droste, Dietrich Kuske: Recognizable and Logically Definable Languages of Infinite Computations in Concurrent Automata. 295-314
• 
  Sanjay Jain: Minimal Concept Identification and Reliability. 315-320
• 
  Fairouz Kamareddine: The Soundness of Explicit Substitution with Nameless Variables. 321-

Volume 9, Number 4, December 1998

• 
  Peter R. Cappello, Ömer Egecioglu: Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems. 351-375
• 
  Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni: Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits. 377-398
• 
  Kim S. Larsen: Sort Order Problems in Relational Databases. 399-430
• 
  M. P. A. Sellink: On the Conservativity of Leibniz Equality. 431-

last updated on Thu May 23 04:17:41 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page