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

• Communication-efficient construction of the plane localized Delaunay graph
  Prosenjit Bose, Paz Carmi, Michiel Smid, Daming Xu
  Lecture Notes in Computer Science 6034, 2010, pp. 282-293
• Time complexity of distributed topological self-stabilization: The case of graph linearization
  Dominik Gall, Riko Jacob, Andrea Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
  Lecture Notes in Computer Science 6034, 2010, pp. 294-305
• Randomised broadcasting: Memory vs. randomness
  Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
  Lecture Notes in Computer Science 6034, 2010, pp. 306-319
• Limit theorems for random MAX-2-XORSAT
  Vonjy Rasendrahasina, Vlady Ravelomanana
  Lecture Notes in Computer Science 6034, 2010, pp. 320-331
• On quadratic threshold CSPs
  Per Austrin, Siavosh Benabbas, Avner Magen
  Lecture Notes in Computer Science 6034, 2010, pp. 332-343
• Finding lower bounds on the complexity of secret sharing schemes by linear programming
  Carles Padró, Leonor Vázquez
  Lecture Notes in Computer Science 6034, 2010, pp. 344-355
• Finding the best CAFE is NP-hard
  Elizabeth Maltais, Lucia Moura
  Lecture Notes in Computer Science 6034, 2010, pp. 356-371
• The size and depth of layered Boolean circuits
  Anna Gál, Jing-Tang Jang
  Lecture Notes in Computer Science 6034, 2010, pp. 372-383
• Lipschitz unimodal and isotonic regression on paths and trees
  Pankaj K. Agarwal, Jeff M. Phillips, Bardia Sadri
  Lecture Notes in Computer Science 6034, 2010, pp. 384-396
• Ambiguity and deficiency in Costas arrays and APN permutations
  Daniel Panario, Brett Stevens, Qiang Wang
  Lecture Notes in Computer Science 6034, 2010, pp. 397-406
• Iterated shared memory models
  Sergio Rajsbaum
  Lecture Notes in Computer Science 6034, 2010, pp. 407-416
• Optimal polygonal representation of planar graphs
  E.R. Gansner, Y.F. Hu, M. Kaufmann, S.G. Kobourov
  Lecture Notes in Computer Science 6034, 2010, pp. 417-432
• Minimum-perimeter intersecting polygons
  Adrian Dumitrescu, Minghui Jiang
  Lecture Notes in Computer Science 6034, 2010, pp. 433-445
• Finding the smallest gap between sums of square roots
  Qi Cheng, Yu-Hsin Li
  Lecture Notes in Computer Science 6034, 2010, pp. 446-455
• Matching points with things
  Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian
  Lecture Notes in Computer Science 6034, 2010, pp. 456-467
• Homotopic rectilinear routing with few links and thick edges
  Bettina Speckmann, Kevin Verbeek
  Lecture Notes in Computer Science 6034, 2010, pp. 468-479
• Tilings robust to errors
  Alexis Ballier, Bruno Durand, Emmanuel Jeandel
  Lecture Notes in Computer Science 6034, 2010, pp. 480-491
• Visiting a sequence of points with a bevel-tip needle
  Steven Bitner, Yam K. Cheung, Atlas F. Cook IV, Ovidiu Daescu, Anastasia Kurdia, Carola Wenk
  Lecture Notes in Computer Science 6034, 2010, pp. 492-502
• Euclidean prize-collecting Steiner forest
  MohammadHossein Bateni, MohammadTaghi Hajiaghayi
  Lecture Notes in Computer Science 6034, 2010, pp. 503-514
• Prize-collecting Steiner networks via iterative rounding
  MohammadTaghi Hajiaghayi, Arefeh A. Nasri
  Lecture Notes in Computer Science 6034, 2010, pp. 515-526
• Kernelization through tidying - A case study based on s-plex cluster vertex deletion
  René van Bevern, Hannes Moser, Rolf Niedermeier
  Lecture Notes in Computer Science 6034, 2010, pp. 527-538
• Gradual sub-lattice reduction and a new complexity for factoring polynomials
  Mark van Hoeij, Andrew Novocin
  Lecture Notes in Computer Science 6034, 2010, pp. 539-553
• The power of fair pricing mechanisms
  Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron L. Roth
  Lecture Notes in Computer Science 6034, 2010, pp. 554-564
• Quasi-proportional mechanisms: Prior-free revenue maximization
  Vahab Mirrokni, S. Muthukrishnan, Uri Nadav
  Lecture Notes in Computer Science 6034, 2010, pp. 565-576
• Some observations on holographic algorithms
  Leslie G. Valiant
  Lecture Notes in Computer Science 6034, 2010, pp. 577-590