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

• Preserving secrecy under refinement
  Rajeev Alur, Pavol C̑erný, Steve Zdancewic
  Lecture Notes in Computer Science 4052, 2006, pp. 107-118
• Quantifying information leakage in process calculi
  Michele Boreale
  Lecture Notes in Computer Science 4052, 2006, pp. 119-131
• Symbolic protocol analysis in presence of a homomorphism operator and Exclusive Or
  Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, Ralf Treinen
  Lecture Notes in Computer Science 4052, 2006, pp. 132-143
• An efficient provable distinguisher for HFE
  Vivien Dubois, Louis Granboulan, Jacques Stern
  Lecture Notes in Computer Science 4052, 2006, pp. 156-167
• Constructing single- and multi-output Boolean functions with maximal algebraic immunity
  Frederik Armknecht, Matthias Krause
  Lecture Notes in Computer Science 4052, 2006, pp. 180-191
• On the impossibility of extracting classical randomness using a quantum computer
  Yevgeniy Dodis, Renato Renner
  Lecture Notes in Computer Science 4052, 2006, pp. 204-215
• A probabilistic Hoare-style logic for game-based cryptographic proofs
  Ricardo Corin, Jerry den Hartog
  Lecture Notes in Computer Science 4052, 2006, pp. 252-263
• Identity-based encryption gone wild
  Michel Abdalla, Dario Catalano, Alexander W. Dent, John Malone-Lee, Gregory Neven, Nigel P. Smart
  Lecture Notes in Computer Science 4052, 2006, pp. 300-311
• Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
  Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier
  Lecture Notes in Computer Science 4052, 2006, pp. 420-431
• On the axiomatizability of priority
  Luca Aceto, Taolue Chen, Wan Fokkink, Anna Ingolfsdottir
  Lecture Notes in Computer Science 4052, 2006, pp. 480-491
• A finite equational base for CCS with left merge and communication merge
  Luca Aceto, Wan Fokkink, Anna Ingolfsdottir, Bas Luttik
  Lecture Notes in Computer Science 4052, 2006, pp. 492-503
• Invisible safety of distributed protocols
  Ittai Balaban, Amir Pnueli, Lenore Zuck
  Lecture Notes in Computer Science 4052, 2006, pp. 528-539
• The complexity of enriched \mu-calculi
  Piero A. Bonatti, Carsten Lutz, Aniello Murano, Moshe Y. Vardi
  Lecture Notes in Computer Science 4052, 2006, pp. 540-551
• Interpreting tree-to-tree queries
  Michael Benedikt, Christoph Koch
  Lecture Notes in Computer Science 4052, 2006, pp. 552-564
• Flat parametric counter automata
  Marius Bozga, Radu Iosif, Yassine Lakhnech
  Lecture Notes in Computer Science 4052, 2006, pp. 577-588
• Additive approximation for edge-deletion problems
  Noga Alon, Asaf Shapira, Benny Sudakov
  Lecture Notes in Computer Science 4051, 2006, pp. 1-2
• The spectral gap of random graphs with given expected degrees
  Amin Coja-Oghlan, André Lanka
  Lecture Notes in Computer Science 4051, 2006, pp. 15-26
• Embedding bounded bandwidth graphs into l_1
  Douglas E. Carroll, Ashish Goel, Adam Meyerson
  Lecture Notes in Computer Science 4051, 2006, pp. 27-37
• Stopping times, metrics and approximate counting
  Magnus Bordewich, Martin Dyer, Marek Karpinski
  Lecture Notes in Computer Science 4051, 2006, pp. 108-119
• Expressive power of pebble automata
  Mikoƚaj Bojańczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin
  Lecture Notes in Computer Science 4051, 2006, pp. 157-168
• A push-relabel algorithm for approximating degree bounded MSTs
  Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar
  Lecture Notes in Computer Science 4051, 2006, pp. 191-201
• Tight bounds for selfish and greedy load balancing
  Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli
  Lecture Notes in Computer Science 4051, 2006, pp. 311-322
• Suffix trays and suffix trists: Structures for faster text indexing
  Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
  Lecture Notes in Computer Science 4051, 2006, pp. 358-369
• Planar crossing numbers of genus g graphs
  Hristo Djidjev, Imrich Vrt'o
  Lecture Notes in Computer Science 4051, 2006, pp. 419-430
• Design is as easy as optimization
  Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani
  Lecture Notes in Computer Science 4051, 2006, pp. 477-488