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

• A calculus and algebra for distributed data management
  Serge Abiteboul
  Lecture Notes in Computer Science 4393, 2007, pp. 1-11
• The Büchi complementation saga
  Moshe Vardi
  Lecture Notes in Computer Science 4393, 2007, pp. 12-22
• Speed-up techniques for shortest-path computations
  Dorothea Wagner, Thomas Willhalm
  Lecture Notes in Computer Science 4393, 2007, pp. 23-36
• Compact forbidden-set routing
  Bruno Courcelle, Andrew Twigg
  Lecture Notes in Computer Science 4393, 2007, pp. 37-48
• A new bound for pure greedy hot potato routing
  Manfred Kunde
  Lecture Notes in Computer Science 4393, 2007, pp. 49-60
• Wavelength management in WDM rings to maximize the number of connections
  Ioannis Caragiannis
  Lecture Notes in Computer Science 4393, 2007, pp. 61-72
• A first investigation of Sturmian trees
  Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
  Lecture Notes in Computer Science 4393, 2007, pp. 73-84
• On the size of the universal automaton of a regular language
  Sylvain Lombardy
  Lecture Notes in Computer Science 4393, 2007, pp. 85-96
• Correlations of partial words
  Francine Blanchet-Sadri, Joshua D. Gafni, Kevin H. Wilson
  Lecture Notes in Computer Science 4393, 2007, pp. 97-108
• Testing convexity properties of tree colorings
  Eldar Fischer, Orly Yahalom
  Lecture Notes in Computer Science 4393, 2007, pp. 109-120
• Why almost all k-colorable graphs are easy
  Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik
  Lecture Notes in Computer Science 4393, 2007, pp. 121-132
• On defining integers in the counting hierarchy and proving arithmetic circuit lower bounds
  Peter Bürgisser
  Lecture Notes in Computer Science 4393, 2007, pp. 133-144
• A new rank technique for formula size lower bounds
  Troy Lee
  Lecture Notes in Computer Science 4393, 2007, pp. 145-156
• Hard metrics from Cayley graphs of Abelian groups
  Ilan Newman, Yuri Rabinovich
  Lecture Notes in Computer Science 4393, 2007, pp. 157-162
• Broadcasting vs. mixing and information dissemination on Cayley graphs
  Robert Elsässer, Thomas Sauerwald
  Lecture Notes in Computer Science 4393, 2007, pp. 163-174
• Light orthogonal networks with constant geometric dilation
  Adrian Dumitrescu, Csaba D. Tóth
  Lecture Notes in Computer Science 4393, 2007, pp. 175-187
• Admissibility in infinite games
  Dietmar Berwanger
  Lecture Notes in Computer Science 4393, 2007, pp. 188-199
• Pure stationary optimal strategies in Markov decision processes
  Hugo Gimbert
  Lecture Notes in Computer Science 4393, 2007, pp. 200-211
• Symmetries and the complexity of pure Nash equilibrium
  Felix Brandt, Felix Fischer, Markus Holzer
  Lecture Notes in Computer Science 4393, 2007, pp. 212-223
• Computing representations of matroids of bounded branch-width
  Daniel Král'
  Lecture Notes in Computer Science 4393, 2007, pp. 224-235
• Characterizing minimal interval completions - Towards better understanding of profile and pathwidth
  Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
  Lecture Notes in Computer Science 4393, 2007, pp. 236-247
• The complexity of unions of disjoint sets
  Christian Glaßer, Alan L. Selman, Stephen Travers, Klaus W. Wagner
  Lecture Notes in Computer Science 4393, 2007, pp. 248-259
• Kolmogorov-Loveland stochasticity and Kolmogorov complexity
  Laurent Bienvenu
  Lecture Notes in Computer Science 4393, 2007, pp. 260-271
• Bounded-hop energy-efficient broadcast in low-dimensional metrics via coresets
  Stefan Funke, Sören Laue
  Lecture Notes in Computer Science 4393, 2007, pp. 272-283
• On the complexity of affine image matching
  Christian Hundt, Maciej Liśkiewicz
  Lecture Notes in Computer Science 4393, 2007, pp. 284-295