Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=3221

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

A survey of FPT algorithm design techniques with an emphasis on recent advances and connections to practical computing
Michael R. Fellows
Lecture Notes in Computer Science 3221, 2004, pp. 1-2
Algorithmic aspects of web search engines
Monika Henzinger
Lecture Notes in Computer Science 3221, 2004, pp. 3-3
Efficient tradeoff schemes in data structures for querying moving objects
Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu
Lecture Notes in Computer Science 3221, 2004, pp. 4-15
Swap and mismatch edit distance
Amihood Amir, Estrella Eisenberg, Ely Porat
Lecture Notes in Computer Science 3221, 2004, pp. 16-27
Path decomposition under a new cost measure with applications to optical network design
Elliot Anshelevich, Lisa Zhang
Lecture Notes in Computer Science 3221, 2004, pp. 28-39
Optimal external memory planar point enclosure
Lars Arge, Vasilis Samoladas, Ke Yi
Lecture Notes in Computer Science 3221, 2004, pp. 40-52
Maximizing throughput in multi-queue switches
Yossi Azar, Arik Litichevskey
Lecture Notes in Computer Science 3221, 2004, pp. 53-64
An improved algorithm for CIOQ switches
Yossi Azar, Yossi Richter
Lecture Notes in Computer Science 3221, 2004, pp. 65-76
Labeling smart dust
Vikas Bansal, Friedhelm Meyer auf der Heide, Christian Sohler
Lecture Notes in Computer Science 3221, 2004, pp. 77-88
Graph decomposition lemmas and their role in metric embedding methods
Yair Bartal
Lecture Notes in Computer Science 3221, 2004, pp. 89-97
Modeling locality: A probabilistic analysis of LRU and FWF
Luca Becchetti
Lecture Notes in Computer Science 3221, 2004, pp. 98-109
An algorithm for computing DNA walks
Ankur Bhargava, S. Rao Kosaraju
Lecture Notes in Computer Science 3221, 2004, pp. 110-121
Algorithms for generating minimal blockers of perfect matchings in bipartite graphs and related problems
Endre Boros, Khaled Elbassioni, Vladimir Gurvich
Lecture Notes in Computer Science 3221, 2004, pp. 122-133
Direct routing: Algorithms and complexity
Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul Spirakis
Lecture Notes in Computer Science 3221, 2004, pp. 134-145
Lower bounds for embedding into distributions over excluded minor graph families
Douglas E. Carroll, Ashish Goel
Lecture Notes in Computer Science 3221, 2004, pp. 146-156
A parameterized algorithm for upward planarity testing
Hubert Chan
Lecture Notes in Computer Science 3221, 2004, pp. 157-168
Fisher equilibrium price with a class of concave utility functions
Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao
Lecture Notes in Computer Science 3221, 2004, pp. 169-179
Hardness and approximation results for packing Steiner trees
Joseph Cheriyan, Mohammad R. Salavatipour
Lecture Notes in Computer Science 3221, 2004, pp. 180-191
Approximation hardness of dominating set problems
Miroslav Chlebík, Janka Chlebíková
Lecture Notes in Computer Science 3221, 2004, pp. 192-203
Improved online algorithms for buffer management in QOS switches
Marek Chrobak, Wojciech Jawor, Jiȓí Sgall, Tomás̑ Tichý
Lecture Notes in Computer Science 3221, 2004, pp. 204-215
Time dependent multi scheduling of multicast
Rami Cohen, Dror Rawitz, Danny Raz
Lecture Notes in Computer Science 3221, 2004, pp. 216-227
Convergence properties of the gravitational algorithm in asynchronous robot systems
Reuven Cohen, David Peleg
Lecture Notes in Computer Science 3221, 2004, pp. 228-239
The average case analysis of partition sorts
Richard Cole, David C. Kandathil
Lecture Notes in Computer Science 3221, 2004, pp. 240-251
A fast distributed algorithm for approximating the maximum matching
Andrzej Czygrinow, Michaƚ Hańćkowiak, Edyta Szymańska
Lecture Notes in Computer Science 3221, 2004, pp. 252-263
Extreme points under random noise
Valentina Damerow, Christian Sohler
Lecture Notes in Computer Science 3221, 2004, pp. 264-274

Seiten 1 2 3 >