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

Suche: Series=LNCS AND Volume=8087

• On stochastic games with multiple objectives
  Taolue Chen, Vojtȇch Forejt, Marta Kwiatkowska, Aistis Simaitis, Clemens Wiltsche
  Lecture Notes in Computer Science 8087, 2013, pp. 266-277
• Minimal indices for successor search
  Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan
  Lecture Notes in Computer Science 8087, 2013, pp. 278-289
• Paradigms for parameterized enumeration
  Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
  Lecture Notes in Computer Science 8087, 2013, pp. 290-301
• Complexity of checking bisimilarity between sequential and parallel processes
  Wojciech Czerwiński, Petr Janc̑ar, Martin Kot, Zdenȇk Sawa
  Lecture Notes in Computer Science 8087, 2013, pp. 302-313
• Guarding orthogonal art galleries using sliding cameras: Algorithmic and hardness results
  Stephane Durocher, Saeed Mehrabi
  Lecture Notes in Computer Science 8087, 2013, pp. 314-324
• Linear-space data structures for range frequency queries on arrays and trees
  Stephane Durocher, Rahul Shah, Matthew Skala, Sharma V. Thankachan
  Lecture Notes in Computer Science 8087, 2013, pp. 325-336
• Noninterference with local policies
  Sebastian Eggert, Henning Schnoor, Thomas Wilke
  Lecture Notes in Computer Science 8087, 2013, pp. 337-348
• In-place binary counters
  Amr Elmasry, Jyrki Katajainen
  Lecture Notes in Computer Science 8087, 2013, pp. 349-360
• Rent or buy problems with a fixed time horizon
  Leah Epstein, Hanan Zebedat-Haider
  Lecture Notes in Computer Science 8087, 2013, pp. 361-372
• On the recognition of four-directional orthogonal ray graphs
  Stefan Felsner, George B. Mertzios, Irina Mustaţă
  Lecture Notes in Computer Science 8087, 2013, pp. 373-384
• Reachability analysis of recursive quantum Markov chains
  Yuan Feng, Nengkun Yu, Mingsheng Ying
  Lecture Notes in Computer Science 8087, 2013, pp. 385-396
• Ordering metro lines by block crossings
  Martin Fink, Sergey Pupyrev
  Lecture Notes in Computer Science 8087, 2013, pp. 397-408
• Reachability in register machines with polynomial updates
  Alain Finkel, Stefan Göller, Christoph Haase
  Lecture Notes in Computer Science 8087, 2013, pp. 409-420
• On the parameterized complexity of cutting a few vertices from a graph
  Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen
  Lecture Notes in Computer Science 8087, 2013, pp. 421-432
• On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of valiant
  Hervé Fournier, Sylvain Perifel, Rémi de Verclos
  Lecture Notes in Computer Science 8087, 2013, pp. 433-444
• A parameterized complexity analysis of combinatorial feature selection problems
  Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
  Lecture Notes in Computer Science 8087, 2013, pp. 445-456
• Meta-kernelization with structural parameters
  Robert Ganian, Friedrich Slivovsky, Stefan Szeider
  Lecture Notes in Computer Science 8087, 2013, pp. 457-468
• Separating hierarchical and general hub labelings
  Andrew V. Goldberg, Ilya Razenshteyn, Ruslan Savchenko
  Lecture Notes in Computer Science 8087, 2013, pp. 469-479
• Solving 3-superstring in 3^{n/3}.
  Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin
  Lecture Notes in Computer Science 8087, 2013, pp. 480-491
• On the parameterized complexity of the maximum edge 2-coloring problem
  Prachi Goyal, Vikram Kamat, Neeldhara Misra
  Lecture Notes in Computer Science 8087, 2013, pp. 492-503
• A note on deterministic poly-time algorithms for partition functions associated with Boolean matrices with prescribed row and column sums
  Leonid Gurvits
  Lecture Notes in Computer Science 8087, 2013, pp. 504-515
• Polynomial threshold functions and Boolean threshold circuits
  Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii
  Lecture Notes in Computer Science 8087, 2013, pp. 516-527
• Reachability in higher-order-counters
  Alexander Heußner, Alexander Kartzow
  Lecture Notes in Computer Science 8087, 2013, pp. 528-539
• Length-increasing reductions for PSPACE-completeness
  John M. Hitchcock, A. Pavan
  Lecture Notes in Computer Science 8087, 2013, pp. 540-550
• Improved complexity results on k-coloring P_t-free graphs
  Shenwei Huang
  Lecture Notes in Computer Science 8087, 2013, pp. 551-558