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

• On the use of guards for logics with data
  Thomas Colcombet, Clemens Ley, Gabriele Puppis
  Lecture Notes in Computer Science 6907, 2011, pp. 243-255
• An elementary proof of a 3n-o(n) lower bound on the circuit complexity of affine dispersers
  Evgeny Demenkov, Alexander S. Kulikov
  Lecture Notes in Computer Science 6907, 2011, pp. 256-265
• On the complexity of the l-diversity problem
  Riccardo Dondi, Giancarlo Mauri, Italo Zoppis
  Lecture Notes in Computer Science 6907, 2011, pp. 266-277
• Infinite synchronizing words for probabilistic automata
  Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi
  Lecture Notes in Computer Science 6907, 2011, pp. 278-289
• Parity games on graphs with medium tree-width
  John Fearnley, Oded Lachish
  Lecture Notes in Computer Science 6907, 2011, pp. 303-314
• Satisfiability of systems of equations of real analytic functions is quasi-decidable
  Peter Franek, Stefan Ratschan, Piotr Zgliczynski
  Lecture Notes in Computer Science 6907, 2011, pp. 315-326
• Distributed synthesis for regular and contextfree specifications
  Wladimir Fridman, Bernd Puchala
  Lecture Notes in Computer Science 6907, 2011, pp. 532-543
• A recurrent method for constructing irreducible polynomials over finite fields
  Sergey Abrahamyan, Melsik Kyureghyan
  Lecture Notes in Computer Science 6885, 2011, pp. 1-9
• Higher-order linear differential systems with truncated coefficients
  S.A. Abramov, M.A. Barkatou, E. Pflügel
  Lecture Notes in Computer Science 6885, 2011, pp. 10-24
• Topology of families of implicit algebraic surfaces depending on a parameter
  Juan Gerardo Alcázar
  Lecture Notes in Computer Science 6885, 2011, pp. 25-36
• A modular approach for beam lines design
  Serge N. Andrianov
  Lecture Notes in Computer Science 6885, 2011, pp. 37-48
• Computations on simple games using RelView
  Rudolf Berghammer, Agnieszka Rusinowska, Harrie de Swart
  Lecture Notes in Computer Science 6885, 2011, pp. 49-60
• On the regularity property of differential polynomials modulo regular differential chains
  François Boulier, François Lemaire, Alexandre Sedoglavic
  Lecture Notes in Computer Science 6885, 2011, pp. 61-72
• Chemical reaction systems, computer algebra and systems biology
  François Boulier, François Lemaire, Michel Petitot, Alexandre Sedoglavic
  Lecture Notes in Computer Science 6885, 2011, pp. 73-87
• On the stability of equilibrium positions in the circular restricted four-body problem
  Dzmitry A. Budzko, Alexander N. Prokopenya
  Lecture Notes in Computer Science 6885, 2011, pp. 88-100
• Semi-algebraic description of the equilibria of dynamical systems
  Changbo Chen, Marc Moreno Maza
  Lecture Notes in Computer Science 6885, 2011, pp. 101-125
• Normal forms of two p:-q resonant polynomial vector fields
  Victor Edneral, Valery G. Romanovski
  Lecture Notes in Computer Science 6885, 2011, pp. 126-134
• On Muldowney's criteria for polynomial vector fields with constraints
  Hassan Errami, Werner M. Seiler, Thomas Sturm, Andreas Weber
  Lecture Notes in Computer Science 6885, 2011, pp. 135-143
• Knowledge-based automatic generation of partitioned matrix expressions
  Diego Fabregat-Traver, Paolo Bientinesi
  Lecture Notes in Computer Science 6885, 2011, pp. 144-157
• Piecewise-linear approximations of uncertain functions
  Mohammad Ali Abam, Mark de Berg, Amirali Khosravi
  Lecture Notes in Computer Science 6844, 2011, pp. 1-12
• A constant factor approximation algorithm for boxicity of circular arc graphs
  Abhijin Adiga, Jasine Babu, L. Sunil Chandran
  Lecture Notes in Computer Science 6844, 2011, pp. 13-24
• On the area requirements of Euclidean minimum spanning trees
  Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Sqarcella
  Lecture Notes in Computer Science 6844, 2011, pp. 25-36
• Multi-target ray searching problems
  Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou
  Lecture Notes in Computer Science 6844, 2011, pp. 37-48
• Convex transversals
  Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S.B. Mitchell, Valentin Polishchuk, Schlipf, Lena, Shang Yang
  Lecture Notes in Computer Science 6844, 2011, pp. 49-60
• How to cover a point set with a V-shape of minimum width
  Boris Aronov, Muriel Dulieu
  Lecture Notes in Computer Science 6844, 2011, pp. 61-72