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

• Weak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem
  Andrew Childs, Aram W. Harrow, Paweƚ Wocjan
  Lecture Notes in Computer Science 4393, 2007, pp. 598-609
• Quantum network coding
  Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
  Lecture Notes in Computer Science 4393, 2007, pp. 610-621
• Reachability in unions of commutative rewriting systems is decidable
  Mikoƚaj Bojańczyk, Piotr Hoffman
  Lecture Notes in Computer Science 4393, 2007, pp. 622-633
• Associative-commutative deducibility constraints
  Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune
  Lecture Notes in Computer Science 4393, 2007, pp. 634-645
• On the automatic analysis of recursive security protocols with XOR
  Ralf Küsters, Tomasz Truderung
  Lecture Notes in Computer Science 4393, 2007, pp. 646-657
• Improved online algorithms for the sorting buffer problem
  Iftah Gamzu, Danny Segev
  Lecture Notes in Computer Science 4393, 2007, pp. 658-669
• Cost sharing methods for makespan and completion time scheduling
  Janina Brenner, Guido Schäfer
  Lecture Notes in Computer Science 4393, 2007, pp. 670-681
• Planar graphs: Logical complexity and parallel isomorphism tests
  Oleg Verbitsky
  Lecture Notes in Computer Science 4393, 2007, pp. 682-693
• Enumerating all solutions for constraint satisfaction problems
  Henning Schnoor, Ilka Schnoor
  Lecture Notes in Computer Science 4393, 2007, pp. 694-705