24. SOFSEM 1997:
Milovy, Czech Republic
Frantisek Plasil, Keith G. Jeffery (Eds.):
SOFSEM '97: Theory and Practice of Informatics, 24th Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 22-29, 1997, Proceedings.
Lecture Notes in Computer Science 1338 Springer 1997, ISBN 3-540-63774-5
Invited Papers
Fundamentals
Distributed And Parallel Computing
Software Engeneering And Methodology
- Dines Bjørner:
A Formal Software Engeneering Paradigm: From Domains via Requirements to Software - Formal Specification & Design Calculi.
219-248

- Annie Kuntzmann-Combelles:
The Whole Picture to Software Process Improvement.
249-265

- Wolfgang Pree:
Object-Oriented Design Patterns.
266-274

Databases And Information Systems
Contributed Papers
- Luca Becchetti, Carlo Gaibisso:
Lower Bounds for the Virtual Path Layout Problem in ATM Networks.
375-382

- Bingning Dai, David A. Bell, John G. Hughes:
Query Processing in Temporal Evidential Databases.
383-390

- Cristina De Castro:
A First Approach to Temporal Predicate Locking for Concurrency Detection in Temporal Relational Databases Supporting Schema Versioning.
391-398

- Carlo Gaibisso, Guido Proietti:
Efficient Insertion of Approximately Sorted Seqeunces of Items into a Dictionary.
399-406

- Pablo Galdámez, Francesc D. Muñoz-Escoí, José M. Bernabéu-Aubán:
High Availability Support in CORBA Environments.
407-414

- Vladimír Glasnák:
On f-Sparse Sets in NP - P.
415-422

- Markus Hof, Hanspeter Mössenböck, Peter Pirkelbauer:
Zero-Overhead Exeption Handling Using Metaprogramming.
423-431

- Jan Janousek, Borivoj Melichar:
The Output-Store Formal Translator Directed by LR Parsing.
432-439

- Jiri Kadlec:
Parallel Processing on Alphas Under MATLAB 5.
440-447

- Petr Kolman:
PRAM Lower Bound for Element Distinctness Revisited.
448-455

- Ivan Kopecek:
Optimal Trees for Searching in Codebook.
456-463

- Rastislav Kralovic:
Time Optimal Self-Stabilizing Algorithms.
464-472

- Petr Kroha, M. Strauß:
Requirements Specification Iteratively Combined with Reverse.
473-480

- Antonín Kucera:
On Finite Representations of Infinite-State Behaviours.
481-488

- Salvador Lucas:
Efficient Strong Sequentiality Using Replacement Restrictions.
489-496

- Massimo Marchiori:
Optmial Encodings.
497-504

- Frantisek Mráz, Martin Plátek, Petr Jancar, Jörg Vogel:
Monotonic Rewriting Automata with a Restart Operation.
505-512

- Shan-Hwei Nienhuys-Cheng, Arie de Bruin:
Kahn's Fixed-Point Characterization for Linear Dynamic Networks.
513-522

- Karel Pala, Pavel Rychlý, Pavel Smrz:
DESAM - Annotated Corpus for Czech.
523-530

- Yvan Peter:
Mobility Management in CORBA: A Generic Implementation of the LifeCycle Service.
531-538

- Wim Pijls, Arie de Bruin:
A Theory of Game Trees, Based on Solution Trees.
539-546

- Heiko Schröder, A. E. May, Imrich Vrto, Ondrej Sýkora:
Approximation Algorithms for the Vertex Bipartization Problem.
547-554

- Heiko Schröder, Ondrej Sýkora, Imrich Vrto:
Optical All-to-All Communication for Some Product Graphs.
555-562

- David Strupl, Roman Neruda:
Parallelizing Self-Organizing Maps.
563-570

Last update Tue May 21 00:31:08 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page