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=1872

• An asynchronous, distributed implementation of mobile ambients
  Cédric Fournet, Jean-Jacques Lévy, Alan Schmitt
  Lecture Notes in Computer Science 1872, 2000, pp. 348-364
• Type systems for concurrent processes: From deadlock-freedom to livelock-freedom, time-boundedness
  Naoki Kobayashi
  Lecture Notes in Computer Science 1872, 2000, pp. 365-389
• Local \pi-calculus at work: Mobile objects as mobile processes
  Massimo Merro, Josva Kleist, Uwe Nestmann
  Lecture Notes in Computer Science 1872, 2000, pp. 390-408
• An interpretation of typed concurrent objects in the blue calculus
  Silvano Dal Zilio
  Lecture Notes in Computer Science 1872, 2000, pp. 409-424
• A higher-order specification of the \pi-calculus
  Joëlle Despeyroux
  Lecture Notes in Computer Science 1872, 2000, pp. 425-439
• Open ended systems, dynamic bisimulation and tile logic
  Roberto Bruni, Ugo Montanari, Vladimiro Sassone
  Lecture Notes in Computer Science 1872, 2000, pp. 440-456
• Fibred models of processes: Discrete, continuous, and hybrid systems
  Marcelo P. Fiore
  Lecture Notes in Computer Science 1872, 2000, pp. 457-473
• On the complexity of bisimulation problems for pushdown automata
  Richard Mayr
  Lecture Notes in Computer Science 1872, 2000, pp. 474-488
• A type-theoretic study on partial continuations
  Yukiyoshi Kameyama
  Lecture Notes in Computer Science 1872, 2000, pp. 489-504
• Partially typed terms between Church-style and Curry-style
  Ken-Etsu Fujita, Aleksy Schubert
  Lecture Notes in Computer Science 1872, 2000, pp. 505-520
• Alternating automata and logics over infinite words
  Christof Löding, Wolfgang Thomas
  Lecture Notes in Computer Science 1872, 2000, pp. 521-535
• Hypothesis support for information integration in four-valued logics
  Yann Loyer, Nicolas Spyratos, Daniel Stamate
  Lecture Notes in Computer Science 1872, 2000, pp. 536-548
• Masaccio: A formal model for embedded components
  Thomas A. Henzinger
  Lecture Notes in Computer Science 1872, 2000, pp. 549-563
• A single complete refinement rule for demonic specifications
  Karl Lermer, Paul Strooper
  Lecture Notes in Computer Science 1872, 2000, pp. 564-579
• Reasoning about composition using property transformers and their conjugates
  Michel Charpentier, K. Mani Chandy
  Lecture Notes in Computer Science 1872, 2000, pp. 580-595
• Some new directions in the syntax and semantics of formal languages
  Gordon D. Plotkin
  Lecture Notes in Computer Science 1872, 2000, pp. 596-596
• New challenges for theoretical computer science
  Jozef Gruska
  Lecture Notes in Computer Science 1872, 2000, pp. 599-601
• Algorithm design challenges
  Giorgio Ausiello
  Lecture Notes in Computer Science 1872, 2000, pp. 602-603
• Quantumization of theoretical informatics
  Jozef Gruska
  Lecture Notes in Computer Science 1872, 2000, pp. 604-608
• Two problems in wide area network programming
  Ugo Montanari
  Lecture Notes in Computer Science 1872, 2000, pp. 609-611
• New challenges for computational models
  Yoshihito Toyama
  Lecture Notes in Computer Science 1872, 2000, pp. 612-613
• Towards a computational theory of everything
  Jiȓí Wiedermann
  Lecture Notes in Computer Science 1872, 2000, pp. 614-615
• On the power of interactive computing
  Jan van Leeuwen, Jiȓí Wiedermann
  Lecture Notes in Computer Science 1872, 2000, pp. 619-623
• The varieties of programming language semantics
  Peter D. Mosses
  Lecture Notes in Computer Science 1872, 2000, pp. 624-628