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

• Genome rearrangement by reversals and insertions/deletions of contiguous segments
  Nadia El-Mabrouk
  Lecture Notes in Computer Science 1848, 2000, pp. 222-234
• A lower bound for the breakpoint phylogeny problem
  David Bryant
  Lecture Notes in Computer Science 1848, 2000, pp. 235-247
• An upper bound for number of contacts in the HP-model on the Face-Centered-Cubic lattice (FCC)
  Rolf Backofen
  Lecture Notes in Computer Science 1848, 2000, pp. 277-292
• Simple optimal string matching algorithm
  Cyril Allauzen, Mathieu Raffinot
  Lecture Notes in Computer Science 1848, 2000, pp. 364-374
• Finding maximal quasiperiodicities in strings
  Gerth Stlting Brodal, Christian N.S. Pedersen
  Lecture Notes in Computer Science 1848, 2000, pp. 397-411
• On the complexity of determining the period of a string
  Artur Czumaj, Leszek Ga̧sieniec
  Lecture Notes in Computer Science 1848, 2000, pp. 412-422
• The complexity of some lattice problems
  Jin-Yi Cai
  Lecture Notes in Computer Science 1838, 2000, pp. 1-32
• Rational points near curves and small nonzero \mid x^3 - y^2\mid via lattice reduction
  Noam D. Elkies
  Lecture Notes in Computer Science 1838, 2000, pp. 33-63
• Construction of secure C_{ab} curves using modular curves
  Seigo Arita
  Lecture Notes in Computer Science 1838, 2000, pp. 113-126
• Curves over finite fields with many rational points obtained by ray class field extensions
  Roland Auer
  Lecture Notes in Computer Science 1838, 2000, pp. 127-134
• New results on lattice basis reduction in practice
  Werner Backes, Susanne Wetzel
  Lecture Notes in Computer Science 1838, 2000, pp. 135-152
• Baby-step giant-step algorithms for non-uniform distributions
  Simon R. Blackburn, Edlyn Teske
  Lecture Notes in Computer Science 1838, 2000, pp. 153-168
• On powers as sums of two cubes
  Nils Bruin
  Lecture Notes in Computer Science 1838, 2000, pp. 169-184
• Factoring polynomials over p-adic fields
  David G. Cantor, Daniel M. Gordon
  Lecture Notes in Computer Science 1838, 2000, pp. 185-208
• Strategies in filtering in the Number Field Sieve
  Stefania Cavallar
  Lecture Notes in Computer Science 1838, 2000, pp. 209-231
• Factoring polynomials over finite fields and stable colorings of tournaments
  Qi Cheng, Ming-Deh A. Huang
  Lecture Notes in Computer Science 1838, 2000, pp. 233-245
• Computing special values of partial zeta functions
  Gautam Chinta, Paul E. Gunnells, Robert Sczech
  Lecture Notes in Computer Science 1838, 2000, pp. 247-256
• Construction of tables of quartic number fields
  Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
  Lecture Notes in Computer Science 1838, 2000, pp. 257-268
• Counting discriminants of number fields of degree up to four
  Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
  Lecture Notes in Computer Science 1838, 2000, pp. 269-283
• On reconstruction of algebraic numbers
  Claus Fieker, Carsten Friedrichs
  Lecture Notes in Computer Science 1838, 2000, pp. 285-296
• Hardware and Petri nets application to asynchronous circuit design
  Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, Alex Yakovlev
  Lecture Notes in Computer Science 1825, 2000, pp. 1-15
• Region based synthesis of P/T-nets and its potential applications
  Philippe Darondeau
  Lecture Notes in Computer Science 1825, 2000, pp. 16-23
• UML - A universal modeling language?
  Gregor Engels, Reiko Heckel, Stefan Sauer
  Lecture Notes in Computer Science 1825, 2000, pp. 24-38
• Parametric stochastic well-formed nets and compositional modelling
  Paolo Ballarini, Susanna Donatelli, Giuliana Franceschinis
  Lecture Notes in Computer Science 1825, 2000, pp. 43-62
• Reducing k-safe Petri nets to pomset-equivalent 1-safe Petri nets
  Eike Best, Harro Wimmel
  Lecture Notes in Computer Science 1825, 2000, pp. 63-82