Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=6198

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

Local search: Simple, successful, but sometimes sluggish
Burkhard Monien, Dominic Dumrauf, Tobias Tscheuschner
Lecture Notes in Computer Science 6198, 2010, pp. 1-17
When conflicting constraints can be resolved - The Lovász Local Lemma and satisfiability
Emo Welzl
Lecture Notes in Computer Science 6198, 2010, pp. 18-18
Plane spanners of maximum degree six
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perković
Lecture Notes in Computer Science 6198, 2010, pp. 19-30
The positive semidefinite Grothendieck problem with rank constraint
Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin
Lecture Notes in Computer Science 6198, 2010, pp. 31-42
Cycle detection and correction
Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira
Lecture Notes in Computer Science 6198, 2010, pp. 43-54
Decomposition width of matroids
Daniel Král'
Lecture Notes in Computer Science 6198, 2010, pp. 55-66
The cooperative game theory foundations of network bargaining games
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Nicole Immorlica, Hamid Mahini
Lecture Notes in Computer Science 6198, 2010, pp. 67-78
On the existence of pure Nash equilibria in weighted congestion games
Tobias Harks, Max Klimm
Lecture Notes in Computer Science 6198, 2010, pp. 79-89
On the limitations of greedy mechanism design for truthful combinatorial auctions
Allan Borodin, Brendan Lucier
Lecture Notes in Computer Science 6198, 2010, pp. 90-101
Mean-payoff games and propositional proofs
Albert Atserias, Elitza Maneva
Lecture Notes in Computer Science 6198, 2010, pp. 102-113
Online network design with outliers
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski
Lecture Notes in Computer Science 6198, 2010, pp. 114-126
Efficient completely non-malleable public key encryption
Benoît Libert, Moti Yung
Lecture Notes in Computer Science 6198, 2010, pp. 127-139
Polynomial-space approximation of no-signaling provers
Tsuyoshi Ito
Lecture Notes in Computer Science 6198, 2010, pp. 140-151
From secrecy to soundness: Efficient verification via secure computation
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
Lecture Notes in Computer Science 6198, 2010, pp. 152-163
Mergeable dictionaries
John Iacono, Özgür Özkan
Lecture Notes in Computer Science 6198, 2010, pp. 164-175
Faster algorithms for semi-matching problems
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai
Lecture Notes in Computer Science 6198, 2010, pp. 176-187
Clustering with diversity
Jian Li, Ke Yi, Qin Zhang
Lecture Notes in Computer Science 6198, 2010, pp. 188-200
New data structures for subgraph connectivity
Ran Duan
Lecture Notes in Computer Science 6198, 2010, pp. 201-212
Tight thresholds for cuckoo hashing via XORSAT
Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink
Lecture Notes in Computer Science 6198, 2010, pp. 213-225
Resource oblivious sorting on multicores
Richard Cole, Vijaya Ramachandran
Lecture Notes in Computer Science 6198, 2010, pp. 226-237
Interval sorting
Rosa M. Jiménez, Conrado Martínez
Lecture Notes in Computer Science 6198, 2010, pp. 238-249
Inapproximability of hypergraph vertex cover and applications to scheduling problems
Nikhil Bansal, Subhash Khot
Lecture Notes in Computer Science 6198, 2010, pp. 250-261
Thresholded covering algorithms for robust and max-min optimization
Anupam Gupta, Viswanath Nagarajan, R. Ravi
Lecture Notes in Computer Science 6198, 2010, pp. 262-274
Graph homomorphisms with complex values: A dichotomy theorem
Jin-Yi Cai, Xi Chen, Pinyan Lu
Lecture Notes in Computer Science 6198, 2010, pp. 275-286
Metrical task systems and the k-server problem on HSTs
Nikhil Bansal, Niv Buchbinder, Joseph (Seffi) Naor
Lecture Notes in Computer Science 6198, 2010, pp. 287-298

Seiten 1 2 3 >