Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1643

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

Adaptively-secure distributed public-key systems
Yair Frankel, Philip MacKenzie, Moti Yung
Lecture Notes in Computer Science 1643, 1999, pp. 4-27
How long does a bit live in a computer?
Bernhard Korte
Lecture Notes in Computer Science 1643, 1999, pp. 28-28
Approximation algorithms for the traveling purchaser problem and its variants in network design
R. Ravi, F.S. Salman
Lecture Notes in Computer Science 1643, 1999, pp. 29-40
The impact of knowledge on broadcasting time in radio networks
Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
Lecture Notes in Computer Science 1643, 1999, pp. 41-52
Multipacket routing on 2-D meshes and its application to fault-tolerant routing
Kazuo Iwama, Eiji Miyano
Lecture Notes in Computer Science 1643, 1999, pp. 53-64
IP address lookup made fast and simple
Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi
Lecture Notes in Computer Science 1643, 1999, pp. 65-76
On-line load balancing in a hierarchical server topology
Amotz Bar-Noy, Ari Freund, Joseph (Seffi) Naor
Lecture Notes in Computer Science 1643, 1999, pp. 77-88
Provably good and practical strategies for non-uniform data management in networks
Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann
Lecture Notes in Computer Science 1643, 1999, pp. 89-100
Approximation algorithms for restoration capacity planning
Steven J. Phillips, Jeffery R. Westbrook
Lecture Notes in Computer Science 1643, 1999, pp. 101-115
Efficient algorithms for integer programs with two variables per constraint
Reuven Bar-Yehuda, Dror Rawitz
Lecture Notes in Computer Science 1643, 1999, pp. 116-126
Convex quadratic programming relaxations for network scheduling problems
Martin Skutella
Lecture Notes in Computer Science 1643, 1999, pp. 127-138
Resource-constrained project scheduling: Computing lower bounds by solving minimum cut problems
Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz
Lecture Notes in Computer Science 1643, 1999, pp. 139-150
Approximation schemes for scheduling on uniformly related and identical parallel machines
Leah Epstein, Jiȓí Sgall
Lecture Notes in Computer Science 1643, 1999, pp. 151-162
Off-line temporary tasks assignment
Yossi Azar, Oded Regev
Lecture Notes in Computer Science 1643, 1999, pp. 163-171
Load balancing using bisectors - A tight average-case analysis
Stefan Bischof, Thomas Schickinger, Angelika Steger
Lecture Notes in Computer Science 1643, 1999, pp. 172-183
On the analysis of evolutionary algorithms - A proof that crossover really can help
Thomas Jansen, Ingo Wegener
Lecture Notes in Computer Science 1643, 1999, pp. 184-193
Motif statistics
Pierre Nicodème, Bruno Salvy, Philippe Flajolet
Lecture Notes in Computer Science 1643, 1999, pp. 194-211
Approximate protein folding in the HP side chain model on extended cubic lattices
Volker Heun
Lecture Notes in Computer Science 1643, 1999, pp. 212-223
On constructing suffix arrays in external memory
Andreas Crauser, Paolo Ferragina
Lecture Notes in Computer Science 1643, 1999, pp. 224-235
Strategies for searching with different access costs
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
Lecture Notes in Computer Science 1643, 1999, pp. 236-247
On the informational asymmetry betweeen upper and lower bounds for ultrametric evolutionary trees
Ting Chen, Ming-Yang Kao
Lecture Notes in Computer Science 1643, 1999, pp. 248-256
Optimal binary search with two unreliable tests and minimum adaptiveness
Ferdinando Cicalese, Daniele Mundici
Lecture Notes in Computer Science 1643, 1999, pp. 257-266
Improving mergesort for linked lists
Salvador Roura
Lecture Notes in Computer Science 1643, 1999, pp. 267-276
Efficient algorithms for on-line symbol ranking compression
Giovanni Manzini
Lecture Notes in Computer Science 1643, 1999, pp. 277-288
On list update and work function algorithms
Eric J. Anderson, Kris Hildrum, Anna R. Karlin, April Rasala, Michael Saks
Lecture Notes in Computer Science 1643, 1999, pp. 289-300

Seiten 1 2 >