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

• A cryptographically sound security proof of the Needham-Schroeder-Lowe public-key protocol
  Michael Backes, Birgit Pfitzmann
  Lecture Notes in Computer Science 2914, 2003, pp. 1-12
• Constructions of sparse asymmetric connectors
  Andreas Baltz, Gerold Jäger, Anand Srivastav
  Lecture Notes in Computer Science 2914, 2003, pp. 13-22
• A separation logic for resource distribution
  Nicolas Biri, Didier Galmiche
  Lecture Notes in Computer Science 2914, 2003, pp. 23-37
• An equational theory for transactions
  Andrew P. Black, Vincent Cremet, Rachid Guerraoui, Martin Odersky
  Lecture Notes in Computer Science 2914, 2003, pp. 38-49
• Axioms for regular words
  Stephen L. Bloom, Zoltán Ésik
  Lecture Notes in Computer Science 2914, 2003, pp. 50-61
• 1-bounded TWA cannot be determinized
  Mikoƚaj Bojañczyk
  Lecture Notes in Computer Science 2914, 2003, pp. 62-73
• Reachability analysis of process rewrite systems
  Ahmed Bouajjani, Tayssir Touili
  Lecture Notes in Computer Science 2914, 2003, pp. 74-87
• Pushdown games with unboundedness and regular conditions
  Alexis-Julien Bouquet, Oliver Serre, Igor Walukiewicz
  Lecture Notes in Computer Science 2914, 2003, pp. 88-99
• Real-time model-checking: Parameters everywhere
  Véronique Bruyère, Jean-François Raskin
  Lecture Notes in Computer Science 2914, 2003, pp. 100-111
• The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata
  Arnaud Carayol, Stefan Wöhrle
  Lecture Notes in Computer Science 2914, 2003, pp. 112-123
• Deciding the security of protocols with Diffie-Hellman exponentiation and products in exponents
  Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani
  Lecture Notes in Computer Science 2914, 2003, pp. 124-135
• Subtyping constraints in quasi-lattices
  Emmanuel Coquery, François Fages
  Lecture Notes in Computer Science 2914, 2003, pp. 136-148
• An improved approximation scheme for computing Arrow-Debreu prices for the linear case
  Nikhil R. Devanur, Vijay V. Vazirani
  Lecture Notes in Computer Science 2914, 2003, pp. 149-155
• Word equations over graph products
  Volker Diekert, Markus Lohrey
  Lecture Notes in Computer Science 2914, 2003, pp. 156-167
• Analysis and experimental evaluation of a simple algorithm for collaborative filtering in planted partition models
  Devdatt Dubhashi, Luigi Laura, Alessandro Panconesi
  Lecture Notes in Computer Science 2914, 2003, pp. 168-182
• Comparing sequences with segment rearrangements
  Funda Ergun, S. Muthukrishnan, S. Cenk Sahinalp
  Lecture Notes in Computer Science 2914, 2003, pp. 183-194
• On logically defined recognizable tree languages
  Zoltán Ésik, Pascal Weil
  Lecture Notes in Computer Science 2914, 2003, pp. 195-207
• Reasoning about infinite state systems using Boolean methods
  Randal E. Bryant
  Lecture Notes in Computer Science 2914, 2003, pp. 399-407
• Stringent relativization
  Jin-Yi Cai, Osamu Watanabe
  Lecture Notes in Computer Science 2914, 2003, pp. 408-419
• Linear time algorithm for approximating a curve by a single-peaked curve
  Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
  Lecture Notes in Computer Science 2906, 2003, pp. 6-15
• Polygonal path approximation: A query based approach
  Ovidiu Daescu, Ningfang Mi
  Lecture Notes in Computer Science 2906, 2003, pp. 36-46
• A vertex incremental approach for dynamically maintaining chordal graphs
  Anne Berry, Pinar Heggernes, Yngve Villanger
  Lecture Notes in Computer Science 2906, 2003, pp. 47-57
• Infinitely-often autoreducible sets
  Richard Beigel, Lance Fortnow, Frank Stephan
  Lecture Notes in Computer Science 2906, 2003, pp. 98-107
• Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems
  Jianer Chen, Iyad A. Kanj, Ge Xia
  Lecture Notes in Computer Science 2906, 2003, pp. 148-157
• The quantum query complexity of 0-1 knapsack and associated claw problems
  V. Arvind, Rainer Schuler
  Lecture Notes in Computer Science 2906, 2003, pp. 168-177