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

• The tangent FFT
  Daniel J. Bernstein
  Lecture Notes in Computer Science 4851, 2007, pp. 291-300
• Novel algebraic structure for cyclic codes
  Dang Hoai Bac, Nguyen Binh, Nguyen Xuan Quynh
  Lecture Notes in Computer Science 4851, 2007, pp. 301-310
• Extended norm-trace codes with optimized correction capability
  Maria Bras-Amorós, Michael E. O'Sullivan
  Lecture Notes in Computer Science 4851, 2007, pp. 337-346
• Modeling and analyzing massive terrain data sets
  Pankaj K. Agarwal
  Lecture Notes in Computer Science 4835, 2007, pp. 1-1
• Coloring triangle-free graphs on surfaces
  Zdenȇk Dvoȓák, Daniel Král', Robin Thomas
  Lecture Notes in Computer Science 4835, 2007, pp. 2-4
• Unifying two graph decompositions with modular decomposition
  Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
  Lecture Notes in Computer Science 4835, 2007, pp. 52-64
• Escaping off-line searchers and a discrete isoperimetric theorem
  Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin
  Lecture Notes in Computer Science 4835, 2007, pp. 65-74
• Dilation-optimal edge deletion in polygonal cycles
  Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel Smid, Yajun Wang
  Lecture Notes in Computer Science 4835, 2007, pp. 88-99
• Algorithms for the hypergraph and the minor crossing number problems
  Markus Chimani, Carsten Gutwenger
  Lecture Notes in Computer Science 4835, 2007, pp. 184-195
• Linear reconfiguration of cube-style modular robots
  Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Flatland, Stefan Langerman, Joseph O'Rourke, Suneeta Ramaswami, Vera Sacristán, Stefanie Wuhrer
  Lecture Notes in Computer Science 4835, 2007, pp. 208-219
• Fast message dissemination in random geometric ad-hoc radio networks
  Artur Czumaj, Xin Wang
  Lecture Notes in Computer Science 4835, 2007, pp. 220-231
• Succinct representation of labeled graphs
  Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
  Lecture Notes in Computer Science 4835, 2007, pp. 316-328
• Kinetic maintenance of mobile k-centres on trees
  Stephane Durocher, Christophe Paul
  Lecture Notes in Computer Science 4835, 2007, pp. 341-352
• Manipulation in games
  Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer
  Lecture Notes in Computer Science 4835, 2007, pp. 365-376
• The price of Nash equilibria in multicast transmissions games
  Vittorio Bilò
  Lecture Notes in Computer Science 4835, 2007, pp. 390-401
• Dynamic structures for top-k queries on uncertain data
  Jiang Chen, Ke Yi
  Lecture Notes in Computer Science 4835, 2007, pp. 427-438
• Separating populations with wide data: A spectral analysis
  Avrim Blum, Amin Coja-Oghlan, Alan Frieze, Shuheng Zhou
  Lecture Notes in Computer Science 4835, 2007, pp. 439-451
• A constant-competitive algorithm for online OVSF code assignment
  F.Y.L. Chin, H.F. Ting, Y. Zhang
  Lecture Notes in Computer Science 4835, 2007, pp. 452-463
• Average-case analysis of online topological ordering
  Deepak Ajwani, Tobias Friedrich
  Lecture Notes in Computer Science 4835, 2007, pp. 464-475
• On the relative dominance of paging algorithms
  Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro
  Lecture Notes in Computer Science 4835, 2007, pp. 488-499
• Geometric streaming algorithms with a sorting primitive
  Eric Y. Chen
  Lecture Notes in Computer Science 4835, 2007, pp. 512-524
• Hardness and approximation of traffic grooming
  Omid Amini, Stéphane Pérennes, Ignasi Sau
  Lecture Notes in Computer Science 4835, 2007, pp. 561-573
• Depth of field and cautious-greedy routing in social networks
  David Barbella, George Kachergis, David Liben-Nowell, Anna Sallstrom, Ben Sowell
  Lecture Notes in Computer Science 4835, 2007, pp. 574-586
• Locating facilities on a network to minimize their average service radius
  Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer
  Lecture Notes in Computer Science 4835, 2007, pp. 587-598
• Covering points by unit disks of fixed location
  Paz Carmi, Matthew J. Katz, Nissan Lev-Tov
  Lecture Notes in Computer Science 4835, 2007, pp. 644-655