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

• On simulatability soundness and mapping soundness of symbolic cryptography
  Michael Backes, Markus Dürmuth, Ralf Küsters
  Lecture Notes in Computer Science 4855, 2007, pp. 108-120
• Key substitution in the symbolic analysis of cryptographic protocols
  Yannick Chevalier, Mounira Kourjieh
  Lecture Notes in Computer Science 4855, 2007, pp. 121-132
• Symbolic bisimulation for the applied pi calculus
  Stéphanie Delaune, Steve Kremer, Mark Ryan
  Lecture Notes in Computer Science 4855, 2007, pp. 133-145
• Probabilistic and topological semantics for timed automata
  Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer
  Lecture Notes in Computer Science 4855, 2007, pp. 179-191
• The deduction theorem for strong propositional proof systems
  Olaf Beyersdorff
  Lecture Notes in Computer Science 4855, 2007, pp. 241-252
• Post embedding problem is not primitive recursive, with applications to channel systems
  Pierre Chambart, Philippe Schnoebelen
  Lecture Notes in Computer Science 4855, 2007, pp. 265-276
• Synthesis of safe message-passing systems
  Nicolas Baudru, Rémi Morin
  Lecture Notes in Computer Science 4855, 2007, pp. 277-289
• Automata and logics for timed message sequence charts
  S. Akshay, Benedikt Bollig, Paul Gastin
  Lecture Notes in Computer Science 4855, 2007, pp. 290-302
• Propositional dynamic logic for message-passing systems
  Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke
  Lecture Notes in Computer Science 4855, 2007, pp. 303-315
• Better algorithms and bounds for directed maximum leaf problems
  Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
  Lecture Notes in Computer Science 4855, 2007, pp. 316-327
• Safely composing security protocols
  Véronique Cortier, Jérémie Delaitre, Stéphanie Delaune
  Lecture Notes in Computer Science 4855, 2007, pp. 352-363
• Computationally sound typing for non-interference: The case of deterministic encryption
  Judicaël Courant, Cristian Ene, Yassine Lakhnech
  Lecture Notes in Computer Science 4855, 2007, pp. 364-375
• Bounding messages for free in security protocols
  Myrto Arapinis, Marie Duflot
  Lecture Notes in Computer Science 4855, 2007, pp. 376-387
• Triangulations of line segment sets in the plane
  Mathieu Brévilliers, Nicolas Chevallier, Dominique Schmitt
  Lecture Notes in Computer Science 4855, 2007, pp. 388-399
• Reconstructing convex polygons and polyhedra from edge and face counts in orthogonal projections
  Therese Biedl, Masud Hasan, Alejandro López-Ortiz
  Lecture Notes in Computer Science 4855, 2007, pp. 400-411
• Stochastic Müller games are PSPACE-complete
  Krishnendu Chatterjee
  Lecture Notes in Computer Science 4855, 2007, pp. 436-448
• Efficient and expressive tree filters
  Michael Benedikt, Alan Jeffrey
  Lecture Notes in Computer Science 4855, 2007, pp. 461-472
• Markov decision processes with multiple long-run average objectives
  Krishnendu Chatterjee
  Lecture Notes in Computer Science 4855, 2007, pp. 473-484
• Undirected graphs of entanglement 2
  Walid Belkhir, Luigi Santocanale
  Lecture Notes in Computer Science 4855, 2007, pp. 508-519
• Inverted Edwards coordinates
  Daniel J. Bernstein, Tanja Lange
  Lecture Notes in Computer Science 4851, 2007, pp. 20-27
• Determining the nonlinearity of a new family of APN functions
  Carl Bracken, Eimear Byrne, Nadya Markin, Gary McGuire
  Lecture Notes in Computer Science 4851, 2007, pp. 72-79
• Space-time codes from crossed product algebras of degree 4
  Grégory Berhuy, Frédérique Oggier
  Lecture Notes in Computer Science 4851, 2007, pp. 90-99
• On the computation of non-uniform input for list decoding on Bezerra-Garcia tower
  M. Prem Laxman Das, Kripasindhu Sikdar
  Lecture Notes in Computer Science 4851, 2007, pp. 237-246
• Links between discriminating and identifying codes in the binary Hamming space
  Irène Charon, Gérard Cohen, Olivier Hudry, Antoine Lobstein
  Lecture Notes in Computer Science 4851, 2007, pp. 267-270
• A path to Hadamard matrices
  P. Embury, A. Rao
  Lecture Notes in Computer Science 4851, 2007, pp. 281-290