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 [2]	Hilfe

Suche: Series=LNCS AND Volume=4337

• A proof system for the linear time \mu-calculus
  Christian Dax, Martin Hofmann, Martin Lange
  Lecture Notes in Computer Science 4337, 2006, pp. 273-284
• Tree automata make ordinal theory easy
  Thierry Cachat
  Lecture Notes in Computer Science 4337, 2006, pp. 285-296
• Context-sensitive dependency pairs
  Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas
  Lecture Notes in Computer Science 4337, 2006, pp. 297-308
• On reduction criteria for probabilistic reward models
  Marcus Größer, Gethin Norman, Christel Baier, Frank Ciesinski, Marta Kwiatkowska, David Parker
  Lecture Notes in Computer Science 4337, 2006, pp. 309-320
• Distributed synthesis for well-connected architectures
  Paul Gastin, Nathalie Sznajder, Marc Zeitoun
  Lecture Notes in Computer Science 4337, 2006, pp. 321-332
• The meaning of ordered SOS
  MohammadReza Mousavi, Iain Phillips, Michel Reniers, Irek Ulidowski
  Lecture Notes in Computer Science 4337, 2006, pp. 333-344
• Almost optimal strategies in one clock priced timed games
  Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Jacob Illum Rasmussen
  Lecture Notes in Computer Science 4337, 2006, pp. 345-356
• Expressivity properties of Boolean BI through relational models
  Didier Galmiche, Dominique Larchey-Wendling
  Lecture Notes in Computer Science 4337, 2006, pp. 357-368
• On continuous timed automata with input-determined guards
  Fabrice Chevalier, Deepak D'Souza, Pavithra Prabhakar
  Lecture Notes in Computer Science 4337, 2006, pp. 369-380
• Safely freezing LTL
  Ranko Lazić
  Lecture Notes in Computer Science 4337, 2006, pp. 381-392
• Branching pushdown tree automata
  Rajeev Alur, Swarat Chaudhuri
  Lecture Notes in Computer Science 4337, 2006, pp. 393-404
• Validity checking for finite automata over linear arithmetic constraints
  Gary Wassermann, Zhendong Su
  Lecture Notes in Computer Science 4337, 2006, pp. 405-416
• Game semantics for higher-order concurrency
  J. Laird
  Lecture Notes in Computer Science 4337, 2006, pp. 417-428