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

• Probabilistic local majority voting for the agreement problem on finite graphs
  Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita
  Lecture Notes in Computer Science 1627, 1999, pp. 33o-338
• The Web as a graph: Measurements, models and methods
  Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew S. Tomkins
  Lecture Notes in Computer Science 1627, 1999, pp. 1-17
• Some observations on the computational complexity of graph accessibility problem
  Jun Tarui, Seinosuke Toda
  Lecture Notes in Computer Science 1627, 1999, pp. 18-30
• An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
  Hiroshi Nagamochi, Toshihide Ibaraki
  Lecture Notes in Computer Science 1627, 1999, pp. 31-40
• Theory of 2-3 heaps
  Tadao Takaoka
  Lecture Notes in Computer Science 1627, 1999, pp. 41-50
• An external memory data structure for shortest path queries
  David Hutchinson, Anil Maheshwari, Norbert Zeh
  Lecture Notes in Computer Science 1627, 1999, pp. 51-60
• Approximating the nearest neighbor interchange distance for evolutionary trees with non-uniform degrees
  Wing-Kai Hon, Tak-Wah Lam
  Lecture Notes in Computer Science 1627, 1999, pp. 61-70
• Signed genome rearrangement by reversals and transpositions: Models and approximations
  Guo-Hui Lin, Guoliang Xue
  Lecture Notes in Computer Science 1627, 1999, pp. 71-80
• An approximation algorithm for the two-layered graph drawing problem
  Atsuko Yamaguchi, Akihiro Sugimoto
  Lecture Notes in Computer Science 1627, 1999, pp. 81-91
• Area minimization for grid visibility representation of hierarchically planar graphs
  Xuemin Lin, Peter Eades
  Lecture Notes in Computer Science 1627, 1999, pp. 92-102
• Layout problems on lattice graphs
  Josep Díaz, Mathew D. Penrose, Jordi Petit, María Serna
  Lecture Notes in Computer Science 1627, 1999, pp. 103-112
• A new transference theorem in the geometry of numbers
  Jin-Yi Cai
  Lecture Notes in Computer Science 1627, 1999, pp. 113-122
• On covering and rank problems for Boolean matrices and their applications
  Carsten Damm, Ki Hang Kim, Fred Roush
  Lecture Notes in Computer Science 1627, 1999, pp. 123-133
• A combinatorial algorithm for Pfaffians
  Meena Mahajan, P.R. Subramanya, V. Vinay
  Lecture Notes in Computer Science 1627, 1999, pp. 134-143
• How to swap a failing edge of a single source shortest paths tree
  Enrico Nardelli, Guido Proietti, Peter Widmayer
  Lecture Notes in Computer Science 1627, 1999, pp. 144-153
• On bounds for the k-partitioning of graphs
  S.L. Bezrukov, R. Elsässer, U.-P. Schroeder
  Lecture Notes in Computer Science 1627, 1999, pp. 154-163
• A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
  Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki
  Lecture Notes in Computer Science 1627, 1999, pp. 164-173
• Probabilities to accept languages by quantum finite automata
  Andris Ambainis, Richard Bonner, Rūsiņs̑ Freivalds, Arnolds Ķikusts
  Lecture Notes in Computer Science 1627, 1999, pp. 174-183
• Distributionally-hard languages
  Lance Fortnow, A. Pavan, Alan L. Selman
  Lecture Notes in Computer Science 1627, 1999, pp. 184-193
• Circuits and context-free languages
  Pierre McKenzie, Klaus Reinhardt, V. Vinay
  Lecture Notes in Computer Science 1627, 1999, pp. 194-203
• On the negation-limited circuit complexity of merging
  Kazuyuki Amano, Akira Maruoka, Jun Tarui
  Lecture Notes in Computer Science 1627, 1999, pp. 204-209
• Suber-polynomial versus half-exponential circuit size in the exponential hierarchy
  Peter Bro Miltersen, N.V. Vinodchandran, Osamu Watanabe
  Lecture Notes in Computer Science 1627, 1999, pp. 210-220
• Efficient learning of some linear matrix languages
  Henning Fernau
  Lecture Notes in Computer Science 1627, 1999, pp. 221-230
• Minimizing mean response time in batch processing system
  Xiaotie Deng, Yuzhong Zhang
  Lecture Notes in Computer Science 1627, 1999, pp. 231-240
• Approximation algorithms for bounded facility location
  Piotr Krysta, Roberto Solis-Oba
  Lecture Notes in Computer Science 1627, 1999, pp. 241-250