Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2748

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

Multi-party pseudo-telepathy
Gilles Brassard, Anne Broadbent, Alain Tapp
Lecture Notes in Computer Science 2748, 2003, pp. 1-11
Adapting (pseudo)-triangulations with a near-linear number of edge flips
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
Lecture Notes in Computer Science 2748, 2003, pp. 12-24
Shape segmentation and matching with flow discretization
Tamal K. Dey, Joachim Giesen, Samrat Goswami
Lecture Notes in Computer Science 2748, 2003, pp. 25-36
Phylogenetic reconstruction from gene-rearrangement data with unequal gene content
Jijun Tang, Bernard M.E. Moret
Lecture Notes in Computer Science 2748, 2003, pp. 37-46
Toward optimal motif enumeration
Patricia A. Evans, Andrew D. Smith
Lecture Notes in Computer Science 2748, 2003, pp. 47-58
Common-deadline lazy bureaucrat scheduling problems
Behdad Esfahbod, Mohammad Ghodsi, Ali Sharifi
Lecture Notes in Computer Science 2748, 2003, pp. 59-66
Bandwidth-constrained allocation in grid computing
Anshul Kothari, Subhash Suri, Yunhong Zhou
Lecture Notes in Computer Science 2748, 2003, pp. 67-78
Algorithms and approximation schemes for minimum lateness/tardiness scheduling with rejection
Sudipta Sengupta
Lecture Notes in Computer Science 2748, 2003, pp. 79-90
Fast algorithms for a class of temporal range queries
Qingmin Shi, Joseph JaJa
Lecture Notes in Computer Science 2748, 2003, pp. 91-102
Distribution-sensitive binomial queues
Amr Elmasry
Lecture Notes in Computer Science 2748, 2003, pp. 103-113
Optimal worst-case operations for implicit cache-oblivious search trees
Gianni Franceschini, Roberto Grossi
Lecture Notes in Computer Science 2748, 2003, pp. 114-126
Extremal configurations and levels in pseudoline arrangements
Micha Sharir, Shakhar Smorodinsky
Lecture Notes in Computer Science 2748, 2003, pp. 127-139
Fast relative approximation of potential fields
Martin Ziegler
Lecture Notes in Computer Science 2748, 2003, pp. 140-149
The one-round Voronoi game replayed
Sándor P. Fekete, Henk Meijer
Lecture Notes in Computer Science 2748, 2003, pp. 150-161
Integrated prefetching and caching with read and write requests
Susanne Albers, Markus Büttner
Lecture Notes in Computer Science 2748, 2003, pp. 162-173
Online seat reservations via offline seating arrangements
Jens S. Frederiksen, Kim S. Larsen
Lecture Notes in Computer Science 2748, 2003, pp. 174-185
Routing and call control algorithms for ring networks
R. Saiand Thomas Erlebach Anand
Lecture Notes in Computer Science 2748, 2003, pp. 186-197
Algorithms and models for railway optimization
Dorothea Wagner
Lecture Notes in Computer Science 2748, 2003, pp. 198-206
Approximation of rectilinear Steiner trees with length restrictions on obstacles
Matthias Müller-Hannemann, Sven Peyer
Lecture Notes in Computer Science 2748, 2003, pp. 207-218
Multi-way space partitioning trees
Christian A. Duncan
Lecture Notes in Computer Science 2748, 2003, pp. 219-230
Cropping-resilient segmented multiple watermarking
Keith Frikken, Mikhail Atallah
Lecture Notes in Computer Science 2748, 2003, pp. 231-242
On simultaneous planar graph embeddings
P. Brass, E. Cenek, C.A. Duncan, A. Efrat, C. Erten, D. Ismailescu, S.G. Kobourov, A. Lubiw, J.S.B. Mitchell
Lecture Notes in Computer Science 2748, 2003, pp. 243-255
Smoothed analysis - Motivation and discrete models
Daniel A. Spielman, Shang-Hua Teng
Lecture Notes in Computer Science 2748, 2003, pp. 256-270
Approximation algorithm for hotlink assignments in web directories
Rachel Matichin, David Peleg
Lecture Notes in Computer Science 2748, 2003, pp. 271-280
Drawing graphs with large vertices and thick edges
Gill Barequet, Michael T. Goodrich, Chris Riley
Lecture Notes in Computer Science 2748, 2003, pp. 281-293

Seiten 1 2 >