Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=4059

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

Top-down analysis of path compression: Deriving the inverse-Ackermann bound naturally (and easily)
Raimund Seidel
Lecture Notes in Computer Science 4059, 2006, pp. 1-1
Results and problems on self-adjusting search trees and related data structures
Robert E. Tarjan
Lecture Notes in Computer Science 4059, 2006, pp. 2-2
Classic and quantum network coding
Kazuo Iwama
Lecture Notes in Computer Science 4059, 2006, pp. 3-4
Multiplexing packets with arbitrary deadlines in bounded buffers
Yossi Azar, Nir Levy
Lecture Notes in Computer Science 4059, 2006, pp. 5-16
Scheduling jobs on grid processors
Joan Boyar, Lene M. Favrholdt
Lecture Notes in Computer Science 4059, 2006, pp. 17-28
Variable sized online interval coloring with bandwidth
Leah Epstein, Thomas Erlebach, Asaf Levin
Lecture Notes in Computer Science 4059, 2006, pp. 29-40
A simpler linear-time recognition of circular-arc graphs
Haim Kaplan, Yahav Nussbaum
Lecture Notes in Computer Science 4059, 2006, pp. 41-52
An O(n^{2.75}) algorithm for online topological ordering
Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
Lecture Notes in Computer Science 4059, 2006, pp. 53-64
Dynamic matching markets and voting paths
David J. Abraham, Telikepalli Kavitha
Lecture Notes in Computer Science 4059, 2006, pp. 65-76
Sorting by merging or merging by sorting?
Gianni Franceschini
Lecture Notes in Computer Science 4059, 2006, pp. 77-89
Finding the position of the k-mismatch and approximate tandem repeats
Haim Kaplan, Ely Porat, Nira Shafrir
Lecture Notes in Computer Science 4059, 2006, pp. 90-101
Unbiased matrix rounding
Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
Lecture Notes in Computer Science 4059, 2006, pp. 102-112
Online, non-preemptive scheduling of equal-length jobs on two identical machines
Michael H. Goldwasser, Mark Pedigo
Lecture Notes in Computer Science 4059, 2006, pp. 113-123
Paging with request sets
Leah Epstein, Rob van Stee, Tami Tamir
Lecture Notes in Computer Science 4059, 2006, pp. 124-135
Decentralization and mechanism design for online machine scheduling
Birgit Heydenreich, Rudolf Müller, Marc Uetz
Lecture Notes in Computer Science 4059, 2006, pp. 136-147
Exponential time algorithms for the minimum dominating set problem on some graph classes
Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
Lecture Notes in Computer Science 4059, 2006, pp. 148-159
Exact computation of maximum induced forest
Igor Razgon
Lecture Notes in Computer Science 4059, 2006, pp. 160-171
Fast subexponential algorithm for non-local problems on graphs of bounded genus
Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
Lecture Notes in Computer Science 4059, 2006, pp. 172-183
On the approximation hardness of some generalizations of TSP
Hans-Joachim Böckenhauer, Juraj Hromkovic̑, Joachim Kneis, Joachim Kupke
Lecture Notes in Computer Science 4059, 2006, pp. 184-195
Reoptimization of minimum and maximum Traveling Salesman's tours
Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
Lecture Notes in Computer Science 4059, 2006, pp. 196-207
The node-weighted Steiner problem in graphs of restricted node weights
Spyros Angelopoulos
Lecture Notes in Computer Science 4059, 2006, pp. 208-219
On guarding rectilinear domains
Matthew J. Katz, Gabriel S. Roisman
Lecture Notes in Computer Science 4059, 2006, pp. 220-231
Approximation algorithms for the minimum convex partition problem
Christian Knauer, Andreas Spillner
Lecture Notes in Computer Science 4059, 2006, pp. 232-241
Approximation of octilinear Steiner trees constrained by hard and soft obstacles
Matthias Müller-Hannemann, Anna Schulze
Lecture Notes in Computer Science 4059, 2006, pp. 242-254
Simultaneous embedding with two bends per edge in polynomial area
Frank Kammer
Lecture Notes in Computer Science 4059, 2006, pp. 255-267

Seiten 1 2 >