13. IFIP Congress 1994:
Hamburg,
Germany
Bjorn Pehrson,
Imre Simon (Eds.):
Technology and Foundations - Information Processing '94,
Volume 1,
Proceedings of the IFIP 13th World Computer Congress,
Hamburg,
Germany,
28 August - 2 September,
1994. North-Holland,
1994,
ISBN 0-444-81989-4
Track 1 - Hardware and Software Technology
Expert and Invited Lectures
System Design
- Xing Cheng:
Analysis and Modelling of Routing Algorithms in High-Speed Networks.
63-68
- R. A. Simpson, Alan J. Harget:
A Simulation Study to Determine the Importance of Load Balancing Algorithms for Loosely-Coupled Distributed Systems.
69-74
- R. K. Shyamasundar:
Specifying Dynamic Reat-Time Systems in CRP.
75-80
- Priscilla J. Fowler, Linda Levine:
The Role of Infrastructure in the Adoption of an Immature Software Technology.
81-86
Wireless Networking
- Katrin Braun, Joachim Grollmann, Michael Horn, Manfred Langen, Wolfgang Thulke, Walter Weigel:
Personal Communication is More Than Wireless Communication.
89-94
- Chr. Kröll, Peter Peinl, J. Pommnitz:
Extensions of the Internet Protocol for Wireless Communication.
95-100
- Frank Reichert, Y. Ismailov, P. Pruthi, T. Ohsawa:
The Walkstation Project - A Flexible Platform for Experiments in Mobile Multimedia Environments.
101-105
User Interfaces
Software
Distributed Systems and Networking
Hardware
Track 4 - Theoretical Foundations of Computing
Expert and Invited Lectures
Algorithms and Complexity
- Yung-Cheng Chang, Lih-Hsing Hsu:
Element Perturbation Problems of Optimum Spanning Trees with Two-Parameter Objectives.
241-246
- Jozef Gruska, Margherita Napoli, Domenico Parente:
Optimization of Systolic Tree Automata.
247-252
- Kazuo Iwama, Shuichi Miyazaki:
SAT-Varible Complexity of Hard Combinatorial Problems.
253-258
- David Chenho Kung, Jyhjong Lin, Pei Hsia:
An Object-Oriented Conceptal Model for Information Systems.
259-264
- Qiang Li:
Lamport's Bakery Algorithm Applied to Loosely-coupled SCI Platforms.
265-270
- Ch. Marco, Paz Morillo:
The Use of Elliptic Curves in Smart Cards.
271-275
- Subhada K. Mishra, Vijay V. Raghavan:
Design Issues in Randomized Branch and Bound Algorithms: A Study of Graph Partitioning.
276-281
- Youzou Miyadera, Kensei Tsuchida, Takeo Yaku:
A Tidy Drawing Problem on the Minimum Area for Tree-Structured Diagrams and Its Application to Program Development.
282-287
- Kenneth W. Regan:
Linear-Time Algorithms in Memory Hierarchies.
288-293
- Kazumi Saito, Ryohei Nakano:
Adaptive Concept Learning Algorithm.
294-299
- Xinfeng Ye, John A. Keane:
A Fault Tolerant Distributed Termination Detection Scheme.
300-305
Semantics
Evolving Algebras
Finite Automata
General Purpose Parallel Computing
Information Based Complexity and Program Speedups in Practice and Theory
Copyright © Mon Mar 15 03:41:35 2010
by Michael Ley (ley@uni-trier.de)
