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

• Online clustering with variable sized clusters
  János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
  Lecture Notes in Computer Science 6281, 2010, pp. 282-293
• Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
  Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc
  Lecture Notes in Computer Science 6281, 2010, pp. 294-305
• Counting classes and the fine structure between NC^1 and L
  Samir Datta, Meena Mahajan, B.V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
  Lecture Notes in Computer Science 6281, 2010, pp. 306-317
• The average complexity of Moore's state minimization algorithm is \mathcal {O} (n\log\log n)
  Julien David
  Lecture Notes in Computer Science 6281, 2010, pp. 318-329
• Connected searching of weighted trees
  Dariusz Dereniowski
  Lecture Notes in Computer Science 6281, 2010, pp. 330-341
• Iterated regret minimization in game graphs
  Emmanuel Filiot, Tristan Le Gall, Jean-François Raskin
  Lecture Notes in Computer Science 6281, 2010, pp. 342-354
• Properties of visibly pushdown transducers
  Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
  Lecture Notes in Computer Science 6281, 2010, pp. 355-367
• Second-order algebraic theories
  Marcelo Fiore, Ola Mahmoud
  Lecture Notes in Computer Science 6281, 2010, pp. 368-380
• Frame definability for classes of trees in the \mu-calculus
  Gaëlle Fontaine, Thomas Place
  Lecture Notes in Computer Science 6281, 2010, pp. 381-392
• Evaluating non-square sparse bilinear forms on multiple vector pairs in the I/O-model
  Gero Greiner, Riko Jacob
  Lecture Notes in Computer Science 6281, 2010, pp. 393-404
• Finding and counting vertex-colored subtrees
  Sylvain Guillemot, Florian Sikora
  Lecture Notes in Computer Science 6281, 2010, pp. 405-416
• Limiting negations in bounded treewidth and upward planar circuits
  Jing He, Hongyu Liang, Jayalal M.N. Sarma
  Lecture Notes in Computer Science 6281, 2010, pp. 417-428
• On the topological complexity of MSO+U and related automata models
  Szczepan Hummel, Michaƚ Skrzypczak, Szymon Toruńczyk
  Lecture Notes in Computer Science 6281, 2010, pp. 429-440
• Least and greatest solutions of equations over sets of integers
  Artur Jeż, Alexander Okhotin
  Lecture Notes in Computer Science 6281, 2010, pp. 441-452
• Improved simulation of nondeterministic Turing machines
  Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh
  Lecture Notes in Computer Science 6281, 2010, pp. 453-464
• The prize-collecting edge dominating set problem in trees
  Naoyuki Kamiyama
  Lecture Notes in Computer Science 6281, 2010, pp. 465-476
• The multivariate resultant is NP-hard in any characteristic
  Bruno Grenet, Pascal Koiran, Natacha Portier
  Lecture Notes in Computer Science 6281, 2010, pp. 477-488
• Parameterized complexity and kernelizability of Max Ones and Exact Ones problems
  Stefan Kratsch, Dániel Marx, Magnus Wahlström
  Lecture Notes in Computer Science 6281, 2010, pp. 489-500
• Meta-envy-free cake-cutting protocols
  Yoshifumi Manabe, Tatsuaki Okamoto
  Lecture Notes in Computer Science 6281, 2010, pp. 501-512
• Two variables and two successors
  Amaldev Manuel
  Lecture Notes in Computer Science 6281, 2010, pp. 513-524
• Harnessing ML^{\mbox{\scriptsize {F}}} with the power of system F
  Giulio Manzonetto, Paolo Tranquilli
  Lecture Notes in Computer Science 6281, 2010, pp. 525-536
• Describing average- and longtime-behavior by weighted MSO logics
  Manfred Droste, Ingmar Meinecke
  Lecture Notes in Computer Science 6281, 2010, pp. 537-548
• Solving minones-2-sat as fast as vertex cover
  Neeldhara Misra, N.S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
  Lecture Notes in Computer Science 6281, 2010, pp. 549-555
• Unambiguous finite automata over a unary alphabet
  Alexander Okhotin
  Lecture Notes in Computer Science 6281, 2010, pp. 556-567
• The complexity of finding reset words in finite automata
  Jörg Olschewski, Michael Ummels
  Lecture Notes in Computer Science 6281, 2010, pp. 568-579