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

• Scheduling periodic tasks in a hard real-time environment
  Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese
  Lecture Notes in Computer Science 6198, 2010, pp. 299-311
• Scalably scheduling power-heterogeneous processors
  Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
  Lecture Notes in Computer Science 6198, 2010, pp. 312-323
• Better scalable algorithms for broadcast scheduling
  Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan
  Lecture Notes in Computer Science 6198, 2010, pp. 324-335
• Max-min online allocations with a reordering buffer
  Leah Epstein, Asaf Levin, Rob van Stee
  Lecture Notes in Computer Science 6198, 2010, pp. 336-347
• Orientability of random hypergraphs and the power of multiple choices
  Nikolaos Fountoulakis, Konstantinos Panagiotou
  Lecture Notes in Computer Science 6198, 2010, pp. 348-359
• On the inapproximability of vertex cover on k-partite k-uniform hypergraphs
  Venkatesan Guruswami, Rishi Saket
  Lecture Notes in Computer Science 6198, 2010, pp. 360-371
• Dynamic programming for graphs on surfaces
  Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 6198, 2010, pp. 372-383
• Interval graphs: Canonical representation in logspace
  Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky
  Lecture Notes in Computer Science 6198, 2010, pp. 384-395
• Approximating the partition function of the ferromagnetic Potts model
  Leslie Ann Goldberg, Mark Jerrum
  Lecture Notes in Computer Science 6198, 2010, pp. 396-407
• On the relation between polynomial identity testing and finding variable disjoint factors
  Amir Shpilka, Ilya Volkovich
  Lecture Notes in Computer Science 6198, 2010, pp. 408-419
• On sums of roots of unity
  Bruce Litow
  Lecture Notes in Computer Science 6198, 2010, pp. 420-425
• Exponential time complexity of the permanent and the Tutte polynomial
  Holger Dell, Thore Husfeldt, Martin Wahlén
  Lecture Notes in Computer Science 6198, 2010, pp. 426-437
• On approximate Horn formula minimization
  Amitava Bhattacharya, Bhaskar DasGupta, Dhruv Mubayi, György Turán
  Lecture Notes in Computer Science 6198, 2010, pp. 438-450
• Choosing, agreeing, and eliminating in communication complexity
  Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb
  Lecture Notes in Computer Science 6198, 2010, pp. 451-462
• Additive spanners in nearly quadratic time
  David P. Woodruff
  Lecture Notes in Computer Science 6198, 2010, pp. 463-474
• Composition theorems in communication complexity
  Troy Lee, Shengyu Zhang
  Lecture Notes in Computer Science 6198, 2010, pp. 475-489
• Network design via core detouring for problems without a core
  Fabrizio Grandoni, Thomas Rothvoß
  Lecture Notes in Computer Science 6198, 2010, pp. 490-502
• Weak completeness notions for exponential time
  Klaus Ambos-Spies, Timur Bakibayev
  Lecture Notes in Computer Science 6198, 2010, pp. 503-514
• Efficient evaluation of nondeterministic automata using factorization forests
  Mikoƚaj Bojańczyk, Paweƚ Parys
  Lecture Notes in Computer Science 6198, 2010, pp. 515-526
• On the complexity of searching in trees: Average-case minimization
  Tobias Jacobs, Ferdinando Cicalese, Eduardo Laber, Marco Molinaro
  Lecture Notes in Computer Science 6198, 2010, pp. 527-539
• Finding is as easy as detecting for quantum walks
  Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland
  Lecture Notes in Computer Science 6198, 2010, pp. 540-551
• Improved constructions for non-adaptive threshold group testing
  Mahdi Cheraghchi
  Lecture Notes in Computer Science 6198, 2010, pp. 552-564
• Testing non-uniform k-wise independent distributions over product spaces
  Ronitt Rubinfeld, Ning Xie
  Lecture Notes in Computer Science 6198, 2010, pp. 565-581
• A sublogarithmic approximation for highway and tollbooth pricing
  Iftah Gamzu, Danny Segev
  Lecture Notes in Computer Science 6198, 2010, pp. 582-593
• Maximum quadratic assignment problem: Reduction from maximum label cover and LP-based approximation algorithm
  Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko
  Lecture Notes in Computer Science 6198, 2010, pp. 594-604