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

• On Cartesian trees and range minimum queries
  Erik D. Demaine, Gad M. Landau, Oren Weimann
  Lecture Notes in Computer Science 5555, 2009, pp. 341-353
• Applications of a splitting trick
  Martin Dietzfelbinger, Michael Rink
  Lecture Notes in Computer Science 5555, 2009, pp. 354-365
• Quasirandom rumor spreading: Expanders, push vs. pull, and robustness
  Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
  Lecture Notes in Computer Science 5555, 2009, pp. 366-377
• Incompressibility through colors and IDs
  Michael Dom, Daniel Lokshtanov, Saket Saurabh
  Lecture Notes in Computer Science 5555, 2009, pp. 378-389
• Partition arguments in multiparty communication complexity
  Jan Draisma, Eyal Kushilevitz, Enav Weinreb
  Lecture Notes in Computer Science 5555, 2009, pp. 390-402
• High complexity tilings with sparse errors
  Bruno Durand, Andrei Romashchenko, Alexander Shen
  Lecture Notes in Computer Science 5555, 2009, pp. 403-414
• Tight bounds for the cover time of multiple random walks
  Robert Elsässer, Thomas Sauerwald
  Lecture Notes in Computer Science 5555, 2009, pp. 415-426
• Online computation with advice
  Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
  Lecture Notes in Computer Science 5555, 2009, pp. 427-438
• Dynamic succinct ordered trees
  Arash Farzan, J. Ian Munro
  Lecture Notes in Computer Science 5555, 2009, pp. 439-450
• Universal succinct representations of trees?
  Arash Farzan, Rajeev Raman, S. Srinivasa Rao
  Lecture Notes in Computer Science 5555, 2009, pp. 451-462
• Distortion is fixed parameter tractable
  Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
  Lecture Notes in Computer Science 5555, 2009, pp. 463-474
• The order bound for toric codes
  Peter Beelen, Diego Ruano
  Lecture Notes in Computer Science 5527, 2009, pp. 1-10
• An extension of the order bound for AG codes
  Iwan Duursma, Radoslav Kirov
  Lecture Notes in Computer Science 5527, 2009, pp. 11-22
• From the Euclidean algorithm for solving a key equation for dual Reed-Solomon codes to the Berlekamp-Massey algorithm
  Maria Bras-Amorós, Michael E. O'Sullivan
  Lecture Notes in Computer Science 5527, 2009, pp. 32-42
• Simulation of the sum-product algorithm using stratified sampling
  John Brevik, Michael E. O'Sullivan, Anya Umlauf, Rich Wolski
  Lecture Notes in Computer Science 5527, 2009, pp. 65-72
• A systems theory approach to periodically time-varying convolutional codes by means of their invariant equivalent
  Joan-Josep Climent, Victoria Herranz, Carmen Perea, Virtudes Tomás
  Lecture Notes in Computer Science 5527, 2009, pp. 73-82
• There are not non-obvious cyclic affine-invariant codes
  José Joaquín Bernal, Ángel del Río, Juan Jacobo Simón
  Lecture Notes in Computer Science 5527, 2009, pp. 101-106
• A non-Abelian group based on block upper triangular matrices with cryptographic applications
  Rafael Álvarez, Leandro Tortosa, José Vicent, Antonio Zamora
  Lecture Notes in Computer Science 5527, 2009, pp. 117-126
• On some sequences of the secret pseudo-random index j in RC4 key scheduling
  Riddhipratim Basu, Subhamoy Maitra, Goutam Paul, Tanmoy Talukdar
  Lecture Notes in Computer Science 5527, 2009, pp. 137-148
• Efficient constructions of deterministic encryption from hybrid encryption and code-based PKE
  Yang Cui, Kirill Morozov, Kazukuni Kobara, Hideki Imai
  Lecture Notes in Computer Science 5527, 2009, pp. 159-168
• New commutative semifields and their nuclei
  Jürgen Bierbrauer
  Lecture Notes in Computer Science 5527, 2009, pp. 179-185
• On the distribution of nonlinear congruential pseudorandom numbers of higher orders in residue rings
  Edwin D. El-Mahassni, Domingo Gomez
  Lecture Notes in Computer Science 5527, 2009, pp. 195-203
• Rooted trees searching for cocyclic Hadamard matrices over D_{4t}
  Víctor Álvarez, José Ándrés Armario, María Dolores Frau, Félix Gudiel, Amparo Osuna
  Lecture Notes in Computer Science 5527, 2009, pp. 204-214
• Gröbner representations of binary matroids
  M. Borges-Quintana, M.A. Borges-Trenard, E. Martínez-Moro
  Lecture Notes in Computer Science 5527, 2009, pp. 227-230
• Succinct greedy graph drawing in the hyperbolic plane
  David Eppstein, Michael Goodrich
  Lecture Notes in Computer Science 5417, 2009, pp. 14-25