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

• A survey of discriminant counting
  Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
  Lecture Notes in Computer Science 2369, 2002, pp. 80-94
• Some genus 3 curves with many points
  Roland Auer, Jaap Top
  Lecture Notes in Computer Science 2369, 2002, pp. 163-171
• Trinomials ax^7 + bx + c and ax^8 + bx + c with Galois groups of order 168 and 8\cdot168
  Nils Bruin, Noam D. Elkies
  Lecture Notes in Computer Science 2369, 2002, pp. 172-188
• Action of modular correspondences around CM points
  Jean-Marc Couveignes, Thierry Henocq
  Lecture Notes in Computer Science 2369, 2002, pp. 234-243
• An extension of Kedlaya's algorithm to Artin-Schreier curves in characteristic 2
  Jan Denef, Frederik Vercauteren
  Lecture Notes in Computer Science 2369, 2002, pp. 308-323
• Time and space efficient multi-method dispatching
  Stephen Alstrup, Gerth Stlting Brodal, Inge Li Grtz, Theis Rauhe
  Lecture Notes in Computer Science 2368, 2002, pp. 20-29
• Linear time approximation schemes for vehicle scheduling
  John E. Augustine, Steven S. Seiden
  Lecture Notes in Computer Science 2368, 2002, pp. 30-39
• Powers of geometric intersection graphs and dispersion algorithms
  Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson
  Lecture Notes in Computer Science 2368, 2002, pp. 140-149
• Efficient data reduction for DOMINATING SET: A linear problem kernel for the planar case
  Jochen Alber, Michael R. Fellows, Rolf Niedermeier
  Lecture Notes in Computer Science 2368, 2002, pp. 150-159
• Planar graph coloring with forbidden subgraphs: Why trees and paths are dangerous
  Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
  Lecture Notes in Computer Science 2368, 2002, pp. 160-169
• Approximation hardness of the Steiner tree problem on graphs
  Miroslav Chlebík, Janka Chlebíková
  Lecture Notes in Computer Science 2368, 2002, pp. 170-179
• Robot localization without depth perception
  Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
  Lecture Notes in Computer Science 2368, 2002, pp. 249-259
• Approximations for Maximum Transportation Problem With Permutable Supply Vector and other capacitated Star Packing problems
  Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko
  Lecture Notes in Computer Science 2368, 2002, pp. 280-287
• All-norm approximation algorithms
  Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger
  Lecture Notes in Computer Science 2368, 2002, pp. 288-297
• Approximability of dense instances of NEAREST CODEWORD problem
  Cristina Bazgan, W. Fernandez de la Vega, Marek Karpinski
  Lecture Notes in Computer Science 2368, 2002, pp. 298-307
• Call control with k rejections
  R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos
  Lecture Notes in Computer Science 2368, 2002, pp. 308-317
• Sorting with a forklift
  M.H. Albert, M.D. Atkinson
  Lecture Notes in Computer Science 2368, 2002, pp. 368-377
• Tree decompositions with small cost
  Hans L. Bodlaender, Fedor V. Fomin
  Lecture Notes in Computer Science 2368, 2002, pp. 378-387
• Computing the treewidth and the minimum fill-in with the modular decomposition
  Hans L. Bodlaender, Udi Rotics
  Lecture Notes in Computer Science 2368, 2002, pp. 388-397
• An optimal algorithm for finding NCA on Pure Pointer Machines
  A. Dal Palú, E. Pontelli, D. Ranjan
  Lecture Notes in Computer Science 2368, 2002, pp. 428-438
• Model validation - A theoretical issue?
  Jörg Desel
  Lecture Notes in Computer Science 2360, 2002, pp. 23-43
• Quasi-static scheduling of independent tasks for reactive systems
  Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Claudio Passerone, Yosinori Watanabe
  Lecture Notes in Computer Science 2360, 2002, pp. 80-100
• Data decision diagrams for Petri net analysis
  Jean-Michel Couvreur, Emmanuelle Encrenaz, Emmanuel Paviot-Adet, Denis Poitrenaud, Pierre-André Wacrenier
  Lecture Notes in Computer Science 2360, 2002, pp. 101-120
• Non-controllable choice robustness expressing the controllability of workflow processes
  Juliane Dehnert
  Lecture Notes in Computer Science 2360, 2002, pp. 121-141
• Real-time synchronised Petri nets
  Giovanna Di Marzo Serugendo, Dino Mandrioli, Didier Buchs, Nicolas Guelfi
  Lecture Notes in Computer Science 2360, 2002, pp. 142-162