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

• Performance ratios for the differencing method applied to the balanced number partitioning problem
  Wil Michiels, Jan Korst, Emile Aarts, Jan van Leeuwen
  Lecture Notes in Computer Science 2607, 2003, pp. 583-595
• Cake-cutting is not a piece of cake
  Malik Magdon-Ismail, Costas Busch, Mukkai S. Krishnamoorthy
  Lecture Notes in Computer Science 2607, 2003, pp. 596-607
• The price of truth: Frugality in truthful mechanisms
  Kunal Talwar
  Lecture Notes in Computer Science 2607, 2003, pp. 608-619
• Untameable timed automata!
  Patricia Bouyer
  Lecture Notes in Computer Science 2607, 2003, pp. 620-631
• The intrinsic universality problem of one-dimensional cellular automata
  Nicolas Ollinger
  Lecture Notes in Computer Science 2607, 2003, pp. 632-641
• On sand automata
  Julien Cervelle, Enrico Formenti
  Lecture Notes in Computer Science 2607, 2003, pp. 642-653
• Adaptive sorting and the information theoretic lower bound
  Amr Elmasry, Michael L. Fredman
  Lecture Notes in Computer Science 2607, 2003, pp. 654-662
• A discrete subexponential algorithm for parity games
  Henrik Björklund, Sven Sandberg, Sergei Vorobyov
  Lecture Notes in Computer Science 2607, 2003, pp. 663-674
• Cryptographically sound and machine-assisted verification of security protocols
  Michael Backes, Christian Jacobi
  Lecture Notes in Computer Science 2607, 2003, pp. 675-686
• Durations, parametric model-checking in timed automata with Presburger arithmetic
  Véronique Bruère, Emmanuel Dall'Olio, Jean-François Raskin
  Lecture Notes in Computer Science 2607, 2003, pp. 687-698