Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=1380

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Analysis of Rabin's polynomial irreducibility test
Daniel Panario, Alfredo Viola
Lecture Notes in Computer Science 1380, 1998, pp. 1-10
A chip search problem on binary numbers
Peter Damaschke
Lecture Notes in Computer Science 1380, 1998, pp. 11-22
Uniform service systems with k servers
Esteban Feuerstein
Lecture Notes in Computer Science 1380, 1998, pp. 23-32
Faster non-linear parametric search with applications to optimization and dynamic geometry
David Fernández-Baca
Lecture Notes in Computer Science 1380, 1998, pp. 33-41
Super-state automata and rational trees
Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
Lecture Notes in Computer Science 1380, 1998, pp. 42-52
An Eilenberg theorem for words on countable ordinals
Nicolas Bedon, Olivier Carton
Lecture Notes in Computer Science 1380, 1998, pp. 53-64
Maximal groups in free Burnside semigroups
Alair Pereira do Lago
Lecture Notes in Computer Science 1380, 1998, pp. 65-75
Positive varieties and infinite words
Jean-Éric Pin
Lecture Notes in Computer Science 1380, 1998, pp. 76-87
Unfolding parametric automata
Marcos Veloso Peixoto, Laurent Fribourg
Lecture Notes in Computer Science 1380, 1998, pp. 88-101
Fundamental structures in well-structured infinite transition systems
Alain Finkel, Philippe Schnoebelen
Lecture Notes in Computer Science 1380, 1998, pp. 102-118
Shape reconstruction with Delaunay complex
Herbert Edelsbrunner
Lecture Notes in Computer Science 1380, 1998, pp. 119-132
Bases for non-homogeneous polynomial C_k splines on the sphere
Anamaria Gomide, Jorge Stolfi
Lecture Notes in Computer Science 1380, 1998, pp. 133-140
The splitting number of the 4-cube
Luerbio Faria, Celina Miraglia Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
Lecture Notes in Computer Science 1380, 1998, pp. 141-150
Short and smooth polygonal paths
James Abello, Emden Gansner
Lecture Notes in Computer Science 1380, 1998, pp. 151-162
Quantum cryptanalysis of hash and claw-free functions
Gilles Brassard, Peter Hyer, Alain Tapp
Lecture Notes in Computer Science 1380, 1998, pp. 163-169
Batch verification with applications to cryptography and checking
Mihir Bellare, Juan A. Garay, Tal Rabin
Lecture Notes in Computer Science 1380, 1998, pp. 170-191
Strength of two data encryption standard implementations under timing attacks
Alejandro Hevia, Marcos Kiwi
Lecture Notes in Computer Science 1380, 1998, pp. 192-205
Spectral techniques in graph algorithms
Noga Alon
Lecture Notes in Computer Science 1380, 1998, pp. 206-215
Colouring graphs whose chromatic number is almost their maximum degree
Michael Molloy, Bruce Reed
Lecture Notes in Computer Science 1380, 1998, pp. 216-225
Circuit covers in series-parallel mixed graphs
Orlando Lee, Yoshiko Wakabayashi
Lecture Notes in Computer Science 1380, 1998, pp. 226-238
A linear time algorithm to recognize clustered planar graphs and its parallelization
Elias Dahlhaus
Lecture Notes in Computer Science 1380, 1998, pp. 239-248
A new characterization for parity graphs and a coloring problem with costs
Klaus Jansen
Lecture Notes in Computer Science 1380, 1998, pp. 249-260
On the clique operator
Marisa Gutierrez, João Meidanis
Lecture Notes in Computer Science 1380, 1998, pp. 261-272
Dynamic packet routing on arrays with bounded buffers
Andrei Z. Broder, Alan M. Frieze, Eli Upfal
Lecture Notes in Computer Science 1380, 1998, pp. 273-281
On-line matching routing on trees
Alan Roberts, Antonios Symvonis
Lecture Notes in Computer Science 1380, 1998, pp. 282-291

Seiten 1 2 >