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

• Descriptional complexity of operations on alternating and Boolean automata
  Galina Jirásková
  Lecture Notes in Computer Science 7353, 2012, pp. 196-204
• Consistency of multidimensional combinatorial substitutions
  Timo Jolivet, Jarkko Kari
  Lecture Notes in Computer Science 7353, 2012, pp. 205-216
• Two-way automata characterizations of L/poly versus NL
  Christos A. Kapoutsis, Giovanni Pighizzini
  Lecture Notes in Computer Science 7353, 2012, pp. 217-228
• Cutting through regular post embedding problems
  Prateek Karandikar, Philippe Schnoebelen
  Lecture Notes in Computer Science 7353, 2012, pp. 229-240
• On the advice complexity of the set cover problem
  Dennis Komm, Richard Královic̑, Tobias Mömke
  Lecture Notes in Computer Science 7353, 2012, pp. 241-252
• Constraint satisfaction with counting quantifiers
  Florent Madelaine, Barnaby Martin, Juraj Stacho
  Lecture Notes in Computer Science 7353, 2012, pp. 253-265
• Space-bounded Kolmogorov extractors
  Daniil Musatov
  Lecture Notes in Computer Science 7353, 2012, pp. 266-277
• Some results on more flexible versions of Graph Motif
  Romeo Rizzi, Florian Sikora
  Lecture Notes in Computer Science 7353, 2012, pp. 278-289
• A characterization of cellular automata generated by idempotents on the full shift
  Ville Salo
  Lecture Notes in Computer Science 7353, 2012, pp. 290-301
• Constructing polynomials for functions over residue rings modulo a composite number in linear time
  Svetlana N. Selezneva
  Lecture Notes in Computer Science 7353, 2012, pp. 302-313
• Boolean composition of visual secret sharing schemes
  Hans Ulrich Simon
  Lecture Notes in Computer Science 7353, 2012, pp. 314-325