JCSS, Volume 45

Volume 45, Number 1, August 1992

• Xin Wang, Edward K. Blum:
  Discrete-Time versus Continuous-Time Models of Neural Networks. 1-19
  
• Eduardo D. Sontag:
  Feedforward Nets for Interpolation and Classification. 20-48
  
• Furio Honsell, Simona Ronchi Della Rocca:
  An Approximation Theorem for Topological Lambda Models and the Topological Incompleteness of Lambda Calculus. 49-75
  
• Marc Gyssens, Dirk Van Gucht:
  The Powerset Algebra as a Natural Tool to Handle Nested Database Relations. 76-103
  
• Reuven Bar-Yehuda, Oded Goldreich, Alon Itai:
  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization. 104-126
  
• Iain A. Stewart:
  Using the Hamiltonian Path Operator to Capture NP. 127-151
  

Volume 45, Number 2, October 1992

• Jean-Camille Birget:
  Positional Simulation of Two-Way Automata: Proof of a Conjecture of R. Kannan and Generalizations. 154-179
  
• Allan Borodin, Walter L. Ruzzo, Martin Tompa:
  Lower Bounds on the Length of Universal Traversal Sequences. 180-203
  
• László Babai, Noam Nisan, Mario Szegedy:
  Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs. 204-232
  
• Tomás Feder:
  A New Fixed Point Approach for Stable Networks and Stable Marriages. 233-284
  

Volume 45, Number 3, December 1992

• Kenneth W. Regan:
  Minimum-Complexity Pairing Functions. 285-295
  
• Tak Wah Lam, Prasoon Tiwari, Martin Tompa:
  Trade-Offs between Communication and Space. 296-315
  
• Pascal Weil:
  Closure of Varieties of Languages under Products with Counter. 316-339
  
• Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough:
  Embedding Grids into Hypercubes. 340-366
  
• Ian F. Carlstrom:
  Foreground Automata. 367-384
  
• Rodney G. Downey:
  Nondiamond Theorems for Polynomial Time Reducibility. 385-395
  
• Daniel Krob:
  Models of a K-Rational Identity System. 396-434
  
• Li-Yan Yuan, Z. Meral Özsoyoglu:
  Design of Desirable Relational Database Schemes. 435-470
  
• Zoran Obradovic, Ian Parberry:
  Computing with Discrete Multi-Valued Neurons. 471-492
  
• Ulrich Schmid, Johann Blieberger:
  Some Investigations on FCFS Scheduling in Hard Real Time Applications. 493-512
  

Last update Mon May 20 01:12:13 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page