Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND YEAR=1997

• Database program mapping onto a shared-nothing multiprocessor architecture: Minimizing communication costs
  Sophie Bonneau, Abdelkader Hameurlain
  Lecture Notes in Computer Science 1300, 1997, pp. 1154-1158
• Towards full Prolog on a distributed architecture
  Lourdes Araujo
  Lecture Notes in Computer Science 1300, 1997, pp. 1173-1180
• Static granularity optimization of a committed-choice language Fleng
  Takuya Araki, Hidehiko Tanaka
  Lecture Notes in Computer Science 1300, 1997, pp. 1191-1200
• Abstract and-parallel machines
  Nachum Dershowitz, Naomi Lindenstrauss
  Lecture Notes in Computer Science 1300, 1997, pp. 1221-1225
• Workshop 20: Real-time systems and constraints
  Gérard Berry
  Lecture Notes in Computer Science 1300, 1997, pp. 1229-1230
• Designing an embedded hard real-time system: A case study
  Matjaz̑ Colnaric̑, C.T. Cheung, Wolfgang A. Halang
  Lecture Notes in Computer Science 1300, 1997, pp. 1231-1235
• Task-system analysis using slope-parametric hybrid automata
  Augusto Burgueño, Vlad Rusu
  Lecture Notes in Computer Science 1300, 1997, pp. 1262-1273
• Schedulers for age constraint tasks and their performance evaluation
  Wolfgang Albrecht, Ralf Wisser
  Lecture Notes in Computer Science 1300, 1997, pp. 1282-1289
• Analyzing schedulability of Astral specifications using extended timed automata
  K. Brink, J. van Katwijk, R.F. Lutje Spelberg, W.J. Toetenel
  Lecture Notes in Computer Science 1300, 1997, pp. 1290-1297
• RAIN: Redundant array of inexpensive workstations for neurocomputing
  Davide Anguita, Marco Chirico, Anna Marina Scapolla, Giancarlo Parodi
  Lecture Notes in Computer Science 1300, 1997, pp. 1340-1345
• OCEANS: Optimizing compilers for embedded applications
  Bas Aarts, Michel Barreteau, François Bodin, Peter Brinkhaus, Zbigniew Chamski, Henri-Pierre Charles, Christine Eisenbeis, John Gurd, Jan Hoogerbrugge, Ping Hu, William Jalby, Peter M.W. Knijnenburg, Michael F.P. O'Boyle, Erven Rohou, Rizos Sakellariou, Henk Schepers, André Seznec, Elena Stöhr, Marco Verhoeven, Harry A.G. Wijshoff
  Lecture Notes in Computer Science 1300, 1997, pp. 1351-1356
• SEEDS - Simulation environment for the evaluation of distributed traffic control systems
  Sebastiano Bottalico, Filippo de Stefani, Thomas Ludwig, Günther Rackl
  Lecture Notes in Computer Science 1300, 1997, pp. 1357-1362
• EFTOS: A software framework for more dependable embedded HPC applications
  G. Deconinck, V. de Florio, R. Lauwereins, T. Varvarigou
  Lecture Notes in Computer Science 1300, 1997, pp. 1363-1368
• Game semantics for programming languages
  Samson Abramsky
  Lecture Notes in Computer Science 1295, 1997, pp. 3-4
• Communication complexity
  László Babai
  Lecture Notes in Computer Science 1295, 1997, pp. 5-18
• Treewidth: Algorithmic techniques and results
  Hans L. Bodlaender
  Lecture Notes in Computer Science 1295, 1997, pp. 19-36
• When are two rewrite systems more than none?
  Nachum Dershowitz
  Lecture Notes in Computer Science 1295, 1997, pp. 37-43
• The expressiveness of Datalog circuits (DAC)
  Foto Afrati, Irène Guessarian, Michel de Rougemont
  Lecture Notes in Computer Science 1295, 1997, pp. 119-128
• A category of transition systems and its relations with orthomodular posets
  Luca Bernardinello, Lucia Pomello
  Lecture Notes in Computer Science 1295, 1997, pp. 139-148
• Accepting Zeno words without making time stand still
  Béatrice Bérard, Claudine Picaronny
  Lecture Notes in Computer Science 1295, 1997, pp. 149-158
• Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
  Beate Bollig, Ingo Wegener
  Lecture Notes in Computer Science 1295, 1997, pp. 159-168
• Specifying computations using hyper transition systems
  Marcello M. Bonsangue, Joost N. Kok
  Lecture Notes in Computer Science 1295, 1997, pp. 169-178
• A shift-invariant metric on S^{zz} inducing a non-trivial topology
  G. Cattaneo, E. Formenti, L. Margara, J. Mazoyer
  Lecture Notes in Computer Science 1295, 1997, pp. 179-188
• Subtyping calculus of construction
  Gang Chen
  Lecture Notes in Computer Science 1295, 1997, pp. 189-198
• Distances between languages and reflexivity of relations
  Christian Choffrut, Giovanni Pighizzini
  Lecture Notes in Computer Science 1295, 1997, pp. 199-208