Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND YEAR=2009

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

Correlation Clustering revisited: The ``true'' cost of error minimization problems
Nir Ailon, Edo Liberty
Lecture Notes in Computer Science 5555, 2009, pp. 24-36
Sorting and selection with imprecise comparisons
Miklós Ajtai, Vitaly Feldman, Avinatan Hassidim, Jelani Nelson
Lecture Notes in Computer Science 5555, 2009, pp. 37-48
Fast FAST
Noga Alon, Daniel Lokshtanov, Saket Saurabh
Lecture Notes in Computer Science 5555, 2009, pp. 49-58
Bounds on the size of small depth circuits for approximating majority
Kazuyuki Amano
Lecture Notes in Computer Science 5555, 2009, pp. 59-70
Counting subgraphs via homomorphisms
Omid Amini, Fedor V. Fomin, Saket Saurabh
Lecture Notes in Computer Science 5555, 2009, pp. 71-82
External sampling
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld
Lecture Notes in Computer Science 5555, 2009, pp. 83-94
Functional monitoring without monotonicity
Chrisil Arackaparambil, Joshua Brody, Amit Chakrabarti
Lecture Notes in Computer Science 5555, 2009, pp. 95-106
De-amortized cuckoo hashing: Provable worst-case performance and experimental results
Yuriy Arbitman, Moni Naor, Gil Segev
Lecture Notes in Computer Science 5555, 2009, pp. 107-118
Towards a study of low-complexity graphs
Sanjeev Arora, David Steurer, Avi Wigderson
Lecture Notes in Computer Science 5555, 2009, pp. 119-131
Decidability of conjugacy of tree-shifts of finite type
Nathalie Aubrun, Marie-Pierre Béal
Lecture Notes in Computer Science 5555, 2009, pp. 132-143
Improved bounds for speed scaling in devices obeying the cube-root rule
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy Katz
Lecture Notes in Computer Science 5555, 2009, pp. 144-155
Competitive analysis of aggregate max in windowed streaming
Luca Becchetti, Elias Koutsoupias
Lecture Notes in Computer Science 5555, 2009, pp. 156-170
Faster regular expression matching
Philip Bille, Mikkel Thorup
Lecture Notes in Computer Science 5555, 2009, pp. 171-182
A fast and simple parallel algorithm for the monotone duality problem
Endre Boros, Kazuhisa Makino
Lecture Notes in Computer Science 5555, 2009, pp. 183-194
Unconditional lower bounds against advice
Harry Buhrman, Lance Fortnow, Rahul Santhanam
Lecture Notes in Computer Science 5555, 2009, pp. 195-209
Approximating decision trees with multiway branches
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal
Lecture Notes in Computer Science 5555, 2009, pp. 210-221
Annotations in data streams
Amit Chakrabarti, Graham Cormode, Andrew McGregor
Lecture Notes in Computer Science 5555, 2009, pp. 222-234
The tile complexity of linear assemblies
Harish Chandran, Nikhil Gopalkrishnan, John Reif
Lecture Notes in Computer Science 5555, 2009, pp. 235-253
A graph reduction step preserving element-connectivity and applications
Chandra Chekuri, Nitish Korula
Lecture Notes in Computer Science 5555, 2009, pp. 254-265
Approximating matches made in heaven
Ning Chen, Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Atri Rudra
Lecture Notes in Computer Science 5555, 2009, pp. 266-278
Strong and Pareto price of anarchy in congestion games
Steve Chien, Alistair Sinclair
Lecture Notes in Computer Science 5555, 2009, pp. 279-291
A better algorithm for random k-SAT
Amin Coja-Oghlan
Lecture Notes in Computer Science 5555, 2009, pp. 292-303
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

Seiten < 1 2 3 4 5 6 7 8 9 10 11 12 >