JCSS, Volume 56

Volume 56, Number 1, February 1998

• Seymour Ginsburg, Xiaoyang Sean Wang:
  Regular Sequence Operations and Their Use in Database Queries. 1-26
  
• Giorgio Satta:
  Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems. 27-45
  
• Andreas Weber:
  Transforming a Single-Valued Transducer Into a Mealy Machine. 46-59
  
• Giovanni Manzini, Luciano Margara:
  Invertible Linear Cellular Automata over Z_m: Algorithmic and Dynamical Aspects. 60-67
  
• Rajeev Rastogi, Sharad Mehrotra, Yuri Breitbart, Henry F. Korth, Abraham Silberschatz:
  On Correctness of Nonserializable Executions. 68-82
  
• Sanguthevar Rajasekaran, Shibu Yooseph:
  TAL Recognition in O(M(n»)) Time. 83-89
  
• Pavol Duris, José D. P. Rolim:
  Lower Bounds on the Multiparty Communication Complexity. 90-95
  
• Richard E. Ladner, Anthony LaMarca, Ewan D. Tempero:
  Counting Protocols for Reliable End-to-End Transmission. 96-111
  
• Daoud Bshouty, Nader H. Bshouty:
  On Interpolating Arithmetic Read-Once Formulas with Exponentiation. 112-124
  
• Juha Kortelainen:
  Remarks about Commutative Context-Free Languages. 125-129
  

Volume 56, Number 2, April 1998

• Dana Ron, Yoram Singer, Naftali Tishby:
  On the Learnability and Usage of Acyclic Probabilistic Finite Automata. 133-152
  
• V. G. Vovk:
  A Game of Prediction with Expert Advice. 153-173
  
• Peter L. Bartlett, Philip M. Long:
  Prediction, Learning, Uniform Convergence, and Scale-Sensitive Dimensions. 174-190
  
• Javed A. Aslam, Scott E. Decatur:
  Specification and Simulation of Statistical Query Algorithms for Efficiency and Noise Tolerance. 191-208
  
• Avrim Blum, Prasad Chalasani, Sally A. Goldman, Donna K. Slonim:
  Learning with Unreliable Boundary Queries. 209-222
  
• Jeong Han Kim, James R. Roche:
  Covering Cubes by Random Half Cubes with Applications to Binary Neural Networks. 223-252
  

Volume 56, Number 3, June 1998

• Lucian Ilie, Arto Salomaa:
  2-Testability and Relabelings Produce Everything. 253-262
  
• Christer Berg, Staffan Ulfberg:
  A Lower Bound for Perceptrons and an Oracle Separation of the PP^PH Hierarchy. 263-271
  
• Arun Sharma:
  A Note on Batch and Incremental Learnability. 272-276
  
• Shai Ben-David, Eli Dichterman:
  Learning with Restricted Focus of Attention. 277-298
  
• Francesco M. Malvestuto, Marina Moscarini:
  A Fast Algorithm for Query Optimization in Universal-Relation Databases. 299-309
  
• Nader H. Bshouty, Lisa Hellerstein:
  Attribute-Efficient Learning in Query and Mistake-Bound Models. 310-319
  
• Lin Chen:
  Optimal Circular Arc Representations: Properties, Recognition, and Construction. 320-331
  
• Joost Engelfriet, Heiko Vogler:
  The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers. 332-356
  

Last update Sat May 25 20:41:22 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page