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

Suche: Series=LNCS AND Volume=5369

• From tree-width to clique-width: Excluding a unit interval graph
  Vadim V. Lozin
  Lecture Notes in Computer Science 5369, 2008, pp. 871-882
• New results on the most significant bit of integer multiplication
  Beate Bollig, Jochen Klump
  Lecture Notes in Computer Science 5369, 2008, pp. 883-894
• Sorting with complete networks of stacks
  Felix G. König, Marco E. Lübbecke
  Lecture Notes in Computer Science 5369, 2008, pp. 895-906
• Quantum query complexity of Boolean functions with small on-sets
  Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
  Lecture Notes in Computer Science 5369, 2008, pp. 907-918
• Unbounded-error quantum query complexity
  Ashley Montanaro, Harumichi Nishimura, Rudy Raymond
  Lecture Notes in Computer Science 5369, 2008, pp. 919-930
• Super-exponential size advantage of quantum finite automata with mixed states
  Rūsiņs̑ Freivalds
  Lecture Notes in Computer Science 5369, 2008, pp. 931-942