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

• Checking properties of polynomials
  Bruno Codenotti, Funda Ergün, Peter Gemell, S. Ravi Kumar
  Lecture Notes in Computer Science 1256, 1997, pp. 203-213
• On the dynamics of sharing graphs
  Andrea Asperti, Cosimo Laneve
  Lecture Notes in Computer Science 1256, 1997, pp. 259-269
• Minimizing diameters of dynamic trees
  Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
  Lecture Notes in Computer Science 1256, 1997, pp. 270-280
• Solving trace equations using lexicographical normal forms
  Volker Diekert, Yuri Matiyasevich, Anca Muscholl
  Lecture Notes in Computer Science 1256, 1997, pp. 336-346
• An algebra-based method to associate rewards with EMPA terms
  Marco Bernardo
  Lecture Notes in Computer Science 1256, 1997, pp. 358-368
• Efficient parallel graph algorithms for coarse grained multicomputers and BSP
  E. Cáceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, S.W. Song
  Lecture Notes in Computer Science 1256, 1997, pp. 390-400
• Upperbound on the communication complexity of private information retrieval
  Andris Ambainis
  Lecture Notes in Computer Science 1256, 1997, pp. 401-407
• Model checking the full modal mu-calculus for infinite sequential processes
  Olaf Burkart, Bernhard Steffen
  Lecture Notes in Computer Science 1256, 1997, pp. 419-429
• Symbolic model ckecking for probabilistic processes
  Christel Baier, Edmund M. Clarke, Vasiliki Hartonas-Garmhausen, Marta Kwiatkowska, Mark Ryan
  Lecture Notes in Computer Science 1256, 1997, pp. 430-440
• Basic observables for processes
  Michele Boreale, Rocco de Nicola, Rosario Pugliese
  Lecture Notes in Computer Science 1256, 1997, pp. 482-492
• On-line routing in all-optical networks
  Yair Bartal, Stefano Leonardi
  Lecture Notes in Computer Science 1256, 1997, pp. 516-526
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
  Ahmed Bouajjani, Peter Habermehl
  Lecture Notes in Computer Science 1256, 1997, pp. 560-570
• Constructive linear time algorithms for branchwidth
  Hans L. Bodlaender, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 1256, 1997, pp. 627-637
• On a conjecture of J. Shallit
  Julien Cassaigne
  Lecture Notes in Computer Science 1256, 1997, pp. 693-704
• The minimum color sum of bipartite graphs
  Amotz Bar-Noy, Guy Kortsarz
  Lecture Notes in Computer Science 1256, 1997, pp. 738-748
• Independent sets in asteroidal triple-free graphs
  Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
  Lecture Notes in Computer Science 1256, 1997, pp. 760-770
• Labelled reductions, runtime errors, and operational subsumption
  Laurent Dami
  Lecture Notes in Computer Science 1256, 1997, pp. 782-793
• Molecular computing, bounded nondeterminism, and efficient recursion
  Richard Beigel, Bin Fu
  Lecture Notes in Computer Science 1256, 1997, pp. 816-826
• The expressive power of unique total stable model semantics
  Francesco Buccafurri, Sergio Greco, Domenico Saccà
  Lecture Notes in Computer Science 1256, 1997, pp. 849-859
• Minimum distance decoding algorithms for linear codes
  Alexander Barg
  Lecture Notes in Computer Science 1255, 1997, pp. 1-14
• Efficient multivariate factorization over finite fields
  Laurent Bernardin, Michael B. Monagan
  Lecture Notes in Computer Science 1255, 1997, pp. 15-28
• On maximal codes in polynomial metric spaces
  Peter Boyvalenkov, Danyo Danev
  Lecture Notes in Computer Science 1255, 1997, pp. 29-38
• Yet another ideal docomposition algorithm
  Massimo Caboara, Pasqualina Conti, Carlo Traverso
  Lecture Notes in Computer Science 1255, 1997, pp. 39-54
• A resultant theory for ordinary algebraic differential equations
  Giuseppa Carrà Ferro
  Lecture Notes in Computer Science 1255, 1997, pp. 55-65
• The symmetry group of Z^n_q in the Lee space and the Z_q^n-linear codes
  Sueli Rodrigues Costa, João Roberto Gerônimo, Reginaldo, Jr. Palazzo, J. Carmelo Interlando, Marcelo Muniz Silva Alves
  Lecture Notes in Computer Science 1255, 1997, pp. 66-77