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 [2]	Hilfe

Suche: Series=LNCS AND Volume=2914

• 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
• Randomized time-space tradeoffs for directed graph connectivity
  Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta
  Lecture Notes in Computer Science 2914, 2003, pp. 208-216
• Distance-preserving approximations of polygonal paths
  Joachim Gudmundsson, Giri Narasimhan, Michiel Smid
  Lecture Notes in Computer Science 2914, 2003, pp. 217-228
• Joint separation of geometric clusters and the extreme irregularities of regular polyhedra
  Sumanta Guha
  Lecture Notes in Computer Science 2914, 2003, pp. 229-243
• On the covering Steiner problem
  Anupam Gupta, Aravind Srinivasan
  Lecture Notes in Computer Science 2914, 2003, pp. 244-251
• Minimality results for the spatial logics
  D. Hirschkoff, É. Lozes, D. Sangiorgi
  Lecture Notes in Computer Science 2914, 2003, pp. 252-264
• Algorithms for non-uniform size data placement on parallel disks
  Srinivas Kashyap, Samir Khuller
  Lecture Notes in Computer Science 2914, 2003, pp. 265-276
• Efficient algorithms for Abelian group isomorphism and related problems
  T. Kavitha
  Lecture Notes in Computer Science 2914, 2003, pp. 277-288
• Quasi-polynomial time approximation algorithm for low-degree minimum-cost Steiner trees
  Jochen Könemann, R. Ravi
  Lecture Notes in Computer Science 2914, 2003, pp. 289-301