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	Hilfe

Suche: Series=LNCS AND Volume=3580

• On steganographic chosen covertext security
  Nicholas Hopper
  Lecture Notes in Computer Science 3580, 2005, pp. 311-323
• Classification of Boolean functions of 6 variables or less with respect to some cryptographic properties
  An Braeken, Yuri Borissov, Svetla Nikova, Bart Preneel
  Lecture Notes in Computer Science 3580, 2005, pp. 324-334
• Label-guided graph exploration by a finite automaton
  Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
  Lecture Notes in Computer Science 3580, 2005, pp. 335-346
• On the wake-up problem in radio networks
  Bogdan S. Chlebus, Leszek Ga̧sieniec, Dariusz R. Kowalski, Tomasz Radzik
  Lecture Notes in Computer Science 3580, 2005, pp. 347-359
• Distance constrained labelings of graphs of bounded treewidth
  Jiȓí Fiala, Petr A. Golovach, Jan Kratochvíl
  Lecture Notes in Computer Science 3580, 2005, pp. 360-372
• Optimal branch-decomposition of planar graphs in O(n^3) time
  Qian-Ping Gu, Hisao Tamaki
  Lecture Notes in Computer Science 3580, 2005, pp. 373-384
• NFAs with and without \epsilon-transitions
  Juraj Hromkovic̑, Georg Schnitger
  Lecture Notes in Computer Science 3580, 2005, pp. 385-396
• On the equivalence of Z-automata
  Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch
  Lecture Notes in Computer Science 3580, 2005, pp. 397-409
• A tight linear bound on the neighborhood of inverse cellular automata
  Eugen Czeizler, Jarkko Kari
  Lecture Notes in Computer Science 3580, 2005, pp. 410-420
• Groupoids that recognize only regular languages
  Martin Beaudry, François Lemieux, Denis Thérien
  Lecture Notes in Computer Science 3580, 2005, pp. 421-433
• Append-only signatures
  Eike Kiltz, Anton Mityagin, Saurabh Panjwani, Barath Raghavan
  Lecture Notes in Computer Science 3580, 2005, pp. 434-445
• Hierarchical group signatures
  Mårten Trolin, Douglas Wikström
  Lecture Notes in Computer Science 3580, 2005, pp. 446-458
• Designated verifier signature schemes: Attacks, new security notions and a new construction
  Helger Lipmaa, Guilin Wang, Feng Bao
  Lecture Notes in Computer Science 3580, 2005, pp. 459-471
• Single-key AIL-MACs from any FIL-MAC
  Ueli Maurer, Johan Sjödin
  Lecture Notes in Computer Science 3580, 2005, pp. 472-484
• The efficiency and fairness of a fixed budget resource allocation game
  Li Zhang
  Lecture Notes in Computer Science 3580, 2005, pp. 485-496
• Braess's paradox, Fibonacci numbers, and exponential inapproximability
  Henry Lin, Tim Roughgarden, Éva Tardos, Asher Walkover
  Lecture Notes in Computer Science 3580, 2005, pp. 497-512
• Weighted automata and weighted logics
  Manfred Droste, Paul Gastin
  Lecture Notes in Computer Science 3580, 2005, pp. 513-525
• Restricted two-variable FO+MOD sentences, circuits and communication complexity
  Pascal Tesson, Denis Thérien
  Lecture Notes in Computer Science 3580, 2005, pp. 526-538
• Suitable curves for genus-4 HCC over prime fields: Point counting formulae for hyperelliptic curves of type y^2 = x^{2k+1} + ax
  Mitsuhiro Haneda, Mitsuru Kawazoe, Tetsuya Takahashi
  Lecture Notes in Computer Science 3580, 2005, pp. 539-550
• Solvability of a system of bivariate polynomial equations over a finite field
  Neeraj Kayal
  Lecture Notes in Computer Science 3580, 2005, pp. 551-562
• Cache-oblivious planar shortest paths
  Hema Jampala, Norbert Zeh
  Lecture Notes in Computer Science 3580, 2005, pp. 563-575
• Cache-aware and cache-oblivious adaptive sorting
  Gerth Stlting Brodal, Rolf Fagerberg, Gabriel Moruz
  Lecture Notes in Computer Science 3580, 2005, pp. 576-588
• Simulated annealing beats metropolis in combinatorial optimization
  Ingo Wegener
  Lecture Notes in Computer Science 3580, 2005, pp. 589-601
• Online interval coloring and variants
  Leah Epstein, Meital Levy
  Lecture Notes in Computer Science 3580, 2005, pp. 602-613
• Dynamic bin packing of unit fractions items
  Wun-Tat Chan, Tak-Wah Lam, Prudence W.H. Wong
  Lecture Notes in Computer Science 3580, 2005, pp. 614-626