The Computer Journal, Volume 36, 1993

Volume 36, Number 1, 1993

• David Hutchison:
  Special Issue Editorial: Distributed Multimedia Systems. 2-3
  
• François Horn, Jean-Bernard Stefani:
  On Programming and Supporting Multimedia Object Synchronisation. 4-18
  
• Srinivas Ramanathan, P. Venkat Rangan:
  Feedback Techniques for Intra-Media Continuity and Inter-Media Synchronization in Distributed Multimedia Systems. 19-31
  
• Phillip Lougher, Doug Shepherd:
  The Design of a Storage Server for Continuous Media. 32-42
  
• Wassim Tawbi, François Horn, Eric Horlait, Jean-Bernard Stefani:
  Video Compression Standards and Quality of Service. 43-54
  
• Ian Wakeman:
  Packetized Video Options for Interaction between the User, the Network and the Codec. 55-67
  
• Peter E. Tischer, Roderick T. Worley, Anthony J. Maeder, M. Goodwin:
  Context-based Lossless Image Compression. 68-77
  
• Michalis Vazirgiannis, Costas Mourlas:
  An Object-Oriented Model for Interactive Multimedia Presentations. 78-86
  
• Harrick M. Vin, Mon-Song Chen, Tsipora P. Barzilai:
  Collaboration Management in DiCE. 87-96
  
• Siu Cheung Hui, Angela Goh, L. H. Lau:
  A Multimedia Information System For IC Failure Analysis. 97-105
  

Volume 36, Number 2, 1993

• Jürg Nievergelt, Peter Widmayer:
  Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects. 107-116
  
• Michael F. Challis:
  Two New Techniques for Computing Extremal h-bases A_k. 117-126
  
• Brian Knight:
  Information Loss in Temporal Knowledge Representations. 128-136
  
• Stephen S. Yau, Jacob V. Gore:
  Paradigm Lost: Discovering the Intersection of Assertion-Guided Program Construction and Constraint-Driven Reevaluation. 137-142
  
• Nava Pliskin, Celia T. Romm, Allen S. Lee, Yaakov Weber:
  Presumed Versus Actual Organizational Culture: Managerial Implications for Implementation of Information Systems. 143-152
  
• M. Elizabeth C. Hull, Peter G. O'Donoghue:
  Family Relationships between Requirements and Design Specification Methods. 153-167
  
• Christopher Burdorf, Jed Marti:
  Load Balancing Strategies for Time Warp on Multi-User Workstations. 168-176
  
• Vincenzo Catania, Antonio Puliafito, Lorenzo Vita:
  A Model for Performance Evaluation of Gracefully Degrading Systems. 177-185
  
• Richard J. Millar, M. Elizabeth C. Hull, J. H. Frazer:
  The Millar Polyhedron and its use in the Construction of Octrees. 186-194
  
• Alexandra Poulovassilis:
  A Pattern-Matching Algorithm for Functional Databases. 195-199
  
• Colin C. Charlton, Paul E. Dunne, K. Halewood, Paul H. Leng:
  An Algorithm to Generate Random Large Combinational Circuits. 200-206
  

Volume 36, Number 3, 1993

• Jan van Leeuwen, Derick Wood:
  Interval Heaps. 209-216
  
• Gianfranco Rossi:
  Programs as Data in an Extended Prolog. 217-226
  
• Moshe Zviran, William J. Haga:
  A Comparison of Password Techniques for Multilevel Authentication Mechanisms. 227-237
  
• Gaétan Hains, Lenore M. R. Mullin:
  Parallel Functional Programming with Arrays. 238-245
  
• Shi-Jinn Horng:
  Constant Time Algorithm for Template Matching on a Reconfigurable Array of Processors. 246-253
  
• Inman P. de Guzmán, Peter G. Harrison, E. Medina:
  Pipelines for Divide-and-Conquer Functions. 254-268
  
• Wolfgang Appelt, Nik Tetteh-Lartey:
  The Formal Specification of the ISO Open Document Architecture (ODA) Standard. 269-279
  
• Mark Allen Weiss:
  On Finding the Height of a Binary Search Tree. 280-281
  
• B. John Oommen:
  Transforming Ill-Conditioned Constrained Problems using Projections. 282-285
  
• Ingo Wegener:
  A Simple Modification of Xunrang and Yuzhang's HEAPSORT Variant Improving its Complexity Significantly. 286-288
  

Volume 36, Number 4, 1993

• Peter Hammersley: Special Issue Editorial: Computing Curricula. 297-298
• Anthony Finkelstein:
  European Computing Curricula: A Guide and Comparative Analysis. 299-319
  
• Anthony Finkelstein, Jeff Kramer, Samson Abramsky, Krysia Broda, Sophia Drossopoulou, Susan Eisenbach:
  An Integrated Engineering Study Scheme in Computing. 320-334
  
• Jonathan D. Pemberton, Joanne M. Smailes:
  Educating the Masses - Is IT a Tricky Business? 335-342
  
• Chris Osborne:
  Planning for IT Literacy in an Institution of Higher Education: A Case Study. 343-350
  
• Peter Naur:
  Understanding Turing's Universal Machine - Personal Style in Program Description. 351-372
  
• Doug Goldson, Steve Reeves, Richard Bornat:
  A Review of Several Programs for the Teaching of Logic. 373-386
  
• Andrew Ireland:
  On Exploiting the Structure of Martin-Löf's Theory of Types. 387-298
  

Volume 36, Number 5, 1993

• Hoon Hong:
  Special Issue Editorial: Computational Quantifier Elimination. 399
  
• Felipe Cucker:
  On the Complexity of Quantifier Elimination: the Structural Approach. 400-408
  
• John F. Canny:
  Improved Algorithms for Sign Determination and Existential Quantifier Elimination. 409-418
  
• Devdatt P. Dubhashi:
  Quantifier Elimination in p-adic Fields. 419-426
  
• Joos Heintz, Marie-Françoise Roy, Pablo Solernó:
  On the Theoretical and Practical Complexity of the Existential Theory of Reals. 427-431
  
• Scott McCallum:
  Solving Polynomial Strict Inequalities Using Cylindrical Algebraic Decomposition. 432-438
  
• Hoon Hong:
  Quantifier Elimination for Formulas Constrained by Quadratic Equations via Slope Resultants. 439-449
  
• Rüdiger Loos, Volker Weispfenning:
  Applying Linear Quantifier Elimination. 450-462
  
• Vijay Chandru:
  Variable Elimination in Linear Constraints. 463-472
  
• Jean-Louis Imbert:
  Variable Elimination for Disequations in Generalized Linear Constraint Systems. 473-484
  
• Dinesh Manocha:
  Efficient Algorithms for MultiPolynomial Resultant. 485-496
  
• Richard Liska, Stanly L. Steinberg:
  Applying Quantifier Elimination to Stability Analysis of Difference Schemes. 497-503
  
• John F. Canny:
  Computing Roadmaps of General Semi-Algebraic Sets. 504-514
  
• M. J. González-López, Tomás Recio:
  Path Tracking in Motion Planning. 515-524
  

Volume 36, Number 6, 1993

• Abraham Mehrez, Geoffry S. Howard, Yaakov Lugassi, Peretz Shoval:
  Information System Planning and Selection: A Multiattribute Theoretic Approach. 525-541
  
• B. John Oommen, Chris Fothergill:
  Fast Learning Automaton-Based Image Examination and Retrieval. 542-553
  
• Daniel Y. Chao, David T. Wang, D. C. Douglas Hung:
  Convergence Time and Memory Capacity of Higher-order Hopfield Associative Memory with Multi-valued Neurons. 554-561
  
• L. Anne Breene:
  Quadtrees and Hypercubes: Grid Embedding Strategies Based on Spatial Data Structure Addressing. 562-569
  
• Henry Ker-Chang Chang, Shing Hong Chen:
  A New Locally Adaptive Data Compression Scheme using Multilist Structure. 570-578
  
• Zbigniew J. Czech, Bohdan S. Majewski:
  A Linear Time Algorithm for Finding Minimal Perfect Hash Functions. 579-587
  

• C. M. Khoong:
  Shortest-Path Reconstruction Algorithms. 588-592
  
• M. D. Atkinson:
  Uniform Generation of Rooted Ordered Trees with Prescribed Degrees. 593-594
  

Volume 36, Number 7, 1993

• Jukka Teuhola, Timo Raita:
  Application of a Finite-State Model to Text Compression. 607-614
  
• Pasi Fränti, Olli Nevalainen:
  A Two-Stage Modelling Method for Compressing Binary Images by Arithmetic Coding. 615-622
  
• Robert R. Goldberg:
  Finite State Automata from Regular Expression Trees. 623-630
  
• Min-Sheng Lin, Deng-Jyi Chen:
  General Reduction Methods for the Reliability Analysis of Distributed Computing Systems. 631-644
  
• Tim B. Cooper, Jeffrey H. Kingston:
  The Solution of Real Instances of the Timetabling Problem. 645-653
  
• D. J. Pavey, L. A. Winsborrow:
  Demonstrating Equivalence of Source Code and PROM Contents. 654-667
  
• Aviezri S. Fraenkel, Shmuel T. Klein:
  Bounding the Depth of Search Trees. 668-678
  

Volume 36, Number 8, 1993

• Rudolph Köber, Thomas Schwederski: Special Issue Editorial: Parallel Processing. 683-684
• M. Schneider, Utz Wever, Qinghua Zheng:
  Solving Large and Sparse Linear Equations in Analog Circuit Simulation on a Cluster of Workstations. 685-689
  
• Dominic A. Clark, Christopher J. Rawlings, Jack Shirazi, Liang-Liang Li, Kees Schuerman, Mike Reeve, André Véron:
  Solving Large Combinatorial Problems in Molecular Biology Using the ElipSys Parallel Constraint Logic Programming System. 690-701
  
• Uwe Geuder, Monika Härdtner, Andreas Reuter, Bernhard Wörner, Roland Zink:
  GRIDS - A Parallel Programming System for Grid-Based Algorithms. 702-711
  
• Vyacheslav B. Muchnick, Alexander V. Shafarenko, C. D. Sutton:
  F-Code and its Implementation: A Portable Software Platform for Data Parallelism. 712-722
  
• Neil Berrington, David De Roure, Julian A. Padget:
  Guaranteeing Unpredictability. 723-733
  
• Björn Bergsten, Michel Couprie, Patrick Valduriez:
  Overview of Parallel Architectures for Databases. 734-740
  
• Hermann Hellwagner:
  Design Considerations for Scalable Parallel File Systems. 741-755
  
• Ferri Abolhassan, Reinhard Drefenstedt, Jörg Keller, Wolfgang J. Paul, Dieter Scheerer:
  On the Physical Design of PRAMs. 756-762
  
• Chris R. Jesshope, Cruz Izu:
  The MP1 Network Chip and its Application to Parallel Computers. 763-777
  
• Peter Thompson:
  Concurrent Interconnect for Parallel Systems. 778-784
  

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