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 Volume=1443

• Concatenable graph processes: Relating processes and derivation traces
  Paolo Baldan, Andrea Corradini, Ugo Montanari
  Lecture Notes in Computer Science 1443, 1998, pp. 283-295
• Axioms for contextual net processes
  F. Gadducci, U. Montanari
  Lecture Notes in Computer Science 1443, 1998, pp. 296-308
• Existential types: Logical relations and operational equivalence
  Andrew M. Pitts
  Lecture Notes in Computer Science 1443, 1998, pp. 309-326
• Optimal sampling strategies in Quicksort
  Conrado Martínez, Salvador Roura
  Lecture Notes in Computer Science 1443, 1998, pp. 327-338
• A genuinely polynomial-time algorithm for sampling two-rowed contingency tables
  Martin Dyer, Catherine Greenhill
  Lecture Notes in Computer Science 1443, 1998, pp. 339-350
• A modular approach to denotational semantics
  John Power, Giuseppe Rosolini
  Lecture Notes in Computer Science 1443, 1998, pp. 351-362
• Generalised flowcharts and games
  Pasquale Malacaria, Chris Hankin
  Lecture Notes in Computer Science 1443, 1998, pp. 363-374
• Efficient minimization of numerical summation errors
  Ming-Yang Kao, Jie Wang
  Lecture Notes in Computer Science 1443, 1998, pp. 375-386
• Efficient approximation algorithms for the Subset-Sums Equality problem
  Cristina Bazgan, Miklos Santha, Zsolt Tuza
  Lecture Notes in Computer Science 1443, 1998, pp. 387-396
• Structural recursive definitions in type theory
  Eduardo Giménez
  Lecture Notes in Computer Science 1443, 1998, pp. 397-408
• A good class of tree automata - Application to inductive theorem proving
  D. Lugiez
  Lecture Notes in Computer Science 1443, 1998, pp. 409-420
• Locally periodic infinite words and a chaotic behaviour
  Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski
  Lecture Notes in Computer Science 1443, 1998, pp. 421-430
• Bridges for concatenation hierarchies
  Jean-Éric Pin
  Lecture Notes in Computer Science 1443, 1998, pp. 431-442
• Complete proof systems for observation congruences in finite-control \pi-calculus
  H. Lin
  Lecture Notes in Computer Science 1443, 1998, pp. 443-454
• Concurrent constraints in the fusion calculus
  Björn Victor, Joachim Parrow
  Lecture Notes in Computer Science 1443, 1998, pp. 455-469
• On computing the entropy of cellular automata
  Michele D'amico, Giovanni Manzini, Luciano Margara
  Lecture Notes in Computer Science 1443, 1998, pp. 470-481
• On the determinization of weighted finite automata
  Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook
  Lecture Notes in Computer Science 1443, 1998, pp. 482-493
• Bulk-synchronous parallel multiplication of Boolean matrices
  A. Tiskin
  Lecture Notes in Computer Science 1443, 1998, pp. 494-506
• A complex example of a simplifying rewrite system
  Hélène Touzet
  Lecture Notes in Computer Science 1443, 1998, pp. 507-517
• On a duality between Kruskal and Dershowitz theorems
  Paul-André Melliès
  Lecture Notes in Computer Science 1443, 1998, pp. 518-529
• A total AC-compatible reduction ordering on higher-order terms
  Daria Walukiewicz
  Lecture Notes in Computer Science 1443, 1998, pp. 530-542
• Model checking game properties of multi-agent systems
  Thomas A. Henzinger
  Lecture Notes in Computer Science 1443, 1998, pp. 543-543
• Limited wavelength conversion in all-optical tree networks
  Luisa Gargano
  Lecture Notes in Computer Science 1443, 1998, pp. 544-555
• Computing mimicking networks
  Shiva Chaudhuri, K.V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
  Lecture Notes in Computer Science 1443, 1998, pp. 556-567
• Metric semantics for true concurrent real time
  Christel Baier, Joost-Pieter Katoen, Diego Latella
  Lecture Notes in Computer Science 1443, 1998, pp. 568-579