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

• How well can primal-dual and local-ratio algorithms perform?
  Allan Borodin, David Cashman, Avner Magen
  Lecture Notes in Computer Science 3580, 2005, pp. 943-955
• Approximating MAX kCSP - Outperforming a random assignment with almost a linear factor
  Gustav Hast
  Lecture Notes in Computer Science 3580, 2005, pp. 956-968
• On dynamic bit-probe complexity
  Corina E. Pȃtraşcu, Mihai Pȃtraşcu
  Lecture Notes in Computer Science 3580, 2005, pp. 969-981
• Time-space lower bounds for the polynomial-time hierarchy on randomized machines
  Scott Diehl, Dieter van Melkebeek
  Lecture Notes in Computer Science 3580, 2005, pp. 982-993
• Lower bounds for circuits with few modular and symmetric gates
  Arkadev Chattopadhyay, Kristoffer Arnsfelt Hansen
  Lecture Notes in Computer Science 3580, 2005, pp. 994-1005
• Discrete random variables over domains
  M.W. Mislove
  Lecture Notes in Computer Science 3580, 2005, pp. 1006-1017
• An accessible approach to behavioural pseudometrics
  Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell
  Lecture Notes in Computer Science 3580, 2005, pp. 1018-1030
• Noisy Turing machines
  Eugene Asarin, Pieter Collins
  Lecture Notes in Computer Science 3580, 2005, pp. 1031-1042
• A better approximation ratio for the vertex cover problem
  George Karakostas
  Lecture Notes in Computer Science 3580, 2005, pp. 1043-1050
• Stochastic Steiner trees without a root
  Anupam Gupta, Martin Pál
  Lecture Notes in Computer Science 3580, 2005, pp. 1051-1063
• Approximation algorithms for the MAX-coloring problem
  Sriram V. Pemmaraju, Rajiv Raman
  Lecture Notes in Computer Science 3580, 2005, pp. 1064-1075
• Tight lower bounds for query processing on streaming and external memory data
  Martin Grohe, Christoph Koch, Nicole Schweikardt
  Lecture Notes in Computer Science 3580, 2005, pp. 1076-1088
• Decidability and complexity results for timed automata via channel machines
  Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, James Worrell
  Lecture Notes in Computer Science 3580, 2005, pp. 1089-1101
• Congruences for visibly pushdown languages
  Rajeev Alur, Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
  Lecture Notes in Computer Science 3580, 2005, pp. 1102-1114
• Approximation algorithms for Euclidean group TSP
  Khaled Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters
  Lecture Notes in Computer Science 3580, 2005, pp. 1115-1126
• Influential nodes in a diffusion model for social networks
  David Kempe, Jon Kleinberg, Éva Tardos
  Lecture Notes in Computer Science 3580, 2005, pp. 1127-1138
• An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks
  Christoph Ambühl
  Lecture Notes in Computer Science 3580, 2005, pp. 1139-1150
• New approaches for virtual private network design
  Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella
  Lecture Notes in Computer Science 3580, 2005, pp. 1151-1162
• Hadamard tensors and lower bounds on multiparty communication complexity
  Jeff Ford, Anna Gál
  Lecture Notes in Computer Science 3580, 2005, pp. 1163-1175
• Lower bounds for Lovász-Schrijver systems and beyond follow from multiparty communication complexity
  Paul Beame, Toniann Pitassi, Nathan Segerlind
  Lecture Notes in Computer Science 3580, 2005, pp. 1176-1188
• On the l-ary GCD-algorithm in rings of integers
  Douglas Wikström
  Lecture Notes in Computer Science 3580, 2005, pp. 1189-1201
• A fully abstract encoding of the \pi-calculus with data terms
  Michael Baldamus, Joachim Parrow, Björn Victor
  Lecture Notes in Computer Science 3580, 2005, pp. 1202-1213
• Orthogonal extensions in structural operational semantics
  MohammadReza Mousavi, Michel A. Reniers
  Lecture Notes in Computer Science 3580, 2005, pp. 1214-1225
• Basic observables for a calculus for global computing
  Rocco De Nicola, Daniele Gorla, Rosario Pugliese
  Lecture Notes in Computer Science 3580, 2005, pp. 1226-1238
• Compositional verification of asynchronous processes via constraint solving
  Giorgio Delzanno, Maurizio Gabbrielli
  Lecture Notes in Computer Science 3580, 2005, pp. 1239-1250