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

• On the complexity of computing treelength
  Daniel Lokshtanov
  Lecture Notes in Computer Science 4708, 2007, pp. 276-287
• On time lookahead algorithms for the online data acknowledgement problem
  Csanád Imreh, Tamás Németh
  Lecture Notes in Computer Science 4708, 2007, pp. 288-297
• Real time language recognition on 2D cellular automata: Dealing with non-convex neighborhoods
  Martin Delacourt, Victor Poupet
  Lecture Notes in Computer Science 4708, 2007, pp. 298-309
• Towards a rice theorem on traces of cellular automata
  Julien Cervelle, Pierre Guillon
  Lecture Notes in Computer Science 4708, 2007, pp. 310-319
• Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority
  Damien Regnault, Nicolas Schabanel, Éric Thierry
  Lecture Notes in Computer Science 4708, 2007, pp. 320-332
• Public key identification based on the equivalence of quadratic forms
  Rupert J. Hartung, Claus-Peter Schnorr
  Lecture Notes in Computer Science 4708, 2007, pp. 333-345
• Reachability problems in quaternion matrix and rotation semigroups
  Paul Bell, Igor Potapov
  Lecture Notes in Computer Science 4708, 2007, pp. 346-358
• VPSPACE and a transfer theorem over the complex field
  Pascal Koiran, Sylvain Perifel
  Lecture Notes in Computer Science 4708, 2007, pp. 359-370
• Efficient provably-secure hierarchical key assignment schemes
  Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci
  Lecture Notes in Computer Science 4708, 2007, pp. 371-382
• Nearly private information retrieval
  Amit Chakrabarti, Anna Shubina
  Lecture Notes in Computer Science 4708, 2007, pp. 383-393
• Packing and squeezing subgraphs into planar graphs
  Fabrizio Frati, Markus Geyer, Michael Kaufmann
  Lecture Notes in Computer Science 4708, 2007, pp. 394-405
• Dynamic matchings in convex bipartite graphs
  Gerth Stlting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel
  Lecture Notes in Computer Science 4708, 2007, pp. 406-417
• Communication in networks with random dependent faults
  Evangelos Kranakis, Michel Paquette, Andrzej Pelc
  Lecture Notes in Computer Science 4708, 2007, pp. 418-429
• Optimal gossiping in directed geometric radio networks in presence of dynamical faults
  Andrea E.F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
  Lecture Notes in Computer Science 4708, 2007, pp. 430-441
• A linear time algorithm for the k maximal sums problem
  Gerth Stlting Brodal, Allan Grnlund Jrgensen
  Lecture Notes in Computer Science 4708, 2007, pp. 442-453
• A lower bound of 1+\phi for truthful scheduling mechanisms
  Elias Koutsoupias, Angelina Vidali
  Lecture Notes in Computer Science 4708, 2007, pp. 454-464
• Analysis of maximal repetitions in strings
  Maxime Crochemore, Lucian Ilie
  Lecture Notes in Computer Science 4708, 2007, pp. 465-476
• Series-parallel languages on scattered and countable posets
  Nicolas Bedon, Chloé Rispal
  Lecture Notes in Computer Science 4708, 2007, pp. 477-488
• Traces of term-automatic graphs
  Antoine Meyer
  Lecture Notes in Computer Science 4708, 2007, pp. 489-500
• State complexity of basic operations on suffix-free regular languages
  Yo-Sub Han, Kai Salomaa
  Lecture Notes in Computer Science 4708, 2007, pp. 501-512
• Exact algorithms for L(2,1)-labeling of graphs
  Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
  Lecture Notes in Computer Science 4708, 2007, pp. 513-524
• On (k,l)-leaf powers
  Andreas Brandstädt, Peter Wagner
  Lecture Notes in Computer Science 4708, 2007, pp. 525-535
• An improved claw finding algorithm using quantum walk
  Seiichiro Tani
  Lecture Notes in Computer Science 4708, 2007, pp. 536-547
• Complexity upper bounds for classical locally random reductions using a quantum computational argument
  Rahul Tripathi
  Lecture Notes in Computer Science 4708, 2007, pp. 548-558
• On the complexity of game isomorphism
  Joaquim Gabarró, Alina García, Maria Serna
  Lecture Notes in Computer Science 4708, 2007, pp. 559-571