Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=5555

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

Exact and approximate bandwidth
Marek Cygan, Marcin Pilipczuk
Lecture Notes in Computer Science 5555, 2009, pp. 304-315
Approximation algorithms via structural results for apex-minor-free graphs
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi
Lecture Notes in Computer Science 5555, 2009, pp. 316-327
Node-weighted Steiner tree and group Steiner tree in planar graphs
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein
Lecture Notes in Computer Science 5555, 2009, pp. 328-340
On Cartesian trees and range minimum queries
Erik D. Demaine, Gad M. Landau, Oren Weimann
Lecture Notes in Computer Science 5555, 2009, pp. 341-353
Applications of a splitting trick
Martin Dietzfelbinger, Michael Rink
Lecture Notes in Computer Science 5555, 2009, pp. 354-365
Quasirandom rumor spreading: Expanders, push vs. pull, and robustness
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
Lecture Notes in Computer Science 5555, 2009, pp. 366-377
Incompressibility through colors and IDs
Michael Dom, Daniel Lokshtanov, Saket Saurabh
Lecture Notes in Computer Science 5555, 2009, pp. 378-389
Partition arguments in multiparty communication complexity
Jan Draisma, Eyal Kushilevitz, Enav Weinreb
Lecture Notes in Computer Science 5555, 2009, pp. 390-402
High complexity tilings with sparse errors
Bruno Durand, Andrei Romashchenko, Alexander Shen
Lecture Notes in Computer Science 5555, 2009, pp. 403-414
Tight bounds for the cover time of multiple random walks
Robert Elsässer, Thomas Sauerwald
Lecture Notes in Computer Science 5555, 2009, pp. 415-426
Online computation with advice
Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
Lecture Notes in Computer Science 5555, 2009, pp. 427-438
Dynamic succinct ordered trees
Arash Farzan, J. Ian Munro
Lecture Notes in Computer Science 5555, 2009, pp. 439-450
Universal succinct representations of trees?
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
Lecture Notes in Computer Science 5555, 2009, pp. 451-462
Distortion is fixed parameter tractable
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
Lecture Notes in Computer Science 5555, 2009, pp. 463-474
Towards optimal range medians
Beat Gfeller, Peter Sanders
Lecture Notes in Computer Science 5555, 2009, pp. 475-486
B-treaps: A uniquely represented alternative to B-trees
Daniel Golovin
Lecture Notes in Computer Science 5555, 2009, pp. 487-499
Testing Fourier dimensionality and sparsity
Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer
Lecture Notes in Computer Science 5555, 2009, pp. 500-512
Revisiting the direct sum theorem and space lower bounds in random order streams
Sudipto Guha, Zhiyi Huang
Lecture Notes in Computer Science 5555, 2009, pp. 513-524
Wireless communication is in APX
Magnús M. Halldórsson, Roger Wattenhofer
Lecture Notes in Computer Science 5555, 2009, pp. 525-536
The Ehrenfeucht-Silberger problem
S̑tȇpán Holub, Dirk Nowotka
Lecture Notes in Computer Science 5555, 2009, pp. 537-548
Applications of effective probability theory to Martin-Löf randomness
Mathieu Hoyrup, Cristóbal Rojas
Lecture Notes in Computer Science 5555, 2009, pp. 549-561
An EPTAS for scheduling jobs on uniform processors: Using an MILP relaxation with a constant number of integral variables
Klaus Jansen
Lecture Notes in Computer Science 5555, 2009, pp. 562-573
Popular mixed matchings
Telikepalli Kavitha, Julián Mestre, Meghana Nasre
Lecture Notes in Computer Science 5555, 2009, pp. 574-584
Factoring groups efficiently
Neeraj Kayal, Timur Nezhmetdinov
Lecture Notes in Computer Science 5555, 2009, pp. 585-596
On finding dense subgraphs
Samir Khuller, Barna Saha
Lecture Notes in Computer Science 5555, 2009, pp. 597-608

Seiten < 1 2 3 >