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 YEAR=2007

• On the power of k-consistency
  Albert Atserias, Andrei Bulatov, Victor Dalmau
  Lecture Notes in Computer Science 4596, 2007, pp. 279-290
• Complexity of propositional proofs under a promise
  Nachum Dershowitz, Iddo Tzameret
  Lecture Notes in Computer Science 4596, 2007, pp. 291-302
• Parameterized algorithms for directed maximum leaf problems
  Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
  Lecture Notes in Computer Science 4596, 2007, pp. 352-362
• Hash functions in the dedicated-key setting: Design choices and MPP transforms
  Mihir Bellare, Thomas Ristenpart
  Lecture Notes in Computer Science 4596, 2007, pp. 399-410
• Unrestricted aggregate signatures
  Mihir Bellare, Chanathip Namprempre, Gregory Neven
  Lecture Notes in Computer Science 4596, 2007, pp. 411-422
• Ring signatures of sub-linear size without random oracles
  Nishanth Chandran, Jens Groth, Amit Sahai
  Lecture Notes in Computer Science 4596, 2007, pp. 423-434
• Balanced families of perfect hash functions and their applications
  Noga Alon, Shai Gutner
  Lecture Notes in Computer Science 4596, 2007, pp. 435-446
• An exponential improvement on the MST heuristic for minimum energy broadcasting in ad hoc wireless networks
  Ioannis Caragiannis, Michele Flammini, Luca Moscardelli
  Lecture Notes in Computer Science 4596, 2007, pp. 447-458
• Offline/online mixing
  Ben Adida, Douglas Wikström
  Lecture Notes in Computer Science 4596, 2007, pp. 484-495
• Maximal infinite-valued constraint languages
  Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen
  Lecture Notes in Computer Science 4596, 2007, pp. 546-557
• Affine systems of equations and counting infinitary logic
  Albert Atserias, Andrei Bulatov, Anuj Dawar
  Lecture Notes in Computer Science 4596, 2007, pp. 558-570
• Holographic algorithms: The power of dimensionality resolved
  Jin-Yi Cai, Pinyan Lu
  Lecture Notes in Computer Science 4596, 2007, pp. 631-642
• Reconciling data compression and Kolmogorov complexity
  Laurent Bienvenu, Wolfgang Merkle
  Lecture Notes in Computer Science 4596, 2007, pp. 643-654
• Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
  Michael Elkin
  Lecture Notes in Computer Science 4596, 2007, pp. 716-727
• Checking and spot-checking the correctness of priority queues
  Matthew Chu, Sampath Kannan, Andrew McGregor
  Lecture Notes in Computer Science 4596, 2007, pp. 728-739
• On the chromatic number of random graphs
  Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger
  Lecture Notes in Computer Science 4596, 2007, pp. 777-788
• Quasi-randomness and algorithmic regularity for graphs with general degree distributions
  Noga Alon, Amin Coja-Oghlan, Hiệp Hàn, Mihyun Kang, Vojtȇch Rödl, Mathias Schacht
  Lecture Notes in Computer Science 4596, 2007, pp. 789-800
• Complexity of the cover polynomial
  Markus Bläser, Holger Dell
  Lecture Notes in Computer Science 4596, 2007, pp. 801-812
• A generalization of Cobham's theorem to automata over real numbers
  Bernard Boigelot, Julien Brusten
  Lecture Notes in Computer Science 4596, 2007, pp. 813-824
• Minimum-time reachability in timed games
  Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, Jean-François Raskin
  Lecture Notes in Computer Science 4596, 2007, pp. 825-837
• Bounded depth data trees
  Henrik Björklund, Mikoƚaj Bojańczyk
  Lecture Notes in Computer Science 4596, 2007, pp. 862-874
• Regular languages of nested words: Fixed points, automata, and synchronization
  Marcelo Arenas, Pablo Barceló, Leonid Libkin
  Lecture Notes in Computer Science 4596, 2007, pp. 888-900
• A combinatorial theorem for trees - Applications to monadic logic and infinite structures
  Thomas Colcombet
  Lecture Notes in Computer Science 4596, 2007, pp. 901-912
• Model theory makes formulas large
  Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
  Lecture Notes in Computer Science 4596, 2007, pp. 913-924
• Decision problems for lower/upper bound parametric timed automata
  Laura Bozzelli, Salvatore La Torre
  Lecture Notes in Computer Science 4596, 2007, pp. 925-936