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

• On-multiple keyword sponsored search auctions with budgets
  Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger
  Lecture Notes in Computer Science 7392, 2012, pp. 1-12
• A theory independent Curry-De Bruijn-Howard correspondence
  Gilles Dowek
  Lecture Notes in Computer Science 7392, 2012, pp. 13-15
• Standing on the shoulders of a giant: One persons experience of Turings impact
  David Harel
  Lecture Notes in Computer Science 7392, 2012, pp. 16-22
• Session types and distributed computing
  Kohei Honda
  Lecture Notes in Computer Science 7392, 2012, pp. 23-23
• Algorithms, graph theory, and the solution of Laplacian linear equations
  Daniel A. Spielman
  Lecture Notes in Computer Science 7392, 2012, pp. 24-26
• Randomized mechanisms for multi-unit auctions
  Berthold Vöcking
  Lecture Notes in Computer Science 7392, 2012, pp. 27-29
• Algebraic synchronization trees and processes
  Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir
  Lecture Notes in Computer Science 7392, 2012, pp. 30-41
• Streaming tree transducers
  Rajeev Alur, Loris D'Antoni
  Lecture Notes in Computer Science 7392, 2012, pp. 42-53
• Causal graph dynamics
  Pablo Arrighi, Gilles Dowek
  Lecture Notes in Computer Science 7392, 2012, pp. 54-66
• Degree lower bounds of tower-type for approximating formulas with parity quantifiers
  Albert Atserias, Anuj Dawar
  Lecture Notes in Computer Science 7392, 2012, pp. 67-78
• Monadic datalog containment
  Michael Benedikt, Pierre Bourhis, Pierre Senellart
  Lecture Notes in Computer Science 7392, 2012, pp. 79-91
• A machine-independent characterization of timed languages
  Mikoƚaj Bojańczyk, Sƚawomir Lasota
  Lecture Notes in Computer Science 7392, 2012, pp. 92-103
• Regular languages of infinite trees that are Boolean combinations of open sets
  Mikoƚaj Bojańczyk, Thomas Place
  Lecture Notes in Computer Science 7392, 2012, pp. 104-115
• Toward model theory with data values
  Mikoƚaj Bojańczyk, Thomas Place
  Lecture Notes in Computer Science 7392, 2012, pp. 116-127
• Robust reachability in timed automata: A game-based approach
  Patricia Bouyer, Nicolas Markey, Ocan Sankur
  Lecture Notes in Computer Science 7392, 2012, pp. 128-140
• Minimizing expected termination time in one-counter Markov decision processes
  Tomás̑ Brázdil, Antonín Kuc̑era, Petr Novotný, Dominik Wojtczak
  Lecture Notes in Computer Science 7392, 2012, pp. 141-152
• Prefix rewriting for nested-words and collapsible pushdown automata
  Christopher Broadbent
  Lecture Notes in Computer Science 7392, 2012, pp. 153-164
• A saturation method for collapsible pushdown systems
  Chris Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
  Lecture Notes in Computer Science 7392, 2012, pp. 165-176
• Regular languages are Church-Rosser congruential
  Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
  Lecture Notes in Computer Science 7392, 2012, pp. 177-188
• Time and parallelizability results for parity games with bounded treewidth
  John Fearnley, Sven Schewe
  Lecture Notes in Computer Science 7392, 2012, pp. 189-200
• Nominal completion for rewrite systems with binders
  Maribel Fernández, Albert Rubio
  Lecture Notes in Computer Science 7392, 2012, pp. 201-213
• Discrete generalised polynomial functors
  Marcelo Fiore
  Lecture Notes in Computer Science 7392, 2012, pp. 214-226
• Computing game metrics on Markov decision processes
  Hongfei Fu
  Lecture Notes in Computer Science 7392, 2012, pp. 227-238
• Deciding first order properties of matroids
  Tomás̑ Gavenc̑iak, Daniel Král', Sang-il Oum
  Lecture Notes in Computer Science 7392, 2012, pp. 239-250
• Pebble games with algebraic rules
  Anuj Dawar, Bjarki Holm
  Lecture Notes in Computer Science 7392, 2012, pp. 251-262