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

• Transducers with set output
  Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc
  Lecture Notes in Computer Science 2387, 2002, pp. 300-309
• Fast and dependable communication in hyper-rings
  Tom Altman, Yoshihide Igarashi, Kazuhiro Motegi
  Lecture Notes in Computer Science 2387, 2002, pp. 350-359
• The on-line Heilbronn's triangle problem in three and four dimensions
  Gill Barequet
  Lecture Notes in Computer Science 2387, 2002, pp. 360-369
• Supertrees by flipping
  D. Chen, O. Eulenstein, David Fernández-Baca, M. Sanderson
  Lecture Notes in Computer Science 2387, 2002, pp. 391-400
• 2-compromise usability in 1-dimensional statistical databases
  Ljiljana Branković, Jozef S̑irán̑
  Lecture Notes in Computer Science 2387, 2002, pp. 448-455
• An experimental study and comparison of topological peeling and topological walk
  Danny Z. Chen, Shuang Luan, Jinhui Xu
  Lecture Notes in Computer Science 2387, 2002, pp. 456-466
• Counting satisfying assignments in 2-SAT and 3-SAT
  Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström
  Lecture Notes in Computer Science 2387, 2002, pp. 535-543
• On families of graphs having a decidable first order theory with reachability
  Thomas Colcombet
  Lecture Notes in Computer Science 2380, 2002, pp. 98-109
• Intersection of regular languages and star hierarchy
  Sebastian Bala
  Lecture Notes in Computer Science 2380, 2002, pp. 159-169
• Exponential structures for efficient cache-oblivious algorithms
  Michael A. Bender, Richard Cole, Rajeev Raman
  Lecture Notes in Computer Science 2380, 2002, pp. 195-207
• Scheduling search procedures
  Peter Damaschke
  Lecture Notes in Computer Science 2380, 2002, pp. 281-292
• Quantum and stochastic branching programs of bounded width
  Farid Ablayev, Cristopher Moore, Christopher Pollett
  Lecture Notes in Computer Science 2380, 2002, pp. 343-354
• Energy optimal routing in radio networks using geometric data structures
  René Beier, Peter Sanders, Naveen Sivadasan
  Lecture Notes in Computer Science 2380, 2002, pp. 366-376
• Gossiping with bounded size messages in ad hoc radio networks
  Malin Christersson, Leszek Ga̧sieniec, Andrzej Lingas
  Lecture Notes in Computer Science 2380, 2002, pp. 377-389
• Constraint satisfaction problems in non-deterministic logarithmic space
  Víctor Dalmau
  Lecture Notes in Computer Science 2380, 2002, pp. 414-425
• Cache oblivious distribution sweeping
  Gerth Stlting Brodal, Rolf Fagerberg
  Lecture Notes in Computer Science 2380, 2002, pp. 426-438
• New algorithms for subset query, partial match, orthogonal range searching, and related problems
  Moses Charikar, Piotr Indyk, Rina Panigrahy
  Lecture Notes in Computer Science 2380, 2002, pp. 451-462
• Comparing functional paradigms for exact real-number computation
  Andrej Bauer, Martín Hötzel Escardó, Alex Simpson
  Lecture Notes in Computer Science 2380, 2002, pp. 488-500
• Random sampling from Boltzmann principles
  Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer
  Lecture Notes in Computer Science 2380, 2002, pp. 501-513
• On the average performance of orthogonal range search in multidimensional data structures
  Amalia Duch, Conrado Martínez
  Lecture Notes in Computer Science 2380, 2002, pp. 514-524
• A spatial logic for querying graphs
  Luca Cardelli, Philippa Gardner, Giorgio Ghelli
  Lecture Notes in Computer Science 2380, 2002, pp. 597-610
• Approximation hardness of bounded degree MIN-CSP and MIN-BISECTION
  Piotr Berman, Marek Karpinski
  Lecture Notes in Computer Science 2380, 2002, pp. 623-632
• Improved bounds and new trade-offs for dynamic all pairs shortest paths
  Camil Demetrescu, Giuseppe F. Italiano
  Lecture Notes in Computer Science 2380, 2002, pp. 633-643
• Finding frequent items in data streams
  Moses Charikar, Kevin Chen, Martin Farach-Colton
  Lecture Notes in Computer Science 2380, 2002, pp. 693-703
• Symbolic strategy synthesis for games on pushdown graphs
  Thierry Cachat
  Lecture Notes in Computer Science 2380, 2002, pp. 704-715