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

• Average case complexity
  Y. Gurevich
  Lecture Notes in Computer Science 510, 1991, pp. 615-628
• Minimal NFA problems are hard
  Tao Jiang, B. Ravikumar
  Lecture Notes in Computer Science 510, 1991, pp. 629-640
• Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language
  K. Hashiguchi
  Lecture Notes in Computer Science 510, 1991, pp. 641-648
• Computing shortest transversals
  B. Bhattacharya, G. Toussaint
  Lecture Notes in Computer Science 510, 1991, pp. 649-660
• Ray shooting in polygons using geodesic triangulations
  B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, J. Snoeyink
  Lecture Notes in Computer Science 510, 1991, pp. 661-673
• The expected extremes in a Delaunay triangulation
  M. Bern, D. Eppstein, F. Yao
  Lecture Notes in Computer Science 510, 1991, pp. 674-685
• Computational geometry for the gourmet: Old fare and new dishes
  B. Chazelle
  Lecture Notes in Computer Science 510, 1991, pp. 686-696
• On the power of multiple reads in a chip
  P. D̑uris̆, Z. Galil
  Lecture Notes in Computer Science 510, 1991, pp. 697-706
• On linear decision trees computing Boolean functions
  H.D. Gröger, G. Turán
  Lecture Notes in Computer Science 510, 1991, pp. 707-718
• An almost linear-time algorithm for the dense subset-sum problem
  Z. Galil, O. Margalit
  Lecture Notes in Computer Science 510, 1991, pp. 719-727
• On-line algorithms for weighted bipartite matching and stable marriages
  S. Khuller, S.G. Mitchell, V.V. Vazirani
  Lecture Notes in Computer Science 510, 1991, pp. 728-738
• Covering radius and writing on memories.
  Gérard D. Cohen
  Lecture Notes in Computer Science 508, 1991, pp. 1-10
• Geometric problems solvable in single exponential time.
  Joos Heintz, Teresa Krick, Marie-Françoise Roy, Pablo Solernó
  Lecture Notes in Computer Science 508, 1991, pp. 11-23
• A construction method for m-ary unidirectional error control codes - Application for m-ary Berger check to asymmetric error control codes
  Tae Nam Ahn, Kohichi Sakaniwa, T.R.N. Rao
  Lecture Notes in Computer Science 508, 1991, pp. 71-85
• Trellis coded modulation based on time-varying mapping and encoders for utilizing a channel intersymbol interference
  Ryuji Kohno, Choonsik Yim, Hideki Imai
  Lecture Notes in Computer Science 508, 1991, pp. 132-143
• Some ideas about fault-tolerant Chinese remaindering
  John Abbott
  Lecture Notes in Computer Science 508, 1991, pp. 155-163
• Single exponential path finding in semialgebraic sets - Part I: The case of a regular bounded hypersurface
  Joos Heintz, Marie-Francoise Roy, Pablo Solernó
  Lecture Notes in Computer Science 508, 1991, pp. 180-196
• On the complexity of algebraic power series
  M.E. Alonso, T. Mora, M. Raimondo
  Lecture Notes in Computer Science 508, 1991, pp. 197-207
• Local decomposition algorithms
  Maria Emilia Alonso, Teo Mora, Mario Raimondo
  Lecture Notes in Computer Science 508, 1991, pp. 208-221
• Implicitization of rational parametric curves and surfaces
  Michael Kalkbrener
  Lecture Notes in Computer Science 508, 1991, pp. 249-259
• An inequality about irreducible factors of integer polynomials (II)
  Philippe Glesser, Maurice Mignotte
  Lecture Notes in Computer Science 508, 1991, pp. 260-266
• The symplectic trilinear mappings; An algorithmic approach of the classification; Case of the field GF(3)
  L. Beneteau
  Lecture Notes in Computer Science 508, 1991, pp. 267-279
• Complexity of standard bases in projective dimension zero II
  Marc Giusti
  Lecture Notes in Computer Science 508, 1991, pp. 322-328
• Systolic architectures for multiplication over finite field GF(2^m)
  Menouer Diab
  Lecture Notes in Computer Science 508, 1991, pp. 329-340
• Applications of Cayley graphs
  G. Cooperman, L. Finkelstein, N. Sarawagi
  Lecture Notes in Computer Science 508, 1991, pp. 367-378