default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Computer Journal, Volume 39, 1996
Volume 39, Number 1, 1996
- David Jeff Jackson, Wagdy Mahmoud:
Parallel Pipelined Fractal Image Compression using Quadtree Recomposition. 1-13 - Qian-Ping Gu, Shietung Peng:
An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters. 14-19 - Vincenzo Loia, Michel Quaggetto:
The OPLA System: Designing Complex Systems in an Object-Oriented Logic Programming Framework. 20-35 - Chandra N. Sekharan, John G. Del Greco, Sailesh Rathi:
Space-Time Trade-offs in the Relative Unranking of Binary Trees. 36-33 - T. S. Naryanan:
A Class of Semi-X Tree-Based Dictionary Machines. 45-51 - Egon Börger, Igor Durdanovic:
Correctness of Compiling Occam to Transputer Code. 52-92
Volume 39, Number 2, 1996
- Linda C. van der Gaag:
Bayesian Belief Networks: Odds and Ends. 97-113 - Mark Levene:
Maintaining Consistency of Imprecise Relations. 114-123 - Hossein Saiedian
, Thomas Spencer:
An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema. 124-132 - Evangelos Kranakis, Danny Krizanc, S. S. Ravi:
On Multi-Label Linear Interval Routing Schemes. 133-139 - Yi Pan, Mounir Hamdi, Gurdip Singh:
Selection on k-Dimensional Meshes with Multiple Broadcasting. 140-144 - Stephen Fitzpatrick, Maurice Clint, Terence J. Harmer, Peter Kilpatrick:
The Tailoring of Abstract Functional Specifications of Numerical Algorithms for Sparse Data Structures through Automated Program Derivation and Transformation. 145-168
Volume 39, Number 3, 1996
- Carlo Meghini:
Logical Image Modelling and Retrieval. 173-183 - Si Pan, R. Geoff Dromey:
Re-engineering Loops. 184-202 - Si Pan, R. Geoff Dromey:
A Formal Basis for Removing Goto Statements. 203-214 - Arthur H. M. ter Hofstede, E. Lippe, Paul J. M. Frederiks:
Conceptual Data Modelling from a Categorical Perspective. 215-231 - Mohamed Ould-Khaoua, Lewis M. Mackenzie, Reza Sotudeh:
Comparative Evaluation of Hypermesh and Multi-stage Interconnection Networks. 232-240 - Behrooz Parhami:
Extreme-Value Search and General Selection Algorithms for Fully Parallel Associative Memories. 241-250
Volume 39, Number 4, 1996
- Arthur H. M. ter Hofstede, Henderik Alex Proper, Theo P. van der Weide:
Query Formulation as an Information Retrieval Problem. 255-274 - Anthony N. Godwin:
Building a Semantic Description for a Data Modelling Language. 275-290 - Jim Grundy:
Transformational Hierarchical Reasoning. 291-302 - Howard Barringer, Graham Gough, Brian Monahan, Alan R. Williams:
A Process Algebra Foundation for Reasoning about Core ELLA. 303-324 - Robert M. Hierons:
Extending Test Sequence Overlap by Invertibility. 325-330 - Haifeng Qian, Jie Wu:
Enhanced Fibonacci Cubes. 331-345 - Hu-Jun Wang, Jian Li:
Bandwidth Analysis for A Class of Bus-Based Systems. 331-345 - Tamás D. Gedeon:
The Cyclic Towers of Hanoi: An Iterative Solution Produced by Transformation. 353-356
Volume 39, Number 5, 1996
- Andy J. Wellings, Alan Burns:
Programming Replicated Systems in Ada 95. 361-373 - Yasemin Turkan, Özgür Ulusoy:
An Efficient Memory Management Algorithm for Client-Server Database Management Systems. 374-385 - J. P. Geschiere, Wilbert H. F. J. Körver:
A Practical Development Process for Parallel Large-Scale Applications and its Underlying Formal Framework. 386-407 - Maarten M. Fokkinga:
Expressions That Talk About Themselves. 386-407 - Tadao Takaoka:
A Left-to-Right Preprocessing Computation for the Boyer-Moore String Matching Algorithm. 413-416 - Wen-Jing Hsu, Moon-Jung Chung, Zejun Hu:
Gaussian Networks for Scalable Distributed Systems. 417-426 - Lucas Chi Kwong Hui, Charles U. Martel:
Randomized Competitive Algorithms for Successful and Unsuccessful Search. 427-439 - Nectarios Koziris, George K. Papakonstantinou, Panayotis Tsanakas:
Optimal Time and Efficient Space Free Scheduling For Nested Loops. 439-448
Volume 39, Number 6, 1996
- John A. Mariani, Tom Rodden:
Cooperative Information Sharing: Developing a Shared Object Service. 455-470 - David B. Skillicorn:
Using Distributed Hypermedia for Collaborative Learning in Universities. 471-482 - Jonathan M. Nash, Peter M. Dew, Martin E. Dyer:
A Scalable Shared Queue on a Distributed Memory Machine. 483-495 - Oliver E. Theel, Brett D. Fleisch:
The Boundary-Restricted Coherence Protocol for Scalable and Highly Available Distributed Shared Memory Systems. 496-510 - Chung-Ming Huang, Ye-In Chang, Duen-Tay Huang:
Reverse Protocol Verification: Concept, Algorithm and Application. 511-524 - Yen-Min Huang, Chinya V. Ravishankar:
URPC: A Toolkit for Prototyping Remote Procedure Calls. 525-540 - Panayiotis Bozanis, Nectarios Kitsios, Christos Makris, Athanasios K. Tsakalidis:
Red-Blue Intersection Reporting for Objects of Non-Constant Size. 541-546 - Bohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech:
A Family of Perfect Hashing Methods. 547-554
Volume 39, Number 7, 1996
- John M. Taylor:
Forward with Foresight. 561-565 - Cristina Cifuentes, Anne Fitzgerald:
Australian Recommendations on Computer Software Protection. 566-576 - Jukka Paakki, Airi Salminen, Jussi Koskinen:
Automated Hypertext Support for Software Maintenance. 577-597 - Martin P. Ward:
Program Analysis by Formal Transformation. 598-618 - Tsong Yueh Chen, Yuen-Tak Yu:
Constraints for Safe Partition Testing Strategies. 619-625 - Qian-Ping Gu, Shietung Peng:
Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes. 626-629
- Jon Agar:
The Provision of Digital Computers to British Universities up to the Flowers Report (1966). 630-642
Volume 39, Number 8, 1996
- Antonio Puliafito, Salvatore Riccobene, Marco Scarpa:
Evaluation of Performability Parameters in Client-Server Environments. 647-662 - Goran Lj. Djordjevic, Milorad B. Tosic:
A Compile-Time Scheduling Heuristic for Multiprocessor Architectures. 663-674 - Joan M. Morrissey, W. T. Bealor:
Minimizing Data Transfers in Distributed Query Processing: A Comparative Study and Evaluation. 675-687 - Xindong Wu:
A Bayesian Discretizer for Real-Valued Attributes. 688-691 - Behrooz Parhami:
Parallel Threshold Voting. 692-700 - Emil Sekerinski, Kaisa Sere:
A Theory of Prioritizing Composition. 701-712 - Shietung Peng, Stanislav Sedukhin:
Array Processors Design for Division-free Linear System Solving. 713-722
Volume 39, Number 9, 1996
- Peter M. Fenwick:
The Burrows-Wheeler Transform for Block Sorting Text Compression: Principles and Improvements. 731-740 - Kristina L. Verco, Michael J. Wise:
Plagiarism à la Mode: A Comparison of Automated Systems for Detecting Suspected Plagiarism. 741-750 - Mahes Visvalingam, Dominic A. Varley, Chris Wright:
A Cognitive Approach to Road Recognition with Novel Feature Indicators. 751-756 - Ing-Ray Chen, Chi-Ming Chen:
Threshold-Based Admission Control Policies for Multimedia Servers. 757-766 - Ing-Ray Chen, Ding-Chau Wang:
Analysis of Replicated Data with Repair Dependency. 767-779 - Jordi Tubella, Antonio González, E. Elias:
The Multipath Architecture for Prolog Programs. 780-792 - Patrick van Bommel, Paul J. M. Frederiks, Theo P. van der Weide:
Object-Oriented Modelling Based on Logbooks. 793-799 - Jixin Ma, Brian Knight:
A Reified Temporal Logic. 800-807 - Graham M. Seed, Doug E. R. Clark, Jonathan R. Corney, R. Tuttle, Gordon Little:
Object-Oriented Graph-Based Geometric Feature Recognition. 808-811
Volume 39, Number 10, 1996
- Rob Ingram, Steve Benford:
The Application of Legibility Techniques to Enhance Information Visualizations. 819-836 - Chongjiang Du:
An Interpolation Method for Grid-Based Terrain Modelling. 837-843 - Ning Zhang, Qi Shi:
Achieving Non-Repudiation of Receipt. 844-853 - A. Bruce McDonald, Taieb Znati:
ARP versus ES-IS: Performance Evaluation of Neighbour-Greeting Protocols. 854-867 - Janos J. Sarbo:
Building Sub-Knowledge Bases Using Concept Lattices. 868-875 - Manuel Díaz, Bartolomé Rubio, José M. Troya:
Distributed Programming with a Logic Channel Based Coordination Model. 876-889
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-11 21:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
